PILOTAGE (EN)
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
SEN2211	Data Structures and Algorithms I	Fall	2	2	3	7

This catalog is for information purposes. Course status is determined by the relevant department at the beginning of semester.

Basic information

Language of instruction:	English
Type of course:	Non-Departmental Elective
Course Level:	Bachelor’s Degree (First Cycle)
Mode of Delivery:	Face to face
Course Coordinator :	Dr. Öğr. Üyesi BETÜL ERDOĞDU ŞAKAR
Course Lecturer(s):	Dr. Öğr. Üyesi BETÜL ERDOĞDU ŞAKAR RA MERVE ARITÜRK Prof. Dr. NAFİZ ARICA Instructor DUYGU ÇAKIR YENİDOĞAN RA SEVGİ CANPOLAT
Recommended Optional Program Components:	None
Course Objectives:	This is an introductory course on common data structures that are used in software engineering. After completing the course, the student will have knowledge of applying, implementing and analysis of basic data structures, including, lists, stacks and queues. Certain fundamental techniques, such as sorting, searching and recursion are also taught.

Learning Outcomes

The students who have succeeded in this course;
1) Describe and apply basic object oriented programming principles.
2) Implement basic data structures such as linked lists, stacks and queues.
3) Analyze the complexity and efficiency of algorithms.
4) Choose and design data structures for writing efficient programs.
5) Implement recursive algorithms.
6) Describe and implement sorting algorithms on common data structures.
7) Describe and implement search algorithms on common data structures.

Course Content

The course content is composed of object oriented Java review, the complexity and efficiency of algorithms, introduction to list-stack-queue structures, implementing list-stack-queue structures, recursion, searching algorithms and sorting algorithms.

Weekly Detailed Course Contents

Week	Subject	Related Preparation
1)	Introduction to Data Structures and Algorithms Complexity Analysis
2)	Introduction to Linked Lists
3)	Doubly Linked Lists Ordered Linked Lists
4)
5)	Stacks
6)	Stacks for Algebraic Operations
7)	Queues
8)	Queues
9)	Data Structure Classes in Java
10)	Recursion
11)	Recursive Complexity
12)	Searching Algorithms
13)	Sorting Algorithms
14)	Sorting algorithms

Sources

Course Notes / Textbooks:	Data Structures & Problem Solving Using Java (Mark Allen Weiss) Data Structures and Algorithm Analysis in Java (Mark Allen Weiss) Data Structures and Abstractions with Java (Frank Carrano)
References:	Yok

Evaluation System

Semester Requirements	Number of Activities	Level of Contribution
Laboratory	4	% 20
Quizzes	5	% 20
Midterms	1	% 20
Final	1	% 40
Total		% 100
PERCENTAGE OF SEMESTER WORK		% 60
PERCENTAGE OF FINAL WORK		% 40
Total		% 100

ECTS / Workload Table

Activities	Number of Activities	Workload
Course Hours	14	28
Laboratory	14	28
Study Hours Out of Class	12	24
Midterms	10	52
Final	5	32
Total Workload		164

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)	Apply scientific methods or concepts in solving aviation-related problems	3
2)	Analyze and interpret data	5
3)	Work effectively on multi‐disciplinary and diverse teams	5
4)	Make professional and ethical decisions	3
5)	Communicate effectively, using both written and oral communication skills	4
6)	Engage in and recognize the need for life‐long learning	5
7)	Use the techniques, skills, and modern technology necessary for professional practice	4
8)	Assess the national and international aviation environment	3
9)	Apply pertinent knowledge in identifying and solving contemporary problems in the field of aviation	3
10)	Apply knowledge of business sustainability to aviation issues	3