MATHEMATICS
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	Spring	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)	To have a grasp of basic mathematics, applied mathematics and theories and applications in Mathematics
2)	To be able to understand and assess mathematical proofs and construct appropriate proofs of their own and also define and analyze problems and to find solutions based on scientific methods,
3)	To be able to apply mathematics in real life with interdisciplinary approach and to discover their potentials,
4)	To be able to acquire necessary information and to make modeling in any field that mathematics is used and to improve herself/himself,	4
5)	To be able to tell theoretical and technical information easily to both experts in detail and non-experts in basic and comprehensible way,
6)	To be familiar with computer programs used in the fields of mathematics and to be able to use at least one of them effectively at the European Computer Driving Licence Advanced Level,
7)	To be able to behave in accordance with social, scientific and ethical values in each step of the projects involved and to be able to introduce and apply projects in terms of civic engagement,
8)	To be able to evaluate all processes effectively and to have enough awareness about quality management by being conscious and having intellectual background in the universal sense,	4
9)	By having a way of abstract thinking, to be able to connect concrete events and to transfer solutions, to be able to design experiments, collect data, and analyze results by scientific methods and to interfere,
10)	To be able to continue lifelong learning by renewing the knowledge, the abilities and the competencies which have been developed during the program, and being conscious about lifelong learning,
11)	To be able to adapt and transfer the knowledge gained in the areas of mathematics ; such as algebra, analysis, number theory, mathematical logic, geometry and topology to the level of secondary school,
12)	To be able to conduct a research either as an individual or as a team member, and to be effective in each related step of the project, to take role in the decision process, to plan and manage the project by using time effectively.