National Computing Education Accreditation

Council
NCEAC

NCEAC.FORM.
COURSE OUTLINE
INSTITUTION University of Management & Technology, Lahore
PROGRAM (S) TO BE BS Computer Science
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 Class Participation 5%
Instruments with Quizzes 10%
Weights Assignments 10%
(homework,
Project 10%
quizzes, midterms,
final, programming Mid Term 25%
assignments, lab Final Term 40%
work, etc.)
Course Moderator Mr. Imran Shafi, CS, SST
1. Book Name: Data Structures Using C++, 2nd Edition By Author :D.S.Malik,
2010.
Textbook (or 2. Book Name: Data Structures and Algorithms in C++, 2nd Edition By
Laboratory Manual Author: Micheal T. Goodrich, Roberto Tamassia and David MountJohn
for Laboratory Wiley and Sons, Inc, 2011.
Courses) 3. Book Name: Algorithms, 4th Edition by Author: Robert Sedgewick, Kevin
Wayne, 2011

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,
Reference Material
Available in Library, 2016.
3. Data Structures and Algorithms Analysis in C++, 2nd Edition By Clifford A
Sheffard, 2003

1
 National Computing Education Accreditation
Council
NCEAC

NCEAC.FORM.
Upon successful completion of the course, a student should be able to:
● Understand the design of fundamental data structures as well as algorithms that
operate on
● them.
Course ● Analysis of Wide Range of Data Structures Available
Goals/Objectives ● Comparison of Data Structures Based on their Analysis.
● Implementing new Data Structures for 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 C3
simple applications.
Analyze simple algorithms and determine their
CLO 2
complexities.
C5
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

Mapping of CLOs to Program Learning Outcomes (PLOs):

CLOs/PLOs CLO 1 CLO 2 CLO 3 CLO 4

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

2
 National Computing Education Accreditation
Council
NCEAC

NCEAC.FORM.
PLO 6: Individual and Teamwork

PLO 7: Communication

PLO 8: Computing Professionalism and Society

PLO 9: Ethics

PLO 10: Life Long Learning

Evaluation
Week# Duration Lab Topics Covered CLOs
Instruments
Introduction of Data Structures
and Algorithm, Course
1 hour & 15
minutes
Evaluation Scheme, Evaluation 1
OOP Concepts Review Instruments for DSA (with
[ Member Initializer List, justification), OOP Concepts,
Composition, Memory Organization, Pointers,
1
Aggregation, Operator Pointer Arithmetic, Void
Overloading] Pointer, Pointer to a pointer,
1 hour & 15
minutes
Dangling Pointers, Dynamic 1
Memory Allocation, Memory
Allocation/De-allocation,
Memory Leakage
1 hour & 15 Introduction of Data Structures
1
minutes Pointers vs Arrays and its and Algorithm
2
1 hour & 15 applications in the Class
minutes
Abstract Data Types 1
1 hour & 15 Program Efficiency &
2
minutes Discussion on OOP Complexity Analysis
3
1 hour & 15 Concepts Arrays ADT and C++
minutes
Quiz 1 2
Implementation
1 hour & 15
minutes
List ADT & Linked Lists 1
Static Arrays, Dynamic
4
1 hour & 15 Arrays, 1D, 2D, Pointers
minutes
Linked Lists 1
1 hour & 15
minutes
Stack Quiz 2 2
5 Lists, Linked List Application of Stack
1 hour & 15
minutes
Infix to Postfix, Prefix Assignment 1 2
Conversion
6 1 hour & 15 Doubly Linked List, Queues 1
minutes Circular Linked List

3
 National Computing Education Accreditation
Council
NCEAC

NCEAC.FORM.
1 hour & 15 Quiz 3
minutes
Queue Implementation 2
1 hour & 15
minutes
Trees Assignment 2 2
Stack & Queue using
7
1 hour & 15 Arrays & Linked List BST 1
minutes
1 hour & 15
minutes
BST Deletion Quiz 4 2
8 Lab Mid Exam
1 hour & 15
minutes
Mid Term 2
1 hour & 15
minutes
AVL Trees 2
9 Recursion
1 hour & 15
minutes
AVL Trees Implementation 2
1 hour & 15
minutes
Heap Quiz 5 2
10 Binary Search Tree
1 hour & 15
minutes
Priority Queue 3

1 hour & 15 Quiz 6

minutes
Hashing I 3
11 AVL Tree
1 hour & 15
minutes
Hashing II Project 2
1 hour & 15
minutes
Graphs 3
12 Heap
1 hour & 15
minutes
Graph Search 3
1 hour & 15
minutes
BFS & DFS Quiz 7 3
13 Hashing
1 hour & 15
minutes
Minimum Spanning Tree 2

1 hour & 15
minutes
Merge Sort, Quick sort 2
14 BFS, DFS
1 hour & 15
minutes
Single Source Shortest Path 2
1 hour & 15
3
minutes
15 Merge Sort & Quick Sort
1 hour & 15
3
minutes
1 hour & 15
3
minutes
16 Lab Final Exam
1 hour & 15
3
minutes

Laboratory
Projects/Experiments Done in Assignments
the Course
Programming Assignments
2-4 programming assignment
Done in the Course
Class Time Spent on (in 3 hours per week

4
 National Computing Education Accreditation
Council
NCEAC

NCEAC.FORM.
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

Instructor Name: Shoaib Khan

Instructor Signature ____________________________