MD3007 DATA STRUCTURE SYLLABUS | ANNA UNIVERSITY BE MEDICAL ELECTRONICS ENGINEERING 6TH SEMESTER SYLLABUS REGULATION 2008 2011 2012-2013 BELOW IS THE ANNA UNIVERSITY SIXTH SEMESTER B.E MEDICAL ELECTRONICS ENGINEERING 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), 2008 REGULATION OF ANNA UNIVERSITY CHENNAI AND STUDENTS ADMITTED IN ANNA UNIVERSITY CHENNAI DURING 2009
MD3007 DATA STRUCTURE L T P C
3 0 0 3
UNIT I PROBLEM SOLVING 9
Top-down Design – Implementation – Verification – Efficiency – Analysis – Algorithms –
Brute force – Recursive – Divide & Conquer.
UNIT II LISTS, STACKS AND QUEUES 9
Abstract Data Type (ADT) – The List ADT – The Stack ADT – The Queue ADT - Priority
Queues.
UNIT III TREES 9
Terminology – Binary Trees – The Search Tree ADT – Binary Search Trees – Tree
Traversals – Hashing – Binary Heap.
UNIT IV SORTING 9
General background of sorting - Bubble sort - selection sort- Insertion Sort – Shell sort –
Heap sort – Merge sort – Quick sort – External Sorting.
UNIT V GRAPHS 9
Topological Sort – Shortest-Path Algorithms – Unweighted Shortest Paths – Dijkstra’s
Algorithm – Minimum Spanning Tree – Prim’s Algorithm – Depth-First Search – Breadth
first search – Undirected Graphs
TOTAL :45 PERIODS
REFERENCES:
1. R. G. Dromey, “How to Solve it by Computer” Prentice-Hall of India, 2002.
2. M. A. Weiss, “Data Structures and Algorithm Analysis in C”, 2nd edition, Pearson
Education Asia, 2002.
3. E. Horowitz & S.Sahni, “Fundamentals Of computer Algorithms”, Galgotia , 2005
4. Y. Langsam, M. J. Augenstein and A. M. Tenenbaum, “Data Structures using C”,
Pearson Education Asia, 2004
5. Richard F. Gilberg, Behrouz A. Forouzan, “Data Structures – A Pseudocode
Approach with C”, Thomson Brooks / COLE, 1998.
6. Aho, J. E. Hopcroft and J. D. Ullman, “Data Structures and Algorithms”, Pearson
education Asia, 1983.
7. Robert Kruse / C. L. Tondo “Data Structures & Program design in C” Prentice Hall of
India 2007.
MD3007 DATA STRUCTURE L T P C
3 0 0 3
UNIT I PROBLEM SOLVING 9
Top-down Design – Implementation – Verification – Efficiency – Analysis – Algorithms –
Brute force – Recursive – Divide & Conquer.
UNIT II LISTS, STACKS AND QUEUES 9
Abstract Data Type (ADT) – The List ADT – The Stack ADT – The Queue ADT - Priority
Queues.
UNIT III TREES 9
Terminology – Binary Trees – The Search Tree ADT – Binary Search Trees – Tree
Traversals – Hashing – Binary Heap.
UNIT IV SORTING 9
General background of sorting - Bubble sort - selection sort- Insertion Sort – Shell sort –
Heap sort – Merge sort – Quick sort – External Sorting.
UNIT V GRAPHS 9
Topological Sort – Shortest-Path Algorithms – Unweighted Shortest Paths – Dijkstra’s
Algorithm – Minimum Spanning Tree – Prim’s Algorithm – Depth-First Search – Breadth
first search – Undirected Graphs
TOTAL :45 PERIODS
REFERENCES:
1. R. G. Dromey, “How to Solve it by Computer” Prentice-Hall of India, 2002.
2. M. A. Weiss, “Data Structures and Algorithm Analysis in C”, 2nd edition, Pearson
Education Asia, 2002.
3. E. Horowitz & S.Sahni, “Fundamentals Of computer Algorithms”, Galgotia , 2005
4. Y. Langsam, M. J. Augenstein and A. M. Tenenbaum, “Data Structures using C”,
Pearson Education Asia, 2004
5. Richard F. Gilberg, Behrouz A. Forouzan, “Data Structures – A Pseudocode
Approach with C”, Thomson Brooks / COLE, 1998.
6. Aho, J. E. Hopcroft and J. D. Ullman, “Data Structures and Algorithms”, Pearson
education Asia, 1983.
7. Robert Kruse / C. L. Tondo “Data Structures & Program design in C” Prentice Hall of
India 2007.
No comments:
Post a Comment
Any doubt ??? Just throw it Here...