1. Data Structures Lecture 1 : Model Course Syllabi 0 Dr. Essam Halim Houssein Lecturer, Faculty of Computers and Informatics, Benha University

2. 2 Overall Aims of Course: By the end of the course the students will be able to: 1.Understand the concepts of the Data Structures. 2.Define and use standard data structures classes. 3.Design program with different data structures: array, linked list, stacks, queues, trees, Graphs and Hash tables. 4.Describe common applications for each data structure in the topic list. 5.Compare alternative implementations of data structures with respect to the performance. 6.Choose the appropriate data structures for modeling a given problem.

3. 3 Contents: LectureTopic No. of hours Lecture Tutorial/ Practical Lec.1 General introduction and overview of C++ Language (specially Arrays, Classes and Pointers) 532 Lec.2Stacks and its application 532 Lec.3Queues 532 Lec. 4&5Linked lists 1064 Lec. 6Recursion 532 Lec. 7Mid term Exam Lec. 8 Sorting Techniques 532 Lec. 9&10 Searching and Hashing 1064 Lec. 11&12 Trees 1064 Lec. 13&14Graphs 1064 14 Lectures 653926

4. 4 Evaluation: Course degree100 Degree Final-term Examination65 % Oral Examination10 % Practical Examination15 % Semester Work10 % Other Types of Assessment --- Total100%

5. 5 List of References: Essential books 1.Principles of Data Structures Using C and C++, Vinu V. Das, New Age International (P) Ltd., Publishers, 2006. Recommended books 1.C++ How to program, 8 th Edition, Paul Deitel and Harvey Deitel, Pearson Education, Inc., 2012 2.Data Structure And Algorithms, 2 nd Edition, Michael T. Goodrich, Roberto Tamassia and David M. Mount, John Wiley & Sons, Inc., 2011. 3.Data Structures Using C++, 2 nd Edition, D.S. Malik, Course Technology, Cengage Learning, 2010. 4.Data Structure And Algorithms In C++, 3 rd Edition, Adam Drozdek, Thomson Course Technology, 2005.

6. Any Questions? 6