|
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
|
Gain an understanding of the mathematical concepts needed to study the performance of computer programs
Learn major algorithms
Learn asymptotic analysis of algorithms
Learn algorithm design techniques
|
|
Course Content
|
This course introduces students to the analysis and design of computer algorithms. The material covered in this course draws from discrete mathematics, elementary real analysis, combinatorics, algorithms and data structures. Topics include sorting algorithms, growth of functions, divide and conquer, randomized algorithms, order statistics, elementary data structures.
|
|
Course Methods and Techniques
|
Grading Policy
The final grades will be computed based on the general performance of the class and the distribution of grades (i.e. who deserves A and who deserves F). The grading strategy will be a combination of the standard catalogue grading and curve grading.
Attendance Policy
Each student is expected to attend to at least 50% of the theoretical classes. If not he/she will get NA as the final grade.
Late Submission Policy
It is the student s responsibility to follow the classes and do the assignments on time. Late submissions will be subject to a penalty of 25% if submitted within one week after the due date and %50 if submitted after one week.
Make-Up Policy
There are no make-ups in homework assignments, labs and quizzes. The student may be exempt from these assignments if a written and formal documentation is provided. Possible reasons for excused absences include serious illnesses, illness or death of a family member, university related trips and other serious circumstances. Acceptable documents for claiming an excused absence include medical doctor’s statements, petitions related to official university travels, court related documents, etc. If the student misses an exam (midterms or final) he or she can take a make-up exam upon submitting a formal document.
|
|
Prerequisites and co-requisities
|
( COMP203 )
|
|
Course Coordinator
|
Asist Prof.Dr. ZAFER AYDIN zafer.aydin@agu.edu.tr
|
|
Name of Lecturers
|
None
|
|
Assistants
|
None
|
|
Work Placement(s)
|
No
|
Recommended or Required Reading
|
Resources
|
Insertion sort, merge sort (LO1, LO2, LO3, LO4, LO5)
Analyzing algorithms, designing algorithms (LO1, LO3, LO5)
Growth of functions, asymptotic notation, standard notations and common functions (LO1, LO4)
Divide and conquer, maximum subarray problem, Strassen’s matrix multiplication algorithm (LO1, LO2, LO4, LO5)
Substitution method, recursion tree method, master method (LO1)
Heap sort, priority queues (LO1, LO2, LO3, LO4)
Probabilistic analysis and randomized algorithms (LO1, LO2)
Quicksort (LO1, LO2, LO3, LO4)
Sorting in linear time (LO1, LO2, LO3, LO4)
Medians and order statistics (LO1, LO2, LO4)
|
|
|
|
|
|
|
|
|
|
|
|
|
|