Data Structures
By
Dr. Mehedi Masud
ِAssociate Professor, Computer Science Dept.
College of Computers and Information Systems
Taif University
1
Contact
Information
Email: mehediku@hotmail.com
Office Number W107
Office Hours: Sunday(9:00-10:00) , Monday (9:0011:00)
Use BlackBoard for course materials
3
Text Book
Data
Structures
and
Algorithm
Analysis in C++ by Mark Allen Weiss
Reference book
 C++ Data Structures, by Nell Dale, third edition,
Jones and Bartlett
7
Midterm Exam
20%
Final Exam
45%
Quizzes + Attendance
20%
Lab
15%
100%
Total
10
Assessment schedule
First Assignment + Quiz 1
After 3 Lectures
Second Assignment + Quiz 2
After 6 Lectures
Third Assignment + Quiz 3
After 10 Lectures
13
Class, Quiz & Exam Rules
●
No attendance after the first 10 minutes
●
No makeup assignment and quiz if
you miss
8
Course Outline
1
Introduction / Definitions
2
Arrays
3
Pointers
4
Structures
5
Recursion
6
Stacks & Queues
7
Linked List
8
Trees
9
Sorting
10
Searching
11
Algorithm Analysis
Standard Data
Structures
Standard
Algorithms
14
Course Learning Outcomes (CLO’s):
Course Learning Outcomes (CLO’s):
CLO1
CLO2
CLO3
CLO4
CLO5
Implement basic data structures in implementing
simple applications.
Implement pointer and the linked list data structure
to solve problems.
Implement the stack and queues data structures to
solve problems.
Implement and use tree data structures (binary tree,
binary search tree, heap, etc.) to solve problems
Use different search and sort algorithms to analyze
collection of data, and analyze simple algorithms
using big-O notation