Home  »  Institute of Science and Engineering »  Ph.D. in Computer Engineering

COURSE UNIT TITLECOURSE UNIT CODESEMESTERTHEORY + PRACTICE (Hour)ECTS
ADVANCED DATA STRUCTURES AND ALGORITHMS BİL611 Program Course List-------- 3 + 0 10

TYPE OF COURSE UNITElective Course
LEVEL OF COURSE UNITDoctorate Of Science
YEAR OF STUDY-
SEMESTERProgram Course List--------
NUMBER OF ECTS CREDITS ALLOCATED10
NAME OF LECTURER(S)-
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) Get practice on time and space efficient programming
3) Get ability to use advanced data structures for effective algorithm development.
MODE OF DELIVERYFace to face
PRE-REQUISITES OF THE COURSENo
RECOMMENDED OPTIONAL PROGRAMME COMPONENTNone
COURSE CONTENTS
WEEKTOPICS
1st Week Algorithm complexity
2nd Week Asymptotic notation
3rd Week Searching
4th Week Sorting
5th Week Divide-and-Conquer
6th Week Dynamic programming
7th Week Greedy methods
8th Week Mid-term
9th Week Applications
10th Week Graph theory
11th Week Shortest paths
12th Week Minimum spanning tree
13th Week Heuristics
14th Week NP hardness and completeness,Recent challenges
RECOMENDED OR REQUIRED READINGCormen, Introduction to Algorithms, 2.Ed., MIT Press, 2001
Gilles Brassard, Paul Bratley. Fundamentals of algorithmics. Prentice Hall, 1996.
D.R. Stinson, An introduction to the design and analysis of algorithms, Charles Babbage Research Centre, Winnipeg, Manitoba, 1987
PLANNED LEARNING ACTIVITIES AND TEACHING METHODSProject
ASSESSMENT METHODS AND CRITERIA
 QuantityPercentage(%)
Mid-term130
Project130
Total(%)60
Contribution of In-term Studies to Overall Grade(%)60
Contribution of Final Examination to Overall Grade(%)40
Total(%)100
LANGUAGE OF INSTRUCTIONTurkish
WORK PLACEMENT(S)No
  

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