DATA STRUCTURE THROUGH C MAKAUT BCA THIRD SEM

Syllabus

Course Code: BCAC302

Data Structure through C

MODULE 1 4 Hours

Structure and Union: Typedef Definition, Implementation of Structure and Union, Accessing Members of the Structure, Pointer to Structure, Passing Structure in Function, Passing Structure through Pointer, Self-Referential Pointer, Nested Structure

MODULE 2 7 Hours

Arrays: 1D, 2D and Multi-Dimensional Arrays, Sparse Matrices. Polynomial Representation, Implementation of Stack and Queue, Example of Infix, Postfix, and Prefix, Priority Queue

MODULE 3 8 Hours

Linked Lists: Singly, Doubly and Circular Lists, Normal and Circular Representation of Self Organizing Lists, Skip Lists, Polynomial representation, Implementation of Stack and Queue, Circular List, Stack as Circular list, Queue as Circular List

MODULE 4 5 Hours

Recursion: Definition, Internal Stack representation, Factorial function, Fibonacci Sequence, Binary Search, The tower of Hanoi Problem

MODULE 5 8 Hours

Trees: Introduction to Tree As a Data Structure, Binary Trees (Insertion, Deletion, Recursive and Iterative Traversals of Binary Search Trees), Threaded Binary Trees (Insertion, Deletion, Traversals), Height-Balanced Trees (Various Operations on AVL Trees).

MODULE 6 8 Hours

Searching and Sorting: Linear Search, Binary Search, Comparison of Linear and Binary Search, Selection Sort, Insertion Sort, Merge Sort, Quick Sort, Shell Sort, Comparison of Sorting Techniques

MODULE 7 5 Hours

Hashing: Introduction to Hashing, Deleting From Hash Table, Efficiency of Rehash Methods, Hash Table Reordering, Resolving Collision by Open Addressing, Coalesced Hashing, Separate Chaining, Dynamic and Extendible Hashing, Choosing a Hash Function, Perfect Hashing