Course Code & Number
CMPE 224
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:
Junior
Semester:
Spring
Type of Course:
Compulsory
Mode of Delivery:
Face-to-face
Language of Instruction:
English
Pre-requisite / Co-requisite:
Pre-requisites: CMPE 221 OR CMPE 242 OR CMPE 223
Co-requisites: NONE
Catalog Description
Undirected graphs. Directed graphs. Minimum spanning trees. Shortest paths. Maximum flow and minimum cut. Radix sorts. Tries. Substring search. Regular expressions. Data compression. Reductions. Intractability.
Course Objectives
The general objective of this course is to introduce students to advanced data structures. This course aims to help students to identify the use of graphs in problem solving and algorithm development. The students are also enabled to develop algorithms using advanced graph data structures. Moreover, it allows students to use different algorithm-design techniques, such as greedy, divide-and-conquer, and linear programming techniques to solve particular problems.
Course Learning Outcomes
Upon successful completion of this course, student will be able to:
- Use graph and string data structures in modeling and solving problems,
- Design graph and string-based algorithms,
- Apply different algorithm-design techniques, including but not limited to, greedy, divide-and-conquer, and dynamic programming techniques, to solve problems,
- Analyze data structures and algorithms in terms of time and space complexity.
Course Coordinator:
Dr. Ulaş Güleç