COMPUTER ENGINEERING
Bachelor	TR-NQF-HE: Level 6	QF-EHEA: First Cycle	EQF-LLL: Level 6

Course Introduction and Application Information

Course Code	Course Name	Semester	Theoretical	Practical	Credit	ECTS
CMP2003	Data Structures and Algorithms (C++)	Fall	3	2	4	7

Basic information

Language of instruction:	English
Type of course:	Must Course
Course Level:	Bachelor’s Degree (First Cycle)
Mode of Delivery:	Face to face
Course Coordinator :	Dr. Öğr. Üyesi TEVFİK AYTEKİN
Course Lecturer(s):	Dr. Öğr. Üyesi ERKUT ARICAN Dr. Öğr. Üyesi TEVFİK AYTEKİN RA ÇİĞDEM ERİŞ
Recommended Optional Program Components:	None
Course Objectives:	This is an introductory course on common data structures that are used in computer engineering. After completing the course, the student will have knowledge of applying, implementing and analysis of basic data structures, including, lists, stacks, queues, hash tables and binary trees. Certain fundamental techniques, such as sorting, searching and recursion are also introduced.

Learning Outcomes

The students who have succeeded in this course;
I. Describe and apply basic object oriented programming principles.
II. Implement basic data structures such as linked lists, stacks, queues, hash tables, and trees.
III. Analyze the efficiency of algorithms.
IV. Choose and design data structures for writing efficient programs and apply/report these methods in a group project.
V. Implement recursive algorithms.
VI. Describe and implement sorting algorithms on common data structures.
VII. Describe and implement search algorithms on common data structures.

Course Content

After course overview and review of object oriented programming and C++, complexity analysis of algorithms will be introduced then array-based lists, linked lists, recursion, stacks, and queues will be covered. After the midterm search algorithms and hashing will be introduced. Lastly, sorting algorithms, binary search trees and B-trees will be covered during the end of the course.

Weekly Detailed Course Contents

Week	Subject	Related Preparation
1)	Course overview and review of object oriented programming and C++
2)	Complexity analysis of algorithms
3)	Array-based and linked lists
4)	Array-based and linked lists
5)	Recursion
6)	Stacks
7)	Queues
8)	Midterm Exam
9)	Searching algorithms
10)	Hashing algorithms
11)	Sorting algorithms
12)	Sorting algorithms
13)	Binary search trees
14)	B-trees

Sources

Course Notes / Textbooks:	D. S. Malik, Data Structures Using C++, 2e. Course Technology - Cengage Learning, 2010.
References:

Evaluation System

Semester Requirements	Number of Activities	Level of Contribution
Quizzes	1	% 10
Project	1	% 20
Midterms	1	% 30
Final	1	% 40
Total		% 100
PERCENTAGE OF SEMESTER WORK		% 40
PERCENTAGE OF FINAL WORK		% 60
Total		% 100

ECTS / Workload Table

Activities	Number of Activities	Duration (Hours)	Workload
Course Hours	14	3	42
Laboratory	14	5	70
Project	1	20	20
Quizzes	1	8	8
Midterms	1	15	15
Final	1	18	18
Total Workload			173

Contribution of Learning Outcomes to Programme Outcomes

No Effect	1 Lowest	2 Low	3 Average	4 High	5 Highest

	Program Outcomes	Level of Contribution
1)	Adequate knowledge in mathematics, science and computer engineering; the ability to use theoretical and practical knowledge in these areas in complex engineering problems.	5
2)	Ability to identify, formulate, and solve complex engineering problems; ability to select and apply appropriate analysis and modeling methods for this purpose.	5
3)	Ability to design a complex system, process, device or product to meet specific requirements under realistic constraints and conditions; ability to apply modern design methods for this purpose.	3
4)	Ability to develop, select and use modern techniques and tools necessary for the analysis and solution of complex problems encountered in computer engineering applications; ability to use information technologies effectively.	3
5)	Ability to design, conduct experiments, collect data, analyze and interpret results for the study of complex engineering problems or computer engineering research topics.	4
6)	Ability to work effectively within and multi-disciplinary teams; individual study skills.	4
7)	Ability to communicate effectively in verbal and written Turkish; knowledge of at least one foreign language; ability to write active reports and understand written reports, to prepare design and production reports, to make effective presentations, to give and receive clear and understandable instructions.	4
8)	Awareness of the necessity of lifelong learning; ability to access information, to follow developments in science and technology and to renew continuously.	3
9)	To act in accordance with ethical principles, professional and ethical responsibility; information on the standards used in engineering applications.	3
10)	Information on business practices such as project management, risk management and change management; awareness of entrepreneurship and innovation; information about sustainable development.	3
11)	Knowledge of the effects of engineering practices on health, environment and safety in the universal and social scale and the problems of the era reflected in engineering; awareness of the legal consequences of engineering solutions.