CA5102-Data Structures and Algorithms |
FUNDAMENTALS OF ALGORITHMS |
Algorithm – Analysis of algorithms – Best case and worst case complexities – Analysis
of some algorithms using simple data structures – Amortized time complexity. |
FUNDAMENTALS OF DATA STRUCTURES |
Arrays – Structures – Stack: Definition and examples – Representing Stacks – Queues
and lists – Queue and its Representation – Applications of Stack – Queue and Linked
Lists. |
TREES |
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.
|
GRAPHS AND THEIR APPLICATIONS |
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.
|
STORAGE MANAGEMENT |
General Lists – Operations – Linked list representation – Using lists – Freeing list
nodes – Automatic list Management: Reference count method – Garbage Collection –
Algorithms – Collection and Compaction. |
Text Books |
1. Cormen T.H., Leiserson C.E, and Rivest R.L., “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, 2009 |
Reference Books |
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, 2009.
3. Tanaenbaum A.S. Langram, Y. Augestein M.J, “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. |