Data Structures

1
Data Structures
By Dr. Mehedi Masud ?Associate Professor,
Computer Science Dept. College of Computers and
Information Systems Taif University
1
2
Contact Information
Email mehediku_at_hotmail.com Office Number W107 Office Hours Sunday(900-1000) , Monday (900-1100) Use BlackBoard for course materials Contact Information
3
3
Text Book and References

• 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
4
Evaluation
20 Midterm Exam
45 Final Exam
20 Quizzes Attendance
15 Lab
100 Total

10
5
Assessment schedule
After 3 Lectures First Assignment Quiz 1
After 6 Lectures Second Assignment Quiz 2
After 10 Lectures Third Assignment Quiz 3
13
6
Class, Quiz Exam Rules
?
No attendance after the first 10 minutes No
makeup assignment and quiz if you miss 

?
8
7
Course Outline
Standard Data Structures Standard Algorithms Introduction / Definitions 1
Standard Data Structures Standard Algorithms Arrays 2
Standard Data Structures Standard Algorithms Pointers 3
Standard Data Structures Standard Algorithms Structures 4
Standard Data Structures Standard Algorithms Recursion 5
Standard Data Structures Standard Algorithms Stacks Queues 6
Standard Data Structures Standard Algorithms Linked List 7
Standard Data Structures Standard Algorithms Trees 8
Standard Data Structures Standard Algorithms Sorting 9
Standard Data Structures Standard Algorithms Searching 10
Standard Data Structures Standard Algorithms Algorithm Analysis 11
14
8
Course Learning Outcomes (CLOs)
Course Learning Outcomes (CLOs)
Course Learning Outcomes (CLOs)
CLO1 Implement basic data structures in implementing simple applications.
CLO2 Implement pointer and the linked list data structure to solve problems.
CLO3 Implement the stack and queues data structures to solve problems.
CLO4 Implement and use tree data structures (binary tree, binary search tree, heap, etc.) to solve problems
CLO5 Use different search and sort algorithms to analyze collection of data, and analyze simple algorithms using big-O notation