Course Outline for data structures for every university
Basic course outline for data structures for almost every international university!
Course Objectives
·
To introduce the theory of complexity and data
structures as basic building blocks.
·
To develop the skills to analyze time (and
space) requirements for a data structure and associated algorithms.
·
To prepare the students to pick the right data
structure for a given problem.
Textbook
Any one of these books is a good source of information:
·
E. Horowitz, S. Sahni, and D. Mehta, Fundamentals
of Data Structures in C++, Computer Science Press, 2007.
·
Mark Allen Weiss, Data structures and algorithm analysis, Pearson Education, 2007.
·
Adam Drozdek, Data structures and algorithms in C++, Course technology, 2004.
Reference Books
·
N. Dale, C++
Plus Data Structures, 3rd Edition, Jones and Bartlett , 2003.
Tentative course outline and lecture plan
Week
|
Topic
|
No. of Lectures
|
Section Reference
|
1
|
Review of C++ Classes
|
2
|
|
2
|
Introduction, Performance analysis and measurement
|
2
|
1.3, 1.6
|
3
|
Arrays, Multi-dimensional Arrays and mapping functions
|
2
|
2.2, 2.5
|
4
|
Stacks using arrays, Recursion
|
2
|
3.2
|
5
|
Queues using arrays, Evaluation of expressions
|
2
|
3.3, 3.6
|
6
|
Midterm
I
|
||
7
|
Singly-linked lists
|
2
|
4.1, 4.2
|
8-8.5
|
Stacks and queues using lists
|
1
|
4.5
|
8.5-9.5
|
Circular & Doubly-linked lists
|
2
|
4.4, 4.9
|
9.5,10.5
|
Trees – binary trees & traversals
|
2
|
5.1, 5.2, 5.3
|
10.5-11.5
|
Binary search trees
|
2
|
5.7
|
11.5,13
|
Height balanced trees
|
3
|
10.3
|
14
|
Heap & priority queue, Heap Sort
|
2
|
5.6, 7.6
|
15
|
Hashing
|
2
|
8.1, 8.2
|
16
|
Graphs – basic operations and traversal, MST
|
2
|
6.1, 6.2, 6.3, 6.4
|
Final
|
Passing Criteria
Minimum requirement to pass this course is to get at least
50% marks in total.
Comments
Post a Comment