The Islamia University of Bahawalpur

Faculty of Engineering & Technology

Department of Computer Systems Engineering

Course Outline: Data Structure & Algorithms

Session (2022-2026)

4th Semester

General Information:

Course: Data Structures & Algorithms Instructor Engr. Bushra Samreen

Course Code COMP-01420 Office Room No. 12
Credit Hours 3+1 Email bushra.samreen@iub.edu.pk
3 lectures of one hour each per
Contact Hours Contact No. +923347095788
week
Monday to Friday: 8am-4pm except
Pre-Requisite(s) Computer Programming Office Hours
class timings

Course Description:

Introduction to data structures; Basic algorithms analysis; Big O, little o, omega and theta notation,
Representation of numeric data, Pointers and references, Data structure operations, Searching and sorting
techniques, Recursion, Fundamental data structures - implementation strategies for stacks, queues and linked
lists; Implementation strategies for tree and graph algorithms; Traversal techniques Hash tables, files,
Applications of data structures (e.g. data compression and memory management).

Course Learning Outcomes (CLOs):

At the end of the course, students should be able to:

CLOs Description Domain PLOs
Theory CLOs

CLO1 To understand concepts related to data, data structures and algorithms C-2 1

To implement programs to demonstrate working of linear ADTs and

CLO2 C-3 1
non-linear ADTs
To analyze C++ code related to various data structures and to measure
CLO3 C-3 2
time complexity of algorithms and possible errors.
Lab Work CLOs
To perform programs that demonstrate various data structures and
CLO1 P-4 3
their operations

Textbook(s)/Reference Books:

1. Data Structures Seymour Lipschutz.

2. Goodrich, Tamassia and Mount, "Data Structures & Algorithms in C++". (Second Edition)

3. Weiss, "Data Structures & Algorithm Analysis in C++". (Fourth Edition)

1
Relation of CLOs to the Program Learning Outcomes (PLOs):

1 2 3 4 5 6 7 8 9 10 11 12

Individual and Team Work

The Engineer and Society
Design & Development of
Engineering Knowledge

Project Management
Modern Tool Usage

Life Long Learning

Problem Analysis

Environment and

Communication
Sustainability
Investigation
Solutions

Ethics
CLO1 √
CLO2 √
CLO3 √
CLO4 √

CLOs – Lab work

CLO1 √
Total 2 2 1
Mediu Medium Medium
Impact
m to High to High

Justification of Program Learning Outcomes (PLO’s) Coverage:

PLO1 - Engineering Knowledge:

The assignments, exams, and laboratory experiments require engineering knowledge to successfully
complete the course. Students learn how to analyze and implement basic algorithms (High relevance to
course).
PLO2 - Problem Analysis
The course shows the value of theory, by making it possible for the students to associate and implement
different data structure algorithms in the given problem (High relevance to course).
PLO3 - Design & Development of Solutions
Laboratory exercises will help students in analyzing the design and implementation of various commonly
used algorithms (High relevance to course).

Assessment of CLOs:
CLO1 CLO2 CLO3 CLO4 CLO5 CLO6
Assignments √ √ √
Quizzes √ √ √
Mid Term Exam √ √ √
Final Term Exam √ √ √
Others
(Projects/presentations)

2
Lecture Plan:

Topics Hours
Overview
 Data Structures
 Abstract Data Types
Week 1
 Applications
 Analysis Tools
 Asymptotic Notation
Arrays, Linked Lists and Recursion
 Singly Linked Lists
 Doubly Linked Lists Week 2-3
 Circularly Linked Lists
 List Reversal
Stacks
 Array Based Stack Implementation
Week 4
 Implementing a Stack with a Generic Linked List

Queues and Deques
 Array Based Queue Implementation
Week 5-6
 Implementing a queue with generic Linked List
 Double-Ended Queues Implementation
Trees
 Introduction
Week 7-8
 Tree Traversal Algorithms (Depth &Height, Preorder, Postorder)
 Binary Trees
Search Trees
 Binary Search Trees
 Binary Search Trees Analysis
Introduction to:
Week 9-10
 AVL Trees
 Splay Trees
 Multi-way Search Trees
 Red Black Trees
Hashing
 Introduction Week 11
 Hash Tables
Heaps and Priority Queues
 Keys, Priority Queues
Week 12
 Heap Data Structure, Binary Heaps
 Heap-Sort
Sorting
 Insertion-Sort
Week 13
 Merge-S ort
 Quick-Sort
Data Compression
 The Huffman Coding Algorithm Week 14
 The Greedy Method
Graph Algorithms
 Graphs
 Data structures for Graphs
 Graph Traversals Week 15-16
 Depth-First Search
 Directed Graphs
 Breadth-First Search Graphs

3
Grading Policy (Theory):

Assignments/Quizzes /Projects/presentations. 20%

Midterm Exam 30%

Final Exam 50%

Grading Policy (Lab Work):

Lab Work 60%

Open Ended Lab (OEL) 20%

Final Exam 20%

---------------END--------------------