‫جمهورية العراق‬
‫وزارة التعليم العالي والبحث العلمي‬
‫وثق ما تفعل‬
‫جامعة بابل‬
‫وافعل ما توثق‬
‫كلية تكنولوجيا المعلومات‬
‫قسم البرامجيات‬
‫الدراسات األولية‬
‫إدارة الجودة الشاملة‬
‫سنوي‬
:‫العدد‬
Curriculum and Process Design Evidence
CAPDE(7-3-1.2.3.-02-01)
:‫التاريخ‬
‫استمارة خاصة الطالع الطلبة على المقرر‬
X ‫فصلي‬
‫النوع‬
Data structures I
DAST201 :‫رقم المقرر الدولي‬
Course NO.: DAST201
2 ‫هياكل البيانات‬
‫اسم المقرر‬
:‫اختياري‬
2
‫العملي‬
2
‫النظري‬
X
4
‫عدد الساعات االجمالي‬
3
‫الثانية‬
‫حوراء شريف حمزة‬
‫مدرس مساعد‬-‫ماجستير علوم حاسبات‬
‫األنكليزي‬
1
:‫اجباري‬
‫عدد الوحدات‬
2
‫المرحلة الدراسية‬
3
‫ اسم التدريسي‬4
‫الشهادة واللقب العلمي‬
‫ لغة تدريس المقرر‬5
‫برنامج المقرر‬
‫المقدمة‬
‫اوال‬
Data Structure is an arrangement of data in a computer’s memory (or sometimes on a disk). Data
structures include arrays, linked lists, stacks, binary trees, and hash tables, among others. Algorithms
manipulate the data in these structures in various ways, such as searching for a particular data item and
sorting the data.
This course treats structured problem solving, data abstraction, and the comparative analysis of
algorithm as fundamental tools of program design.
)1 - 3(
‫اهداف المقرر‬
‫ثانيا‬
1. Understand the recursion techniques.
2. Describe the binary tree traversal techniques.
 Evaluate Binary tree traversal (Inorder)
 Explain how can visit the B.T by using Preorder.
 Explain how can visit the B.T by using Postorder.
3. Be familiar with advanced data structures such as:
 balanced search trees,
 Complete search tree.
4. Able to understand the AVL tree.
5. Explain the insert operation on AVL tree.
6. Discuss the deletion operation on AVL tree.
7. Describe the meaning of Red-Black tree.
8. Learn how can insert elements in red black tree.
9. Explain the meaning of Graphs.
10. Understand the types of graphs.
11. Learn how to traverse graphs.
12. Explain how dijkstra’s algorithm works.
13. Be familiar with several sorting algorithms including:
a. Quick sort,
b. Sorting & selection,
c. Radix sort
14. Be familiar with Weighted graphs
15. Master analyzing problems and writing program solutions to problems using the above
techniques
16. Amortized analysis
17. Randomized analysis
18. Augmenting data structures
‫مفردات المقرر او المحتوى‬
Week 1
Week 2
Week 3
Week 4
Week 5
Week 6
Week 7
Week 8
Week 9
Week 10
Week 11
Week 12
Week 13
Week 14
Week 15
‫الماده النظرية‬
Trees traversals
AVL trees, Insertion
AVL trees, Deletion
red-black trees, Insertion
red-black trees, Deletion
Exam I
Graphs
Weighted graphs
sorting algorithms
Quick sort
Sorting & selection
‫الماده العملية‬
Post, pre, inorder traversals
Post, pre, inorder traversals
Impl. AVL
Impl. AVL
Impl. red-black trees
Impl. red-black trees
Impl. Graph
Exam I
Impl. Weighted Graph
Impl. Quick sort
Impl. Sorting & selection
Impl. selection
Impl. Radix sort
Impl. Radix sort
Exam II
Radix sort
Exam II
Algorithm analysis
)2 - 3(
‫ثالثا‬
‫طرائق التدريس المعتمدة لتنفيذ المقرر‬
‫رابعا‬
‫توزع درجات المقرر وفق لواحد أو أكثر مما يأتي‬
‫خامسا‬
: - ‫ التسلسل حسب األهمية‬- ‫المصادر والمراجع‬
‫سادسا‬
1- Lecture Oral Presentation.
2- Class Discussion.
1.
2.
3.
4.
5.
6.
3% for the attendance.
7% for the homework.
5% for project.
15% for the Lab Exams.
20% for the Exams.
50% for the final Exam.
1. Michael T. Goodrich and Roberto Tamassia, Data Structures and Algorithms in Java, John Wiley &
Sons, (Fifth Edition, 2011).
2. Robert Lafore, Data Structures and Algorithims in Java, Second Edition (Second Edition 2003).
‫ صفاء عبيس‬.‫ د‬:‫رئيس القسم‬
‫م حوراء شريف حمزة‬.‫ م‬:‫اسم التدريسي‬
:‫التوقيع‬
:‫التوقيع‬
)3 - 3(