SYLLABUS (As per NEP-2020)

UNIT-I

Introduction: Elementary data organization, Data Structure definition, Data type vs. data structure, Categories of data structures, Data structure operations, Applications of data structures.
Arrays: Introduction, Linear arrays, Representation of linear array in memory, address calculations, Traversal, Insertions, Deletion in an array, Multidimensional arrays, Parallel arrays, Sparse arrays.
Searching: Introduction, Sequential search, Binary search, Prerequisite for binary search, Comparison in terms of efficiency.

UNIT-II

Sorting: Bubble sort, Selection sort, Insertion sort, Quick sort, Merge sort, Comparison in terms of their efficiency.
Stack: Introduction, Array and linked representation of stacks, Operations on stacks, Applications of stacks: Polish notation, Recursion.
Queues: Introduction, Array and linked representation of queues, Operations on queues, Deques, Priority Queues, Applications of queues.

UNIT-III

Linked List: Introduction, Representation of linked lists in memory, Traversal, Insertion, Deletion, Searching in a linked list, Header linked list, Circular linked list, Two-way linked list, Threaded lists, Garbage collection, Applications of linked lists.
Tree: Introduction, Definition, Representing Binary tree in memory, Traversing binary trees, Traversal algorithms using stacks.
Graph: Introduction, Graph Theory terminology, Sequential and Linked representation of Graphs.

UNIT-IV

Introduction to file structures: Concept of a file, types of files, File operations - open, read, write, close. External storage devices, Concepts of record, file, database and database system.
File Organization: Sequential file organisation – structures and processing, Record structures and access methods. Indexed sequential file organisation – structures and processing, Indexing techniques, B-trees and hashing for indexed files. Direct file organisation. Hashed File Organization - Hash function implementation.