COURSE UNIT TITLE

: ALGORITHM DESIGN

DEGREE PROGRAMMES

Description of Individual Course Units

Course Unit Code Course Unit Title Type Of Course D U L ECTS
BLP 4113 ALGORITHM DESIGN COMPULSORY 1 1 0 4

Offered By

Computer Programming

Level of Course Unit

Short Cycle Programmes (Associate's Degree)

Course Coordinator

MURAT GÜNEY

Offered to

Computer Programming
Computer Programming (Evening)

Course Objective

With this course students; the basic knowledge of problem solving and necessary knowledge about computational efficiency, design, computational efficiency analysis and implementation knowledge and skills of algorithms widely used in computer science and computational problems

Learning Outcomes of the Course Unit

1   Ability to employ recursion as a problem solving and programming technique.
2   Ability to design algorithms employing randomization, dynamic programming, greedy heuristics.
3   Ability to analyze runtime efficiency of an algorithm.
4   Understanding algorithmic solutions to problems related to sets, sequences, strings, graphs, geometry.
5   Ability to design experiments for algorithm correctness and efficiency testing.

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description
1 Inductive design with an example: Insertionsort, analyzing algorithms
2 Divide-and-conquer with an example: Mergesort, analysis of mergesort
3 Asymptotic notation, common functions
4 Solving recurrences, common recurrences
5 Randomized algorithms with an example: Quicksort, expected runtime analysis
6 Graphs: Breadth-First Search
7 Midterm
8 Midterm
9 Graphs: Depth-First Search
10 Dynamic programming: Rod cutting
11 Dynamic programming: Elements of Dynamic Programming, Longest common subsequence problem
12 Dynamic programming: Knapsack problem, Pseudo-polynomial algorithms
13 Greedy algorithms: Activity selection
14 Greedy algorithms: Huffman encoding

Recomended or Required Reading

Textbook(s): Introduction to algorithms, Cormen, Leiserson, Rivest, SteIn, the mit press, 2nd edition, 2001.
Supplementary Book(s): Internet, Computer lab
References:
Materials: Operating system, application software

Planned Learning Activities and Teaching Methods

1. Lectures
2. Case Study

Assessment Methods

SORTING NUMBER SHORT CODE LONG CODE FORMULA
1 MTE MIDTERM EXAM
2 FN Final
3 FCG FINAL COURSE GRADE VZ*0.40 + FN* 0.60
4 RST RESIT
5 FCGR FINAL COURSE GRADE (RESIT) VZ*0.40 + BUT* 0.60


*** Resit Exam is Not Administered in Institutions Where Resit is not Applicable.

Further Notes About Assessment Methods

None

Assessment Criteria

Mid-term exam and final exams are measuring 5 learning outcomes in-class applications and this is the stage of the student to achieve the learning outcomes will be monitored.

Language of Instruction

Turkish

Course Policies and Rules

70% of the classes is compulsory to attend. Disciplinary investigation will be concluded with the opening of any act of dishonesty.

Contact Details for the Lecturer(s)

To be announced.

Office Hours

Will be announced by the instructor at the beginning of all semester.

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours)
Lectures 12 1 12
Tutorials 12 1 12
Preparations before/after weekly lectures 12 3 36
Preparation for midterm exam 1 12 12
Preparation for final exam 1 20 20
Midterm 1 1 1
Final 1 1 1
TOTAL WORKLOAD (hours) 94

Contribution of Learning Outcomes to Programme Outcomes

PO/LOPO.1PO.2PO.3PO.4PO.5PO.6PO.7PO.8PO.9PO.10PO.11PO.12PO.13PO.14PO.15
LO.11111111
LO.211111
LO.311111
LO.411111
LO.5111111

CONTACT INFORMATION
Dokuz Eylül Üniversitesi Cumhuriyet Bulvarı No: 144 35210 Alsancak / İZMİR
Phone: +90(232) 412 12 12 - Fax: +90 (232) 464 81 35

Copyright 2015 DEÜ. BİD

HOME / ABOUT US / DEGREE PROGRAMMES / GENERAL INFORMATION FOR STUDENTS / INTERNATIONAL RELATIONS