Eskisehir Technical University Info Package Eskisehir Technical University Info Package
  • Info on the Institution
  • Info on Degree Programmes
  • Info for Students
  • Turkish
    • Turkish Turkish
    • English English
About the Program Educational Objectives Key Learning Outcomes Course Structure Diagram with Credits Field Qualifications Matrix of Course& Program Qualifications Matrix of Program Outcomes&Field Qualifications
  • Faculty of Engineering
  • Department of Computer Engineering (English)
  • Course Structure Diagram with Credits
  • Computer Algorithm Design
  • Description
  • Description
  • Learning Outcomes
  • Course's Contribution to Prog.
  • Learning Outcomes & Program Qualifications

Course Introduction Information

Code - Course Title BİM304 - Computer Algorithm Design
Course Type Required Courses
Language of Instruction İngilizce
Laboratory + Practice 3+0
ECTS 6.0
Course Instructor(s) DOKTOR ÖĞRETİM ÜYESİ SELCAN KAPLAN BERKAYA
Mode of Delivery The mode of delivery of this course is face-to-face.
Prerequisites There is no prerequisite or co-requisite for this course.
Courses Recomended Data Structures and Algorithms
Recommended Reading List Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2022). Introduction to algorithms. MIT press.
Assessment methods and criteria 1 Midterm Exam, 1 Final Exam, Homeworks, Project, Quizzes.
Work Placement Students are required to do 2 projects
Sustainability Development Goals Quality Education , Industry, Innovation and Infrastructure

Content

Weeks Topics
Week - 1 Introduction, Mathematical Background, Asymptotic Notations
Week - 2 Iterative sorting algorithms: BubbleSort, SelectionSort, InsertSort
Week - 3 Recursive Algorithms: MergeSort, QuickSort, Medians
Week - 4 Recursive Algorithms: MergeSort, QuickSort, Medians
Week - 5 Heaps and HeapSort
Week - 6 Lower Bounds on Comparison-based Sorting Algorithms Linear Time Sorting Algorithms: Counting Sort and Radix Sort
Week - 7 MIDTERM
Week - 8 Graphs: BFS, DFS
Week - 9 Union/Find Data Structure
Week - 10 Topological Sort
Week - 11 Minimum Spanning Trees
Week - 12 Shortest Path Algorithms
Week - 13 ClosestPair-ConvexHull-FarthestPair
Week - 14 Greedy Algorithms: Activity Selection Problem, Huffman Coding

Learning Activities and Teaching Methods

  • Teaching Methods
  • Lecture
  • Discussion
  • Question & Answer
  • Drill - Practise
  • Competences
  • Rational
  • Questoning
  • Organization and planning
  • Elementary computing skills

Assessment Methods

Assessment Method and Passing Requirements
Quamtity Percentage (%)
1.Midterm Exam 1 30
Homework 1 30
Final Exam 1 40
Toplam (%) 100
  • Info on the Institution
  • Name and Adress
  • Academic Calendar
  • Academic Authorities
  • General Description
  • List of Programmes Offered
  • General Admission Requirements
  • Recognition of Prior Learning
  • Registration Procedures
  • ECTS Credit Allocation
  • Academic Guidance
  • Info on Degree Programmes
  • Doctorate Degree / Proficieny in Arts
  • Master's Degree
  • Bachelor's Degree
  • Associate Degree
  • Open&Distance Education
  • Info for Students
  • Cost of living
  • Accommodation
  • Meals
  • Medical Facilities
  • Facilities for Special Needs Students ı
  • Insurance
  • Financial Support for Students
  • Student Affairs Office
  • Info for Students
  • Learning Facilities
  • International Programmes r
  • Practical Information for Mobile Students
  • Language courses
  • Internships
  • Sports and Leisure Facilities
  • Student Associations