-----------------------------------

CMSC 216-030X-040X

-----------------------------------


Course syllabus

The course syllabus is above. Registered students are able to see all other course materials on ELMS.

The pseudo News feed

  1. (Friday, May 7) As of now, see ELMS for all course materials (other than code on Grace, of course).
  2. (8:45 p.m. Thursday, May 7) One of your classmates happened to have the important end-of-semester announcements open in their web browser when Canvas died, so was able to send them to me without my having to remember everything that they said. (Thanks!!!)
    Read these important end-of-semester announcements carefully.
  3. (8:30 p.m. Thursday, May 7) Today's lecture slides are now under Lectures below
    I will put the examples on Grace in ~/216public/examples soon. Note that I skipped over some examples that are mentioned in the lecture slides, but I will put all the examples mentioned in the slides on Grace anyway, in case anyone wants to look at even the ones that weren't shown.
  4. (8:15 p.m. Thursday, May 7) The PDF assembly handouts are under Lectures below
    Reminder from the recent email that I will have office hours tomorrow (Friday) 2:00-4:00, which will be hybrid (so visit me either in person or via Zoom). Keep in mind that certain course material would be much easier to explain in person.
  5. (7:30 p.m. Thursday, May 7) The lecture slides from a few recent lectures are below. (You should need to use your UM directory ID and password to authenticate.)
    More will be available soon.

Lectures (a few recent ones so far)

  1. Lecture #23
  2. Lecture #24- Exam #2
  3. Lecture #25
    Example #6- simple function call
  4. Lecture #26
    Example #7- simple recursion (a recursive function without a parameter)
    Example #8- function with local variables
    Example #9- recursive parameter
    Example #10- parameter and return value
  5. Lecture #27
  6. Lecture #28 Time and optimization, (con't.); Data representation (Chapter 2 in the Bryant & O'Hallaron reserve text); Dynamic memory allocation (Section 9.9 in the Bryant & O'Hallaron reserve text)

Homeworks (a few recent ones so far)

  1. Homework #8 (basic assembly)   Solutions
  2. Homework #9 (functions in assembly)   Solutions
  3. Homework #10 (concurrency)   Solutions

Exams

  1. Final exam practice questions coming soon

[Back] Back to the Department of Computer Science Class Pages

Web Accessibility