Database System Concepts
Database System Concepts
7th Edition
ISBN: 9780078022159
Author: Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher: McGraw-Hill Education
Bartleby Related Questions Icon

Related questions

Question

answer the following

5. The maximum number of nodes at level n for a binary tree is:
C. 2"
A. n
В. 2п
D. n + 1
6. For analyzing an algorithm, which is better computing time?
A. 0(100 Log N)
B. 0(2N)
C. 0(N Log N)
D. O(N²)
7. Which of the following is not as a quadratic sorting algorithm?
A. Bubble sort
B. Selection sort
C. Quick sort
D. Insertion sort
8. Which data structure allows deleting data elements from front and inserting at rear?
A. Stacks
B. Queues
C. Binary search trees
D. Hash tables
9. Which of the algorithm design approach is used by Quick sort and Merge sort
A. Branch and bound approach
B. Greedy approach
C. Dynamic approach
D. Divide and Conquer approach
10. Which of the following is the recurrence equation for the worst case time complexity of the
quick sort algorithm for sorting n (2 2) numbers ? where c is a constant
А. Т(п) — 2T (n/2) + сп
В. Т(п) — т(n/2) + сп
С. Т(п) — 2T (n - 2) + сп
D. T(n) = T(n-1) + T(1) + cm
expand button
Transcribed Image Text:5. The maximum number of nodes at level n for a binary tree is: C. 2" A. n В. 2п D. n + 1 6. For analyzing an algorithm, which is better computing time? A. 0(100 Log N) B. 0(2N) C. 0(N Log N) D. O(N²) 7. Which of the following is not as a quadratic sorting algorithm? A. Bubble sort B. Selection sort C. Quick sort D. Insertion sort 8. Which data structure allows deleting data elements from front and inserting at rear? A. Stacks B. Queues C. Binary search trees D. Hash tables 9. Which of the algorithm design approach is used by Quick sort and Merge sort A. Branch and bound approach B. Greedy approach C. Dynamic approach D. Divide and Conquer approach 10. Which of the following is the recurrence equation for the worst case time complexity of the quick sort algorithm for sorting n (2 2) numbers ? where c is a constant А. Т(п) — 2T (n/2) + сп В. Т(п) — т(n/2) + сп С. Т(п) — 2T (n - 2) + сп D. T(n) = T(n-1) + T(1) + cm
Expert Solution
Check Mark
Knowledge Booster
Background pattern image
Computer Science
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education