Scribd
Upload
44 views1 page

315-Fall 2022

This document provides information about the CENG 315 - Algorithms course for the Fall 2022-2023 semester at Middle East Technical University. It outlines the instructors, teaching assistants, lecture times and locations. The course will cover topics such as algorithm analysis, sorting, dynamic programming, graph algorithms, string processing and NP-completeness. Students will complete programming exams throughout the semester and a midterm exam. Their grade will be based on the exams, a final exam, and six of the eight programming exams with the highest grades will count.

Uploaded by

Furkan KÖROĞLU
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
44 views1 page

315-Fall 2022

This document provides information about the CENG 315 - Algorithms course for the Fall 2022-2023 semester at Middle East Technical University. It outlines the instructors, teaching assistants, lecture times and locations. The course will cover topics such as algorithm analysis, sorting, dynamic programming, graph algorithms, string processing and NP-completeness. Students will complete programming exams throughout the semester and a midterm exam. Their grade will be based on the exams, a final exam, and six of the eight programming exams with the highest grades will count.

Uploaded by

Furkan KÖROĞLU
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

MIDDLE EAST TECHNICAL UNIVERSITY

Department of Computer Engineering


CEng 315 – Algorithms
Fall 2022-2023

Instructors: Prof. Dr. İsmail Hakkı Toroslu (Sections 1,2)

Teaching Assistants: Asli Umay Ozturk, Oguz Godelek, Merve Asiler

Lecture Hours: (4x35 minutes lectures)


Section 1: Tue (BMB 1) 9:00-9:35 & 9:50-10:25, Thr (BMB 1) 9:00-9:35 & 9:50-10:25
Section 2: Mon (BMB 2) 9:00-9:35 & 9:50-10:25, Thr (BMB 3) 10:45-11:20 & 11:35-12:10

Outline
1. Introduction to Algorithms (1 week)
- Algorithms, Analysis and Design (Chapters 1, 2)
2. Algorithm Analysis (2 weeks)
- Growth of Functions (Chapter 3)
- Summations (Chapter 3)
- Recurrences (Chapter 4)
3. Sorting (2 weeks)
- Comparison-Based Sorting (Chapter 7)
- Sorting Algorithms in Linear Time (Chapter 8)
4. Dynamic Programming (2 week) (Chapter 15)
5. MT EXAM (WEEK 8)
6. Graph Algorithms (2 weeks)
- Elementary Graph Algorithms (BFS, DFS, Top. Sort, Strongly Con. Comp, etc.) (Chapters 22)
- Minimum Spanning Trees (Chapter 23)
7. Graph Algorithms (2 weeks)
- Single-Source Shortest Paths (Chapter 24)
- All-Pairs Shortest Paths (Chapter 25)
- Maximum Flow (Chapter 26)
8. String Processing (1 week)
- String Matching (Chapter 32)
- Huffman codes (Chapter 16.3)
9. NP-Completeness (1 week) (Chapter 34)

Textbook
Introduction to Algorithms by T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein, Mc Graw-Hill.

Grading
8 Programming Exams (Weeks 4, 5, 6, 7, 10, 11, 12, 13) 30%
MT Exam (Week 8, Thursday November 24th) 30%
Final Exam (TBA) 40%

Policy
o The course officially has 3 lecture hours (3x50 minutes). Officially 4 lecture hours have been reserved for
flexibility. Within these scheduled hours, we may make further changes throughout the semester.
o Programming (Take Home) Exams will be related to the most recently covered subjects. They will be on
Fridays from 12:00 Noon to 11:59 PM (midnight).
o Out of 8 programming exams, 6 of them with the best grades for each student will be used in grading. You
are expected to use this right to handle schedule conflicts between your other exams and CENG 315
programming exams. We may not grant any additional exemptions for exam conflicts, unless there is a truly
extraordinary situation.
o Class attendance is not mandatory, but it is highly recommended. We may at times cover material that is not
included in the textbook, and anything we cover in class could appear on an exam.
o Final exam will be comprehensive covering the whole material of the semester.

You might also like