CS9212 DATA STRUCTURES AND ALGORITHMS SYLLABUS | ANNA UNIVERSITY MTECH IT 1ST SEM SYLLABUS REGULATION 2009 2011 2012-2013 BELOW IS THE ANNA UNIVERSITY FIRST SEMESTER M.TECH. INFORMATION TECHNOLOGY DEPARTMENT SYLLABUS, TEXTBOOKS, REFERENCE BOOKS,EXAM PORTIONS,QUESTION BANK,PREVIOUS YEAR QUESTION PAPERS,MODEL QUESTION PAPERS, CLASS NOTES, IMPORTANT 2 MARKS, 8 MARKS, 16 MARKS TOPICS. IT IS APPLICABLE FOR ALL STUDENTS ADMITTED IN THE YEAR 2011 2012-2013 (ANNA UNIVERSITY CHENNAI,TRICHY,MADURAI, TIRUNELVELI,COIMBATORE), 2009 REGULATION OF ANNA UNIVERSITY CHENNAI AND STUDENTS ADMITTED IN ANNA UNIVERSITY CHENNAI DURING 2009
CS9212 DATA STRUCTURES AND ALGORITHMS L T P C
3 0 0 3
UNIT I COMPLEXITY ANALYSIS & ELEMENTARY DATA STRUCTURES 9
Asymptotic notations – Properties of big oh notation – asymptotic notation with several
parameters – conditional asymptotic notation – amortized analysis – NP-completeness –
NP-hard – recurrence equations – solving recurrence equations – arrays – linked lists –
trees.
3
UNIT II HEAP STRUCTURES 9
Min-max heaps – Deaps – Leftist heaps –Binomial heaps – Fibonacci heaps – Skew
heaps - Lazy-binomial heaps.
UNIT III SEARCH STRUCTURES 9
Binary search trees – AVL trees – 2-3 trees – 2-3-4 trees – Red-black trees – B-trees –
splay trees – Tries.
UNIT IV GREEDY & DIVIDE AND CONQUER 9
Quicksort – Strassen’s matrix multiplication – Convex hull - Tree-vertex splitting – Job
sequencing with deadlines – Optimal storage on tapes
UNIT V DYNAMIC PROGRAMMING AND BACKTRACKING 9
Multistage graphs – 0/1 knapsack using dynamic programming – Flow shop scheduling
– 8-queens problem – graph coloring – knapsack using backtracking
TOTAL: 45 PERIODS
REFERENCES:
1. E. Horowitz, S.Sahni and Dinesh Mehta, Fundamentals of Data structures in C++,
Galgotia, 1999.
2. E. Horowitz, S.Sahni and S. Rajasekaran, Computer Algorithms / C++, Galgotia,
1999.
3. Adam Drozdex, Data Structures and algorithms in C++, Second Edition, Thomson
learning – vikas publishing house, 2001.
4. G. Brassard and P. Bratley, Algorithmics: Theory and Practice, Printice –Hall, 1988.
5. Thomas H.Corman, Charles E.Leiserson, Ronald L. Rivest, ”Introduction to
Algorithms”, Second Edition, PHI 2003.
CS9212 DATA STRUCTURES AND ALGORITHMS L T P C
3 0 0 3
UNIT I COMPLEXITY ANALYSIS & ELEMENTARY DATA STRUCTURES 9
Asymptotic notations – Properties of big oh notation – asymptotic notation with several
parameters – conditional asymptotic notation – amortized analysis – NP-completeness –
NP-hard – recurrence equations – solving recurrence equations – arrays – linked lists –
trees.
3
UNIT II HEAP STRUCTURES 9
Min-max heaps – Deaps – Leftist heaps –Binomial heaps – Fibonacci heaps – Skew
heaps - Lazy-binomial heaps.
UNIT III SEARCH STRUCTURES 9
Binary search trees – AVL trees – 2-3 trees – 2-3-4 trees – Red-black trees – B-trees –
splay trees – Tries.
UNIT IV GREEDY & DIVIDE AND CONQUER 9
Quicksort – Strassen’s matrix multiplication – Convex hull - Tree-vertex splitting – Job
sequencing with deadlines – Optimal storage on tapes
UNIT V DYNAMIC PROGRAMMING AND BACKTRACKING 9
Multistage graphs – 0/1 knapsack using dynamic programming – Flow shop scheduling
– 8-queens problem – graph coloring – knapsack using backtracking
TOTAL: 45 PERIODS
REFERENCES:
1. E. Horowitz, S.Sahni and Dinesh Mehta, Fundamentals of Data structures in C++,
Galgotia, 1999.
2. E. Horowitz, S.Sahni and S. Rajasekaran, Computer Algorithms / C++, Galgotia,
1999.
3. Adam Drozdex, Data Structures and algorithms in C++, Second Edition, Thomson
learning – vikas publishing house, 2001.
4. G. Brassard and P. Bratley, Algorithmics: Theory and Practice, Printice –Hall, 1988.
5. Thomas H.Corman, Charles E.Leiserson, Ronald L. Rivest, ”Introduction to
Algorithms”, Second Edition, PHI 2003.
No comments:
Post a Comment
Any doubt ??? Just throw it Here...