PCCST303 DATA STRUCTURES AND ALGORITHMS

MODULE 1

Basic Concepts of Data Structures
Definitions; Data Abstraction; Performance Analysis – Time & Space Complexity, Asymptotic Notations; Polynomial representation using Arrays, Sparse matrix (Tuple representation); Stacks and Queues – Stacks, Multi-Stacks, Queues, Circular Queues, Double Ended Queues; Evaluation of Expressions- Infix to Postfix, Evaluating Postfix Expressions.

MODULE 2

Linked List and Memory Management
Singly Linked List – Operations on Linked List, Stacks and Queues using Linked List, Polynomial representation using Linked List; Doubly Linked List; Circular Linked List; Memory allocation – First-fit, Best-fit, and Worst-fit allocation schemes; Garbage collection and compaction.

MODULE 3

Trees and Graphs
Trees :- Representation Of Trees; Binary Trees – Types and Properties, Binary Tree Representation, Tree Operations, Tree Traversals; Expression Trees; Binary Search Trees – Binary Search Tree Operations; Binary Heap, Binary Heap Operations, Priority Queue. Graphs :- Definitions; Representation of Graphs; Depth First Search and Breadth First Search; Applications of Graphs – Single Source All Destination.

MODULE 4

Sorting and Searching
Sorting Techniques :- Selection Sort, Insertion Sort, Quick Sort, Merge Sort, Heap Sort, Radix Sort. Searching Techniques :- Linear Search, Binary Search, Hashing – Hashing functions : Mid square, Division, Folding, Digit Analysis; Collision Resolution : Linear probing, Quadratic Probing, Double hashing, Open hashing.

YOUTUBE VIDEO LECTURES