Scheme & Syllabus Copy of Data Structure using c and c++ bca notes
Subject: Data Structures using C
Subject Code: BCA 108
UNIT-I: Introduction to Data Structures
- Basic Terminology: Definitions and key concepts.
- Elementary Data Organizations: Overview of data organization techniques.
- Classification of Data Structures: Overview and operations.
Arrays:
- Representation of single and multidimensional arrays (up to three dimensions).
- Sparse arrays: Lower and upper triangular matrices, and tri-diagonal matrices.
- Operations on sparse arrays: Addition and subtraction.
Stacks and Queues:
- Stack: Introduction and primitive operations.
- Applications: Polish notations, evaluation of postfix expressions, and conversion from infix to postfix.
- Queue: Introduction and primitive operations.
- Types: D-queues and priority queues.
[No. of Hours: 11]
UNIT-II: Lists and Trees
Lists:
- Introduction to linked lists.
- Sequential and linked lists.
- Operations: Traversal, insertion, deletion, and searching.
- Two-way lists and the use of headers.
Trees:
- Introduction and terminology.
- Binary tree traversal techniques.
- Recursive algorithms for tree operations: Traversal, insertion, and deletion.
[No. of Hours: 11]
UNIT-III: Advanced Trees and Indexing
AVL Trees and m-Way Search Trees:
- Introduction and creation of AVL trees.
- Elementary treatment of m-way search trees.
Multilevel Indexing and B-Trees:
- Introduction to indexing with binary search trees.
- Multilevel indexing: A better approach to tree indexes.
- Creation and examples of B-trees.
[No. of Hours: 11]
UNIT-IV: Sorting and Searching Techniques
Sorting Techniques:
- Insertion sort.
- Selection sort.
- Merge sort.
Searching Techniques:
- Linear search.
- Binary search.
- Hashing.
