lecture18

lecture18 - Wednesday, March 11 th Evaluation forms Prize...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
Wednesday, March 11 th   Evaluation forms Final exam review Final Exam Topics Everything from before the Midterm Recursion Big-oh Sorting Traversals Searching, Inserting, Deleting, etc. Tables (BST’s and Hash Tables) Priority Queues Heaps Graphs Traverals
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Review Problem #0 Given: hash_map<student,set<class> >  studentClass There are S students and an average of C classes per student. What is the big-oh of printing all students alphabetically and for each  student, listing each of their classes alphabetically? What is the big-oh of determining who’s taking CS32? What is the big-oh of determining if Joe Smith is taking CS32?
Background image of page 2
Review Problem #0 Given a randomly ordered array of N integers, what is the big-oh of the most 
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 10

lecture18 - Wednesday, March 11 th Evaluation forms Prize...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online