Trending: Anna University 8th Sem Results April 2014 May/June 2014 Time Table/ Internal Marks Calculate CGPA Online SSLC Results 2014 12th Result 2014

Test Footer 1

Wednesday, September 26, 2012

MC9214 DATA STRUCTURES SYLLABUS | ANNA UNIVERSITY MCA 1ST SEMESTER SYLLABUS REGULATION 2009 2011 2012-2013

Latest: TNEA 2014 Engineering Application Status, Counselling Date, Rank List
MC9214 DATA STRUCTURES SYLLABUS | ANNA UNIVERSITY MCA 1ST SEMESTER SYLLABUS REGULATION 2009 2011 2012-2013 BELOW IS THE ANNA UNIVERSITY FIRST SEMESTER MCA MASTER 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), 2008 REGULATION OF ANNA UNIVERSITY CHENNAI AND STUDENTS ADMITTED IN ANNA UNIVERSITY CHENNAI DURING 2009


MC9214 DATA STRUCTURES L T P C
3 1 0 4
UNIT I DATA STRUCTURES 9
Introduction – Arrays – Structures – Stack: Definition and examples, Representing
Stacks - Queues and lists: Queue and its Representation, lists – Applications of Stack,
Queue and Linked Lists.
UNIT II TREES 9
Binary Trees – Operations on binary trees - Binary Tree Representations – node
representation, internal and external nodes, implicit array representation – Binary tree
Traversals - Huffman Algorithm – Representing Lists as Binary Trees
UNIT III SORTING AND SEARCHING 9
General Background – Exchange sorts – Selection and Tree Sorting – Insertion Sorts –
Merge and Radix Sorts – Basic Search Techniques – Tree Searching – General Search
Trees – Hashing.
UNIT IV GRAPHS AND THEIR APPLICATIONS 9
Graphs – An application of graphs – Representation – transitive closure - Warshall’s
algorithm – Shortest path algorithm - a flow Problem – Dijkstra’s algorithm – An
application of scheduling - Linked representation of Graphs – Graph Traversals
UNIT V STORAGE MANAGEMENT 9
General Lists: Operations, linked list representation, using lists, Freeing list nodes -
Automatic list Management: Reference count method, Garbage Collection, Algorithms,
Collection and compaction
L : 45 T : 15 TOTAL : 60 PERIODS
5
TEXTBOOK:
1. Tanaenbaum A.S.,Langram Y. Augestein M.J “ Data Structures using C” Pearson
Education , 2004
REFERNCES:
1. Robert Kruse & Clovis L. Tondo “ Data Structures and Program Design in
C”,Prentice Hall , 2nd edition.,1991.
2. Weiss “Data Structures and Algorithm Analysis in C ” ,Addison Wesley , Second
Edition, 1997.

No comments:

Post a Comment

Any doubt ??? Just throw it Here...