Data Structures
Subject Overview
Data Structures builds internal data management skills — algorithm complexity and searching/sorting techniques, stacks and queues with recursion, linked lists and dynamic storage management, and trees and their traversal applications. A 4-credit core theory paper.
Unit-wise Syllabus
4 units — click WhatsApp below to get the full notes for each
Unit 1: Introduction, searching and sorting
Basic concept of data, problem analysis, algorithm complexity, Big O notation, time-space trade-off, types of data structures (arrays, records, pointers, stack, queue, trees, linked list), linear and binary search, bubble/insertion/selection sort
Unit 2: Stacks and queues
Basics of stacks and queues, recursion, Polish notation, circular queues, priority queues
Unit 3: Linked lists
Single linked list, circular linked list, doubly linked list, dynamic storage management, generalized list, garbage collection
Unit 4: Trees
Definition and concepts, basic trees, binary tree representations, binary tree traversals and applications of trees