Course Details

Return to Classes
Course Information
SemesterCourse Unit CodeCourse Unit TitleT+P+LCreditNumber of ECTS CreditsLast Updated Date
3COMP203DATA STRUCTURES AND ALGORITHMS3+2+04714.08.2025

 
Course Details
Language of Instruction English
Level of Course Unit Bachelor's Degree
Department / Program COMPUTER ENGINEERING
Type of Program Formal Education
Type of Course Unit Compulsory
Course Delivery Method Face To Face
Objectives of the Course The purpose of this course is to provide introduction to data structures and algorithms.
Course Content The topics include fundamental data structures, algorithm analysis, recursion, stacks, queues, list and iterator ADTs, and trees.
Course Methods and Techniques 11-12 week lab study and 14-15 weeks theretical class. The course is supported with homework and quiz.
Prerequisites and co-requisities ( COMP112 )
Course Coordinator None
Name of Lecturers Instructor Dr. Cavidan Yakupoğlu Karaağaç cavidan.yakupoglu@agu.edu.tr
Assistants None
Work Placement(s) No

Recommended or Required Reading
Resources • Java How to Program, Early Objects., P. Deitel and H. Deitel, 11th Edition, Prentice Hall, 2017. • Core Java, vol. I–Fundamentals, 12th edition, C. S. Horstmann and G. Cornell, Upper Saddle River, NJ: Prentice Hall, 2021. • The Java Programming Language, 4th edition, K. Arnold, J. Gosling, and D. Holmes, The Java Series, Upper Saddle River, NJ: Prentice Hall, 2005. • Eclipse and Java for Total Beginners http://eclipsetutorial.sourceforge.net/totalbeginnerlessons.html
Course Notes Course content is taken from this book in general. Data Structures and Algorithms in Java, 6th edition, M. T. Goodrich, R. Tamassia, M. H. Goldwasser, Wiley, 2014.

Course Category
Mathematics and Basic Sciences %20
Engineering %35
Engineering Design %35
Social Sciences %0
Education %0
Science %0
Health %0
Field %10

Planned Learning Activities and Teaching Methods
Activities are given in detail in the section of "Assessment Methods and Criteria" and "Workload Calculation"

Assessment Methods and Criteria
In-Term Studies Quantity Percentage
Yarıl yılSonu Sınavı/Dönem Projesinin Başarı Notuna Katkısı 1 % 25
Quiz/Küçük Sınav 2 % 10
Ödev 5 % 20
Laboratuar 11 % 15
Final examination 1 % 30
Total
20
% 100

 
ECTS Allocated Based on Student Workload
Activities Quantity Duration Total Work Load
Belirsiz 1 2 2
Münazara 1 3 3
Yazılı Sınav 1 15 15
F2F Dersi 1 3 3
Ev Ödevi 5 5 25
Teslim İçin Hazırlık 5 2 10
Kısa Sınav 2 5 10
Okuma 1 5 5
Rapor 5 1 5
Araştırma 1 5 5
Kişisel Çalışma 2 5 10
Yazılım Deneyimi 11 5 55
Yüz Yüze Ders 14 3 42
Final Sınavı 1 20 20
Total Work Load   Number of ECTS Credits 7 210

 
Course Learning Outcomes: Upon the successful completion of this course, students will be able to:
NoLearning Outcomes
1 Describe fundamental data structures and algorithm
2 Analyze an algorithm for a computational problem
3 Develop efficient computer programs using appropriate data structures and algorithms in Java
4 Solve computational problems by applying the data structure and algorithm design concepts

 
Weekly Detailed Course Contents
WeekTopicsStudy MaterialsMaterials
1 Java primer
2 Object oriented design
3 Object oriented design, fundamental data Structures, arrays
4 Fundamental data structures, arrays, linked lists
5 Algorithm analysis
6 Recursions-1
7 Recursions-2
8 Semester break
9 Midterm exam and active learning week: Group studies
10 Stacks
11 Queues
12 Lists and iterator ADTs
13 Trees
14 Binary trees
15 Binary search trees

 
Contribution of Learning Outcomes to Programme Outcomes
P1 P2 P3 P4 P5 P6 P7 P8 P9 P10 P11 P12 P13 P14 P15
All 5 4 5 5 3 1 2 1 1 1 5 1 5 1 1
C1 4 4 5 4 2 1 2 2 1 1 5 1 5 1 1
C2 5 5 5 4 2 1 2 1 1 1 5 1 5 1 1
C3 5 4 5 5 3 1 2 1 1 1 5 1 5 1 1
C4 5 4 5 5 3 1 2 1 1 1 5 1 5 1 1

  Contribution: 1: Very Slight 2:Slight 3:Moderate 4:Significant 5:Very Significant

  
  https://sis.agu.edu.tr/oibs/bologna/progCourseDetails.aspx?curCourse=78308&lang=en
Return to Classes