GOVT POSTGRADUATE COLLEGE SAMANABAD

FAISALABAD
Break-up-course code CSI-401 Data Structure and algorithm
4(3-1)

No of Course contents
Week
s
1st Introduction To data structure
Binary and decimal Integers, real numbers, character string,data structure
and C
Practical 1. Basic C++ programs structure.
2nd Arrays.
One Dimensional array, two dimensional array , multidimensional array
Practical 2. Array Program Examples.
3rd Stacks.
Definition and examples, Representing stack in C++,Infix, postfix and
prefix.
Practical 3.Stack Program examples.
4th Queues and priority Queue.
The Queue and its sequential representation, Array Implementation of
priority Queue.
Practical 4. Queue and priority queue examples.
5th Linked List.
Definition of linked list, Inserting and removing nodes from a list, get node
and free node operation, linked implementation of a stack. Linked
implementation of queues.
Practical 5. Linked list programs examples.

6th Trees.
Definition of trees, Binary Tree, Binary tree representation, node
representation of binary tree, binary tree traversal, The Huffman algorithm.
Practical 6. Trees program Examples.

7th Graphs and Recursion.

Application of graphs and representation of graphs. Recursive algorithm,
Divide and conquer
Practical 7. Recursive algorithm implementation.

8th Searching And sorting algorithms.

(MID) Basic Search Techniques, Binary search , sequential search , indexed
sequential search. Bubble sort, quick sort, shell sort
 Practical 8. Sorting program examples.
9th Hashing .
Hash function, separate chaining, linear probing , double hashing
Practical 8 . Searching program examples.
10th Storage and retrieval properties and techniques for various data structures.
Representation of lists.
Practical 10. Representation of lists.
11th Algorithm complexity
12th Polynomial and intractable algorithm.
13th Classes of efficient algorithm
14th Dynamic memory management .
Compaction of block of storage, first fit, best fit and worst fit, improving in
first fit method

15th Greedy algorithm

16th