CS 374: Algorithms and Models of Computation Mahesh Viswanathan - - PowerPoint PPT Presentation

cs 374 algorithms and models of computation
SMART_READER_LITE
LIVE PREVIEW

CS 374: Algorithms and Models of Computation Mahesh Viswanathan - - PowerPoint PPT Presentation

Staff, and Office Hours Resources Grading Scheme Advice CS 374: Algorithms and Models of Computation Mahesh Viswanathan vmahesh@illinois.edu 3232 Siebel Center University of Illinois, Urbana-Champaign Spring 2016 Viswanathan CS374 Staff,


slide-1
SLIDE 1

Staff, and Office Hours Resources Grading Scheme Advice

CS 374: Algorithms and Models of Computation

Mahesh Viswanathan vmahesh@illinois.edu 3232 Siebel Center

University of Illinois, Urbana-Champaign

Spring 2016

Viswanathan CS374

slide-2
SLIDE 2

Staff, and Office Hours Resources Grading Scheme Advice

Instructional Staff

Instructor: Mahesh Viswanathan Teaching Assistants:

Qian Cheng Antoine Dejong Spencer Gordon Eric Huber Mark Idleman Shweta Patwa Alexander Steiger Tana Wattanawaroon

Office Hours: See course webpage Contacting Staff: Use “private note” in Piazza.

Viswanathan CS374

slide-3
SLIDE 3

Staff, and Office Hours Resources Grading Scheme Advice

Course Aides

Osayd Abdu Robert Andrews Surya Bakshi Edward Chou Sebastian Conybeare Matthew Faust Jingwen Jiang Tong Li Roy Young Li Kevin Lin Maidi Lin Nishad Phadke Sachin Ravichandran Sushan Jiang Madeleine Walstad Yizhi Zhu

Viswanathan CS374

slide-4
SLIDE 4

Staff, and Office Hours Resources Grading Scheme Advice

Electronic Bulletin Boards

Webpage: General information, course policies, lecture notes courses.engr.illinois.edu/cs374 Piazza: Announcements, online questions and discussion, contacting course staff. Sign up at piazza.com/illinois/spring2016/cs374. Moodle: Everything related to homeworks, quizzes, grades, announcements https://learn.illinois.edu/course/view.php?id=14935

Viswanathan CS374

slide-5
SLIDE 5

Staff, and Office Hours Resources Grading Scheme Advice

Resources for class material

Prerequisites: All material in CS 173, and CS 225 Lecture Notes: Available on course web-page Video Recording of Lectures: See course website for link. Additional References

Introduction to the Theory of Computation: Michael Sipser Algorithms: Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani See website for more sources

Viswanathan CS374

slide-6
SLIDE 6

Staff, and Office Hours Resources Grading Scheme Advice

Grading Policy: Overview

Total Grade and Weight Homeworks: 24% Quizzes: 6% Midterms: 40% (2 × 20) Finals: 30%

Viswanathan CS374

slide-7
SLIDE 7

Staff, and Office Hours Resources Grading Scheme Advice

Homeworks

One homework every week: Due on Tuesdays at midnight on

  • Moodle. Assigned at least one week in advance.

No late homeworks. Lowest 6 homework problem scores will be dropped. Homeworks may be solved in groups of size at most 3 and each group submits one written solution on Moodle.

Viswanathan CS374

slide-8
SLIDE 8

Staff, and Office Hours Resources Grading Scheme Advice

Homeworks

One homework every week: Due on Tuesdays at midnight on

  • Moodle. Assigned at least one week in advance.

No late homeworks. Lowest 6 homework problem scores will be dropped. Homeworks may be solved in groups of size at most 3 and each group submits one written solution on Moodle. For the other homeworks, read Homework Guidelines and Academic integrity policies on course website.

Viswanathan CS374

slide-9
SLIDE 9

Staff, and Office Hours Resources Grading Scheme Advice

Quizzes

The day before every class on Moodle. About 25 to 26 in total. We will drop the 5 lowest scores.

Viswanathan CS374

slide-10
SLIDE 10

Staff, and Office Hours Resources Grading Scheme Advice

Examinations

First Midterm: Monday February 22, 7pm to 8:30pm

Conflict exam on Tuesday February 23.

Second Midterm: Monday April 4, 7pm to 8:30pm

Conflict exam on Tuesday April 5.

Final Exam: Monday May 9, 8am to 11am

Viswanathan CS374

slide-11
SLIDE 11

Staff, and Office Hours Resources Grading Scheme Advice

Examinations

First Midterm: Monday February 22, 7pm to 8:30pm

Conflict exam on Tuesday February 23.

Second Midterm: Monday April 4, 7pm to 8:30pm

Conflict exam on Tuesday April 5.

Final Exam: Monday May 9, 8am to 11am No conflict exam offered unless you have valid excuse.

Viswanathan CS374

slide-12
SLIDE 12

Staff, and Office Hours Resources Grading Scheme Advice

Examinations

First Midterm: Monday February 22, 7pm to 8:30pm

Conflict exam on Tuesday February 23.

Second Midterm: Monday April 4, 7pm to 8:30pm

Conflict exam on Tuesday April 5.

Final Exam: Monday May 9, 8am to 11am No conflict exam offered unless you have valid excuse. Midterms will only test material since the previous exam Final Exam will test all the course material

Viswanathan CS374

slide-13
SLIDE 13

Staff, and Office Hours Resources Grading Scheme Advice

Advice

Attend lectures and discussion sessions Make use of office hours/Piazza Study regularly and keep up with the material Ask plenty of questions, and promptly. Don’t delay getting doubts cleared This course is on problem solving. Solve as many as you can This course about writing rigorous proofs. Review 173 material on writing proofs, especially induction.

Viswanathan CS374

slide-14
SLIDE 14

Computation Overview Skills

Part I Course Overview

Viswanathan CS374

slide-15
SLIDE 15

Computation Overview Skills

High-Level Questions

Viswanathan CS374

slide-16
SLIDE 16

Computation Overview Skills

High-Level Questions

What is the nature of computation? Our answer will be independent of our understanding of the physical laws (or on the laws themselves).

Viswanathan CS374

slide-17
SLIDE 17

Computation Overview Skills

High-Level Questions

What is the nature of computation? Our answer will be independent of our understanding of the physical laws (or on the laws themselves). How can one come up with a way to solve a problem computationally? What are the limits of computation?

Viswanathan CS374

slide-18
SLIDE 18

Computation Overview Skills

Course Overview

The course can be roughly divided into three parts. Models of Computation: Regular languages, finite state machines, context-free grammars, and Turing machines Algorithms: Algorithm design techniques illustrated through specific algorithms for certain problems Lower Bounds: Undecidability and NP-completeness

Viswanathan CS374

slide-19
SLIDE 19

Computation Overview Skills

Skills

Comprehend mathematical definitions Write mathematical definitions Comprehend mathematical proofs Write mathematical proofs Learn algorithmic techniques that help solve problems computationally

Viswanathan CS374