Transcript Description

0
Data Structures
Lecture 1 :
Model Course Syllabi
Dr. Essam Halim Houssein
Lecturer, Faculty of Computers and Informatics,
Benha University
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
Contents:
No. of
Lecture
Lec.1
Topic
hours
Tutorial/
Lecture
Practical
General introduction and overview of C++
Language (specially Arrays, Classes and Pointers)
5
3
2
Lec.2
Stacks and its application
5
3
2
Lec.3
Queues
5
3
2
Lec. 4&5
Linked lists
10
6
4
Lec. 6
Recursion
5
3
2
Lec. 7
Mid term Exam
Lec. 8
Sorting Techniques
5
3
2
Lec. 9&10
10
6
4
Lec. 11&12
Searching and Hashing
Trees
10
6
4
Lec. 13&14
Graphs
10
6
4
65
39
26
14 Lectures
4
Evaluation:
Course degree
100 Degree
Final-term Examination
65 %
Oral Examination
10 %
Practical Examination
15 %
Semester Work
10 %
Other Types of Assessment
Total
--100%
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, 8th Edition, Paul Deitel and Harvey Deitel, Pearson
Education, Inc., 2012
2. Data Structure And Algorithms, 2nd Edition, Michael T. Goodrich, Roberto
Tamassia and David M. Mount, John Wiley & Sons, Inc., 2011.
3. Data Structures Using C++, 2nd Edition, D.S. Malik, Course Technology,
Cengage Learning, 2010 .
4. Data Structure And Algorithms In C++, 3rd Edition, Adam Drozdek, Thomson
Course Technology, 2005.
6
Any Questions?