Shaheed Benazir Bhutto University, ShaheedBenazirabad

Knowledge - Commitment – Leadership

COURSE COVERAGE REPORT

Subject Data Structure and Course Code

Algorithm
Subject Teacher Dr. Munwar Ali Designation Assistant Professor
Class 19 BS (IT) Section A&B

UNIT/Chapter Name of Status Face to face

Week Topics Recommended (completed/ (ff)/online (OL)
book/website incomplete)
1st  Basic  To Define
Terminology term data 1. Data Structure FF
 Data Structures with at least and Other
 Data Structure two Objects using completed
C++
Operations examples
2. Data Structures
 To define by Schaum’s
the term series
structure
with
examples
 To relate
the term
data with
structure
 to Explain
importance
of data
structure
with it
usage and
examples
 To Classify
types of
data
structure
 To describe
the
operations
of data
structure
2nd  Algorithm  To define completed FF
 Algorithmic algorithm 1. Data Structure
Notations  To discuss and Other
 Complexity of the term Objects using
C++
Algorithms algorithm
2. Data Structures
 To Explain by Schaum’s
all notations series
of different
algorithm
 To Describe
Control
Structures
with
 Shaheed Benazir Bhutto University, ShaheedBenazirabad
Knowledge - Commitment – Leadership

examples
 Discuss
complexity
of
algorithms
 Explain How
to find
complexity
of
algorithms
 Describe
Subalgorithm
 use
Subalgorithm
in main
algorithms
3rd  Steps Control  Practice FF
Exit, steps for 1. Data Structure
 Comments, making an and Other
Objects using Completed
 Variable Names, algorithm
C++
 Assignment  Use of
2. Data Structures
Statement, control exits by Schaum’s
 Input & Output, in algorithm series
 Procedures  Use of
 variables in
algorithm
 Write
statments
in algorithm
 Write
input/output
in algorithm
 Prepare
procedures
4th  Control  What is FF
Structures control 1. Data Structure Completed
 Subalgorithm  Discuss and Other
 classification Objects using
 C++
of control
2. Data Structures
structre by Schaum’s
 Define series
sequential
structre
 Define
repetitive
structure
 Define
conditional
structure

5th  Flowchart  What is FC FF

Definition  Why we use 1. Data Structure Completed
 Shaheed Benazir Bhutto University, ShaheedBenazirabad
Knowledge - Commitment – Leadership
and Other
 Flowchart FC Objects using
Symbols  Discuss C++
 Pseudo code basic 6 2. Data Structures
shapes of by Schaum’s
series
FC
 What is PC
 Why we use
PC

6th  Introduction of  What is FF

Array array 1. Data Structure Completed
 Representation  How to and Other
of Array in declere Objects using
C++
memory array
2. Data Structures
 How to by Schaum’s
initialize series
array
 Discuss
diagram of
representati
on of array
7th  Multidimensional  Types of
array. array 1. Data Structure Completed FF
 2-D Arrays  Define 1D and Other
 Representation array Objects using
C++
of 2-D array in  Define 2D
2. Data Structures
memory array by Schaum’s
 Difference series
btw 1D and
2D array
 Discuss
diagram of
representati
on of 2D
array
8th  Operations of  Discuss all 6 FF
arrays operations 1. Data Structure Completed
 Traversing Linear of array and Other
Array  Explain and Objects using
C++
 Inserting and execute
2. Data Structures
Deleting algo:of by Schaum’s
 traversing series
  Explain and
execute
algo:of
Deleting
 Explain and
execute
algo:of
Inserting
9th  Searching Linear  What is FF
Completed
 Shaheed Benazir Bhutto University, ShaheedBenazirabad
Knowledge - Commitment – Leadership

Array search
 Linear Search  Define
 Binary Search types of
 Introduction of search
Linked List  Define
 Representation linear
of Linked List in search
memory  Define
Binary
search
 Explain and
execute
algo:of LS
 Explain and
execute
algo:of BS
 What is
Linked List
 Discuss
diagram of
representati
on of linked
list
10th  Operations of  Discuss all 6 FF
Linked list operations Completed
 Memory of Linked
Allocation, List
1. Data Structure
Garbage  Discuss and Other
Collection memory Objects using
 Overflow & allocation C++
Underflow  Define 2. Data Structures
 New delete static & by Schaum’s
operators dynamic series
memory
allocation
 Define
garbage
collection
 Discuss
Overflow
situation
 Discuss
Underflow
situation
 Discuss
New
operator
 Discuss
Delete
opearator
11th  Introduction of  What is 1. Data Structure Online
stack stack and Other
Completed
 Shaheed Benazir Bhutto University, ShaheedBenazirabad
Knowledge - Commitment – Leadership
Objects using
 Basic Operations  Why stack C++
 Types of  Define all 2. Data Structures
representation of stack by Schaum’s
stack in memory operations series
 Push( ) Algorithm  Practical of
 Pop( ) Algorithm pop algo:
 Practical of
push algo:
12th  Introduction of  What is tree 1. Data Structure
tree  Define all and Other completed Online
 Terminologies terminologies Objects using
 Types of tree of tree C++
2. Data Structures
 Types of binary  Define
by Schaum’s
tree types of
series
 Representation tree
of tree in  Define
memory types of
binary tree
 Draw
representation
of tree in
memory
13th  Introduction of  What is 1. Data Structure Completed Online
graph graph and Other
 Types of Graphs  Define all Objects using
 Terminologies terminologies C++
2. Data Structures
 Trees vs Graphs of graph
by Schaum’s
 Shortest Path  Define
series
Problem types of
 Traversing of graph
Graph  Draw
representation
of graph in
memory
 How to find
shortest
path
problem
14th  Abstract Data  What is ADT 1. Data Structure Completed Online
Type (ADT)  Discuss ADT and Other
 Algorithms:  What is Objects using
Complexity, tradeoff C++
2. Data Structures
Time-Space  Discuss
by Schaum’s
Tradeoff time space
series
tradeoff
 Find
complexity
of tradeoff
15th Test & Presentation Done Online

16th Final exam

 Shaheed Benazir Bhutto University, ShaheedBenazirabad
Knowledge - Commitment – Leadership

Counter signed by

Head of Department