CS 146 Laney College Data Structure Questions
Description
Unformatted Attachment Preview
Due Tuesday, February 7, at 7:00AM
10 points
This quiz will be a written quiz. Please submit your answers to these questions by
uploading a file to Canvas. You may type or handwrite your solutions. You are free to use the
textbook, slides, class notes, but DO NOT consult any other resources. There are five
questions total (two of them on the second page).
Question 1) [2 points]
??+1
Is 2
??
= ??(2 )?
Question 2) [2 points]
2??
Is 2
??
= ??(2 )?
Question 3) [2 points]
2
Explain why the statement, (e running time of algorithm A is at least ??(?? ))s
meaningless.
Question 4) [2 points]
Using reasoning similar to what we used for insertion sort in class, analyze the running
time of the selection sort algorithm from the first homework assignment.
selectionSort(arr)
for startOfUnsorted in 0 to arr.length
cost
??1
smallestInUnsorted = max value
??2
indexOfSmallest = -1
??3
for i in startOfUnsorted to arr.length
??4
int current = arr[i]
??5
if arr[i] < smallestInUnsorted
??6
smallestInUnsorted = arr[i]
??7
indexOfSmallest = i
??8
swap arr[indexOfSmallest],arr[startOfUnsorted]
Question 5) [2 points]
Why do all cases have the same runtime in selection sort?
??9
time
Purchase answer to see full
attachment
Have a similar assignment? "Place an order for your assignment and have exceptional work written by our team of experts, guaranteeing you A results."