Data structure syllabus ( BCA- 3 sem)

                   The Index 

 

S NO.       Name

1. Introduction of data structure

2. The stack

3.  Queue

4. List

5. Linked Lists

6. Recursion

7. Trees

                        The Syllabus 

Unit-1

Introduction of data structure: Definition, Abstract Data, Importance of data structure.

  

Unit-2

The Stack : Introduction, Stack as an ADT, POP and PUSH Operating, Stack Application:

Evaluation of Infix, Postfix and Prefix Expressions, Conversion, of Expression.   

Unit-3

Queue: Introduction, Queue as an ADT, Primitive operation in queue, Linear and circular Queue and their application, Enqueue and Dequeue, Priority Queue.

Unit-4 

List : Introduction, static and dynamic list structure, Army implementation of lists, Queue as a list

Unit-5 

Linked Lists : Introduction, Linked List as an ADT, Dynamic implementation, Insertion & Deletion of node to and from a list, insertion and deletion after and before nodes, Linked stacks and queue, Doubly linked lists and its advantages.

Unit-6

Recursion : Introduction, Principle of recursion, Recursion vs Iteration Recursion Example. TOLL and Fibonacci series, Application of Recursion, Search tree.

Unit-7 

Trees : Introduction, Basic Operation in binary in binary tree, Tree search and insertion and Deletion, Binary tree Traversals ( pre - order, Post order and in - order), Tree Height, Level and depth, balanced trees: AVL Balanced Tress Balancing algorithm, The Huffen Algorithm, Game tree, B- Tree.