Data Structures-I
Subject Overview
Data Structures-I is BCA's foundational data-structures paper, covering algorithm complexity and asymptotic notation, arrays (including multi-dimensional and sparse matrices), linked lists (singly, doubly, circular), stacks (with arithmetic expression conversion/evaluation and recursion applications), and queues (simple, circular, priority, double-ended). A 3-credit core theory paper.
Unit-wise Syllabus
4 units — click WhatsApp below to get the full notes for each
Unit 1: Introduction and arrays
Definition, classification and operations of data structures, algorithm complexity, asymptotic notations, time-space trade-off, linear array representation and operations (traversing, inserting, deleting), two-dimensional arrays, sparse matrices, multi-dimensional arrays
Unit 2: Linked lists
Definition, comparison with arrays, representation, singly/doubly/circular linked lists — traversing, inserting, deleting, searching, applications of linked lists
Unit 3: Stacks and recursion
Definition, array and linked-list representation, stack operations, applications — arithmetic expressions, Polish notation, infix-to-postfix conversion, postfix evaluation; recursion definition, recursive notation, runtime stack, applications (factorial, GCD, Fibonacci, Towers of Hanoi)
Unit 4: Queues
Definition, array and linked-list representation, simple queue, circular queue, double-ended queue, priority queue, operations on simple and circular queues, applications of queues