BCA DS Syllabus

 

Unit	Content	Weightage (%)
Unit -1	Introduction to Data Structure §  Data Management concepts §  Foundation terms of a data Structure: Interface and Implementation §  Characteristics of a Data Structure: Correctness, Time Complexity & Space Complexity §  Need for Data Structure: Data Search, Processor speed and Multiple requests §  Basic Terminology of data Structure: Data, Data Item, Group Items, Elementary Items, Attribute and Entity, Entity Set, Field, Record, File §  Data types primitive and non-primitive §  Types of Data Structures- Linear &Non-Linear Data Structures. §  Array: ·         Representation of arrays ·         Applications of arrays §  Pointers: ·         Declaring and initializing pointers ·         Pointer arithmetic §  Structure: ·         Declaring and using structure	20

Unit -2	Stack and Queue: §  Stack: ·         Stack-Definitions & Concepts ·         Operations On Stacks ·         Applications of Stacks ·         Polish Expression ·         Reverse Polish Expression and their Compilation §  Queue: ·         Representation Of Queue ·         Operations On Queue ·         Circular Queue ·         Priority Queue ·         Array representation of Priority Queue ·         Double Ended Queue ·         Applications of Queue	20
Unit -3	Dynamic Memory allocation: §  What is Dynamic memory allocation? §  malloc( ), calloc( ), realloc( ) and free( ) function Singly Linked List: §  Building a linked list §  Traversing a linked list §  Insertion in a linked list ·         As a first node ·         As a last node ·         At specific location §  Deletion of a node ·         First node ·         Last node ·         Specific node §  Searching of linked lists §  Sorting of linked list §  Merging linked list Doubly Linked list: (traversing, insertion and deletion) §  Linked list implementation of Stack §  Linked list implementation of Queue §  Applications of linked list.	20

Unit -4	Nonlinear Data Structure: Tree : §  Definitions and Concepts §  Representation of binary tree §  Binary tree traversal (inorder, postorder, preorder) §  Complete Binary tree §  Binary search trees §  Applications of Trees Graph: §  Basic concepts and definitions §  Elementary Graph operations §  Breadth First Search §  Depth First Search §  Spanning Trees §  Shortest path	20
Unit -5	Sorting Techniques: Sorting, Selection Sort, Bubble Sort, Quick Sort , Merge Sort, Insertion Sort  Searching Techniques: Linear Search / Sequential Search, Binary Search  Hashing: Concept, hashing techniques, Collision resolution techniques	20