Overview – How to create a Program and Analyze a program. Axiomatization – ordered lists- Representation of arrays.
Fundamentals –Mazing Problems - Evaluation of Expressions – Multiple Stacks and Queues.
Singly Linked Lists – Linked Stacks and Queues - Application: Sparse matrix - Doubly Linked Lists and Dynamic Storage management- Garbage collection and compaction.
Basic Terminology - Binary Tree and Binary tree representation – Binary Tree Traversals Terminology and representation –Definition – Graph representation-Depth first search and breadth first search- spanning trees and minimum cost spanning trees.
Liner and Binary search, Sorting: Insertion Sort – Quick Sort – Merge Sort – Heap Sort – shell sort.
Reference Book:
1. Narasimha Karumanchi , “Data Structures and Algorithms Made Easy” Copyright (c) Dec 21, 2014 CareerMonk Publications and others. ISBN : 9780615459813 2. Alfred V.Aho, John E.Hopcroft, Jeffrey D.Ullman, “Data Structures and Algorithms” ,Pearson Education ,1st Impression 2006. 3. Sartaj Sahni, “ Data Structures Algorithms and applications in C++” 2nd Edition Universities press (India)Private Ltd, 2005.
Text Book:
1. Ellis Horowitz,Sartaj Sahni ,“Fundamentals of Data Structures”,Neeraj Galgotia Book Source ,Gurgaon.
