SEN2211 Data Structures and Algorithms IBahçeşehir UniversityDegree Programs CARTOON AND ANIMATIONGeneral Information For StudentsDiploma SupplementErasmus Policy StatementNational QualificationsBologna Commission
CARTOON AND ANIMATION
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 theoretical and practical knowledge and skills in cartoon and animation.
2) To be able to develop research, observation-experience, evaluation skills in the field of cartoon and animation and effectively communicate ideas, convincing actions and emotions using cartoon and animation and performance principles in every direction.
3) Making animated films with various artistic styles and techniques.
4) Designing the cartoon and animation production process using initiative, applying it with creativity and presenting it with personal style.
5) To be a team member in the production process of cartoon and animations, to be able to take responsibility and manage the team members under their responsibility and to lead them.
6) To be able to evaluate cartoon and animations in the framework of their knowledge and skills.
7) To be able to define and manage learning requirements in the field of cartoon and animation.
8) To be able to communicate with related organizations by sharing scientific and artistic works in cartoon and animation and to share information and skills in the field.
9) To monitor developments in the field of cartoon and animation using foreign languages ​​and to communicate with foreign colleagues.
10) To be able to use general information and communication technologies at advanced level with all kinds of technical tools and computer software used in cartoon and animations.
11) Using critical thinking skills and problem solving strategies in all aspects of development and production, effectively communicating ideas, emotions and intentions visually, verbally and in writing, and effectively incorporating technology in the development of cartoon and animation projects.
12) To have sufficient knowledge about ethical values ​​and universal values ​​in the field of cartoon and animation.