Professional Documents
Culture Documents
Course Breakdown
Assignments and Quizzes: Approximately 4 assignments and minimum 4 quizzes shall be given
during the semester. The quizzes shall preferably be unannounced
Attendance Policy: 80% attendance is mandatory; deficient students will not be allowed to appear in
the examination.
Lecture Breakdown
Lecture #
Topics
Introduction to the Course
Introduction to Tree
Binary tree
Tree Travesing (PreOrder, InOrder, PostOrder)
Tree Part
AVL Tree, Binary Search Tree
Tree Part
B Tree, Heap Data Structure
Min Heap & Max Heap
9
10
Tree Part
Min Heap & Max Heap
Heap Sort
Brute Force Algorithms
Selection Sort
Course Breakdown
11
Exhaustive Search
12
Sorting
Quick Sort
Merge Sort
11
Sorting
Heap Sort
Radix Sort
12
13
14
15
16
17
18
19
20
Greedy Algorithms
A task-scheduling problem
21
Dynamic Programming
Elements of dynamic programming
Course Breakdown
22
Dynamic Programming
All Pair shortest distance( Floyed Warshal)
23
Dynamic Programming
Matrix-chain multiplication
24
Dynamic Programming
Longest Common Subsequence
25
String Matching
The nave string-matching algorithm
26
String Matching
The Rabin-Karp algorithm
27
Hash Tables
Direct-address table
28
29
Hash Tables
Hash tables
Hash functions
Hash Tables
Open addressing
30
Hash Tables
Perfect addressing
31
Course Revision
32
Course Revision