ALGORITHMS AND COMPLEXITY 

  CS 3AC3  (Winter 2023)



* * * This outline is constantly updated. Students should consult this page regularly for all information relevant to this course * * *

Instructor 

Dr. George Karakostas
ITB/218, ext 26132, Mac address: karakos
Office hours:
Thu 1:30-2:30 pm

Course Assistance 

Fernando Martinez Garcia (martinef@mac), Office hours: Mo 4:30-5:30pm, Fri 10:30-11:30 am (ITB/207)
Holly Koponen (koponeh@mac), Office hours: Tue 12:20 - 2:30 pm (ITB/242)
Shiyun Sun (suns61@mac),
Office hours: Mo 10:30-11:30, We 10:30-11:30 am
(ITB/242)
Yipeng Xin (xiny13@mac),
Office hours: Fri 2:30-4:30 pm
(ITB/242)
Victor Vezina (vezinav@mac),
Office hours: Tue 11:30-13:30 (ITB/242)


Scheduling notes

Prerequisites
COMPSCI 2C03 or SFWRENG 2C03, COMPSCI 2AC3 or 2FA3 or SFWRENG 2FA3


Course Objectives
 

In this course, we will study the solution of computational problems from two complementary perspectives: (i) The Algorithm Design & Analysis perspective, i.e., the design methods one can employ in order to build efficient algorithms for fundamental problems (e.g., network flows), and the analysis of their running times. We will study the design of Divide-and-Conquer, Greedy and Dynamic Programming algorithms, approximations algorithms that are efficient but can only provide approximation-of-the-optimal guarantees, and the use of randomization in our algorithms. (ii) The Computational Complexity perspective, i.e., the study of the inherent difficulty of solving a problem computationally. As opposed to the 'easyness' of solving a problem, demonstrated by efficient algorithms designed in (i), in this part we will study how one can show that a problem is at least as 'hard' to solve as another problem, using reductions, and will classify our problems into complexity classes such as P, NP, PSPACE, according to their 'hardness'.  


More specifically, students should know and understand:

Students should be able to

Learning objectives, indicators, and rubrics  


Outline of Topics (roughly per week) 

  1. Analysis of algorithms (Chapter 2, slides, KT slides)
  2. Divide-and-Conquer and recurrences, the class P (5.1 - 5.5, KT slides)
  3. Greedy algorithms (4.1 - 4.7, slides, KT slides)
  4. Dynamic Programming (Chapter 6, slides, KT slides 
  5. Network Flow (7.1-7.3, 7.5-7.12, KT slides1, KT slides2)
  6. Turing Machines, the Turing-Church Thesis, the class NP (Chapter 8, slides, KT slides1, KT slides2, KT slides3) 
  7. The class PSPACE (Chapter 9, KT slides) 
  8. Approximation algorithms (11.1 - 11.3, 11.8, KT slides) 
  9. Randomized algorithms (13.1- 13.5, KT slides) 

  

Student Assessment (Grading) 

Policy on collaboration for homework assignments: Collaboration on the homework assignments is highly encouraged, within reasonable limits. Students are expected to discuss assignment problems with each other, and to cooperate on solutions in groups of no more than 5 people. However, the final write-up should be done by individual students (i.e. individual students should be able to explain their solutions by themselves, if such an explanation is asked for by the instructor) and the names of the collaborators should appear on the paper. Cooperation and teamwork are necessary for the success of any complex task (the design of algorithms being one such task), and it is the instructor's hope that students will come to appreciate them in a constructive way. Please see the instructor if you need someone to collaborate with.

Policy on delayed assignments: Assignments delivered between the lecture they were due and the following lecture get 50% of total credit. After the following lecture, no credit given. 

Policy on collaboration during exams: ABSOLUTELY NO COLLABORATION DURING EXAMS!!!
  

Resources 

Required textbook: "Algorithm Design", by J. Kleinberg and E. Tardos, Addison-Wesley
Recommended textbook: "Introduction to Algorithms", 3rd Ed., by T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, MIT Press
Recommended textbook:
"Introduction to the Theory od Computation", 3rd Ed., by M. Sipser, Cengage Learning


Assignments

All assignments are posted on Avenue, and they are submitted electronically (also on Avenue)

Assignment 1
(Both Part I & II: Due 23/1 at 3:30pm):  The questions are here. The solutions are here.
Assignment 2 (Both Part I & II:
Due 6/2 at 11:59pm):  The questions are here. The solutions are here.
Assignment 3 (
Both Part I & II: Due 27/2 at 11:59pm):  The questions are here. The solutions are here.
Assignment 4 (Both Part I & II:
Due 22/3 at 11:59pm):  The questions are here. The solutions are here.
Assignment 5 (
Due (both Parts): Due 5/4 at 11:59pm):  The questions are here.  


Slides 

The lecture slides used in the lectures are designed by the textbook authors, and are distributed by Pearson Addison-Wesley.


McMaster Course Policies

The instructor and university reserve the right to modify elements of the course during the term. The university may change the dates and deadlines for any or all courses in extreme circumstances. If either type of modification becomes necessary, reasonable notice and communication with the students will be given with explanation and the opportunity to comment on changes. It is the responsibility of the student to check their McMaster email and course websites weekly during the term and to note any changes.

ACADEMIC INTEGRITY

You are expected to exhibit honesty and use ethical behaviour in all aspects of the learning process. Academic credentials you earn are rooted in principles of honesty and academic integrity. It is your responsibility to understand what constitutes academic dishonesty.

Academic dishonesty is to knowingly act or fail to act in a way that results or could result in unearned academic credit or advantage. This behaviour can result in serious consequences, e.g. the grade of zero on an assignment, loss of credit with a notation on the transcript (notation reads: “Grade of F assigned for academic dishonesty”), and/or suspension or expulsion from the university. For information on the various types of academic dishonesty please refer to the Academic Integrity Policy, located at https://secretariat.mcmaster.ca/university-policies-procedures- guidelines/

The following illustrates only three forms of academic dishonesty:
plagiarism, e.g. the submission of work that is not one’s own or for which other credit has been obtained. improper collaboration in group work.
copying or using unauthorized aids in tests and examinations.

AUTHENTICITY / PLAGIARISM DETECTION

Some courses may use a web-based service (Turnitin.com) to reveal authenticity and ownership of student submitted work. For courses using such software, students will be expected to submit their work electronically either directly to Turnitin.com or via an online learning platform (e.g. A2L, etc.) using plagiarism detection (a service supported by Turnitin.com) so it can be checked for academic dishonesty.

Students who do not wish their work to be submitted through the plagiarism detection software must inform the Instructor before the assignment is due. No penalty will be assigned to a student who does not submit work to the plagiarism detection software. All submitted work is subject to normal verification that standards of academic integrity have been upheld (e.g., on-line search, other software, etc.). For more details about McMaster’s use of Turnitin.com please go to www.mcmaster.ca/academicintegrity.

COURSES WITH AN ON-LINE ELEMENT

Some courses may use on-line elements (e.g. e-mail, Avenue to Learn (A2L), LearnLink, web pages, capa, Moodle, ThinkingCap, etc.). Students should be aware that, when they access the electronic components of a course using these elements, private information such as first and last names, user names for the McMaster e-mail accounts, and program affiliation may become apparent to all other students in the same course. The available information is dependent on the technology used. Continuation in a course that uses on-line elements will be deemed consent to this disclosure. If you have any questions or concerns about such disclosure please discuss this with the course instructor.

ONLINE PROCTORING

Some courses may use online proctoring software for tests and exams. This software may require students to turn on their video camera, present identification, monitor and record their computer activities, and/or lock/restrict their browser or other applications/software during tests or exams. This software may be required to be installed before the test/exam begins.

CONDUCT EXPECTATIONS

As a McMaster student, you have the right to experience, and the responsibility to demonstrate, respectful and dignified interactions within all of our living, learning and working communities. These expectations are described in the Code of Student Rights & Responsibilities (the “Code”). All students share the responsibility of maintaining a positive environment for the academic and personal growth of all McMaster community members, whether in person or online.

It is essential that students be mindful of their interactions online, as the Code remains in effect in virtual learning environments. The Code applies to any interactions that adversely affect, disrupt, or interfere with reasonable participation in University activities. Student disruptions or behaviours that interfere with university functions on online platforms (e.g. use of Avenue 2 Learn, WebEx or Zoom for delivery), will be taken very seriously and will be investigated. Outcomes may include restriction or removal of the involved students’ access to these platforms.

ACADEMIC ACCOMMODATION OF STUDENTS WITH DISABILITIES

Students with disabilities who require academic accommodation must contact Student Accessibility Services (SAS) at 905-525-9140 ext. 28652 or sas@mcmaster.ca to make arrangements with a Program Coordinator. For further information, consult McMaster University’s Academic Accommodation of Students with Disabilities policy.

REQUESTS FOR RELIEF FOR MISSED ACADEMIC TERM WORK

McMaster Student Absence Form (MSAF): In the event of an absence for medical or other reasons, students should review and follow the Academic Regulation in the Undergraduate Calendar “Requests for Relief for Missed Academic Term Work”.

ACADEMIC ACCOMMODATION FOR RELIGIOUS, INDIGENOUS OR SPIRITUAL OBSERVANCES (RISO)

Students requiring academic accommodation based on religious, indigenous or spiritual observances should follow the procedures set out in the RISO policy. Students should submit their request to their Faculty Office normally within 10 working days of the beginning of term in which they anticipate a need for accommodation or to the Registrar's Office prior to their examinations. Students should also contact their instructors as soon as possible to make alternative arrangements for classes, assignments, and tests.

COPYRIGHT AND RECORDING

Students are advised that lectures, demonstrations, performances, and any other course material provided by an instructor include copyright protected works. The Copyright Act and copyright law protect every original literary, dramatic, musical and artistic work, including lectures by University instructors

The recording of lectures, tutorials, or other methods of instruction may occur during a course. Recording may be done by either the instructor for the purpose of authorized distribution, or by a student for the purpose of personal study. Students should be aware that their voice and/or image may be recorded by others during the class. Please speak with the instructor if this is a concern for you.

EXTREME CIRCUMSTANCES

The University reserves the right to change the dates and deadlines for any or all courses in extreme circumstances (e.g., severe weather, labour disruptions, etc.). Changes will be communicated through regular McMaster communication channels, such as McMaster Daily News, A2L and/or McMaster email.


Faculty Notices "The Faculty of Engineering is concerned with ensuring an environment that is free of all discrimination.  If there is a problem, individuals are reminded that they should contact the Department Chair, the Sexual Harrassment Officer or the Human Rights Consultant, as the problem occurs."