SEN2211 Data Structures and Algorithms IBahçeşehir UniversityDegree Programs MECHATRONICS (TURKISH)General Information For StudentsDiploma SupplementErasmus Policy StatementNational QualificationsBologna Commission
MECHATRONICS (TURKISH)
Associate TR-NQF-HE: Level 5 QF-EHEA: Short Cycle EQF-LLL: Level 5

Course Introduction and Application Information

Course Code Course Name Semester Theoretical Practical Credit ECTS
SEN2211 Data Structures and Algorithms I Spring
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: Associate (Short 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 improve fundamental computer knowledge, to encourage students using office and package programs.
2) Ability to have and use of fundamental mathematics knowledge and skills the usage of relevant materials.
3) Ability to recognize general structures of machine equipments and the features of shaping
4) Ability to grasp manufacturing processes and cutting tool materials, materials, statics, mechanics and fluid science fundemantal knowledge.
5) Ability to draw assembly and auxilary devices as well as to draw whole or details of a system.
6) Ability to have a knowledge of fundemantal manufacturing process such as turning, milling, punching,grinding and welding techniques and to have a self esteem in order to work behind the bench.
7) Ability to do computer aided design and write program on digital benches.
8) Ability to prepare project report, follow up project process and implement projects.
9) ability to learn the areas of usage of electronic circuit components. Ability to grasp and write programs for micro controllers and for their components. Ability to design relevant circuits.
10) Ability to understand the electric motors principles and AC-DC analysis
11) Ability to gain a dominaion on visual programming
12) Having the ability to communicate efficiently in verbal and written Turkish, to know at least one foreign language in order to communicate with the colleagues and customers.