lecture18

# lecture18 - Wednesday,March11 th Evaluationforms...

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

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

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

View Full Document
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?
Review Problem #0 Given a randomly ordered array of N integers, what is the big-oh of the most  efficient algorithm for determining if any single number in the array makes up

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 11/07/2009 for the course CS 32 taught by Professor Davidsmallberg during the Winter '08 term at UCLA.

### Page1 / 10

lecture18 - Wednesday,March11 th Evaluationforms...

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

View Full Document
Ask a homework question - tutors are online