1 / 15

Important Lecture Notes and Homework Details for CSE 331 - Oct 7, 2011

This document covers essential announcements from the CSE 331 lecture on October 7, 2011. It details homework (HW) submissions for questions 1, 2, and 3, due by 1:15 pm, and notes that no late submissions will be accepted. The mid-term exam will be conducted on Monday at 1 pm, with Jiun-Jie absent but monitored by PhD students. It also includes a brief overview of directed graphs, topological sorting, and contact information for office hours. Homework solutions and graded assignments will be addressed in upcoming sessions.

ora
Télécharger la présentation

Important Lecture Notes and Homework Details for CSE 331 - Oct 7, 2011

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Lecture 17 CSE 331 Oct 7, 2011

  2. HW 4 due today Q1, Q2 and Q3 in separate piles I will not take any HW after 1:15pm

  3. Mid term Monday in class at 1pm Unfortunately I won’t be there Jiun-Jie with my PhD students Steve & Swapnoneel will proctor the exam

  4. Graded HW 3 & solutions to HW4 Graded HW3 in office-hour-a-thon Solutions to HW 4 at the end of the lecture

  5. On Friday, Oct 7 hours-a-thon Unclaimed HWs and solutions Atri: 2:00-3:00 (Bell 123) Jiun-Jie: 4:00-5:00 (Commons 9) Jesse: 5:00-6:00 (Bell 224)

  6. To form a group Can use comment section on the blog (Do not use the anonymous comment link)

  7. If there is interest Can spend last 10 mins taking questions on the mid-term

  8. Directed graphs Model asymmetric relationships Precedence relationships u needs to be done before v means (u,v) edge

  9. Directed graphs Adjacency matrix is not symmetric Each vertex has two lists in Adj. list rep.

  10. Directed Acyclic Graph (DAG) No directed cycles Precedence relationships are consistent

  11. Topological Sorting of a DAG Order the vertices so that all edges go “forward” Topological sorting  DAG

  12. HW 4 due today Q1, Q2 and Q3 in separate piles I will not take any HW after 1:15pm

  13. Today’s agenda DAG  topological sorting

  14. A notation announcement I will (try to) not use u from now on

  15. Run of TopOrd algorithm

More Related