YCS923 DATA STRUCTURES SYLLABUS | ANNA UNIVERSITY BCA 2nd SEMESTER SYLLABUS REGULATION 2010 2011 2012-2013 BELOW IS THE ANNA UNIVERSITY SECOND SEMESTER BCA BACHELOR OF COMPUTER APPLICATIONS 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), 2010 REGULATION OF ANNA UNIVERSITY CHENNAI AND STUDENTS ADMITTED IN ANNA UNIVERSITY CHENNAI DURING 2010
YCS923 DATA STRUCTURES L T P C
3 0 0 3
UNIT I PROBLEM SOLVING 9
Problem solving – Top-down Design– Implementation– Verification– Efficiency–Analysis – Sample
algorithms.
UNIT II LISTS, STACKS AND QUEUES 9
Abstract Data Type (ADT) – The List ADT – The Stack ADT – The Queue ADT
UNIT III TREES 9
Preliminaries – Binary Trees – The Search Tree ADT – Binary Search Trees – AVL Trees
– Tree Traversals – Hashing – General Idea – Hash Function – Separate Chaining –
Open Addressing – Linear Probing – Priority Queues (Heaps) – Model – Simple
implementations – Binary Heap
UNIT IV SORTING 9
Preliminaries– Insertion Sort – Shellsort –Heapsort– Mergesort–Quicksort– External Sorting
UNIT V GRAPHS 9
Definitions– Topological Sort– Shortest-Path Algorithms–Unweighted Shortest Paths–
Dijkstra’s Algorithm– Minimum Spanning Tree– Prim’s Algorithm– Applications of Depth-
First Search–Undirected Graphs –Biconnectivity– Introduction to NP-Completeness
TOTAL : 45
REFERENCES:
1 R. G. Dromey, “How to Solve it by Computer” (Chaps 1-2), Prentice-Hall of India,
2002.
2 M. A. Weiss, “Data Structures and Algorithm Analysis in C”, 2nd ed, Pearson
Education Asia, 2002.
3 ISRD Group, “Data Structures using C”, Tata McGraw Hill, 2007
4 Richard F. Gilberg, Behrouz A. Forouzan, “Data Structures – A Pseudocode
Approach with C”, ThomsonBrooks / COLE, 1998.
YCS923 DATA STRUCTURES L T P C
3 0 0 3
UNIT I PROBLEM SOLVING 9
Problem solving – Top-down Design– Implementation– Verification– Efficiency–Analysis – Sample
algorithms.
UNIT II LISTS, STACKS AND QUEUES 9
Abstract Data Type (ADT) – The List ADT – The Stack ADT – The Queue ADT
UNIT III TREES 9
Preliminaries – Binary Trees – The Search Tree ADT – Binary Search Trees – AVL Trees
– Tree Traversals – Hashing – General Idea – Hash Function – Separate Chaining –
Open Addressing – Linear Probing – Priority Queues (Heaps) – Model – Simple
implementations – Binary Heap
UNIT IV SORTING 9
Preliminaries– Insertion Sort – Shellsort –Heapsort– Mergesort–Quicksort– External Sorting
UNIT V GRAPHS 9
Definitions– Topological Sort– Shortest-Path Algorithms–Unweighted Shortest Paths–
Dijkstra’s Algorithm– Minimum Spanning Tree– Prim’s Algorithm– Applications of Depth-
First Search–Undirected Graphs –Biconnectivity– Introduction to NP-Completeness
TOTAL : 45
REFERENCES:
1 R. G. Dromey, “How to Solve it by Computer” (Chaps 1-2), Prentice-Hall of India,
2002.
2 M. A. Weiss, “Data Structures and Algorithm Analysis in C”, 2nd ed, Pearson
Education Asia, 2002.
3 ISRD Group, “Data Structures using C”, Tata McGraw Hill, 2007
4 Richard F. Gilberg, Behrouz A. Forouzan, “Data Structures – A Pseudocode
Approach with C”, ThomsonBrooks / COLE, 1998.
No comments:
Post a Comment
Any doubt ??? Just throw it Here...