Hi, welcome to CS141! 🎉
The course explores basic algorithm/data structure design and analysis. The topics cover general algorithm design techniques including analysis of algorithms, divide-and-conquer, the greedy method, dynamic programming, graph algorithms and basic parallel algorithms. In particular, we will also put a strong emphasis on the practice. In the course, we will consider both design and analyze the interesting algorithms in theory, and include some training to implement them!
⏰ Lectures: Tue/Thu 12:30 – 1:50 PM (Session I) / 6:30 - 7:50 PM (Session II)
🏫 Classroom: Olmsted 1208 (Session I) / HMNSS 1501 (Session II)
We will use
- CampusWire for sending annoucements and online discussions.
- GradeScope to submit homework assignments. You should be added to GradeScope automatically if you are enrolled in the course.
- CodeForces to test coding assignments. See more details here.
The course announcements will be sent via CampusWire, so please make sure you enable email notifications. ⚠
⚠ You will likely find this course difficult. There are several reasons why. First, Computer Science and Engineering are challenging disciplines requiring extensive time to master, and algorithm is the core of it. Second, the material covered in the course, combines both theory (analysis of algorithms) and practice (implementing them), and thus require you to have solid background in both math and programming. Third, this course will require generating your own algorithms in addition to just memorizing and understanding existing algorithms. If you don’t know programming, then there will also be the additional overhead of learning coding, and you should start learning it immediately. There are many online resources for doing so.
It is thus important for you to mentally prepare yourself for a difficult course. If you do your work, we are confident that you will finish this class with a satisfactory grade, and will one day (if not immediately) find what you learned in this course useful in your career (and fun, hopefully).
Please make sure you understand the policy of the course, especially about Academic Integrity.
Prerequisites: CS014 (10C) with “C-” or better; CS111; MATH009C or MATH09HC; proficiency in C++ (or some other high-level programming languages).
Yuta Nakamura- Email: ynaka034 [at] ucr.edu
Letong Wang- Email: lwang323 [at] cs.ucr.edu
Jiajun Yu- Email: jyu284 [at] cs.ucr.edu
Xiaojun Dong- Email: xdong038 [at] cs.ucr.edu
All office hours (other than the instructors’) are in WCH 110. You can see the schedule using the calendar below.
A Quick Note abou emailing course staffs
Please remember that this is a large class and refrain from unnecessarily emailing course staff. They are likely to be ignored (although usually unintentionally), or you may get a response very late if that person is busy at that time. We recommend you to post on CampusWire that is visible only to TAs and instructors, and thus anyone seeing the post can reply. You could (and should) email instructors privately in cases that require privacy.
- Mon, 9:00 - 9:50 AM (WCH 142), 5:00 - 5:50 PM (Physics 2104), 7:00 - 7:50 PM (WCH 143)
- Wed, 10:00 - 10:50 AM (Student Success Center 125)
You can add the this to your Google Calendar if you want (by clicking the little “+” bottom right). All the lectures and assignment deadlines are included in this calendar.
Introduction to Algorithms (CLRS).
Third Edition. Cormen, Leiserson, Rivest, and Stein. MIT Press.
[UCR Library Link]
We will cover many other interesting topics that are not in the textbook.