Mukabbir - Gujrat

Course Outline Spring 2024

Course Information
Department Computer Science Campus Gujrat
Course Title Data Structures and Course Code CC-213L
Algorithms Lab
Credit Hours 1 Course Level Computing Core
Instructor Information
Name ZULFIQAR ALI Office
Email alizulfiqar061@gmail.com Contact No. 03109212226

Course Details
1: Course Description
This course introduces students to new types of data structures such as trees (including binary
and multiway trees), heaps, stacks and queues. Students will also learn how to design new
algorithms for each new data structure studied, create and perform simple operations on graph
data structures, describe and implement common algorithms for working with advanced data
structures and recognize which data structure is the best to use to solve a particular problem.
2: Course Objectives
After you have completed the work in this course, you will be able to:
 Develop sound techniques on designing, developing, and documenting well-structured
programs using proper software engineering principles.
 Continue to apply problem solving skills and provide a foundation for advanced
programming courses using an OOP (object-oriented programming) methodology.
 Describe and implement common data structures--lists, stacks, queues, graphs, and trees--
for solving complex programming problems.
 Use mathematical techniques to analyse the efficiency of the various algorithms presented,
as well as the common operations on the data structures discussed
3: Course Learning Outcomes
At the end of the course the students will be able to:
1. Develop sound techniques on designing, developing, and documenting well-structured
programs using proper software engineering principles.
2. Continue to apply problem solving skills and provide a foundation for advanced
programming courses using an OOP (object-oriented programming) methodology.
3. Describe and implement common data structures--lists, stacks, queues, graphs, and trees--
for solving complex programming problems.
4. Use mathematical techniques to analyse the efficiency of the various algorithms
presented, as well as the common operations on the data structures discussed

4: Course Pre-requisite/s
Object Oriented Programming
5: Recommended Textbooks and Journals
 Ellis Horowitz, Sartaj Sahni, D. Mehta, Fundamentals of Data Structures in C++, 2 nd Ed.,
Computer Science Press, 1995. ISBN 81-7808-792-8.
 Adam B. Drozdek, Data Structure and Algorithm in C++, 4th Ed., Cengage Learning, ISBN 978-
1133608424.
6: Course Readings
Page 1 of 4
 Mukabbir - Gujrat
Course Outline Spring 2024
 Data Structures and Algorithms in C++ by Adam Drozdek
 Data Structures and Algorithm Analysis in C++ by Mark Allen
Weiss
7: Course Evaluation
Sr. # Criteria Before Mid After Mid

1. Assignments 2 2
2. Quizzes 2 2
3. Presentation/Project - 1
4. Mid-term Exam As per University schedule
5. Pre-university Exam As per University schedule
6. Final Exam As per University schedule
8: Plagiarism Policy
Be very careful to avoid plagiarism
Material submitted for assessment in connection with coursework assignment must represent the
student's own efforts, and be his / her work (except group work). Brief quotations from the
published or unpublished work of another person may be used, but must always be attributed.
quotations, or close paraphrasing or copying from the work of another person (including another
student) without acknowledgement both at the relevant point in the text, and in any bibliography,
constitutes plagiarism, which is an assessment offence.

9: Assignment/Presentation/Case Study Briefings

The assessment approach is based on a concern for assessing the quality of the learning outcomes
achieved by the student. The assignments are structured to assess group as well as individual
performance and will involve the evaluation and application of both marketing principles to a
given business situation.

Research The report should present evidence beyond the standard textbook
material and company provided information. There should be
evidence of information and data from various sources, including
the use of literature to support argument.
Analysis The quality and quantity of the analytical input, including
application of theoretical models, frameworks and concepts,
together with logical reasoning and arguments.
Understanding Demonstration of knowledge and understanding of the subject
materials and chosen organisation in the context of their marketing
Evidence Use of evidence from literature, internet sites financial and regular
press and professional journals and similar sources to support
assertions and conclusions
Presentation Quality of standard of presentation, including the use of logical
structure, use of headings and subheadings, use of diagrams,
appropriate references, citation of published sources and
appendices. (Harvard System Preferred)
Writing Skills and Quality of the written work in terms of grammar, syntax and
Techniques spelling, and also clarity, cogency and economy for writing style
10: Class Attendance and Missed Exam Policy
Students are required to attend all classes in the course. Students who miss classes are far likely to
Page 2 of 4
 Mukabbir - Gujrat
Course Outline Spring 2024
meet the requirements of the course. A student who misses more than 5 classes will get zero in
class participation. If a student does not attend minimum of 70% of total classes he/she will not
be permitted to take final examination in the course.

Students are advised not to miss any exam under any circumstances. A makeup exam will be
allowed only under very special circumstances and that too only after the approval of the
Chairperson/ HOD of the department.

Semester study plan

Week Clas Course Contents/Activities *Teaching Deadlines
s Method
Writing Algorithms Practical /
1 1
Demonstration
Array and its operations Practical /
2 2
Demonstration
Singly Linked List Implementation Practical /
3 3
Demonstration
Doubly Linked List Implementation Practical /
4 4
Demonstration
Static and Dynamic Stack Practical /
5 5
Demonstration
Static and Dynamic Queue Practical /
6 6
Demonstration
Recursion Examples Practical /
7 7
Demonstration
8 8 Revision

9 Mid-Term Exams

Binary Search Tree Logical Representation and Practical /

10 9
Tree Traversals Demonstration
AVL Tree Construction Practical /
11 10
Demonstration
Spanning and Minimum Spanning Tree logical Practical /
12 11
representation Demonstration
Creating Max and Min heap Practical /
13 12
Demonstration
Radix Searching Practical /
14 13
Demonstration
Selection, Bubble and Insertion Sort Practical /
15 14
Demonstration
Page 3 of 4
 Mukabbir - Gujrat
Course Outline Spring 2024
Merge and Quick Sort Practical /
16 15
Demonstration
17 16 Revision

*Lecture, Discussion, Class Seminar, Case Study, Presentation etc

Signature Signature
Course Instructor Coordinator Specialization

Signature
Head of Department

Page 4 of 4