Download CS331: Algorithms and Complexity - Spring 2021 and more Lecture notes Algorithms and Programming in PDF only on Docsity!
Sp21 - ALGORITHMS AND COMPLEXITY-WB (
Edit
CS331: ALGORITHMS AND COMPLEXITY (52390 & 52395), Spring
2021 (January 18, 2021)
Professor Vijaya Ramachandran Dept of Computer Science, UT-Austin Daily Schedule: s21_331_schedule.pdf Class Zoom: https://utexas.zoom.us/j/99950397319 (Links to an external site.) (TTh 2-3:30) Discussion Sessions: https://utexas.zoom.us/j/9 6337751646 (Links to an external site.) (#52390: F 10-11; #52395: F 11-noon) Professor Office Hours: https://utexas.zoom.us/j/95195009294 (Links to an external site.) (TTh 9-10) TA Office Hours: https://utexas.zoom.us/j/99701646418 (Links to an external site.) (MW 10-
COURSE DESCRIPTION Time/Unique numbers. TTh 2-3:30, unique numbers 52390 and 52395. Discussion Sessions. #52390: F 10-11; #52395: F 11-noon Prerequisites. The following, with a grade of at least C- in each course: Computer Science 429 (or 310) or 429H (or 310H); Mathematics 362K or Statistics and Data Sciences 321 (or Statistics and Scientific Computation 321); and credit with a grade of at least C- or registration for: Mathematics 340L, 341, or Statistics and Data Sciences 329C (or Statistics and Scientific Computation 329C) Professor. Vijaya Ramachandran (Links to an external site.) (VLR"at"cs.utexas.edu) Office Hours. Tuesdays and Thursdays 9-10 am.
Teaching Assistant. Jeffrey Champion (jchampion"at"utexas.edu) TA Office Hours. Mondays and Wednesdays 10-11 am.
Textbook. Jon Kleinberg and Eva Tardos, Algorithm Design, Pearson Education, 2006.
COURSE OUTLINE. This course will cover the basic aspects of the theory of algorithms, including divide-and-conquer, greedy, and dynamic programming, several graph algorithms, randomized algorithms, and approximation algorithms, together with an introduction to undecidability, and to NP-completeness. This is a theory course and algorithms will be analyzed to obtain provable bounds. There is no programming component to the course. Here is a high-level course schedule. COURSE SCHEDULE. Introduction; graph searching 1 week Basic graph searching 1 week Greedy; minimum spanning tree; Dijkstra's SSSP 2 weeks Divide and conquer; recurrence relations 1 week Dynamic programming; shortest paths in graphs 2 weeks Maximum flow, bipartite matching, linear programming 1 week Undecidability; halting problem 1 week NP-completeness 2 weeks Approximation algorithms 1 weeks Randomized algorithms: randomized selection and Quicksort; hashing 2 weeks This course carries the Quantitative Reasoning (QR) flag: establishing the correctness of algorithms and rigorous bounds on their running times, and deriving proofs of NP- completeness and undecidability are important components of this course. Daily Schedule. A link to more detailed schedule, listing topics by class is available at the beginning of this syllabus. Lectures. This is an online course with lecture over Zoom, and we will have live interactions during class. Do plan to ask and respond to questions. The class will be recorded and made available on Canvas after the class. Canvas and Piazza. Course material will be posted on Canvas. All discussions will be on Piazza. Also, most announcements will be on Piazza. Please be sure to monitor the Piazza and Canvas pages for this class regularly. You can set up Piazza to notify you of new posts. Please reserve your email messages to the instructor and TA for matters that concern only you. For queries relating to class material, please post to the discussion board so that everyone can benefit from the query and the responses.
time, you need to inform me by February 3. Your alternate test could be a timed test at a different time slot, a verbal interview with me at a suitable time-slot, or a combination of the two. Additional Information on the Tests.
- Most of the material in the tests will build directly on material seen in class and in the problem sets.
- The second test will mainly cover the material not included in the first test, and similarly, the third test will mainly cover the material not included in the first and second tests. (Basic background material seen prior to the test will be included in the later tests.)
- The tests are closed book. You are allowed one double-sided sheet of personal notes for each of the three tests, and no other material.
- You will take the tests remotely with Zoom and a webcam on.
- You will need to have your UT id card with you at the test and quizzes.
- You will write your solutions by hand, and you will need to scan your written test solutions and upload the pdf to Canvas. You will also need to upload scan of a page with your UT id and a pledge of honesty (in a prescribed format). Please have a scanner ready for use, note that there are many scanner apps available for smart devices. You will practice this in the Logistics Quiz that will be made available February 2-4, when you will need to upload a scanned document.
- You will need to write your solutions legibly on white paper with a dark pen so that the scanned solutions you upload to Canvas can be read by us. Problem Sets. Problem set solutions are due on Canvas and should be typeset in latex. If you are unfamiliar with latex, we will provide a basic latex template on Canvas. Any problem set solution not submitted by the due date and time will incur a 10% late penalty if submitted within 24 hours of the due date. No problem set solutions will be accepted later than 24 hours after the due date and time. You may discuss the problem sets with other students in the class, but solutions must be written up separately. You will need to upload a separate collaboration statement along with your solutions. Note that there is no penalty for discussing with others; you are, in fact, encouraged to do so. But be sure to acknowledge these discussions in your write-up.
Do not copy solutions from others -- this would be a serious case of scholastic dishonesty.
Peer Grading. The peer grading period will begin shortly after the late submission deadline. Peer grading assignments will be made on Canvas, and will need to performed on Canvas within about 2 days (part of which may be over the weekend). The exact deadline will be noted on the class schedule.
The Problem Set Guidelines document available on Canvas gives more details on Problem Sets and Peer Grading. Perusall. Copies of slides or other written lecture material will be posted on Perusall ahead of class. You will need to review the material and post comments on the posted material as well as responses to the comments by others by end of the day prior to the date of the class lecture. Perusall will automatically assign a score for your participation. Perusall is a useful learning mechanism where you will learn both by reviewing the posted material and by posting comments and responding to others' comments. You should access Perusall through Canvas. (Do not log in to Perusall directly, or your scores will not be recorded properly.) Grading Queries. Any questions on grading should be brought to the attention of the TA or the instructor no later than a week after the graded material is handed out in class. Grade Cut-offs. The exact grade cut-offs for the class will be determined after the point totals are finalized. The following cut-off guarantees will hold: 85 points or above guarantees an A grade (A- or A), with A guaranteed for 90 points or above; 72 points or above guarantees a B (B+, B or B-); 60 points or above guarantees a C (C+, C, or C-), and 50 points or above guarantees a D (D+, D, or D-). While these cut-offs are guaranteed, it is possible some of them may be lowered (this can only benefit some students; however do not count on having these cut-offs lowered). Academic Integrity. Each student in the course is expected to abide by the University of Texas Honor Code: “As a student of The University of Texas at Austin, I shall abide by the core values of the University and uphold academic integrity.” Plagiarism is taken very seriously in this class and at UT. Therefore, if you use words or ideas that are not your own (or that you have used in previous class), you must cite your sources. Otherwise you will be guilty of plagiarism and subject to academic disciplinary action, including failure of the course. You are responsible for understanding UT’s Academic Honesty and the University Honor Code which can be found at the following web address: https://deanofstudents.utexas.edu/conduct/standardsofconduct.php Statement on Scholastic Dishonesty. Anyone who violates the University Honor Code or the rules for this class is in danger of receiving an F for the course. Additional penalties may be levied by the Computer Science department and the University. Students with Disabilities. Students with disabilities may request appropriate academic accommodations from the Division of Diversity and Community Engagement, Services for Students with Disabilities. In particular, any student with a documented disability who requires academic accommodations should contact Services for Students with Disabilities at 471 - 6259 (voice) or 512- 410 - 6644 (Video Phone) as soon as possible to request an official letter outlining authorized accommodations. For more information, visit http://
Caveat. This syllabus is subject to change; students who miss class or fail to monitor announcements on Piazza and Canvas are responsible for learning about any changes to the syllabus.
