ANNA UNIVERSITY TRICHY - MCA SYLLABUS 5

ANNA UNIVERSITY TRICHY - MCA SYLLABUS 5

CA5102 DATA STRUCTURES AND ALGORITHMS 

UNIT I FUNDAMENTALS OF ALGORITHMS                                   9 


Algorithm – Analysis of algorithms – Best case and worst case complexities – Analysis
of some algorithms using simple data structures – Amortized time complexity.


UNIT II FUNDAMENTALS OF DATA STRUCTURES                               9 


Arrays – Structures – Stack: Definition and examples – Representing Stacks – Queues
and lists – Queue and its Representation – Applications of Stack – Queue and Linked
Lists.






UNIT III 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 – Sorting
and searching Techniques – Tree searching – 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 – Dijikstra’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.


            Total: 45


TEXT BOOKS 


1. T.H Cormen, C.E Leiserson, and R.L Rivest, “Introduction to Algorithms”,          
Prentice Hall India, New Delhi, 2007.


2. Ellis Horowitz, S.Sahni and S.Rajasekan, “Fundamentals of Computer          
Algorithms”, Universities press(India) limited, 2008


REFERENCES 


1.   Sartaj. Sahni, “Data Structures, Algorithms and Applications in C++”, Second
Edition WCB / Tata McGraw Hill, 2005.


2.   Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, Second
Edition, Pearson Education, 2008.


3.  Tanaenbaum A.S. Langram, M.J. Augestein, “Data Structures using C” Pearson
Education, 2004.


4.  Robert L Kruse, Bruce P Leung and Clovin L Tondo, “Data Structures and
Program Design in C”, Pearson Education, 2007.