AI-Powered Learning Platform

Subject Syllabus

CB-203 - Data Structures and Algorithms

CSBS · Semester 2

Course Modules

Learn topic-wise with Hyper AI and revise using mapped PYQs.

Algorithm specification, Recursion Performance analysis, Asymptotic Notation - The Big-O, Omega and Theta notation Programming Style, Refinement of Coding - Time-Space Trade Off Testing, Data Abstraction

Dynamic memory allocation Array, Stack, Queue, Linked-list and its types Various Representations, Operations & Applications of Linear Data Structures

Trees (Binary Tree, Threaded Binary Tree, Binary Search Tree, B & B+ Tree, AVL Tree, Splay Tree)Priority queue as heap Graphs (Directed, Undirected)Various Representations, Operations (search and traversal algorithms and complexity analysis) & Applications of Non-Linear Data Structures

Sequential Search, Binary Search Breadth First Search, Depth First Search Insertion Sort, Selection Sort, Shell Sort Divide and Conquer Sort, Merge Sort, Quick Sort, Heap Sort Introduction to Hashing

Organisation (Sequential, Direct, Indexed Sequential, Hashed)Various types of accessing schemes