|
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. The topics include fundamental data structures, algorithm analysis, recursion, stacks, queues, list and iterator ADTs, and trees.
|
|
Course Content
|
The purpose of this course is to provide the students with solid foundations in the basic concepts of programming: data structures and algorithms. The main objective of the course is to teach the students how to select and design data structures and algorithms that are appropriate for problems that they might encounter. This course is also about comparing algorithms and studying their correctness and computational complexity. This course offers the students a mixture of theoretical knowledge and practical experience using Java.
|
|
Course Methods and Techniques
|
Lectures
Each week lectures will be in class. Attendance will be taken in class.
Quizzes
You will work multiple choice or explanation questions at the beginning of a class. Quizzes aim to make the students come prepared to lectures.
Labs
In laboratory assignments, you will work on a self-paced problem. At the
end of each lab session you must submit your work to Canvas. In
some laboratory sessions we can cover lecture material.
Homework
You can discuss homework with other students but your solution should be developed alone and should not resemble to others.
Exams
The exams will require you to solve computing problems, which are typically submitted as a text document and/or source codes. You are not allowed to collaborate with others in exams.
|
|
Prerequisites and co-requisities
|
( COMP112 )
|
|
Course Coordinator
|
None
|
|
Name of Lecturers
|
Asist Prof.Dr. VEHBİ ÇAĞRI GÜNGÖR zafer.aydin@agu.edu.tr
|
|
Assistants
|
None
|
|
Work Placement(s)
|
No
|