National Computing Education Accreditation Council

NCEAC

NCEAC.FORM.0

COURSE OUTLINE

INSTITUTION University of Management & Technology,

Lahore
PROGRAM (S) TO BE BS AI
EVALUATED
Course Description:
Course Code CC2042

Course Title Data Structures and Algorithms

Credit Hours 3+1

Prerequisites by Data Structures & Algorithms

Course(s) and Topics
Assessment
Instruments with Quizzes 10%
Weights (homework,
Assignments 10%
quizzes, midterms,
final, programming Project 20%
assignments, lab Mid Term 20%
work, etc.) Final Term 40%

Course Moderator

Instructor Mr. Muhammad Rizwan

URL (if any)

Textbook (or
Laboratory Manual
for Laboratory BookName: Data Structures Using C++, 2nd Edition By Author :D.S.Malik, 2010.
Courses) BookName : Data Structures and Algorithms in C++, 2nd Edition By Author:
Micheal T. Goodrich, Roberto Tamassia and David MountJohn Wiley and Sons,
Inc, 2011.
BookName : Algorithms, 4th Edition By Author: Robert
Sedgewick , Kevin Wayne, 2011

1
 National Computing Education Accreditation Council
NCEAC

NCEAC.FORM.0
Reference Material BookName : Introduction to Algorithms, 3rd Edition, By Thomas H Cormen,
Charles E Leiserson, Ronald L Rivest, Clifford Stein MIT Press Available in Library,
2009.
2. BookName : Classic Data Structures, 2nd Edition By Samanta Debasis, Available
in Library, 2016.
3. Data Structures and Algorithms Analysis in C++, 2nd Edition By Clifford A
Sheffard, 2003

Course Upon successful completion of the course, a student should be able to:
Goals/Objectives ● Understand the design of fundamental data structures as well as algorithms that
operate on them.
● Analysis of Wide Range of Data Structures Available
● Comparison of Data Structures Based on their Analysis
● Implementing new Data Structures for the real time & industrial needs.
● Provide rigorous ‘hands-on’ experience with implementing different data
structures in a programming language

Course Learning Outcomes (CLOs):

Domain & BT
CLOs Description
Level *
Implement various data structures and their
CLO 1 algorithms and Apply them in implementing
simple applications. C 2, 3
Analyze simple algorithms and determine
CLO 2 their complexities.
C 4, 5
Apply the knowledge of data structures to
CLO 3 other application domains. C3
Design new data structures and algorithms to
CLO 4 solve problems. C6

* BT= Bloom’s Taxonomy, C=Cognitive domain, P=Psychomotor domain, A= Affective domain

2
 National Computing Education Accreditation Council
NCEAC

NCEAC.FORM.0

Mapping of CLOs to Program Learning Outcomes (PLOs):

CLOs/PLOs CLO 1 CLO 2 CLO 3

PLO 1: Academic Education

PLO 2: Knowledge for Solving Computing Problems

✓
PLO 3: Problem Analysis ✓ ✓ ✓

PLO 4: Design and Development of Solutions

✓
PLO 5: Modern Tool Usage

PLO 6: Individual and Teamwork

PLO 7: Communication

PLO 8: Computing Professionalism and Society

PLO 9: Ethics
PLO 10: Life Long Learning

Evaluation CLOs
Date Duration Topics Covered Instruments
used
Introduction to Data Structures and Algorithm
1 1, 3
Abstract Data Types (ADTs)
2 Complexity Analysis and Big-O Notation 1, 2

3
 National Computing Education Accreditation Council
NCEAC

NCEAC.FORM.0

Static Arrays: Basic Operations (Searching,

3
Insertion, Deletion)
4 Dynamic Arrays: Memory Allocation and 1, 2
Resizing
Mapping Functions of Arrays
Array ADT in C++
Introduction to Linked Lists: Structure and
5 1, 3
Properties.
Singly Linked List: Insertion and Deletion
6 1, 3
(Head, Tail, Middle)
Singly Linked List: Implementation and Traversal
7 1
Quiz 1
Review + Quiz 1
8 Assignment 1 1,2, 3
(Covers Arrays, ADTs, and Linked Lists)

9 Recursion: Introduction, Recursive Definitions 1, 3

Problem Solving with Recursion (Factorial,
10 1, 4
Fibonacci, Linked List in Reverse)
Stack: Introduction and Applications
11 1, 3
Array-Based Stack Implementation
12 Review + Quiz 2 Quiz 2 1, 2, 3
(Covers Recursion and Stacks)
13 Stack Operations: Push, Pop, Top, isEmpty, isFull 1
Linked Stack Implementation
Stack Applications (Postfix Expressions,
14 4
Matching Parentheses) Assignment 2
More Recursion Examples (Tower of Hanoi,
15 1, 3
Binary Search via Recursion)

16 Midterm Exam Preparation and Review 1, 2, 3

17 Mid - Term 1,2,3

18 Queues: Introduction and Applications 1, 3
Array-Based Queue Implementation
Queue Operations: Enqueue, Dequeue, Front,
19 Rear, isEmpty, isFull 1
Linked Queue Implementation

4
 National Computing Education Accreditation Council
NCEAC

NCEAC.FORM.0

Priority Queues and Queue Applications

20 4
(Simulation)
Review + Quiz 3
21 1, 2, 3
(Covers Queues) Quiz 3
22 Introduction to Binary Trees: Properties and 1,3
Terminologies
Binary Tree Traversals (Inorder, Preorder,
23 1, 4
Postorder)
Binary Search Trees (BST): Insertion, Search,
24 1, 3
Deletion Assignment 3
25 AVL Trees: Height-Balanced Trees, Rotations 1, 4
Searching Algorithms: Linear Search, Binary
26 1, 2
Search
27 Sorting Algorithms: Selection Sort, Insertion Sort 2,3
Merge Sort: Divide and Conquer
28 1, 3
29 Graphs: Introduction, Definitions, Representation 1, 3
(Adjacency Matrix, Adjacency List)
Graph Traversals: Depth-First Search (DFS),
30 1, 4
Breadth-First Search (BFS) Assignment 4
Graph Algorithms: Shortest Path Algorithm
31 1, 4
(Dijkstra’s Algorithm)
Review + Quiz 4 + Project Evaluation Quiz 4
32 1,2,3,4
(Covers Trees and Searching)

Laboratory Assignments
Projects/Experiments Done in
the Course

5
 National Computing Education Accreditation Council
NCEAC

NCEAC.FORM.0

Programming Assignments 4 programming assignment

Done in the Course

3 hours per week

Class Time Spent on (in credit

hours)
Oral and Written
Communications

*-Tentative Mapping of CLOs to Direct Assessments

CLO Quiz-1 Quiz-2 Quiz-3 Quiz-4 Assign1 Assign2 Assign3 Assign4 Mid Final

1 ✓ ✓ ✓ ✓ ✓ ✓ ✓ ✓ ✓
2 ✓ ✓ ✓ ✓ ✓ ✓ ✓ ✓
3 ✓ ✓ ✓ ✓ ✓ ✓ ✓
4 ✓ ✓ ✓ ✓

Instructor Name: Muhammad Rizwan

Instructor Signature ____________________________