Phone: (+92) 41-9330712

You might also like

Download as pdf or txt
Download as pdf or txt
You are on page 1of 3

GOVERNMENT ISLAMIA GRADUATE COLLEGE, SARGODHA ROAD, FAISALABAD.

____________________________________________________________________
Phone: (+92) 41-9330712 E-mail: gigccsoffice@gmail.com

Tentative Lecture Plan

Week Topics Contents


1. Linear Search and Binary Search
01  Searching and Sorting Algorithms – I
2. Bubble Sort
3. Insertion Sort
1. Selection Sort and Count Sort
02  Searching and Sorting Algorithms – II
2. Merge Sort
3. Quick Sort
1. Arrays
03  Introduction to Data Structures
2. Pointers
 Arrays & Pointers 3. Linked List Introduction
 Linked List – I
1. Linked List Operations
04  Linked List – II
2. Linked List Examples
3. Doubly Linked List
1. Doubly Linked List Operations
05  Doubly Linked List
2. Doubly Linked List Examples
3. Doubly Circular Linked List
1. Introduction
06  Stack
2. Operations – I
3. Operations – II
1. Applications
07  Stack Applications
2. Expression evaluation – I
 Stack Expressions
3. Expression evaluation – II

Assignment 01

Mid Term Exam


1. Stack Expressions Examples
08  Stack
2. Recursion
 Recursion
3. Introduction to Queues
 Queues – I
1. Operations – I
09  Queues – II
2. Operations – II
 Priority Queues
3. Priority Queues
1. Tree Introduction
10  Binary Search Tree – I
2. BST Operations – I
3. BST Operations – II
1. BST Examples – I
11  Binary Search Tree – II
2. BST Examples – II
Page 3 of 5
GOVERNMENT ISLAMIA GRADUATE COLLEGE, SARGODHA ROAD, FAISALABAD.
____________________________________________________________________
Phone: (+92) 41-9330712 E-mail: gigccsoffice@gmail.com

3. BST Examples – III


1. Introduction
12  AVL Trees
2. Operations
3. Examples

Assignment 02
1. Introduction
12  Graphs – I
2. Adjacency List and Matrix
3. BFS
1. DFS
13  Graphs – II
2. Dijkstra
3. Prims & Kruskal
1. Notations and times
14  Algorithm Complexity
2. Calculating time
3. Examples
1. Divide and Conquer
15  Classes of Efficient Algorithms
2. Dynamic Programming
3. Greedy Algorithms
1. Heap Sort
16  Heap
2. Revision
 Revision
Term Project Viva

Final Term Exams

Page 4 of 5
GOVERNMENT ISLAMIA GRADUATE COLLEGE, SARGODHA ROAD, FAISALABAD.
____________________________________________________________________
Phone: (+92) 41-9330712 E-mail: gigccsoffice@gmail.com

Tentative Lab Plan

Lab

01  Linear Search and Binary Search

02  Sorting comparison

03  Arrays and Pointers

04  Linked List – I
 Operations

05  Linked List – II
 Operations

06  Doubly Linked List


 Operations

07  Stack
 Operations

08  Queue
 Priority Queue

09  BST
 Operations

10  AVL
 Operations

11  Graphs
 Adjacency Matrix and List
 Dijkstra

Page 5 of 5

You might also like