DATA STRUCTURES
AND ALGORITHMS
DR SAMABIA TEHSIN
BS (AI)
Instructor’s Info
Instructor: Dr. Samabia Tehsin
E-mail: samabiatehsin.bukc@bahria.edu.pk
Office #1, Faculty Room # 9, Second Floor, Iqbal Block
Topics
1. Abstract Data Types (ADTs) 6. Searching (Linear, Binary,
Depth First, Breadth First,
2. Linear data structures (Stacks,
Shortest Path, Minimum
Queues, Linked list)
Spanning Trees)
3. Non-linear data structures
7. Hashing and Collision
(Trees, Graphs)
resolution techniques (Open
4. Recursion and recursive Addressing, Separate Chaining,
algorithms Double Hashing)
5. Sorting Algorithms (Bubble, 8. Data Compression (Huffman’s
Insertion, Selection, Quick, Code),
Merge, Shell, Heap)
9. Complexity Analysis of
Algorithms (Big-O notation)
Course material: BOOKS
GOODRICH AND TAMASSIA,
DATA STRUCTURES AND ALGORITHM
DATA STRUCTURES AND ANALYSIS IN C++, BY MARK ALLEN WEISS
ALGORITHMS IN C++
Course material
LMS
Assessment Methods and Weightage
Quizzes 10%
Assignment/project 20%
Mid-Term Examination 20%
Final Examination 50%
Total 100%
Policies regarding Quizzes
❖ I will take 3 to 5 quizzes and all quizzes are included in final grade calculation
❖ Quizzes may be announced or surprise
❖ There will be no makeup quiz
Academic Honesty
All parties involved in any kind of cheating in any exam will get zero in that exam
Basically,
◦ Don’t copy the code from the Internet
◦ Don’t store other people’s code in your storage
◦ Don’t discuss by looking at others’ code (even in the screen)
◦ Highly likely to share codes
Remember
◦ Zero Tolerance!
Course Learning Outcomes
Course Learning Outcomes
After successful completion of this course, the students should be PLO BT Level
able to:
1. Explain and compare different data structures and their 1 C2
applications
2. Apply appropriate data structures according to the given 2 C3
scenarios and application domain.
3. Analyze time complexity of different algorithms C4
4. Design efficient algorithm(s) to solve real-world problems 4 C6
Bloom’s Taxonomy
