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 :	Assoc. Prof. TEVFİK AYTEKİN
Course Lecturer(s):	Assist. Prof. ERKUT ARICAN Assoc. Prof. TEVFİK AYTEKİN
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. The teaching methods of the course include lectures, group work, technology-assisted learning, project preparation, and practice.

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 and science.	2
2)	Adequate knowledge in subjects specific to Computer Engineering.	4
3)	Ability to use theoretical and practical knowledge in Computer Engineering subjects for complex engineering problems.	4
4)	Ability to identify, define, and formulate complex engineering problems	4
5)	Ability to select and apply appropriate analysis and modeling methods to solve complex engineering problems.	4
6)	Ability to design a complex system, process, device, or product under realistic constraints and conditions to meet specific requirements, and to apply modern design methods for this purpose	4
7)	Ability to develop, select, and use modern techniques and tools required for the analysis and solution of complex problems encountered in computer engineering applications.	1
8)	Ability to use information technologies effectively	4
9)	Ability to design experiments for the investigation of complex engineering problems or research topics in computer engineering.	4
10)	Ability to conduct experiments, collect data, analyze and interpret results for the investigation of complex engineering problems or research topics in computer engineering	5
11)	Ability to work effectively in intra-disciplinary teams.
12)	Ability to work effectively in multidisciplinary teams.
13)	Ability to work independently.
14)	Ability to communicate effectively in both oral and written forms
15)	Knowledge of at least one foreign language
16)	Ability to write effective reports, understand written reports, and prepare design and production reports.	1
17)	Ability to deliver effective presentations and to give and receive clear and understandable instructions.
18)	Awareness of the necessity of lifelong learning	5
19)	Ability to access information, follow developments in science and technology, and continuously improve oneself.	1
20)	Ability to be aware of professional and ethical responsibilities and to act in accordance with ethical principles.
21)	Knowledge of standards used in engineering applications.
22)	Knowledge of professional practices in business life such as project management, risk management, and change management.
23)	Awareness of entrepreneurship and innovation.
24)	Knowledge of sustainable development.
25)	Knowledge of the impacts of engineering applications on health, environment, and safety in universal and societal dimensions, as well as awareness of contemporary issues reflected in the field of engineering.
26)	Awareness of the legal consequences of engineering solutions.