2BCA3 - FUNDAMENTAL DATA STRUCTURE
Introduction to Data Structure
- The concept of data structure
- Abstract data structure
- Analysis of Algorithm
- The concept of List
Stakes and Queues
- Introduction to stack & primitive operation on stack
- Stack as an abstract data type
- Multiple Stack
- Stacks application: Infix, post fix, Prefix and Recursion
- Introduction to queues
- Primitive Operations on the Queues
- Queue as an abstract data type
- Circular queue
- Dequeue
- Priority queue
Linked List
- Introduction to the Linked List of Stacks
- The Linked List of queues
- Header nodes
- Doubly Linked List
- Circular Linked List
- Stacks & Queues as a Circular Linked List
- Application of Linked List.
Trees
- Basic Terminology
- Binary Trees
- Tree Representations as Array & Linked List
- Binary tree representation
- Traversal of binary trees:- In order, Preorder & post
order
- Application of Binary tree
- Threaded binary tree
- B-tree & Height balanced tree, representation of B+
& B* trees
- Binary tree representation of trees
- Counting binary trees
- 2-3 Trees, algorithm for manipulating 2-3 Trees
Searching & sorting
- Sequential Searching
- Binary search
- Insertion sort
- Selection sort
- Quick sort
- Bubble sort
- Heap sort
- Comparison of sorting methods
Tables & Graphs
- Hash Table
- Collision resolution Techniques
- Introduction to graphs
- Definition
- Terminology
- Directed, Undirected & Weighted graph
- Representation of graphs
- Graph Traversal-Depth first & Breadth first search
- Spanning Trees, minimum spanning Tree, The basic
- Greedy Strategy for computing Algorithm of Kruskal And
Prims
Text & Reference Books
- FUNDAMENTALS OF DATA STRUCTURE : By S. Sawhney &
E. Horowitch
- DATA STRUCTURE : By Tremblety & Sorrenson
- DATA STRUCTURE USING PASCAL: By Tannenbaum &
Augenstein
- DATA STRUCTURE : By lipschuists (Schanme's Outline
Series Mcgraw Hill Publication)
FUNDAMENTALS OF COMPUTER ALGORITHM: By Ellis Horowitz
and Sartaj Sawhney
