National University

of Computer & Emerging Sciences

Department Department of Electrical Engineering Dept. Code EE

Course Title Data Structures and Algorithms Course Code CS210
Pre-requisite(s) CS214 Programming Fundamentals Credit Hrs. 3+1

Course Objective To understand the fundamental data structures and the various sorting and
searching algorithms available in computer science and their application to
different problems. The course also introduces the theory of complexity and
develops the skills needed to analyze time (and space) requirements for a data
structure and associated algorithms.

No. Assigned Program Learning Outcome (PLO) Level Tool

An ability to create, select and apply appropriate techniques, resources,
and modern engineering and IT tools, including prediction and modeling,
05 R F
to complex engineering activities, with an understanding of the
limitations.
I = Introduction, R = Reinforcement, E = Evaluation.
A = Assignment, Q = Quiz, M = Midterm, F=Final, L=Lab, P=Project, W=Written Report.

No. Course Learning Outcome (CLO) Statements Tool

 Analyze the efficiency of algorithms and data structures in terms of time and Q1, M1
01
space complexity.
 Design, implement, and analyze linked list data structures and their M1, F
02
associated algorithms.
 Design, implement, and analyze FIFO and LIFO based data structures and A1, F
03
their associated algorithms.
 Design, implement, and analyze tree and graph data structures and their Q2, M2, A2
04
associated algorithms.
 Identify and appropriately implement/apply the best searching/sorting Q3, F
05
algorithm to solve a problem
 The student can design and implement solutions to complex problems using A3, F
06
appropriate and/or specified data structures and/or algorithms.
 National University
of Computer & Emerging Sciences

Text Book(s) Title Data Structures, Algorithms and Applications in C++, 2nd Edition
Author Sartaj Sahni
Publisher Universities Press
Ref. Book(s) Title Data Structures and Algorithm Analysis in C++, 4th Edition
Author Mark Allen Weiss
Title C++ Plus Data Structures, 3rd Edition, Jones and Bartlett, 2003
Author Nell Dale

Week Course Contents/Topics Chapter CLO

01  Fundamentals of Performance Analysis 2-4 1
02  Introduction to Abstract Data Types 7.1 2
02  Arrays as ADTs, Multidimensional arrays and mapping functions 7.2-7.3 2
03  Singly Linked List, Singly Circular linked list 5-6 2
04  Doubly Linked List, Doubly Circular linked list 5-6 2
05  Stack ADT 8 3
06  Queue ADT 9 3
07  Trees, Binary Trees, Binary Tree Traversals 11 4
08  Binary Tree Traversals Programming and related programming problems 11 4
09  Binary Search Trees. Insertion and Deletion 14 4
10  Priority Queues, Heaps 12 4
11  Graphs (Introduction) / Graph traversal / MST / Greedy and Exhaustive 16 4
Algorithms
12  Graphs (Shortest Path Algorithm) and Dynamic Programming 16,19 6
13  Hash Tables / Algorithm Design Techniques (Greedy Methods) 10, 17 5
14  Divide and Conquer Methods - Sorting Algorithms (Mergesort, Quicksort, 18 5
Heapsort)
15  Height Balanced Trees: AVL-trees - Insertion 15 4
16  AVL-trees Deletion 15 4
Evaluation Criteria:
Assessment Tools Weightage
Quizzes (3), Assignments (3) 20%
Midterm (I+II) 30%
Final Exam 50%