There will be a review session on Weds., May 5, from 3-4pm, in our usual classroom.

Office hours before the exam will be:

• Weds., 10-noon, 2-3 (then the review session)
• Thurs., 10-2pm. (Exam starts at 2pm)

I have created an Exam 3 question forum on Collab.

In the Solutions area, you’ll find a version of the self-quiz you had in your hands last week with the answers

In the Slides Etc. area, you’ll find a set of practice questions you might find useful to work on. We’ll look at these in tomorrow’s class, too.

Exam 3 will be on Thursday, May 6, from 2-4pm in our regular room.
It will be 50% on material since Exam 2 (starting with dynamic programming), and 50% review material from exams 1 and 2. More details on the content and format of the exam in Tuesday’s class.

I will schedule extra office hours on Tuesday afternoon, May 4, and Weds., May 6. Think about what times might be best for you.

If you are taking three exams within a 24 hour period, one of your professors is supposed to be willing to let you take the exam at a different time (earlier or later). I will be cooperative in such matters, within reason. Please email by 2pm on Tuesday, May 4, and give me your exam schedule or situation so I can give you the OK on this. Give me some time slots that might work for you. Note: All CS4102 exams really need to be done by 5pm on Monday, May 10.

Exam keys for exams 1 and 2 will be posted by the end of the day on Friday. A review sheet should be ready, but this may go into the weekend before it’s done. We will post keys for old HWs by then too, and hopefully get caught up HW4 and HW5 for you.

Homework 6 is due at the start of class on Tuesday, May 4.
Here are office hours (some extra) between now and then.

• Thurs., 4/29: 11-noon, 2-3
• Friday, 4/30: 11-12:30, 3-4
• Monday, 4/3: 10:30-noon, 3-4:30

I’ve also added a Forum for questions on HW6.
(There will be extra office hours before our final on May 6, too.)

In the Slides Etc. area of this site, you’ll now find the slides for today and the remaining classes. Also, the self-practice/assessment “quiz” that I passed out today for you to answer while listening. Also, two PDF files that are the sides of the two-sided handout with examples of reductions (we’ll talk about these Thursday).

Wikipedia articles about topics covered in this unit:
Computational complexity theory (in general).
Classes P and NP.
NP-c.
Cook-Levin Theorem.
(Follow the links to many others. Note how this topic appeared in the Simpsons!)

Homework 6 is in the Homework page.
It’s due at the start of class on Tuesday, May 4. I’ll go over those problems in class that day.

If you didn’t get a copy of the topics list in class, you can find it in the Slides Etc. area on the website.

I just sent email to the class about why Exam 2 got pushed back to Tuesday, April 20. You can see the email in the Email Archive (use link on this page, or try this link).

That email has info about how you can possibly take it earlier if you prefer (Thur, Fri, Sun eve., or Mon).
It also says that my office hours before the exam will be:

• Thursday, 11-noon and 2-3
• Friday, 10:30-noon and 1:30-3
• Monday, 11-1 and 3-4

Sorry for the confusion and all -- it’s inconvenient for me, too, so I’m annoyed I got sick Tuesday. Oh well.

I am sick this morning (seriously dizzy, very weird). Class on Tuesday, 4/13, is canceled. Look for news about exam soon. You will not have to take it Thurs. in class, but if you want to take it earlier than Tuesday, 4/20, I’ll try to make that possible. So the tentative plan is exam review on Thursday with Exam on Tuesday 4/20 except those who want to get it out of the way earlier may have the chance.

Instead of class today, read the handout (4-5 pages) on the 0/1 Knapsack and dynamic programming. It’s now in the “Slides Etc.” area. Also, there’s an Excel sheet with an exercise to help you see how it works -- I’ll demo that in class, but try it if you wish. Please do the reading before class on Thursday!

Starting April 6 we’ll be looking at Dynamic Programming. Topics you should read include:

• Sections 8.1 and also 334-335, p. 361: Definitions, overview, memoization, optimal substructure property
• Wikipedia article on dynamic programming
• Section 8.4
• Handout on 0/1 knapsack
• Maybe Section 8.3 on multiplying matrices

As discussed in class last Tuesday, Exam 2 will be Thursday, April 15. Right now I believe it will cover up to Greedy Algorithms. If you won’t be in town or have some other issue for that date, let me know.

Yesterday in class I distributed HW5 and talked about one of the problems. It’s now posted on the website. There’s a Forum for questions too. Collaboration rules are listed in the HW description.

It’s due on Thursday, April 8, at 4:30pm. You can turn it in to me, or put it into the envelope in the CS office by 4:30 pm. You can turn it in up to 24 hours late for a 10% penalty.

This week the lectures have been on Greedy Algorithms. The topics match these book sections:

• Intro, coin changing: Section 7.1
• Continuous knapsack: Section 7.6
• Prim’s MST algorithm: Section 7.3
• Dijkstra’s Shortest Path algorithm: Section 7.4
• Prim’s MST algorithm: Section 7.2 (we’ll talk about this on 4/6). Also, look over Section 3.6, page 150-161.
• Nothing on Section 7.5 (Huffman Encoding -- you did this in CS2150!)
• No book sections cover activity selection

Here’s what you should be reading and studying in the current unit on graph traversals:

• Read and review Section 2.5. Much of this is stuff you learned in an earlier class, but there may be new concepts and terminology.
• Review definitions, data structures, and algorithms from CS2150/CS216 slides. You’ve had this material before in lectures, labs and exams. I’ve put a copy of the slides on the Slides page of this website.
  • Read Sections 4.2 (DFS) and 4.3 (BFS) in the textbook
  • After this, we will do Section 4.4 (topological sort) and 4.5 (backtracking)
• Do HW4 (including the practice problems)