MT 9312 DATA STRUCTURES AND ALGORITHMS SYLLABUS | ANNA UNIVERSITY MTECH MAIN FRAME TECHNOLOGY 1ST SEM SYLLABUS REGULATION 2009 2011 2012-2013 BELOW IS THE ANNA UNIVERSITY FIRST SEMESTER M.TECH MAIN FRAME 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
MT 9312 DATA STRUCTURES AND ALGORITHMS L T P C
3 0 0 3
UNIT I INTRODUCTION (8)
Basic concepts of OOPs – Templates – Fundamentals of Analysis of Algorithm Efficiency
– ADT - List (Singly, Doubly and Circular) Implementation - Array, Pointer
UNIT II BASIC DATA STRUCTURES (9)
Stacks and Queues – ADT, Implementation and Applications - Trees – General, Binary,
Binary Search, Expression Search, AVL, Splay, B-Trees – Implementations - Tree
Traversals
UNIT III ADVANCED DATA STRUCTURES (10)
Set – Implementation – Basic operations on set – Priority Queue – Implementation -
Graphs – Directed Graphs – Shortest Path Problem - Undirected Graph - Spanning
Trees – Graph Traversals
UNIT IV SEARCHING AND SORTING (9)
Searching Techniques, Sorting – Internal Sorting – Bubble Sort, Insertion Sort, Quick
Sort, Heap Sort, Bin Sort, Radix Sort – External Sorting – Merge Sort, Multi-way Merge
Sort, Polyphase Sorting
UNIT V ALGORITHM DESIGN TECHNIQUES (9)
Design Techniques - Divide and Conquer - Dynamic Programming - Greedy Algorithm –
Backtracking - Local Search Algorithms
L – 45 Total – 45
REFERENCES:
1. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C++”, Pearson
Education, 2002.
2. A. Levitin, “Introduction to The Design and Analysis of Algorithms “, 2nd edition,
Addison Wesley, 2007 ( chapter 2)
3. Horowitz, Sahni, Rajasekaran, “Computer Algorithms”, Galgotia, 2000
4. Tanenbaum A.S., Langram Y, Augestien M.J., ”Data Structures using C & C++”,
Prentice Hall of India, 2002
5. Aho, Hopcroft, Ullman, “Data Structures and Algorithms”, Pearson Education, 2002.
MT 9312 DATA STRUCTURES AND ALGORITHMS L T P C
3 0 0 3
UNIT I INTRODUCTION (8)
Basic concepts of OOPs – Templates – Fundamentals of Analysis of Algorithm Efficiency
– ADT - List (Singly, Doubly and Circular) Implementation - Array, Pointer
UNIT II BASIC DATA STRUCTURES (9)
Stacks and Queues – ADT, Implementation and Applications - Trees – General, Binary,
Binary Search, Expression Search, AVL, Splay, B-Trees – Implementations - Tree
Traversals
UNIT III ADVANCED DATA STRUCTURES (10)
Set – Implementation – Basic operations on set – Priority Queue – Implementation -
Graphs – Directed Graphs – Shortest Path Problem - Undirected Graph - Spanning
Trees – Graph Traversals
UNIT IV SEARCHING AND SORTING (9)
Searching Techniques, Sorting – Internal Sorting – Bubble Sort, Insertion Sort, Quick
Sort, Heap Sort, Bin Sort, Radix Sort – External Sorting – Merge Sort, Multi-way Merge
Sort, Polyphase Sorting
UNIT V ALGORITHM DESIGN TECHNIQUES (9)
Design Techniques - Divide and Conquer - Dynamic Programming - Greedy Algorithm –
Backtracking - Local Search Algorithms
L – 45 Total – 45
REFERENCES:
1. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C++”, Pearson
Education, 2002.
2. A. Levitin, “Introduction to The Design and Analysis of Algorithms “, 2nd edition,
Addison Wesley, 2007 ( chapter 2)
3. Horowitz, Sahni, Rajasekaran, “Computer Algorithms”, Galgotia, 2000
4. Tanenbaum A.S., Langram Y, Augestien M.J., ”Data Structures using C & C++”,
Prentice Hall of India, 2002
5. Aho, Hopcroft, Ullman, “Data Structures and Algorithms”, Pearson Education, 2002.
No comments:
Post a Comment
Any doubt ??? Just throw it Here...