COMSATS University Islamabad

Department of Computer Science

Course Syllabus
Course Information
Course Code: CSC211 Course Title: Data Structures
Credit Hours: 4(3,1) Lecture Hours/Week: 3
Lab Hours/Week: 3 Pre-Requisites: CSC103-Programming Fundamentals
Catalogue Description:
This course provides fundamental knowledge of data organization. The topics include Overview of Data Structures;
Static & Dynamic List; Stack; Queue; Tree & its Algorithms; Graph & its Algorithms; Sorting; Searching; Hashing.
Text and Reference Books
Textbook:
1. A Common-Sense Guide to Data Structures and Algorithms, Jay Wengrow, Pragmatic Bookshelf,
2020.
Reference Book:
1. Data Structures and Algorithm Analysis in C++, Mark Allen Weiss, Addison-Wesley, 2014.
Week wise Plan:
CDF Reference
Lecture # Topics Covered
Unit # Material
Data Structure: Overview, Importance, Classification, Wengrow: Ch1
1. 1
Operations, and Abstract Data Types. Weiss: Ch3
2. 2 Array List & its Operations. Weiss: Ch3
3. 2 Dynamic VS. Static Data Structures, Pointers, and Structures. Wengrow: Ch14
Introduction to Linked List & its operations: Insert at Start, Wengrow: Ch14
4. 2 Insert after a Specific location(node), Insert at End of
Linked List, Display of Linked List.
More Operations of Singly Linked List: Insert Before Specific Wengrow: Ch14
5. 2 Value, Delete from Start, Delete from End, Delete After a
Specific Value, and Delete Before a Specific Value.
6. 2 Doubly Linked List Operations. Wengrow: Ch14
7. 2 Circular Linked List. Wengrow: Ch14
Introduction to Stack, Static and Dynamic Implementation Wengrow: Ch9
8. 3
of Stack, Its Operations and Usage with Examples.
9. 3 Infix to Postfix Conversion using Stack. Weiss: Ch3
Introduction to Queue, Static and Dynamic Implementation, Wengrow: Ch9
10. 4
Its Operations and Example of Different Applications. Weiss: Ch3
Circular Queue: Insertion & Deletion (Static and Dynamic Wengrow: Ch9
11. 4 Implementation); Priority Queue: Insertion & Deletion Weiss: Ch3
(Static & Dynamic Implementation); Applications.
Double Ended Queue: Input restricted Queue, Output Wengrow: Ch9
12. 4
restricted Queue; Applications Weiss: Ch3
Non-Linear Data Structures (Trees), Concept & Wengrow: Ch15
13. 5
Terminology, and Traversal Algorithms.
14. 5 Binary Search Tree (BST), Insertion, Traversal and Search Wengrow: Ch15

1
 in BST.
15. 5 Deletion from BST. Wengrow: Ch15
16. 5 Tree Balancing Technique (AVL). Weiss: Ch4
17.
Mid Term Exam
18.
Left to Left and Right to Right Rotation in AVL to Balance
19. 5 Weiss: Ch4
the Tree.
20.
Heap: Max Heap, Min Heap, Insertion and Deletion in Wengrow: Ch16
21. 5
Heap, Heap Tree as Priority Queue.
22. 6 Introduction to Graph, Terminology and Representation. Wengrow: Ch18
Graph Traversal Techniques: Breadth First Search, and Wengrow: Ch18
23. 6
Depth First Search.
24. 6 Shortest Path Problem: Dijkstra’s Algorithm. Wengrow: Ch18
25. 6 Minimum Spanning Trees (MST): Kruskal Algorithm. Weiss: Ch9
26. 6 Prims Algorithm. Weiss: Ch9
Sorting Algorithms: Bubble Sort, Insertion Sort, and Wengrow: Ch4-6
27. 7
Selection Sort.
28. 7 Merge Sort Weiss: Ch7
29. 7 Searching Algorithms: Linear Search and Binary Search. Wengrow: Ch2
30. 8 Time Complexity of Searching and Sorting Algorithms Wengrow: Ch 4-6
Hashing: Hash Functions, choosing a Hash function, Types of
Wengrow: Ch8
31. 8 Hash function: Division method, Mid square method, Digit
Weiss: Ch5
folding method, and Collision
Strategies for Avoiding & Resolving Collisions: Closed Wengrow: Ch8
32. 8 Hashing: Linear Probing, Quadratic Probing, Double Hashing; Weiss: Ch5
Open Hashing: Separate chaining
33. Revision

Final Term Exam

Graduate Attributes (GAs)

S.# Description
Apply knowledge of computing fundamentals, knowledge of a computing specialization, and
2 mathematics, science, and domain knowledge appropriate for the computing specialization to the
abstraction and conceptualization of computing models from defined problems and requirements.
Identify, formulate, research literature, and solve complex computing problems reaching
3 substantiated conclusions using fundamental principles of mathematics, computing sciences, and
relevant domain disciplines.
Design and evaluate solutions for complex computing problems, and design and evaluate systems,
4 components, or processes that meet specified needs with appropriate consideration for public
health and safety, cultural, societal, and environmental considerations.
Create, select, adapt and apply appropriate techniques, resources, and modern computing tools
5
to complex computing activities, with an understanding of the limitations.

2
 Function effectively as an individual and as a member or leader in diverse teams and in multi-
6
disciplinary settings.

Course Learning Outcomes (CLO)

Blooms
Sr.# Unit # Course Learning Outcomes Taxonomy GA
Learning Level
CLO’s for Theory
Employ linear data structures to solve computing 2-4
CLO-1 1-4 Applying
problems.
Use non-linear data structures to solve computing 2-4
CLO-2 5-6 Applying
problems.
Apply fundamental sorting, searching, and hashing 2-4
CLO-3 7,8 Applying
techniques on different data structures.
CLO’s for Lab
Implement various data structures, searching, sorting, and
CLO-4 2-7 Applying 2-4
hashing in a programming language.
Develop a project using appropriate data structures in a team
CLO-5 1-8 Creating 2-6
environment.
CLO Assessment Mechanism
Assessment
CLO-1 CLO-1 CLO-2 CLO-3 CLO-4 CLO-5
Tools
-
Quizzes Quiz 1 Quiz 2 Quiz 3 Quiz 4 -

Assignment Lab -
Assignments Assignment 2 Assignment 3 Assignment 4
1 Assignments
Lab Mid -
Mid Term Mid Term Mid Term
- - Term
Exam Exam Exam
Exam
Lab Project/
Final Term
Final Term Exam - Final Term
Exam
Lab Exam
Policy & Procedures
• Attendance Policy: Every student must attend 80% of the lectures delivered in this course and 80%
of the practical/laboratory work prescribed for the respective courses. The students falling short of
required percentage of attendance of lectures/seminars/practical/laboratory work, etc., shall not be
allowed to appear in the terminal examination of this course and shall be treated as having failed this
course.
• Course Assessment:
Mid Term Terminal
Quizzes Assignments Total
Exam Exam
Theory(T) 15 10 25 50 100
Lab(L) - 25 25 50 100
Final Marks
(T/100)*75 + (L/100)*25
(T+L)

3
• Grading Policy: The minimum pass marks for each course shall be 50%. Students obtaining less than
50% marks in any course shall be deemed to have failed in that course. The correspondence between
letter grades, credit points, and percentage marks at CUI shall be as follows:
Grade A A- B+ B B- C+ C C- D F
Marks 90 - 100 85 - 89 80 - 84 75 - 79 70 - 74 65 - 69 60 - 64 55 - 59 50 - 54 <50
Cr. Point 4.0 3.7 3.3 3.0 2.7 2.3 2.0 1.7 1.3 0.0

• Missing Exam: No makeup exam will be given for final exam under any circumstance. When a
student misses the mid-term exam for a legitimate reason (such as medical emergencies), his grade for
this exam will be determined based on the Department policy. Further, the student must provide an
official excuse within one week of the missed exam.

• Academic Integrity: All CUI policies regarding ethics apply to this course. The students are advised
to discuss their grievances/problems with their counsellors or course instructor in a respectful manner.

• Plagiarism Policy: Plagiarism, copying and other anti-intellectual behaviour are prohibited by the
university regulations. Violators must face serious consequences.