| OPERATING ROOM SERVICES (TURKISH) | |||||
| Associate | TR-NQF-HE: Level 5 | QF-EHEA: Short Cycle | EQF-LLL: Level 5 | ||
| 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. |
| 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. |
|
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. |
| 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. |
| 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 |
| 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 |
| 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 | |
| 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 | |
| No Effect | 1 Lowest | 2 Low | 3 Average | 4 High | 5 Highest |
| Program Outcomes | Level of Contribution | |
| 1) | The use of theoretical knowledge in practice | |
| 2) | Effective use the terminology of the field | |
| 3) | Behave according to basic professional legislation related the field | |
| 4) | Use information and communication technology, express professional knowledge through written and verbal/non-verbal communication | |
| 5) | Express the social, scientific, cultural and ethical values of professional | |
| 6) | Behave according to quality management and processes and participate in these processes | |
| 7) | Develop themselves personally and professionally updating knowledge, skills and competencies of the field with lifelong learning awareness | |
| 8) | Use basic level knowledge and skills related the field, interpret and evaluate the data, identify potential problems and solve them | |
| 9) | Implement techniques according to developing technology and use new tools and devices | |
| 10) | The ability to prepare the operating room for surgery | |
| 11) | The ability to admit the patient into the operating room and to provide assistance for post - operational transport | |
| 12) | The ability to have theoretical and practical knowledge related to the field at a basic level |