Departement of Information Technology

Course Title: Data structure and Algorithm

Code: CS-201
Coordinating Faculty/ Department: Faculty of Engineering and Technology,
Department of IT
Credits: 4
Pre-requisites : Object Oriented Programming

Lecturer Name and Contact:

General Course Information

This course covers the advanced programming topics that focus on the design, analysis, and
implementation of data structures and algorithms. It covers the data structures that are used for the
development of software and intelligent machines, the list of the data structures that we will be covering
are, arrays, link list, queue, stack, trees, and graphs.

COURSE OBECTIVES
Students will learn about different data structures that are core in software development, also they will
learn about the operation that we will be performing against the data structures considered in this course,
beside acquiring technical skills students are going to acquire soft skills such as presentation skills, team
building skills, and communication skills.

COURSE Learning Outcome

At the end of this course, students will be able to:

1. Define and explain different data structures, and operations.

2. Demonstrate and practice algorithms design and flowcharting.
3. Demonstrate and practice data structures such as array, link list, queue, stack, tree, and graphs.
4. Perform traversal, insertion, deletion, and searching operation over the data structures.
5. Define recursion, and explain the way recursion call itself.
6. Solving real world problems with recursion.
 7. Forming groups will help students to work in groups and to reach out their objectives.
8. Project demonstration in the class will build students presentation skills.

LEARNING REFERECNCES
1. Data Structures, latest edition by Seymour Lipschutz.
2. Data Structures and algorithms in C++, 2nd Edition by Sartaj Sahni.
3. Data Structures and algorithms analysis in C++, Fourth Edition by Mark Ellen Weiss.
4. Open Data Structures (in C++) by Pat Morin

TEACHING METHODS
lecture:
Oral presentation by lecturers focuses on explaining topics, ideas and theories
Discussion:
two -way communication with and among the groups of students.
Experiential Techniques (Learning by Doing):
Exercise that reflects the lesson.
Computer Based practices:
Network computer labs

Class Room Etiquette:

Classroom courtesy is expected of all students all the time. Following is general guideline for the
classroom conduct:

1. Refrain from chatting with fellow students.

2. Arrive on time. If you come late please be courteous to other students
3. Do not get up and walk out halfway through class.
4. Do not cut the instructor off at the end of class.
5. All cell phones and pagers must be turned off during class and examination.
6. Eating is not permitted.
7. Above all please be cognizant of the learning process and purpose of you being in the
Classroom and extend same respect to other students.

Policies & Guidelines

Guidelines for Format of Assignments: (General Recommendations)
 Students will submit mini project or semester project that will carry 10% of the total grades. The
maximum number of members in a group is 3, for the project presentation students will either
make a video of about 10 minutes and will upload that video to YouTube or will deliver a 15
minutes presentation in class, language is optional for video recording.
 No hard copy of assignment is accepted.
 Assignment submission via email is not acceptable, submit it via LMS.

Note:
All papers and any and all course work submitted will be subject to plagiarism verification by
software.

Course Schedule / Contents

Week Topics for Discussion Book Suggested Topic Outcomes
No. Chapter # Activity
1 Lecture 1: introduction to data Class Define and practicing the basic
structure & algorithm Chapter 1 Discussion, concepts of Data structure and
class algorithms, class discussion will
1.1 What is Data structure exercise. develop student soft skills.
1.2 Algorithms
1.3 Overview of all data structures
1.4 Algorithm notations and its uses
1.5 Practice on writing simple
algorithms

2 Lecture 2: Algorithms and Chapter 1 Class Practicing flow-charting,

Flowcharts exercise, demonstrating an algorithm using
summarizing. flow-charting. Also, during
2.1 Algorithms exercise they will form the groups
2.2 Algorithm notations and its uses to discuss and find out solution to
2.3 Flow chart the problem given in exercise.
2.4 Flow chart Symbols
2.5examples

3 Lecture 3: Array Data Structure Chapter 2 Class Demonstration, and Practice of

3.1 Arrays introduction exercise, arrays operation. Student will
3.2 Arrays Declaration and discussion, form groups in order to solve the
initialization implementati class exercise, it will help student
3.3 Operations on array on in c to build team and share ideas.
3.4 Finding out maximum in arrays ++, and
3.5 Finding out minimum in arrays. assignment.
3.6 Implementation in C++

4 Lecture 4: Searching Chapter 2 Class Demonstration, and Practice of

4.1 Arrays Searching exercise, Searching in arrays. Also, during
4.2 Linear Search discussion, exercise they will form the groups
4.3 Binary Search implementati to discuss and find out solution to
4.5 Implementation in C++ on in c the problem given in exercise.
++, and quiz.
5 Lecture 5: Insert/Delete element Chapter 3 Class Demonstration, and Practice of
in Array exercise, insertion, deletion in array.
5.1 Insertion in Arrays discussion, Student will form groups in order
5.2 Deletion in Arrays implementati to solve the class exercise, it will
5.3 Implementation in C++ on in c help student to build team and
++. share ideas.
6 Lecture 6: Sorting, 2D arrays Chapter 2 Class Demonstration, and Practice of
6.1 Bubble Sort, algorithm and exercise, 2D array with implementation in
 implementation in C++ discussion, C++. Also, during exercise they
6.2 What is 2D arrays implementati will form the groups to discuss
6.3 Matrices addition, multiplication on in c and find out solution to the
with 2D arrays. ++. problem given in exercise.
7. Lecture 7: Recursion Chapter 3 Class Demonstration, and Practice of
7.1 Recursion exercise, Recusion, Student will form
7.2 Exercises discussion, groups in order to solve the class
implementati exercise, it will help student to
on in c build team and share ideas.
++.

8. Lecture 8: Stacks Class Demonstration, and Practice of

exercise, Stack with implementation using
8.1 Introduction discussion, either array or link list, Also
8.2 Application implementati during exercise they will form the
8.3 Stack (LIFO) explanation on in c groups to discuss and find out
8.4 POP Chapter 4 ++. solution to the problem given in
8.5 PUSH exercise.
8.6 IsEmpty
8.7 IsFull
8.8 Peek

9. Lecture 9: Queues Class Demonstration, Practice, and

exercise, implementation of queue using
9.1 Introduction to Queue discussion, either array or link list. Student
9.2 Queue Application in Real Chapter 5 implementati will form groups in order to solve
world/in Computers on in c the class exercise, it will help
9.3 Queue Represenation ++. student to build team and share
9.4 Queue Operations ideas.
9.5 EnQueue, DeQueue, isFull,
isEmpty
9.6 Implementation
9.7 Implementing a Deque with a
Doubly Linked List.
9.8 Adapters and the Adapter
Design Pattern.
9.9 Exercises.

10 Lecture 10: Linked Lists Chapter 6 Class Demonstration, Practice, and

10.1 Introduction exercise, implementation of link list. Also,
10.2 Link list discussion, during exercise they will form the
10.3 Link list representation implementati groups to discuss and find out
10.4 Traversing on in c solution to the problem given in
10.5.Searching ++, mini exercise.
10.6 Insertion/Deletion to/from link project or
list assignment.

11. Lecture 11: General Trees Class Demonstration, Practice, and

 exercise, implementation of tree. Student
11.1 Tree Definitions and Properties Chapter 7 discussion, will form groups in order to solve
11.2 Tree Functions. implementati the class exercise, it will help
11.3 A C++ Tree Interface on in c student to build team and share
11.4 A Linked Structure for General ++. ideas.
Trees
11.5 Tree Traversal Algorithms
11.6 Depth and Height
11.7 Preorder Traversal
11.8 Post order Traversal

12. Lecture 12: Binary Trees Class Demonstration, Practice, and

exercise, implementation of binary tree.
12.1 Binary Tree discussion, The discussion part of the class
12.2 Binary Tree represenation in implementati will help student to improve their
Memory. on in c communication skills.
12.3 Binary Tree Traversal Chapter 7 ++, and quiz.
12.4 Traversal algorithm using stack
12.4 BST
12.5 Search and Insert in BST
Exercises .
13. Lecture 12: Graph Data Structure Chapter 8 Class Demonstration, Practice, and
13. 1 Graph Theory Terminology exercise, implementation of graphs,
13. 2 Sequential representation of discussion, disscusion will help students to
graphs implementati share ideas and to draw a
13.3 Adjacency matrix, path matrix on in c conclusion for the given problem.
13.4 Warshalls algorithm ++.
13.5 Shortest paths
14. Lecture 13 : Graphs Class Demonstration, Practice, and
14.1 Linked representation of a Chapter 8 exercise, implementation of graphs. The
graph discussion, discussion part will give students
14.2 Operation on Graphs implementati the oppurtunity to negotiate and
14.3 Traversing a Graph on in c draw a conclusion.
14.5 Spanning Tree ++.
14.6 Exercise

15. Lecture 15: Hash Tables Chapter 9 Class Demonstration, Practice, and
exercise, implementation of hash tables.
15.1 Bucket Arrays discussion, Forming groups in order to solve
15.2 Hash Functions implementati the class exercise, it will help
15.3 Hash Codes on in c student to build team and share
15.4 Compression Functions ++. ideas.
15.5 Collision-Handling Schemes
15.6 Load Factors and Rehashing
15.7 A C++ Hash Table
Implementation
16. Presentation: students will present Student Building up students presentation
their projects. projects skills, and communication skills.
presentation.
Course Assessment

TYPE PERCENTAGE RATIONALE

Internal Assessment 25 % Equal weightage is assignments and quizzes and
- Assignments: 10% at the same time emphasizing on the importance
- Quizzes: 10% of class participation.
- Attendance: 5%
External Assessment 75% Students develop an examination sense through
- Midterm: 25% midterm examination hence 25% weightage is
- Terminal: 50% appropriate. Midterm duly followed by terminal
examination providing 50% weightage which is
an opportunity to improve scores appropriately.

Grading
MARK RANGE GRADE POINT GRADE EXPECTED RESULT
90 and above 4.0 A At least 25% expected to
secure A grade
80 – 89 3.0 B At least 35% expected to
secure B grade
70 – 79 2.0 C At least 30% expected to
secure C grade
60 – 69 1.0 D At least 7% expected to
secure D grade
59 and below 0.0 F At least 3% expected to
secure F grade

Kardan University Policy on Plagiarism:

All examinations and quizzes will be “closed book” unless otherwise instructed. At the time of
examination all students are requested to clear their desks and are not allowed exchanging any notes or
electronic (text) messages to other students. All cellular phones should be in silent mode and student will
not be allowed to use it during the examination other than medical/family/work emergency. All students
are expected to adhere to these policies and procedures.

Conduct and Important Policies:

Any student found guilty of a breach of ethics will be refered to Disiplinary Committee of the University.
a) Breach of ethics includes, but is not limited to plagiarism (the copying of other’s ideas and passing
them off as one’s own); copying or other forms of cheating on examinations, papers, and reports; the sale,
purchase, or distribution of term papers It is within an instructor’s discretion to impose a lesser penalty,
e.g., “zero” grade on a given assignment.
b) Course registration is charged by the management. Please approach the management for any queries
about course enrolment. In no circumstances should you approach the lecturers who have no control on
this.
c) Make-up exam for midterm and terminal exam is available only for those individuals, who are not able
to attend their regural exams. Provision of supported documents are mandatory for grant of approval to
participate in make-up exams. Those students who miss their regular exam without a genuin reason, will
be entitled for 80% of total makeup marks.
Usually make-up exam starts a week after the regular exam finishes.

d) There is no make-up session for the oral presentations and quizzes. If you are absent from the oral
presentation/ quiz without eligible reasons/documents, you will not earn any marks.

e) All examinations and quizzes will be “closed book” unless otherwise instructed. At the time of
examination all students are requested to clear their desks and are not allowed exchanging any notes or
electronic (text) messages to other students. All cellular phones should be in silent mode and student will
not be allowed to use it during the examination other than medical/family/work emergency. All students
are expected to adhere to these policies and procedures.

f) There is no supplementary exam for any failed course. Individuals, who fail the course, must retake the
module.

Attendance:
Your regular and punctual attendance at lectures and seminars is expected in this course.
University regulations indicate that if students attend less than 65% of scheduled classes they may be
refused from final assessment.

Dean Signature..........................................................

VC Signature ............................................................