• 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 UBP 4113 ALGORITHM DESIGN COMPULSORY 1 1 0 4

Offered By

Computer Programming Distance Learning

Level of Course Unit

Short Cycle Programmes (Associate's Degree)

Course Coordinator

ISMAIL DÜŞMEZ

Offered to

Computer Programming Distance Learning

Course Objective

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 Developing sample applications related to achievements 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 15 Developing sample applications related to achievements 16 Final exam

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.20 + FN* 0.80 4 RST RESIT 5 FCGR FINAL COURSE GRADE (RESIT) VZ*0.20 + BUT* 0.80 *** 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

30% 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

The Student Interview days are announced on the notice board outside each faculty member's door every semester

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours) Lectures 14 1 14 Tutorials 14 1 14 Preparations before/after weekly lectures 14 2 28 Preparation for midterm exam 1 15 15 Preparation for final exam 1 15 15 Midterm 1 1 1 Final 1 1 1 TOTAL WORKLOAD (hours) 88

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 PO.14 PO.15 LO.1 1 1 1 1 1 1 1 LO.2 1 1 1 1 1 LO.3 1 1 1 1 1 LO.4 1 1 1 1 1 LO.5 1 1 1 1 1 1