exam2Sec1Example - CSE 331 Section 1 Study questions for...

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

View Full Document Right Arrow Icon
CSE 331 Section 1 Study questions for Exam 2 Stockman The exam is scheduled for Thursday, 29 March. The following questions are samples: they may not cover the entire range of the exam. The exam coverage is from the text sections from the syllabus: heaps/Ch 6; hashing/Ch 5; graphs/Ch 9 and from concepts covered in class. Basic algorithms concepts from Chapters 1 and 2 apply as needed. 1. Samples from algorithms and algorithm analysis: assume multiple choices as in exam 1. ++++++++++++++ exam 1 type choices are here ++++++++++++++++++ a) What is the cost of creating a min heap in an array of N unordered integers? b) What is the cost of adding a single integer to an existing min heap of N integers? c) Consider graph G=(V,E): what is the cost of deciding whether or not there are vertices u and v with no path from u to v? d) Consider digraph G. What is the cost of determining the length of the longest path of all the shortest paths from some fixed vertex u to any other vertex v. e)
Background image of page 1

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

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

This note was uploaded on 07/25/2008 for the course CSE 331 taught by Professor M.mccullen during the Spring '08 term at Michigan State University.

Page1 / 2

exam2Sec1Example - CSE 331 Section 1 Study questions for...

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

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