22C:31 Algorithms Exam 1 Information

Exam 1 will be made available between 4:30 pm and 5:00 pm on Thursday, 9/24. The exam is due back via a 22C:31 ICON dropbox by 5:00 pm on Friday, 9/25. The dropbox will automatically close at that time and I will not accept the exams in any other way. If you are unfamiliar with how the ICON dropbox works, you can try it out by making a dummy submission before the deadline.

Since the submission is electronic, you should (i) either type up your answers or (ii) scan your handwritten answers into a file that we can read (e.g., pdf). If you anticipate a problem with scanning your answers, let me know ahead of time and I can scan your answers for you.

There will be 4 problems on the exam and I expect each problem will take you about 45 minutes total, i.e., from reading the problem and understanding it to thinking about it to neatly writing up a solution. So you should reserve about 4 hours in your schedule for this exam on Thursday evening and during the day on Friday.

The exam will cover the first four chapters of the textbook, spanning the topics:

Representative problems
Analysis of Algorithms
Graphs
Greedy Algorithms

There will be one problem on Analysis of Algorithms, one of Graphs, and two on Greedy Algorithms. Even though I have not explicitly discussed material from the chapter on Graphs (Chapter 3) in class, you should be familiar with this material from 22C:19 (Discrete Structures) and 22C:21 (Data Structures). Specifically, you should know basic notation and definitions pertaining to graphs and basic graph algorithms such as breadth first search, depth first search, and applications. I like the problems at the back of the chapters in the textbook and it is possible that I will just use some of these on the exam.