CompSci 260P: Fundamentals of Algorithms with Applications

• Class Meetings (Fall 2021)
  • Lecture:   M W 3:30-4:50pm   in room ICS 174
        The first class meeting is on Monday, September 27
        no lecture on Wednesday, Sep 29 (due to religious holiday)
        replaced by lecture on Friday, October 1 at 3pm
  • Discussion:   F 3:00-3:50pm   in room ICS 174

• Instructor
  • Professor Dan Hirschberg  —  dan (at) ics.uci.edu
        office hours by appointment
  • Teaching Assistants:     Ofek Gila — ogila (at) uci.edu
                                                office hours by appointment
                                          Evrim Ozel — eozel (at) uci.edu
                                                office hours by appointment

• Prerequisites
  • An undergraduate algorithms course

• Add/Drop Policy
  • No adds or drops allowed after the second week of classes

• Textbook
  • Required: Kleinberg and Tardos, Algorithm Design, Addison Wesley, 2006, ISBN 978-032-129535-4
    The course will cover the first seven chapters of this book plus selected topics

• List of Topics
  The following schedule is approximate and may change over the course of the quarter.
  • Week 1: Introduction. The Stable Marriage Problem. [KT Chapter 1]
  • Week 2: Basics of Algorithm Analysis. [KT Chapter 2]
  • Week 3: Basics of Graph Algorithms. [KT Chapter 3]
    Week 4: First midterm examination covers chapters 1-3
  • Week 5: Greedy Algorithms. Shortest Paths. Minimum Spanning Trees. [KT Chapter 4]
  • Week 6: Divide and Conquer. [KT Chapter 5, section 13.5]
  • Week 7: Dynamic Programming. [KT Chapter 6]
  • Week 8: Network Flow. [KT sections 7.1-7.7, 7.12]
    Week 9: Second midterm examination covers chapters 4-6
  • Week 10: KMP Pattern Matching. Sweep Algorithms. Introduction to Linear Programming.

• Graded submissions
  • seven homework assignments -- 10 points each, lowest score is dropped
  • two projects -- each graded 100 max, factored to be valued 30 points max
  • two midterm examinations -- 30 points each
  • submission protocols

• Schedule for lectures, homework, projects, and exams

• Access lecture topics, slides, and assignments
      access is password-protected
  • user name is your UCInetID in ALL CAPITAL LETTERS
  • password is your 8-character student number

• Discussion Board
  • Students can discuss matters related to this course on Ed Discussion
    Class students have access to the 260P Ed Discussion pages, typically within three days of class enrollment.

• Academic Dishonesty
  
  • Instances of academic dishonesty will be reflected in the final grade (usually an F)
    because dishonesty devalues the learning experience for the whole class.
    Additional consequences may occur at the campus level.
  • Examples of academic dishonesty include, but are not limited to:
    • submitting homework or project code that was not your own work
      (such as by copying from another person or from a website)
    • copying from others during an examination
    • allowing another student to copy from your work
    • communicating exam answers to other students during an examination
    • using unauthorized materials during an examination
    • tampering with an examination after it has been corrected and then returning it for more credit
  • For more complete information about academic honesty policies, consult the
    Academic Senate Policy on Academic Integrity

• Communication
  If you send me email with course-related questions:
  • include the string "CompSci 260P" at the start of the subject line
  • include your name and UCI student number in the message
  • if you are not writing from your official UCI email address, please cc your official UCI email address
  
  (This protocol enables me to weed out requests for help on problems from non-UCI students)