Data Structure and Algorithm Chapters

Data types; Data structure and abstract data type; Dynamic memory allocation in C; Introduction to algorithms; Asymptotic notations and common functions.

Basic concept of stack; Stack as an ADT; Stack operations and applications; Infix to postfix/prefix conversion; Evaluation of postfix and prefix expressions.

Basic concept of queue; Queue as ADT; Primitive operations; Linear queue; Circular queue; Priority queue; Queue applications.

Principle of recursion; Recursion vs iteration; Tail recursion; Examples: factorial, Fibonacci, GCD, Tower of Hanoi; Applications and efficiency.

Concept of lists; ADT list; Array implementation; Linked lists—singly, doubly and circular; Basic operations on lists.

Introduction to sorting; Internal and external sorting; Bubble, Selection, Insertion sort; Shell sort; Divide-and-conquer sorting.

Sequential and binary search; Efficiency; Hashing—hash functions, hash tables, collision handling techniques.

Definitions; Binary tree operations; Tree height, level, depth; BST operations; AVL trees; Graphs and basic graph operations.