Course ID:
Course Code & Number
CMPE 222
Course Title
Data Structures and Algorithms II
Level
BS
Credit Hours/ ECTS Credits
(3+0+0) 3 TEDU Credits, 6 ECTS Credits
Year of Study:
Sophomore
Semester:
Spring
Type of Course:
Compulsory
Mode of Delivery:
Face-to-face
Language of Instruction:
English
Pre-requisite / Co-requisite::
Pre-requisites: NONE
Co-requisites: NONE
Catalog Description
Advanced set representation methods. Directed graphs. Undirected graphs. Sorting. Algorithm analysis techniques.
Course Objectives
The objective of this course is to introduce advanced data structures and algorithm analysis techniques. This course introduces the use of graphs in problem solving and algorithm development and describes how to develop algorithms using advanced data structures.
Software Usage
Course Learning Outcomes
Upon succesful completion of this course, a student will be able to
1. Use advanced data structures in modeling and solving problems
2. Use graphs and directed graphs in modeling problems
3. Implement sorting and searching algorithms using graph based data structures
4. Analyze an algorithm to measure its time complexity
5. Analyze an algorithm to measure its space complexity
6. Design algorithms with efficiency in mind
Learning Activities and Teaching Methods:
Telling/Explaining
Discussion/Debate
Questioning
Reading
Problem Solving
Others
Assessment Methods and Criteria:
Test / Exam
Quiz
Assessment Methods and Criteria Others:
Design Content
Recommended Reading
Required Reading
1. Algorithms, Fourth Edition. Robert Sedgewick, Kevin Wayne. Addison Wesley Publications. ISBN 978-0-321-57351-3
Grading
Midterm Exam - 20%
Quiz - 30%
Homeworks - 30%
Final Exam - 20%
Learning Activities and Teaching Methods Others:
Course Coordinator:
Student Workload:
| Workload | Hrs |
|---|
Course & Program Learning Outcome Matching: