Course Code & Number
CMPE 223
Course Title
Data Structures and Algorithms I
Level
BS
Credit Hours/ ECTS Credits
(3+0+0) 3 TEDU Credits, 6 ECTS Credits
Year of Study:
Sophomore
Semester:
Fall
Type of Course:
Compulsory
Mode of Delivery:
Face-to-face
Language of Instruction:
English
Pre-requisite / Co-requisite::
Pre-requisites: CMPE 211 OR CMPE 114
Co-requisites: NONE
Catalog Description
Design and Analysis of algorithms. Stacks and queues. Elementary sorts. Mergesort. Quicksort. Priority queues. Heaps. Symbol tables. Binary search trees. Balanced search trees. Hash tables.
Course Objectives
This course aims to help students to understand the basic data types in computer science. The course allows students to use these data types to create compound data types and mathematically model problems. The course also enables students to identify tree structures and set operations.
Course Learning Outcomes
Upon successful completion of this course, students will be able to
- Identify fundamental abstract data structures,
- Use basic data types such as linked list, stack, queue and tree structures to model problems,
- Apply different algorithm design methodologies such as divide and conquer,
- Construct efficient operations on basic ADT,
- Analyze different data structures and algorithms in terms of time and space complexity.
Course Coordinator:
Dr. Tansel Dökeroğlu