Data Stru. & Algo
Course Profile
Course Name: 
Algorithms & Data Structures 
Course Code: 
CEN 215 
Academic Year: 
20142015 
Semester: 
First 
Course Overview

This course provides completely understanding of algorithm development, and use a good algorithms in related to the problems which we solve, including: abstract data type unsorted list and sorted list, abstract data type stack and queue, Sorting, linked structures which include (implementing stack, queue, unsorted list, sorted list, all as a linked structure). programming with recursion(programming with recursively, verifying recursive function, writing recursive functions, using recursion to simplify solutions, recursive linked list, recursive version of binary search), binary search tress(iterative insertion and deletion), priority queues and heaps and graphs and sets, Tree Data Structure.
Course Details


Level: 
6 
Credit: 
3(202) 
PreRequisites: 
CEN 212 
Co Requisites: 

Learning Outcomes of Course

After successful completion of this course, student will be able to
1. Pointers
2. Dynamic memory allocation
3. Linked lists.
4. Stacks
5. Queues
6. Trees (including Binary Search Tress)
7. Hash Tables
8. Utilizing various sorting algorithms.
Course Assessment

Name of Assessment Task 
Weight of Assessment 
Week Due 
1. Midterm Exam1 
15% 
Week 8 
2. Midterm Exam2 
15% 
Week 12 
3. Quizzes + Assignments 
10% 

4. Laboratory 
20% 
Week 14 
5. Final Exam 
40% 
Week 15 
Assessment Task and Learning Outcomes Alignment

Assessment Task Name 
Course Learning Outcomes 

1 
2 
3 
4 
5 
6 
7 
8 

1. Midterm Exam1 
√ 
√ 

√ 




2. Midterm Exam2 


√ 
√ 
√ 



3. Quizzes 





√ 


4. Assignments 
√ 
√ 






5. Laboratory 


√ 
√ 
√ 



6. Final Exam 
√ 
√ 
√ 
√ 
√ 
√ 
√ 
√ 
Teaching Contact Details

Name of Course Coordinator: 
Ahsan Ahmed 
Email of Course Coordinator: 

Lab/Tutorial Instructor: 
Ahsan Ahmed 
Email of Lab/Tutorial Instructor: 

Office Hours: 
MONDAY: 12:00 Noon  02:00 PM 
Office Number: 
R0241191, First Floor, CCIS Building 
Office Phone Number: 
00966164042536 
Details of Required Text Book

Book Name 
Authors Name 
Publisher 
Year 
Edition 
Data Structures and Algorithms in C++ [ISBN10 : 0470383275 ISBN13 : 9780470383278]

MichaelT. Goodrich, Roberto Tamassia, David M. Mount 
John Wiley& Sons 
2011 
2^{nd} 
Details of Required Reference Books

Book Name 
Authors Name 
Publisher 
Year 
Edition 
C++ plus Data Structures ISBN13: 9780763704810 
Nell Dale 
Jones & Bartlett Learning 
2003 
3^{rd} 
C ++: How to Program ISBN13: 9780273752769 
Paul Deitel Harvey Deitel 
Pearson 
2012 
8^{th} 
IT Resources

The following IT Resources will requireto access
· Web References and downloads:
o http://www.cplusplus.com
o http://www.cprogramming.com
o http://en.wikibooks.org/wiki/Data_Structures
o Saudi Digital Library
· Faculty Website: http://faculty.mu.edu.sa/a.ahmed
· College Computer Laboratory for Practical Implementation
Course Schedule

Course Topics 
Book’s Chapter 
Event Name 
Week Due 
C++ Review 
C ++: How to Program, Chapter4Control Statements Part 1,Chapter5 Control Statements Part 2,Chapter6Fnctions,Chapter7Arrays and vectors,Chapter9Classes Part1, Chapter10Classes Part2 

Week1& 2 
Algorithms and Analysis 
C++ plus Data Structures, Chapter 2Design and Implementation 

Week3 
Pointer 
C ++: How to Program, Chapter8Pointers, 

Week4 
Linked List 
C++ plus Data Structures, Chapter3ADT Unsorted List, Chapter 4ADT Sorted List, Chapter 6 List Plus

Assignment Due (to be submitted at the beginning of this class) 
Week5&6 
Stack 
C++ plus Data Structures, Chapter5ADTs Stack and Queue 

Week7 


First Midterm Exam

Week8 
Queues 
C++ plus Data Structures, Chapter6ADTs Stack and Queue 
Quiz1 
Week9 & 10 
Trees 
C++ plus Data Structures, Chapter8 Binary Search Trees


Week11& 12 


Second Midterm Exam

Week 12 
Hash Tables 
C++ plus Data Structures, Chapter9Sorting and Searching Algorithms 

Week 13 
Graphs 
C++ plus Data Structures, Chapter10Priority Queues, Heaps, and Sets 
Final Laboratory Exam 
Week 14 


Final Exam Date and Time: TBA

Exam Week 15 
Referencing Style

The American Psychological Association (APA) referencing style must be use for all submissions of this course.
Course Assessment Task

Assessment Name: 
Midterm Exam1 
Description of Task Assessment: 
This assessment is aligned to learning outcomes 1, 2 and 4. In that regard, the assignment contains questions that assess: 1) Pointers 2) Dynamic Memory Allocation 4) Stacks 
Task Assessment Due Week/Date: 
Week8 
Return Week/Date to Students: 
Week 9 (Evaluated copies will be shown to students)

Weight of Task Assessment: 
15% 
List of Learning Outcomes Assessed: 
1. Pointers 2. Dynamic memory allocation 4. Stacks 
Assessment Name: 
Midterm Exam2 
Description of Task Assessment: 
This assessment is aligned to learning outcomes 3, 4 and 5. In that regard, the assignment contains questions that assess: 3) Linked lists, 4) Stacks 5) Queues 
Task Assessment Due Week/Date: 
Week12 
Return Week/Date to Students: 
Week 13 (Evaluated copies will be shown to students)

Weight of Task Assessment: 
15% 
List of Learning Outcomes Assessed: 
3. Linked lists 4. Stacks 5.Queues 
Assessment Name: 
Quiz 
Description of Task Assessment: 
This assessment is aligned to learning outcome 6. In that regard, the assignment contains questions that assess: 6) Trees

Task Assessment Due Week/Date: 
Week10 
Return Week/Date to Students: 
Week 11 (Evaluated copies will be shown to students) 
Weight of Task Assessment: 
5% 
List of Learning Outcomes Assessed: 
6.Trees 
Assessment Name: 
Assignment 
Description of Task Assessment: 
This assignment is aligned to learning outcomes 1 and 2. In that regard, the assignment contains questions that assess: 1) Pointers and 2) Dynamic memory allocation

Task Assessment Due Week/Date: 
Week5 
Return Week/Date to Students: 
Week 6 (Evaluated copies will be shown to students) 
Weight of Task Assessment: 
5% 
List of Learning Outcomes Assessed: 
1. Pointers 2. Dynamic memory allocation

Assessment Name: 
Final Exam 
Weight of Task Assessment: 
40% 
Duration: 
3 Hours 
Warning: 
No Calculator Permitted Exam Question Paper will be given to students. Exam will be Closed Books. 
List of Learning Outcomes Assessed: 
1. Pointers 2. Dynamic memory allocation 3. Linked lists 4. Stacks 5. Queues 6. Trees (including Binary Search Trees) 7. Hash Tables 8. Utilizing various sorting algorithms 