zbzFinal Review

zbzFinal Review - FinalExamReview FinalExamTopics Recursion...

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

View Full Document Right Arrow Icon
Final Exam Review Final Exam Topics Recursion Big-O Sorting (slow and efficient sorting algorithms) Traversals Binary Search Trees Searching, Inserting, Deleting, etc. Tables, Hash Tables, Load, etc. Priority Queues, Heaps and HeapSort 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 #1 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 #2 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  more than 50% of the array? Given a binary search tree, what is the algorithm to print it out in reverse 
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.

This note was uploaded on 04/02/2012 for the course COMPUTER S 32 taught by Professor Smallberg during the Winter '12 term at UCLA.

Page1 / 9

zbzFinal Review - FinalExamReview FinalExamTopics Recursion...

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