Computer Engineering Department

Algorithms And Data Structures(INF224-A)

Course Code Course Name Semester Theory Practice Lab Credit ECTS
INF224-A Algorithms And Data Structures 3 3 0 2 3 4
Prerequisites
Admission Requirements
Language of Instruction French
Course Type Compulsory
Course Level Bachelor Degree
Course Instructor(s) Gülfem ALPTEKİN gulfem@gmail.com (e-mail)
Assistant
Objective The aim of the course is to equip student with skills of choosing the most appropriate data structure, using these data structures into different types of algorithms, analyzing the performance of proposed algorithms and choosing the most efficient one and programming these algorithms in C.
Content Week 1: Algorithm analysis.
Week 2: Principal data structures (arrays, linked lists, queues).
Week 3: Tree structures, binary search tree.
Week 4: AVL tree structure.
Week 5: Tree traversal algorithms.
Week 6: Hash functions and tables.
Week 7: Graph structure.
Week 8: Midterm.
Week 9: Graph algorithms (shortest path, minimum spanning tree).
Week 10: Sorting algorithms.
Week 11: Sorting algorithms.
Week 12: Search algorithms.
Week 13: Search algorithms.
Week 14: Coding algorithms.
Course Learning Outcomes At the end of this course, students obtain the following information:
• Having deep knowledge on each data structure.
• Choosing the most appropriate data structure in respect to the available data.
• Using the data structures in different algorithms.
• Analyzing the performance of algorithms.
Teaching and Learning Methods Lecture, Discussion, Demonstration, Case Study, Problem Solving, Cooperative Learning, Project, Brainstorming
References 1. M.A. Weiss, Data Structures & Algorithm Analysis in C++, 1999, Addison Wesley.
2. A.M. Tanenbaum, Data Structures using C, 1989, Prentice Hall.
3. A. Drozdek, Data Structures and Algorithmss in C++, 2004, Course Technology.
4. R. Sedgewick, Algorithms in C, Parts 1-4: Fundamentals, Data Structures, Sorting, Searching, 1997, Addison-Wesley.
5. Olcay Taner Yıldız, C && Java ile Veri Yapılarına Giriş, Boğaziçi Üniversitesi Yayınevi, 2013.
Print the course contents
Theory Topics
Week Weekly Contents
1 Algorithm analysis.
2 Principal data structures (arrays, linked lists, queues).
3 Tree structures, binary search tree.
4 AVL tree structure.
5 Tree traversal algorithms.
6 Hash functions and tables.
7 Graph structure.
8 Midterm.
9 Graph algorithms (shortest path, minimum spanning tree).
10 Sorting algorithms.
11 Sorting algorithms.
12 Search algorithms.
13 Search algorithms.
14 Coding algorithms.
Practice Topics
Week Weekly Contents
Contribution to Overall Grade
  Number Contribution
Contribution of in-term studies to overall grade 4 50
Contribution of final exam to overall grade 1 50
Toplam 5 100
In-Term Studies
  Number Contribution
Assignments 3 15
Presentation 0 0
Midterm Examinations (including preparation) 1 35
Project 0 0
Laboratory 0 0
Other Applications 0 0
Quiz 0 0
Term Paper/ Project 0 0
Portfolio Study 0 0
Reports 0 0
Learning Diary 0 0
Thesis/ Project 0 0
Seminar 0 0
Other 0 0
Toplam 4 50
No Program Learning Outcomes Contribution
1 2 3 4 5
1 Knowledge and understanding of a wide range of basic sciences (math, physics, etc.) and the main concepts of engineering, X
2 Ability to use fundamental sciences in computer engineering, X
3 Ability to access information and resources to achieve the ability to use databases and other information, X
4 Ability to analyze the process or the component of a system, modeling, produce solution algorithms, application and development analytically, X
5 Ability to distinguish information technologies effectively, to use and to adapt emerging technologies, X
6 Ability to participate in working groups and have a multidisciplinary team spirit, X
7 Ability to speak at least two foreign languages, French and English, X
8 Knowledge on entrepreneurship and innovation, X
9 Ability to take responsibility and to satisfy the requirements, X
10 Knowledge of work ethics and labor law, X
11 Awareness of the need for continuous improvement of lifelong learning. X
Activities Number Period Total Workload
Class Hours 14 3 42
Working Hours out of Class 14 1 14
Assignments 2 4 8
Presentation 0 0 0
Midterm Examinations (including preparation) 1 6 6
Project 0 0 0
Laboratory 2 14 28
Other Applications 0 0 0
Final Examinations (including preparation) 1 10 10
Quiz 0 0 0
Term Paper/ Project 0 0 0
Portfolio Study 0 0 0
Reports 0 0 0
Learning Diary 0 0 0
Thesis/ Project 0 0 0
Seminar 0 0 0
Other 0 0 0
Total Workload 108
Total Workload / 25 4,32
Credits ECTS 4
Scroll to Top