Information Package

Program of Statistics and Computer Sciences

İST410

ALGORITHMS

Course Code
İST410
Semester
-
Theory+Practice
3 + 0
ECTS
5
Course TypeElective Course
Course LevelBachelor's Degree
Year of Study-
Semester-
ECTS5
Name of Lecturer(s) -
Learning Outcomes

At the end of this course, the students;

  1. learn the basic concepts and terminology of algorithms
Mode of DeliveryFace to face
PrerequisitesNo
Recommended Optional Programme ComponentsThere is no recommended optional programme component for this course.
Course DescriptionSorting Algorithms; Search Trees, Heaps, and Hashing; Divide and Conquer; Dynamic Programming; Graph Algorithms; Shortest Paths; Network Flow; Number-Theoretic Algorithms; Polynomial and Matrix Calculations; Paralel Computing
Course Contents
WEEK TOPICS
1st Week Introduction
2nd Week rowth of functions
3rd Week Recurrences
4th Week Quicksort
5th Week Order Statistics
6th Week Heaps
7th Week Amortized Analysis
8th Week MIDTERM
9th Week Hashing
10th Week Binary Search Trees
11th Week Greedy Algorithms
12th Week Shortest Paths
13th Week Network Flow
14th Week MIDTERM II
Recommended or Required Reading"T. H. Cormen, C:E Leierson, R.L. Rivest And C. Stein, Introduction to ALgorithms, 2nd Edition, , Springer, 2001."
Planned Learning Activities and Teaching Methods
  • Lecture
  • Questions/Answers
  • Case Study
  • Problem Solving
Assessment Methods and Criteria
Quantity Percentage (%)
Mid-term 2 20
Assignment 5 5
Quiz 5 5
Total(%) 30
Contribution of In-term Studies to Overall Grade(%) 30
Contribution of Final Examination to Overall Grade(%) 70
Total(%) 100
Language of InstructionTurkish
Work Placement(s)No
LO1
K1 X
K2 X
K3 X
K4
K5
K6 X
K7 X
K8
K9
K10 X
K11
K12