• 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 BIL 3015 THE DESIGN AND ANALYSIS OF ALGORITHMS COMPULSORY 2 2 0 6

Offered By

Computer Science

Level of Course Unit

First Cycle Programmes (Bachelor's Degree)

Course Coordinator

PROFESSOR DOCTOR MURAT ERŞEN BERBERLER

Offered to

Computer Science

Course Objective

To teach the design and analysis of algorithms concepts to solve computer science problems.

Learning Outcomes of the Course Unit

1   Have a knowledge of basic concepts of the design and analysis of algorithms. 2   Be able to solve problems of the design and analysis of algorithms. 3   Be able to solve computer science problems by using the design and analysis of algorithms concepts. 4   Be able to design efficient algorithms by using the design and analysis of algorithms concepts. 5   Be able to solve problems of different type of disciplines by using concepts of the design and analysis of algorithms.

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

BIL 2011 - Algorithms and Data Structures

Recomended Optional Programme Components

None

Course Contents

Week Subject Description 1 Fundamentals of algorithmic problem solving 2 Important problem types 3 Analysis framework 4 Asymptotic notations and basic efficiency classes 5 Mathematical analysis of non-recursive algorithms 6 Mathematical analysis of recursive algorithms 7 Empirical analysis of algorithms 8 General review 9 Sorting networks 10 Matrix operations 11 Number theoretic algorithms 12 String matching 13 Dynamic programming 14 Greedy algorithms NP-completeness and approximation algorithms

Recomended or Required Reading

Textbook(s): Introduction to Algorithms, Thomas Cormen, CEL, RLR, CS, ISBN 0262032937. Supplementary Book(s): Introduction to The Design and Analysis of Algorithms, Anany Levitin, ISBN 0321364139.

Planned Learning Activities and Teaching Methods

Will be announced.

Assessment Methods

SORTING NUMBER SHORT CODE LONG CODE FORMULA 1 VZ Vize 2 FN Final 3 BNS BNS VZ * 0.40 + FN * 0.60 4 BUT Bütünleme Notu 5 BBN Bütünleme Sonu Başarı Notu 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

Will be announced.

Language of Instruction

Turkish

Course Policies and Rules

Will be announced.

Contact Details for the Lecturer(s)

murat.berberler@deu.edu.tr

Office Hours

Will be announced.

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 5 70 Preparation for midterm exam 1 12 12 Preparation for final exam 1 12 12 Final 1 2 2 Midterm 1 2 2 TOTAL WORKLOAD (hours) 154

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 PO.11 PO.12 PO.13 LO.1 5 5 5 LO.2 5 5 5 LO.3 5 5 5 LO.4 5 5 5 LO.5 5 5 5