• HOME
• ABOUT US
  • Name Address
  • General Description
  • Governance
  • Academic Calendar
  • Degree Programmes
  • List of Programmes in English
  • General Admission and Registration Procedures
  • Credit Mobility and Recognition of Prior Learning
  • ECTS Credit Allocation
  • Academic Guidance
  • Contacts
• Degree Programmes
  • Third Cycle Programmes (Doctorate Degree)
  • Second Cycle Programmes (Master's Degree)
  • First Cycle Programmes (Bachelor's Degree)
  • Short Cycle Programmes (Associate's Degree)
• GENERAL INFORMATION FOR STUDENTS
  • Cost of Living
  • Accommodation
  • Meals
  • Medical Facilities
  • Facilities for Disabled Students
  • Insurance
  • Financial Supports
  • Student Affairs Office
  • Practical Information for International Students
  • Language Courses
  • Work Placement Possibilities
  • Sports, Social and Cultural Facilities
  • Student Associations and Clubs
  • About İzmir - Turkey
• INTERNATIONAL RELATIONS
  • International Relations Office
  • Registration Procedures
  • Agreements
  • Coordinators
  • Documents
  • List of Programmes in English
  • ECTS / DS Labels

Description of Individual Course Units

Course Unit Code Course Unit Title Type Of Course D U L ECTS ELECTIVE

Offered By

Computer Engineering

Level of Course Unit

First Cycle Programmes (Bachelor's Degree)

Course Coordinator

PROFESSOR DOCTOR DERYA BIRANT

Offered to

Computer Engineering

Course Objective

The purpose of this course is to enable students to understand and use various forms of advanced computer algoprithms.

Learning Outcomes of the Course Unit

1   Do expected value algorithm analysis 2   Design randomized algorithms for given problems 3   Do amortized analysis 4   Apply dynamic algorithms 5   Apply greedy algorithms 6   Apply graph algorithms

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description 1 Probabilistic Analysis, Indicator Random Variables and Randomized Algorithms 2 Review of Recursion, Divide-and-conquer, Master Method, Introduction of Akra-Bazzi Method. 3 Randomized Quicksort, Analysis of Randomized Quicksort 4 Medians and Order Statistics, Median of Medians Algorithm 5 Augmenting Data Structures 6 Skip Lists 7 Amortized Analysis 8 Dynamic Algorithms 9 Greedy Algorithms 10 Graph Algorithms 11 Minimum-Spanning Trees 12 Single-Source Shortest Path Algorithms 13 String Algorithms 14 String Algorithms

Recomended or Required Reading

Introduction To Algorithms, Third edition, THOMAS H. CORMEN CHARLES E. LEISERSON RONALD L. RIVEST CLIFFORD STEIN, The MIT Press Massachusetts Institute of Technology Cambridge, 2001

Planned Learning Activities and Teaching Methods

Lectures, tutroials and homeworks.

Assessment Methods

SORTING NUMBER SHORT CODE LONG CODE FORMULA 1 MTE MIDTERM EXAM 2 ASG ASSIGNMENT 3 FIN FINAL EXAM 4 FCG FINAL COURSE GRADE MTE * 0.30 + ASG * 0.20 + FIN * 0.50 5 RST RESIT 6 FCGR FINAL COURSE GRADE (RESIT) MTE * 0.30 + ASG * 0.20 + RST * 0.50

Further Notes About Assessment Methods

Asessment of individual work done at home and supervised written exams.

Assessment Criteria

Students are asessed through homeworks and exams.

Language of Instruction

English

Course Policies and Rules

Participation is mandatory.

Contact Details for the Lecturer(s)

Prof.Dr. Derya BIRANT derya@cs.deu.edu.tr

Office Hours

To be announced in the first week of lectures.

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours) Lectures 14 2 28 Tutorials 14 2 28 Preparations before/after weekly lectures 14 2 28 Preparation for midterm exam 1 14 14 Preparation for final exam 1 18 18 Preparing assignments 2 10 20 Final 1 2 2 Midterm 1 2 2 TOTAL WORKLOAD (hours) 140

Contribution of Learning Outcomes to Programme Outcomes

PO/LO PO.1 PO.2 PO.3 PO.4 PO.5 PO.6 PO.7 PO.8 PO.9 PO.10 LO.1 4 3 4 3 LO.2 4 5 4 3 3 LO.3 4 4 4 LO.4 4 3 3 LO.5 4 3 3 LO.6 4 3 3