CSE382 - Algorithms and Data Structures

Lecture #12 - Preparing for Oral Examination

Revised: 24 November 2008
Home Courses Code Handouts CoreTech Books Articles Math Research Masters Projects SWDev WebDev News OtherLinks SiteDesign Graduates AllPages Office Hours Notices Contents
CSE382-AADS CSE681-SWMAA CSE686-IP CSE687-OOD CSE775-DO CSE776-DP CSE778-AWP CSE784-SWS
Lecture #01 Lecture #02 Lecture #03 Lecture #04 Lecture #05 Lecture #06 Lecture #07
Lecture #08 Lecture #09 Lecture #10 Lecture #11 Lecture #12 Lecture #13 Lecture #14
Contents Syllabus

Web Resources:

UML XML, HTML Code Project Microsoft Developer's Network DevelopMentor XML Sells Brothers Windows Developer's Journal Windows Forms DotNetJunkies GotDotNet C# Corner Mono Project

Office Hours: Instructor & TAs

Content:

This lecture summarizes what is to be covered in the Oral Exam.
  1. The Syllabus describes topics to be covered, reading material for you to digest before coming to class, and due dates for the assigned projects.
  2. Structure of handouts directories, notices page, office hours

    3. Binary Search Trees

  3. 2 3 4 Trees
  4. Red Black Tree - Wikipedia
  5. Red Black Tree - UC.edu

    6. Priority Heaps

  6. Priority Heaps - Auckland.ac
  7. Priority Heaps - Wikipedia

    8. Graphs

  8. Strong Components
  9. Transitive closure

    10. Linear Vector Spaces

  10. Linear Vector Spaces

    11. Programming Algorithms and Data Structures

  11. Abstract Data Type Presentation
  12. C++ Hashtable
  13. STL Presentation
  14. .Net Framework