Scribd
Upload
288 views2 pages

Cs 473 2014 Fall Syllabus

This document outlines the schedule, structure, and policies for CS 473 - Algorithms I, a 3 credit course taught in the fall 2014-2015 semester. It will meet twice a week on Tuesdays and Fridays in two sections. There will be 10 mid-week exams held on Thursdays covering the weekly course content, along with a midterm and final exam. The course topics include analyzing and designing algorithms, asymptotic notation, sorting algorithms like quicksort and heapsort, and algorithm design techniques like dynamic programming and greedy algorithms. Policies on attendance, exams, and academic honesty are also provided.

Uploaded by

HannaLane
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
288 views2 pages

Cs 473 2014 Fall Syllabus

This document outlines the schedule, structure, and policies for CS 473 - Algorithms I, a 3 credit course taught in the fall 2014-2015 semester. It will meet twice a week on Tuesdays and Fridays in two sections. There will be 10 mid-week exams held on Thursdays covering the weekly course content, along with a midterm and final exam. The course topics include analyzing and designing algorithms, asymptotic notation, sorting algorithms like quicksort and heapsort, and algorithm design techniques like dynamic programming and greedy algorithms. Policies on attendance, exams, and academic honesty are also provided.

Uploaded by

HannaLane
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/ 2

CS 473 - Algorithms I - 2014-2015 Fall

Schedule:
Section 1 - EB102 - Tuesday 15:40-16:30 Friday 13:40-15:30
Section 2 - EB102 - Tuesday 10:40-12:30 Friday 9:40-10:30
Mid-week exams - Classrooms TBD - Thursday 17:40-19:40
Text Book: T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein Introduction to Algorithms,
Mit Press and McGraw-Hill, 2009. Third Edition
Reference: E. Horowitz and S. Sahni, Fundamentals of Computer Algorithms, Computer
Science Press 1978.
Instructor: Cevdet Aykanat
Assistants: Seher Acer, R. Oguz Selvitopi, Kadir Akbudak,
Course Web Page: http://cs.bilkent.edu.tr/~reha/473/
Credits: 3, ECTS Credits: 6,
Prerequisites: CS 202
Grading:
Midterm: 20%
Final: 20%
Mid-week exams: 56%
Attendance: 4%
Course Contents
WEEK(1): Introduction: analysing algorithms, designing algorithms.
WEEK(2): Asymptotic notation.
WEEK(3): Divide and conquer: Strassen
WEEK(4): Randomized quicksort: analysis.
WEEK(5): Medians and order statistics.
WEEK(6): Heaps: heapsort, priority queues.
WEEK(7): Sorting in linear time.
WEEK(8): Dynamic programming: matrix-chain multiplication, longest common subsequence.
WEEK(9): Dynamic programming: 0/1 Knapsack problem, resource allocation problem.
WEEK(10): Greedy algorithms: activity selection problem, Huffman codes.
WEEK(11): Greedy algorithms: task scheduling problem.
WEEK(12): Amortized analysis: aggregate and accounting methods.
WEEK(13): Amortized analysis: potential method and dynamic tables.
WEEK(14): Review

Remarks
Copying or communicating during an exam is considered as cheating. Students caught
cheating in an exam will be subject to disciplinary action, as explained in the Student
Disciplinary Rules and Regulation
(www.provost.bilkent.edu.tr/procedures/AcademicHonesty.htm).
There will be 10 mid-week exams.
Mid-week exams will be held on Thursday, between 17:40 and 19:30.
Mid-week exams will be held in classrooms ...., ....., and .....
In mid-week exams, books are open but any other resources are forbidden (Books must
be clean and unused. Books containing any written text are strictly not allowed).
In all exams, phones and any other electronic devices must be turned off.
Each week we will have a mid-week exam and each mid-week exam will contain
questions about the topics covered in the respective week.
Two of these mid-week exams having least grades will be omitted at final grading. Least
grades are determined for each student individually.
All students are strictly encouraged to attend all mid-week exams.
For students missing mid-week exams due to health problems (all of which are
reported officially) there will be makeups at the end of semester. Topics of
makeups are determined by the instructor.
Exam papers without section IDs will get 15 points penalty.
Attendance grade will be computed as follows: If you miss less than or equal to 4 hours
in the semester, you will get the full 4% grade. If you miss more than 4 hours, you will
lose 0.125% for every extra hour you miss. For example, if you miss 5 hours in the
semester, your attendance grade will be 3.875%. If you miss 36 hours or more, you will
get 0% as attendance grade.

You might also like