KTU S3 CST 201 & CSL 201
To help 2nd Year KTU students
DATA-STRUCTURES-SYLLABUS
Module 1
Basic Concepts of Data Structures
System Life Cycle, Algorithms, Performance Analysis, Space Complexity, Time Complexity,
Asymptotic Notation, Complexity Calculation of Simple Algorithms
Module 2
Arrays and Searching
Polynomial representation using Arrays, Sparse matrix, Stacks, Queues-Circular Queues, Priority
Queues, Double Ended Queues, Evaluation of Expressions
Linear Search and Binary Search
Module 3
Linked List and Memory Management
Self Referential Structures, Dynamic Memory Allocation, Singly Linked List-Operations on
Linked List. Doubly Linked List, Circular Linked List, Stacks and Queues using Linked List,
Polynomial representation using Linked List
Memory allocation and de-allocation-First-fit, Best-fit and Worst-fit allocation schemes
Module 4
Trees and Graphs
Trees, Binary Trees-Tree Operations, Binary Tree Representation, Tree Traversals, Binary Search
Trees- Binary Search Tree Operations
Graphs, Representation of Graphs, Depth First Search and Breadth First Search on Graphs,
Applications of Graphs
Module 5
Sorting and Hashing
Sorting Techniques – Selection Sort, Insertion Sort, Quick Sort, Merge Sort and Heap Sort
Hashing- Hashing Techniques, Collision Resolution, Overflow handling, Hashing functions –
Mid square, Division, Folding, Digit Analysis