INTERIOR ARCHITECTURE AND ENVIRONMENTAL DESIGN
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
SEN2212	Data Structures and Algorithms II	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 :	Assist. Prof. ÖZGE YÜCEL KASAP
Course Lecturer(s):	Assist. Prof. BETÜL ERDOĞDU ŞAKAR Assoc. Prof. YÜCEL BATU SALMAN RA SEVGİ CANPOLAT RA MERVE ARITÜRK
Recommended Optional Program Components:	None
Course Objectives:	The objective of this course is to analyze data structures and algorithms used in software engineering in detail. After completing the course, the student will have knowledge of applying, implementing and analysis of data structures, including, trees, binary search trees, balanced search trees, heaps and graphs. Certain fundamental techniques, such as sorting, hashing and greedy algorithms are also taught. The teaching methods of the course include lectures, practice, and project preparation.

Learning Outcomes

The students who have succeeded in this course;
The students who have succeeded in this course;
1) Describe and apply basic object oriented programming principles.
2) Implement basic data structures such as trees, binary search trees, balanced search trees, heaps and graphs.
3) Describe and implement sorting algorithms on common data structures.
4) Describe and implement searching algorithms on common data structures.
5) Implement and use hashing algorithms.
6) Implement and use greedy algorithms.
7) Choose and design data structures for writing efficient programs.

Course Content

The course content is composed of basic data structures like trees, binary search trees, balanced search trees, heaps, graphs and sorting, hashing and greedy algorithms.

Weekly Detailed Course Contents

Week	Subject	Related Preparation
1)	Introduction and Sorting Algorithms.	Sorting algorithms.
2)	Introduction to different tree structures.	Trees.
3)	Introduction to binary search trees.	Binary search trees.
4)	Implementing binary search tree using Java.	Binary search trees.
5)	Introduction to balanced trees and implementing AVL balanced tree structure using Java.	AVL trees.
6)	Using other balanced tree structure using Java.	Other balanced trees.
7)	Using heap structure and implementing them using Java.	Heap.
8)	Using heaps as priority queues. Midterm.	Heap.
9)	Analyzing and implementing hashing algorithms.	Hashing algorithms.
10)	Analyzing and implementing graph structure using Java.	Graph.
11)	Analyzing and implementing graph algorithms.	Graph algorithms.
12)	Analyzing and implementing greedy algorithms.	Greedy algorithms.
13)	Analyzing and implementing greedy algorithms. Quiz.	Greedy algorithms.
14)	Review.

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	2	% 10
Quizzes	2	% 10
Project	1	% 15
Midterms	1	% 25
Final	1	% 40
Total		% 100
PERCENTAGE OF SEMESTER WORK		% 45
PERCENTAGE OF FINAL WORK		% 55
Total		% 100

ECTS / Workload Table

Activities	Number of Activities	Duration (Hours)	Workload
Course Hours	14	2	28
Laboratory	14	3	42
Project	1	30	30
Quizzes	2	15	30
Midterms	1	20	20
Final	1	25	25
Total Workload			175

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)	Engages in design, planning, and implementation activities in the field of interior architecture that can respond to different spatial configurations, user groups, and needs in national and international contexts,
2)	Analyzes data collected by focusing on user needs alongside real physical, social, and economic constraints, synthesizes various information and thoughts using individual and professional skills of the 21st century, and uses these processes to develop creative spatial solutions.
3)	Produces creative, innovative, aesthetic, and original spatial solutions using abstract and concrete concepts,
4)	Uses contemporary knowledge production, expression, representation, and technologies required by the field of interior architecture,
5)	Gains knowledge about contemporary spatial fittings and construction techniques in design and implementation works in the field of interior architecture; follows the industry and current developments,
6)	Embraces and prioritizes the relationship between human-environment, user health and safety, universal design principles, and sustainable design approaches in the field of interior architecture,
7)	Acquires a design understanding that respects the social and cultural rights of society, cultural heritage, and nature, and can make conscious decisions on these matters.
8)	Follows national and international values and developments in the fields of interior architecture, architecture, design, and art, participates in teamworks, interdisciplinary and multidisciplinary work, and is knowledgeable in ethical issues,
9)	Gains an understanding of legal regulations and standards in interior architecture; and becomes aware of professional ethics and responsibilities.