CompSci 161 - Design and Analysis of Algorithms - Fall, 2023 (Dillencourt)
To view the information on this page, either scroll down or
click one of these links:
Class announcements
- Class announcements will be made on canvas.
The most recent ones will appear at the top of the course home page on canvas.
Please check there frequently.
Class meetings
- Lectures: 2:00-2:50PM M W F HIB 100 [This is the
Humanities Instructional Building]
- Midterm Exams will be given during the lecture time, in
the same classroom as the lectures
- The first lecture will be held on Friday, September 29
- There will be no lecture on the following days:
- Friday, November 10 (Veteran's Day Holiday)
- Friday, November 24 (Thanksgiving Holiday)
- Discussion sections:
- There are four discussion sections (A1, A2, A3, A4).
They meet at the following times and places.
[ICS is the
Information and Computer Science 1 Building].
- A1: 7-7:50PM M W ICS 174
- A2: 8-8:50PM M W ICS 174
- A3: 7-7:50PM Tu Th ICS 174
- A4: 8-8:50PM Tu Th ICS 174
- The first discussion section meetings will be on
Monday, October 2 (Sections A1, A2) and
Tuesday, October 3 (Sections A3, A4).
- Due to the Thanksgiving holiday, there will be no discussion sections
on the following days:
- Wednesday, November 22
- Thursday, November 23
Course staff
Sending us email
- Rather than sending email to one of us individually,
it is much better to send email to the address:
compsci161-questions at uci dot edu
This is an alias for the instructor, the TAs and the Reader.
Sending your question here ensures that all of us see your message
and the response, and usually gives you better turnaround time.
- Please put the string "CompSci 161 - " in the subject line, followed by
something meaningful.
- NOTE:It is very important to put spaces around 161.
I have noticed that sometimes my mail server's search function gets
confused when there is a word preceding a number with no
intervening space.
- If you are posting a question of general interest, please post it
on Ed Discussion instead
Ed Discussion question-and-answer forum
- We will be using the Ed Discussion question-and-answer forum.
Access to the Ed Discussion forum will be made available through the
class Canvas space.
- Although posters can hide their identity from other students,
the instructor and the teaching assistants are able to determine the
identity of posters.
- The forum is intended as an open and respectful forum for the exchange
of questions and answers about the class and the course material.
Inappropriate, insulting, or offensive posts will not be tolerated.
Such posts will be deleted, and
may result in the suspension or termination of access to the forum.
In extreme cases, offensive posts may be referred to other University entities
for appropriate disciplinary action.
Academic Dishonesty:
- Academic dishonesty (cheating) is a serious offense
in the eyes of the instructor, the instructional assistants,
ICS, and the university.
Incidents of academic dishonesty will usually result in your receiving
a grade of F in the course and not being allowed to drop the course.
Additional consequences may occur at the academic unit or campus level.
Examples of academic dishonesty include, but are not limited to:
- Copying from others during an examination
- Using unauthorized materials during an examination.
- Sharing answers or
allowing another student to copy off your work during an examination.
- Tampering with an examination after it has been
corrected, then returning it for more credit.
- Intentionally disrupting the educational process in any way.
- For more complete information about academic honesty policies and
procedures, consult the following resources:
Required Textbook
- We will be using the online, web-based version of the textbook
- [GT] Algorithm Design and Applications,
by Michael T. Goodrich and Roberto Tamassia,
published by Zybooks.
- You are required to subscribe to the book if you are
enrolled in the class.
The material in the book includes interactive exercises which will count as
a small portion of your grade.
- Instructions for subscribing can be found here.
- Copies of the book in traditional (non-Zybook) form
are available in hard copy from the usual sources,
and an online PDF is available for free.
Additional resources
- Optional additional reading:
- You may find the following books helpful as well.
These are not required, but they may provide useful additional
perspective and, in for some topics, more detailed coverage.
I have requested that a copy of each of them be placed on reserve
in the Science Library:
- [BvG] Baase and van Gelder, Computer Algorithms,
Addison-Wesley.
- [KT] Kleinberg and Tardos, Algorithm Design, Addison Wesley.
- [CLRS] Cormen, Leiserson, Rivest, and Stein,
Introduction to Algorithms, MIT Press.
- Prerecorded lectures from previous quarters:
- Prerecorded lectures from previous quarters can be found on the class
canvas page. Please note the following:
- These prerecorded lectures are intended as a supplement
to the in-class lectures, not as an alternative to or a substitute
for attending the in-class lectures.
- The material covered in the prerecorded lectures will overlap
considerably with the in-class lectures,
but it will not be identical. There will be topics
covered in the in-class lectures that are not covered in the prerecorded
lectures, and you will be responsible for these topics on exams.
- On occasion I may explicitly assign you to watch a specific prerecorded
lecture.
If I do so, you will be responsible for the material covered on
that specific prerecorded lecture on exams.
Otherwise, you will not be responsible for
material in the prerecorded lectures that is not coved in the in-class
lectures.
- I will not fix errors in the prerecorded lectures.
Here is a list of known errors.
If you think you have found an error, let me know, and once I have
verified it I will add it to the list of known errors.
Grading
- Based on two midterms, a final exam,
weekly homework assignments,
and assigned readings in the online textbook.
- The individual components will be weighted as follows when
computing the course grade:
- Test score (weighted average on midterms and final exam): 90%.
- The test score will be computed as follows:
- Midterm 1: 33%
- Midterm 2: 33%
- Final Exam: 34%
- Homework assignments: 5%
- Readings in the online textbook: 5%
- Midterms and Final:
- There will be two midterms.
- The midterms will be given Friday of weeks 4 and 9.
- Makeup exams midterms will only be given in extraordinary
and documentable circumstances, and only at the discretion of
the instructor.
If the circumstances are forseeable in advance, notify me
as far in advance as posssible. Failure to do this may result
your forfeiting your opportunity to take a makeup.
- The final exam will be given during finals week, in the
time period designated by the registrar.
-
Click here for more information about the
midterms and the final exam, including exact date/time.
- Homework:
- There will be weekly homework assignments.
They will generally be due Wednesday evenings.
The first assignment will be due during week 2.
- Your lowest homework assignment score will be dropped.
- A consequence of this policy is that if you do not turn in a homework
assignment and hence receive a zero on it,
that homework score will be dropped.
This means that failing to turn in one homework assignment will not
negatively impact your grade as long as you do well on all the other
homework assignments.
- For a link to the homework assignment page, scroll down or click
here.
- Reading Assignments:
- There will be reading assigments from the online Zybook textbook.
- In each section you are assigned to read, you will need to
complete the Participation Activities.
- Generally there will be a reading assignment due one minute before
the start of each lecture.
- You will be deemed to have satisfactorily completed the reading
of a particular section if and only if the Zybook log says that
you completed all Participation Activities in the section by the
deadline.
- For a link to the reading assignment page, scroll down or click
here.
Class Notes:
- The class notes consist of the slides used in the lectures.
- Other material may be added to the class notes page over the course
of the quarter.
- Access to class notes is restricted to students enrolled in the class.
- Click here to access the class notes.
Authentication information will be announced.
Homework Assignments
- Homework assigment page:
The homework assignments and instructions for submitting the homework
are posted here.
Reading Assignments
- Reading assigment page:
The reading assignments to be completed before each lecture
are posted here.
Schedule of deliverables (tests, homework due dates):
List of topics:
- A preliminary, prospective list of topics can be found
here.
- A retrospective list of topics that were covered in each lecture
can be found
here.
Last modified: December 5, 2023