Ministry of Higher Education

Jahan University
Academic Vice Chancellor
Quality Assurance Committee

Data Structure & Algorithm Course Policy

Class Specification:
Subject: Data Structure & Algorithms
Code: CSC211
Semester: 6th
Pre requisite subjects: PROGRAMMING CPP OR JAVA LANGUAGE
Academic Year: 1405
Year: 3rd
Department: Database/IT
Credit Hours: 3 (Theory) + 0 (Lab)
Videos (Tutorials): [Link]

Lecturer Specification
Name: Condidate Assistant Professor Mohammad Yousuf Arabzai
Phone: +93784620037
Email: mohammadyousufarabzai179@[Link]

Teaching Assistant
Name: Sir Imdadullah Momand
Phone number: +93793520577
Email address: imdadullah123@[Link]

Grading and Evaluation Method

No Activity Marks
 1 Assignments and Attendance 10

2 OBE 10

3 Mid-term Exam 20

4 Final term exam 60

Total 100

Learning Objectives
The Data Structures and Algorithms course aims to develop students’
understanding of fundamental data organization and problem-solving techniques
used in computer science. By the end of this course, students will be able to explain
core concepts of data structures and algorithm design, analyze time and space
complexity using asymptotic notations, and implement linear and non-linear data
structures such as arrays, linked lists, stacks, queues, trees, and graphs. Students
will also be able to apply and compare various searching and sorting algorithms,
utilize algorithmic strategies such as recursion, divide and conquer, greedy
methods, and dynamic programming, and evaluate algorithm efficiency to design
optimized solutions for real-world computational problems.

Teaching Methods
 Lecture
 Lab
 Class discussion
 Question & Answer
 Problem Solving
 Student Presentation

Teaching & Learning Material

 Main Materials:
 Data Structure & Algorithm By Naeemullah
 M. Tanenbaum, Data Structures using C++, Prentice-Hall, New
Delhi
 N. Karumanchi, Data Structures and Algorithms Made Easy in Java:
Data Structure and Algorithmic Puzzles. Scotts Valley, CA, USA:
Create Space Independent Publishing Platform, 2011.
 RECOMMENDED BOOKS:
 Data structure By Naeemullah

Class Regulation
 Attendance treatment: 75% attendance is necessary.
 Homework evaluation: Up to 5 Home works are necessary.
 Make: Should prepare a 50-page notebook.
 Class activity Evaluation: Student should actively participate in the class.
  Student must not: Any take any action in the class that violates the rules
and regulation of the class and the university.

Lectures Plan
Teaching
We
Topics Method and Remarks
ek
evaluation
Lecturer introduction & greeting with students
Course Introduction & Objectives
Chapter 1: Data Structure Forming Student
 Introduction to Data Structure Lecture method group for group
 Importance of Data Structure work.
1  Characteristics of Data Structure
 Cases of Execution time
 Data Structures Types(Linear &
Non-Linear)
 Data Structure Operations
Chapter 1: Algorithms
 Algorithms
 History of algorithms
Solving 3 different
2  Pseudo language and PBL(Problem examples.
conventions
Solving)
 Algorithms notations
 Examples

Chapter 2: Program Execution

Flow
 Sequential flow Assignment#1
PBL(Problem
 Decisional flow
3 Solving)
 Single alternative, Double
alternative, Multiple alternative
 Quadratic equation
 Iterative or repetitive flow
Chapter 3: Array
 Introduction to Array
 Representation of array
GBL(Class Assignment#2
4  Working with Dope Vector
method discussion)
 Array traversing
 Array insertion and Deletion
Chapter 4: Searching
1. Linear search PBL(Problem Assignment#3
5 Solving)
2. Binary search

Chapter 5: Sorting
 Working with bubble sort
6 PBL(Problem Implementation
 Working with selection sort
Solving) using CPP
 Working with insertion sort
Chapter 5: Sorting
7  Understanding advanced sorting
PBL(Problem Assignment#4
techniques
Solving)
 Chapter 6: Stack
 Introduction to Stack GBL(Class Application Area
8  Stack Applications
 Push algorithm and its discussion)
implementation

 Pop algorithm and its

implementation PBL(Problem Midterm Exam
9 Solving)
 Midterm Exam

Chapter 6: Queue
 Introduction to Queue
 Queue Applications
10 GBL(Class Application Area
 Enqueue and Dequeue
algorithms and its discussion)
implementation

Chapter 7: Linked List

 Introduction to linked list
 Types of linked list
11 GBL(Class Implementation
 Understanding one-way link list using CPP
 Operations on one-way link list discussion)
 Understanding two-way link list
 Two-way inked list
Representation
 Operations on two-way link list PBL(Problem Implementation
12 Solving) using CPP
 Advantage of Link List
 Implementation using C++
Chapter 8: Tree
 Introduction to Trees
 Binary tree and its types
13  Binary search tree 10 Questions and
CBL(Question&
 General tree Answers
Answer)
 Polish notation
 Notation conversion
Chapter 9: Graph
 Introduction to Graphs
14 PBL(Problem Assignment#5
 Graph terminologies
Solving)
 Graph types
Chapter 9:
15  Practical work GBL(Class Practical work
discussion)
 Book Reading Competition
Chapter 1 - 9: GBL(Class Review all
16  Review of the Key topics in discussion) Chapters
course

.‫) شورای دیپارتمنت مورد تایید قرار گرفت‬۱۴۰۴/ / ( ‫) مورخ‬ ( ‫قرار شرح فوق کورس پالیسی هذا در جلسه شماره‬
 ‫‪ )۱۴۰۴/‬کمیتهء فرعی نصاب مورد تایید قرار گرفت‪.‬‬ ‫‪/‬‬ ‫) مورخ (‬ ‫قرار شرح فوق کورس پالیسی هذا در جلسه شماره (‬

‫‪ )۱۴۰۴/‬شورای علمي پوهنځی مورد تایید قرار گرفت‪.‬‬ ‫‪/‬‬ ‫) مورخ (‬ ‫قرار شرح فوق کورس پالیسی هذا در جلسه شماره (‬