Data Structure (45 Hours)
Each session 2 hours
Session 1
Introduction Basic terminology: data, information, data structure, abstract data type
(ADT)
Session 2
Classification of data structures: linear, non-linear Algorithm
Session 3
Data Structure analysis: time complexity, Big O notation
Session 4
Array representation and operations (traversal, insertion, deletion, searching .
Session 5
Linked lists: singly linked lists (representation, insertion, deletion, traversal)
Session 6
Linked lists: double linked lists (representation, insertion, deletion, traversal) and
circular
Session 7
Comparison of arrays and linked lists, advantages and disadvantages .
Session 8
Stack push, pop, peek operations Array implementation of stacks Applications of
stacks
Session 9
expression evaluation (infix to postfix conversion)
Session 10
Queue ADT: enqueue, dequeue, peek operations Array implementation of queues
Session 11
Recursion Concept of recursion base case, recursive step Examples: factorial,
Fibonacci sequence
Session 12
Trees Binary trees representation, traversal (inorder, preorder, post order) Binary
search trees
Session 13
insertion, deletion, search Applications of trees: basic hierarchical data
representation
Session 14
Hashing Hash functions and hash tables Collision handling and implementation
with coding
Session 15
separate chaining Applications of hashing: dictionaries and implementation with
coding
Session 16
Sorting and Searching Sorting algorithms: bubble sort and implementation with
coding.
Session 17
insertion sort, selection sort, quicksort, merge sort and implementation with coding.
Session 18
Searching algorithms: linear search, binary search and implementation with
coding
Session 19
Graph Definitions (vertices, edges), representation (adjacency matrix, adjacency
list)
Session 20
Graph traversals (Depth First Search - DFS, Breadth First Search - BFS)
Project: 5 Hours
