{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

zbzFinal Review

# zbzFinal Review - FinalExamReview FinalExamTopics Recursion...

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

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

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

View Full Document
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?
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

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.

{[ snackBarMessage ]}

### Page1 / 9

zbzFinal Review - FinalExamReview FinalExamTopics Recursion...

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

View Full Document
Ask a homework question - tutors are online