Curriculum and Process Design Evidence capde(7-3 2 02-01)

إدارة الجودة الشاملة





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:
    
    1. 
       Quick sort,
       
    2. 
       Sorting & selection,
       
    3. 
       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
    

1. 
   Lecture Oral Presentation.
   
2. 
   Class Discussion.
   

1. 
   3% for the attendance.
   
2. 
   7% for the homework.
   
3. 
   5% for project.
   
4. 
   15% for the Lab Exams.
   
5. 
   20% for the Exams.
   
6. 
   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).