COURSE DESCRIPTION FORM: CS-2001: Data Structures

INSTITUTION FAST School of Computing, National University of Computer

and Emerging Sciences, Islamabad

PROGRAM TO BE EVALUATED

Course Description

NCEAC.FORM.001.D
Course Code CS-2001
Course Title Data Structures
Credit Hours 3+1
Course Instructor Ms. Kainat Iqbal, Ms. Mahnoor Tariq
Prerequisites by
Object Oriented Programming
Course(s) and Topics
Grading policy Absolute Grading
Retake of missed assessment items (other than sessional/ final exam) will not be held.
Student who misses an assessment item (other than sessional / final exam) is awarded zero
Policy about missed marks in that assessment item i.e. late submission will not be accepted.
assessment items in
the course For missed sessional/ final exam, exam retake/ pretake application along with necessary
evidence are required to be submitted to the department secretary. The examination
assessment and retake committee decides the exam retake/ pretake cases.
Course Plagiarism Plagiarism in project or sessional/ final exam will result in F grade in the course.
Policy Plagiarism in an assignment will result in zero marks in the whole assignments category.
Assessment with the weight.
Assessment Item Number Weight (%)
Assessment Assignments >3 12
Instruments with
Weights (homeworks, Quizzes >4 6
quizzes, sessional Sessionals (I + II) 2 30
exams, final exam,
assignments, etc.) Project 1 12
Final Exam 1 40

Course Coordinator Dr. Muhammad Ishtiaq

Google Classroom Link: https://classroom.google.com/c/NzA0NDMwMzc3ODEz
URL (if any)
Google Classroom Code: 6lqiaix
Introduction to data structures, Abstract data types, Complexity theory, Arrays, Address
translation, Sorting/ Searching algorithms, Lists, Linked list implementation using arrays and
Current Catalog pointers, Queue, Stacks & applications, Trees: Tree data structure definition and basic
Description terminologies, Tree Traversal, Expression trees. Binary Search Trees, AVL Trees, Binary
Heap, B-Trees/ B+Trees, Hashing Graphs: Definitions and Basic terminology, Traversal,
Minimum spanning trees, Shortest path trees
- D.S. Malik, Data Structures Using C++, 2nd Edition
Textbook
- Mark Allen Weiss, Data Structures and Algorithm Analysis in C++, 4th Edition
- Mark Allen Weiss, Data Structures and Problem Solving Using C++, 2nd Edition
Reference Material - Y. Langsam, M. J. Augenstein, A. M. Tenenbaum, Data Structures Using C and C++, 2nd
Edition

NCEAC.FORM.001.D
 - Clifford A. Shaffer, Data Structures and Algorithm Analysis, Edition 3.2
- Thomas H. Cormen et al. “Introduction to Algorithms” 3rd Edition.

A. Course Learning Outcomes (CLOs)

After course completion, the students shall be able to:

1. Describe basic static and dynamic data structures and relevant standard
algorithms for them: Stacks, Queues, Linked lists, Trees, Graphs, Heap, Priority
queue, and sorting/searching algorithms.
2. Demonstrate advantages and disadvantages of specific algorithms and data
structures.
3. Determine the right data structure for a given problem.
4. Determine and demonstrate bugs in program and recognize required basic
operations with data structures.
5. Formulate new solutions for programing problems or improve existing code
using learned algorithms and data structures.
6. Evaluate algorithms and data structures in terms of time and memory
complexity of basic operations.
B. Program Learning Outcomes (PLOs)

Course Goals PLO 1 Computing and Apply knowledge of mathematics, statistics, natural
Data Science sciences, computing fundamentals, and a data specialization
Knowledge to the solution of complex data science problems.

PLO 2 Problem Identify, formulate, research literature, and analyze complex

Analysis data problems, reaching substantiated conclusions using
first principles of mathematics, statistics, natural sciences,
computing and data sciences.
PLO 3 Design/ Design solutions for complex data science problems and
Develop design systems, components, and processes that meet
Solutions specified needs with appropriate consideration for public
health and safety, cultural, societal, and environmental
considerations.
PLO 4 Investigation & Conduct investigation of complex data science problems
Experimentation using research based knowledge and research based
methods.
PLO 5 Modern Tool Create, select, and apply appropriate techniques, resources
Usage and modern data science tools, including prediction and
modelling for complex data science problems.
PLO 6 Society Apply reasoning informed by contextual knowledge to
Responsibility assess societal, health, safety, legal, and cultural issues
relevant to context of complex data science problems.

PLO 7 Environment Understand and evaluate sustainability and impact of data

and professional work in the solution of complex data science
Sustainability problems.

NCEAC.FORM.001.D
 PLO 8 Ethics Apply ethical principles and commit to professional ethics
and responsibilities and norms of computing practice.
PLO 9 Individual and Function effectively as an individual, and as a member or
Team Work leader in diverse teams and in multi-disciplinary settings.
PLO 10 Communication Communicate effectively on complex data science activities
with the data professionals’ community and with society at
large.
PLO 11 Project Demonstrate knowledge and understanding of management
Management principles and economic decision making and apply these to
and Finance one's own work as a member or a team.
PLO 12 Life Long Recognize the need for, and have the preparation and ability
Learning to engage in independent and life-long learning in the
broadest context of technological changes.

C. Mapping of CLOs to PLOs

(CLO: Course Learning Outcome, PLOs: Program Learning
Outcomes)
PLOs

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

1 √ √ √
2 √ √ √
3 √ √ √
CLOs
4 √ √ √
5 √ √ √
6 √ √ √ √

Topics to be covered:
Topics Covered in
the Course, with No. of Contact
Number of Lectures List of Topics
Weeks Hours CLO(s)
on Each Topic
(assume 15-week Introduction to data structures 0.5 1.5 1, 2, 3
instruction and one-hour
lectures) Abstract data types 0.5 1.5 1, 2, 3

Complexity theory 0.5 1.5 1, 2, 3, 5

NCEAC.FORM.001.D
 Arrays, Address translation 0.5 1.5 1, 3

Sorting/Searching algorithms 0.5 1.5 1, 2, 3

Lists, Linked list implementation using
1.5 4.5 1, 2, 3
arrays and pointers
Stacks & applications 1.5 4.5 1, 2, 3, 5

Queue 0.5 1.5 1, 2, 3

Trees: Tree data structure definition
0.5 1.5 1, 2, 3, 5
and basic terminologies
Trees: Tree Traversal, Expression
0.5 1.5 1, 2, 3
trees
Trees: Binary Search Trees 1 3 1, 2, 3

Trees: AVL Trees 1.5 4.5 1, 2, 3

Trees: Binary Heap 0.5 1.5 1, 2, 3

Hashing 1 3 1, 2, 3
Graphs: Definitions and Basic
0.5 1.5 1, 2, 3
terminology
Graphs: Traversal 0.5 1.5 1, 2, 3

Graphs: Minimum spanning trees 1 3 1, 2, 3, 5

Graphs: Shortest path trees 0.5 1.5 1, 2, 3

Trees: B-Trees/ B+Trees 1.5 4.5 1, 2, 3

Total 15 45

Programming
Language for C++
Assignments
Social and Ethical
Class Time Spent (in Theory Problem Analysis Solution Design
Issues
percentage)
55 20 20 5
Oral and Written Every student is required to submit at least __5___ written reports of typically ___5____
Communications pages each and to make __1___ oral presentation of typically ____10___ minutes’ duration.

NCEAC.FORM.001.D
NCEAC.FORM.001.D