Homework Answers
Note: As per HOMEWORKLIB RULES I am allowed to answer only one question per post(But I have answered 2), so please do post the rest as a separate query. Sorry for the inconvenience caused.
10)
quick sort has the following recurrence
T(n)= T(n-1)+ O(n)
T(n)= O(n^2)
so the answer is option B
11)
the best case for any comparison based sorting is O(nlogn)
this is because any permutation of n elements which is n! must apper as leaves in the sorting. It is a big theorem. Please do read it once.
Add Answer to:
Canvas →XC 6 D Question 10 5 pts When sorting n records, Quicksort has worst-case cost...
C++ Question 5 5 pts In a min-heap of N elements, if we want to find...
C++
Question 5 5 pts In a min-heap of N elements, if we want to find the max element, we have to search all the leaves. What is the big-o running time of findMax? O(N^2) Oſlog N) O(N) OIN log N) Question 6 5 pts An AVL tree is a Binary Search Tree that has the following additional property for every node in the tree, the height of the left and right subtrees is the same none of the above...
not A Question 5 In the worst case, the very best that a comparison based sorting...
not A
Question 5 In the worst case, the very best that a comparison based sorting algorithm can do when sorting n records is Q (n^2) Q(log (n!)) Q (logn) (n)
Canvas → XCO Question 4 5 pts When using a hash table with quadratic probing, and...
Canvas → XCO Question 4 5 pts When using a hash table with quadratic probing, and the table size is prime, then a new element can always be inserted if the table is at least half empty the table is at least half full the table is full the table is larger than any data value Question 5 5 pts The general strategy of inorder traversal is: process the left subtree, then process the current node and finally process the...
C++ Question 1 5 pts A binary heap's structure is an AVL tree a complete binary...
C++
Question 1 5 pts A binary heap's structure is an AVL tree a complete binary tree a particular case of binary search tree a sparse tree Question 2 5 pts When using a hash table with quadratic probing, and the table size is prime, then a new element can always be inserted if the table is at least half empty the table is full the table is at least half full the table is larger than any data value...
The INORDER traversal output of a binary tree is U,N,I,V,E,R,S,I,T,Y and the POSTORDER traversal output of the same tree is N,U,V,R,E,T,I,S,I,Y
a. The INORDER traversal output of a binary tree is U,N,I,V,E,R,S,I,T,Y and the POSTORDER traversal output of the same tree is N,U,V,R,E,T,I,S,I,Y. Construct the tree and determine the output of the PREORDER traversal output. b. One main difference between a binary search tree (BST) and an AVL (Adelson-Velski and Landis) tree is that an AVL tree has a balance condition, that is, for every node in the AVL tree, the height of the left and right subtrees differ by at most 1....
C++ Question 9 5 pts Deleting the minimum element in a min-heap of N elements takes...
C++
Question 9 5 pts Deleting the minimum element in a min-heap of N elements takes in average case O(N log N) O(1) O(N) Oſlog N) D Question 10 5 pts The time taken to find an element in an AVL tree of depth d is Old) 02) Oſlog d) Old log d) Question 11 5 pts Secondary clustering in a hash table occurs when using Linear probing Separate chaining Quadratic probing Double hashing Question 12 5 pts When sorting...
(5 marks; questions to Reza) In Lecture 5, Travis said you can prove QuickSort takes N(n...
(5 marks; questions to Reza) In Lecture 5, Travis said you can prove QuickSort takes N(n log n) time in the best case the same way he proved any comparison-based sorting algorithm takes (n log n) time in the worst case. Give that proof. Notice it doesn't follow directly: e.g., Insertion Sort takes O(n) time in the best case. You can assume QuickSort divides each array into elements less than or equal to the pivot (including the pivot itself) and...
When sorting n records, Merge sort has worst-case running time a. O(n log n) b. O(n)...
When sorting n records, Merge sort has worst-case running time a. O(n log n) b. O(n) c. O(log n) d. O(n^2)
When sorting n records, Merge Sort has worst-case running time O(log n) O O(n log n)...
When sorting n records, Merge Sort has worst-case running time O(log n) O O(n log n) O O(n) O(n^2)
1) (10 pts) What are the worst case run times of each of the following operations?...
1) (10 pts) What are the worst case run times of each of the following operations? Make sure to list your answer in terms of the appropriate variables in the prompt. Note that on occasion, some of the run times won't be dependent on some of the variables listed in the prompt. (a) Inserting an item to the front of a linked list of n elements. (b) Sorting n integers using Quick Sort. (c) Merging a sorted list of a...
C++
Question 5 5 pts In a min-heap of N elements, if we want to find the max element, we have to search all the leaves. What is the big-o running time of findMax? O(N^2) Oſlog N) O(N) OIN log N) Question 6 5 pts An AVL tree is a Binary Search Tree that has the following additional property for every node in the tree, the height of the left and right subtrees is the same none of the above...
not A
Question 5 In the worst case, the very best that a comparison based sorting algorithm can do when sorting n records is Q (n^2) Q(log (n!)) Q (logn) (n)
Canvas → XCO Question 4 5 pts When using a hash table with quadratic probing, and the table size is prime, then a new element can always be inserted if the table is at least half empty the table is at least half full the table is full the table is larger than any data value Question 5 5 pts The general strategy of inorder traversal is: process the left subtree, then process the current node and finally process the...
C++
Question 1 5 pts A binary heap's structure is an AVL tree a complete binary tree a particular case of binary search tree a sparse tree Question 2 5 pts When using a hash table with quadratic probing, and the table size is prime, then a new element can always be inserted if the table is at least half empty the table is full the table is at least half full the table is larger than any data value...
C++
Question 9 5 pts Deleting the minimum element in a min-heap of N elements takes in average case O(N log N) O(1) O(N) Oſlog N) D Question 10 5 pts The time taken to find an element in an AVL tree of depth d is Old) 02) Oſlog d) Old log d) Question 11 5 pts Secondary clustering in a hash table occurs when using Linear probing Separate chaining Quadratic probing Double hashing Question 12 5 pts When sorting...
(5 marks; questions to Reza) In Lecture 5, Travis said you can prove QuickSort takes N(n log n) time in the best case the same way he proved any comparison-based sorting algorithm takes (n log n) time in the worst case. Give that proof. Notice it doesn't follow directly: e.g., Insertion Sort takes O(n) time in the best case. You can assume QuickSort divides each array into elements less than or equal to the pivot (including the pivot itself) and...
When sorting n records, Merge Sort has worst-case running time O(log n) O O(n log n) O O(n) O(n^2)
1) (10 pts) What are the worst case run times of each of the following operations? Make sure to list your answer in terms of the appropriate variables in the prompt. Note that on occasion, some of the run times won't be dependent on some of the variables listed in the prompt. (a) Inserting an item to the front of a linked list of n elements. (b) Sorting n integers using Quick Sort. (c) Merging a sorted list of a...
Most questions answered within 3 hours.
-
Which of the following pairs of ions have the same electron
configuration?
I: Br− and Se2−...
asked 1 hour ago -
The Foremost Composite Materials Company is planning a two-day
sales conference for October 19-20. The conference...
asked 1 hour ago -
3) Illustrate the observed pattern of relatedness of organisms
versus adaptations to specific conditions. This means...
asked 2 hours ago -
In winter a lake has a 0.35 m thick ice layer over 1.10 m of
water....
asked 3 hours ago -
Assuming the following has been encrypted with a Vigenere cipher
below, use the method(s) and assumptions...
asked 3 hours ago -
How would I use switch statements to write a program that will
take an input of...
asked 3 hours ago -
Imagine a reaction in which methane gas combusts at a constant
pressure of 1 atm and...
asked 3 hours ago -
Two parallel wires (each 12 m in length) are separated by a
distance of 0.065 m...
asked 3 hours ago -
Suppose there were three masses at the corner of uniform
equilateral triangle. The masses are m1...
asked 3 hours ago -
Situation: A building that is 618 m above the ground floor. How
many times would a...
asked 3 hours ago -
help me and discuss one successful and one
unsuccessful international company/busines in Indonesia.whyit
succeed and why...
asked 3 hours ago -
I- Choose the best answer
Which of the following statements about the structure and
packaging of...
asked 3 hours ago