BAHÇEŞEHİR UNIVERSITY BİLGİ PAKETİ / DERS KATALOĞU
| 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 |
| 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 : | Assist. Prof. ÖZGE YÜCEL KASAP |
| Course Lecturer(s): |
Assist. Prof. BETÜL ERDOĞDU ŞAKAR RA MERVE ARITÜRK Prof. Dr. NAFİZ ARICA Assist. Prof. 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 teaching methods of the course are lecture and practice. |
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 | 2 | % 25 |
| Quizzes | 2 | % 15 |
| 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 | Duration (Hours) | Workload |
| Course Hours | 14 | 2 | 28 |
| Laboratory | 14 | 2 | 28 |
| Homework Assignments | 1 | 8 | 8 |
| Quizzes | 2 | 20 | 40 |
| Midterms | 1 | 30 | 30 |
| Final | 1 | 30 | 30 |
| 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) | 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. |