Home  »  Faculty of Engineering »  Program of Computer Engineering (English 30%)

COURSE UNIT TITLECOURSE UNIT CODESEMESTERTHEORY + PRACTICE (Hour)ECTS
ALGORITHMS BİL367 Fifth Term (Fall) 3 + 1 5

TYPE OF COURSE UNITCompulsory Course
LEVEL OF COURSE UNITBachelor's Degree
YEAR OF STUDY3
SEMESTERFifth Term (Fall)
NUMBER OF ECTS CREDITS ALLOCATED5
NAME OF LECTURER(S)Assistant Professor Didem Ölçer
LEARNING OUTCOMES OF THE COURSE UNIT At the end of this course, the students;
1) Learn algorithm complexity anlaysis and how to compare algorithms
2) Learn algorithm design techniques
3) Get practice on efficient programming
4) Get ability to use graphs in problem solving
MODE OF DELIVERYFace to face
PRE-REQUISITES OF THE COURSEYes(BİL265)
RECOMMENDED OPTIONAL PROGRAMME COMPONENTNone
COURSE DEFINITIONThe efficiency of algorithms. Asymptotic notations. Nonrecursive and recursive algorithms. Greedy technique and algorithms. Divide and conquer, transform and conquer. Dynamic programming approach and covered problems. Exploring graphs (backtracking, branch-and-bound). Probabilistic algorithms.
COURSE CONTENTS
WEEKTOPICS
1st Week The efficiency of algorithms
2nd Week Asymptotic notations
3rd Week Nonrecursive and recursive algorithms
4th Week Greedy technique and algorithms
5th Week Greedy technique and algorithms
6th Week Divide and conquer, transform and conquer
7th Week Divide and conquer, transform and conquer
8th Week Mid-term
9th Week Dynamic programming approach and covered problems
10th Week Dynamic programming approach and covered problems
11th Week Exploring graphs (backtracking, branch-and-bound)
12th Week Exploring graphs (backtracking, branch-and-bound)
13th Week Probabilistic algorithms
14th Week Probabilistic algorithms
RECOMENDED OR REQUIRED READING1. Cormen, Introduction to Algorithms, 2.Ed. MIT Press, 2001
2. Gilles Brassard, Paul Bratley. Fundamentals of algorithmics. Prentice Hall, 1996.
3. D.R. Stinson, An introduction to the design and analysis of algorithms, Charles Babbage Research Centre, Winnipeg, Manitoba, 1987.
PLANNED LEARNING ACTIVITIES AND TEACHING METHODSLecture,Questions/Answers,Problem Solving,Experiment,Project,Presentation,Report Preparation
ASSESSMENT METHODS AND CRITERIA
 QuantityPercentage(%)
Mid-term130
Assignment520
Quiz210
Total(%)60
Contribution of In-term Studies to Overall Grade(%)60
Contribution of Final Examination to Overall Grade(%)40
Total(%)100
ECTS WORKLOAD
Activities Number Hours Workload
Midterm exam11,51,5
Preparation for Quiz248
Individual or group work
Preparation for Final exam14040
Course hours14342
Preparation for Midterm exam13030
Laboratory (including preparation)14114
Final exam11,51,5
Homework21020
Quiz2,51
Total Workload158
Total Workload / 305,26
ECTS Credits of the Course5
LANGUAGE OF INSTRUCTIONTurkish
WORK PLACEMENT(S)No
  

KEY LEARNING OUTCOMES (KLO) / MATRIX OF LEARNING OUTCOMES (LO)
LO1LO2LO3LO4
K1  X   X   X   X
K2  X   X   X   X
K3  X   X   X   X
K4    X     X
K5  X      
K6       
K7       
K8       
K9       
K10       
K11       
K12