Discrete Structures & Algorithms

Category: Announcements

Office Hours / Final Exam

Just a reminder that we will have our final exam on Monday, during our regular class time.

A handful of people logged on to Blackboard Collaborate for office hours earlier today. I recorded the session, so you can view the recording on Blackboard (go to our Collaborate Ultra page and click on the menu button in the upper left to switch to “Recordings”)

I went over a mathematical induction proof, reviewed some basic algorithms in pseudocode, and outlined what sort of topics/exercises to review for the final:

  • propositional logic e.g., truth table: see Exam #1
  • direct proofs and indirect proofs (i.e., proofs by contraposition): see Quiz #2 and Exam #2
  • set operations and functions (including domain/range, definitions of one-to-one and onto functions): see Exam #2
  • algorithms (writing simple algorithms in pseudocode; executing the basic search and sorting algorithms; big-O estimates of running-times): Exam #3 & Quiz #3
  • proof by mathematical induction: Exam #3 & Sec 5.1

I will post solutions to Exam #3 and Quiz #3, so that you can review the solutions of those.

Spring Break

Hope you are all enjoying your spring break. Please do take a break, but also try to set aside some time to catch up on your courses. There will be only a few weeks left in the semester when we come back next week, and finals will be coming up quickly.

In particular, here’s what you can work on for our course:

  • review for the Exam #2 in-class exercises
    • I am grading your take-home exams this week, and I have posted the solutions to the take-home exercises (to OpenLab Files). Please review the solutions and make sure you understand them. We will briefly review the take-home exercises at the beginning of class Monday.
    • The in-class exam will be next Monday (April 25), when we return from break. The in-class exercises will be similar to some of the take-home exercises.
  • read Sec 3.1 of the textbook and start the HW#4 exercises (Sec 3.1: #3-8, 23, 24)
    • we discussed some of these exercises in class last Wednesday
    • for each of these exercises, write pseudo-code
    • for the odd-numbered exercises, compare with the solutions in the textbook
    • some of the textbook solutions can be simplified using certain python constructs, such as for loops for iterating over the elements of a set
  • review (and edit) the python code “trinkets” we have looked at (see here for a full list of the trinkets we have looked at so far)

Welcome to MAT2440!

Welcome to MAT2440 – “Discrete Structures & Algorithms.” Please take some time to explore this OpenLab course site. Use the menus above to explore the course information, activities, and help.

Join this Course

Login to your OpenLab account and follow these instructions to join this course.

If you’re new to the OpenLab, follow these instructions to create an account and then join the course.

Remember that your username and display name can be pseudonyms, rather than your real name. Your avatar does not need to be a picture of your face–just something that identifies you on the OpenLab.

Questions

If you have any questions, reach out via email or in Office Hours. If you need help with the OpenLab, you can consult OpenLab Help or contact the OpenLab Community Team.