Data Structure and Algorithm Course Outline - Updated
Data Structure and Algorithm Course Outline - Updated
Course Description:
This course focuses on the study of data structures, algorithms and program efficiency. Topics
include: analysis of time and space requirements of algorithms; program efficiency improving
techniques, abstract data types such as linked lists, stacks, queues, trees (traversal,
implementations); simple searching algorithms (linear search, binary search), simple sorting
algorithms.
Course Goals /Course objectives/:
The course objectives: -
To introduce the most common data structures like stack, queue, linked list
To give alternate methods of data organization and representation
To enable students, use the concepts related to Data Structures and Algorithms to solve real world
problems
To practice Sorting, and Searching on the different data structures
1|Page
Topics Assessments
Assessment Method:
Students will be assessed based on the programming and the written assignments given, and with 2 tests
given within the course period, in addition to the final examination executed at the end of the course
schedule. Class participation should also take as part of student evaluation.
2|Page
a) Continuous assessments:
Test 1 10%
Mid_Exam 20%
Assignments/Project 20%
Class and lab activity 10%
b) Final examination: 40%
Total mark 100%
References
3|Page