22. Alternate Inorder traversal could be performed on a n-node BST by calling TreeMIN and then calling, on value returned, TreeSuccessor A.n times. В. п-1 C.n+1 D. lg n 23. On a DEQUE(double ended queue) following operations were performed what will be the contents of the queue after Pu:4 Pu:5 En:9 Po Pu:8 De Po En:1 De А. 1 В.15 C.4 5891 D.5 89 24. On an array of size 12, 4 successive PARTITION procedures were called, after that how many elements have reached their correct location? A. 4 В. 3 C.depends on pivot 25. Let P be a quick sort program to sort numbers in ascending order. Let tl and t2 be the time taken by the program for the inputs [1 2 3 4 5] and [5 4 32 1] respectively. Which of the following holds ? A. tl = t2 B. 12>tl C.tl >t2 D.tl=12 + log5 26. Inorder and Post order Traversal of a tree will return same result if.. A.tree is a leftest tree B. not possible C. tree is a rightest tree 27. Lets assume there are two Shortest path algorithms A & B. Both algorithms will find same shortest path between two given nodes x & y? A. Yes В. No C. Yes: if there doesn't exist multiple short paths 28. Would the hashCode be a valid hash method? int hashCode() { return -1; } A. Yes B. No: it returns -1 C. No: it is not
22. Alternate Inorder traversal could be performed on a n-node BST by calling TreeMIN and then calling, on value returned, TreeSuccessor A.n times. В. п-1 C.n+1 D. lg n 23. On a DEQUE(double ended queue) following operations were performed what will be the contents of the queue after Pu:4 Pu:5 En:9 Po Pu:8 De Po En:1 De А. 1 В.15 C.4 5891 D.5 89 24. On an array of size 12, 4 successive PARTITION procedures were called, after that how many elements have reached their correct location? A. 4 В. 3 C.depends on pivot 25. Let P be a quick sort program to sort numbers in ascending order. Let tl and t2 be the time taken by the program for the inputs [1 2 3 4 5] and [5 4 32 1] respectively. Which of the following holds ? A. tl = t2 B. 12>tl C.tl >t2 D.tl=12 + log5 26. Inorder and Post order Traversal of a tree will return same result if.. A.tree is a leftest tree B. not possible C. tree is a rightest tree 27. Lets assume there are two Shortest path algorithms A & B. Both algorithms will find same shortest path between two given nodes x & y? A. Yes В. No C. Yes: if there doesn't exist multiple short paths 28. Would the hashCode be a valid hash method? int hashCode() { return -1; } A. Yes B. No: it returns -1 C. No: it is not
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
![22. Alternate Inorder traversal could be performed on a n-node BST by calling TreeMIN
and then calling, on value returned, TreeSuccessor. tmes.
А.n
....
В. п-1
C.n+1
D. lg n
23. On a DEQUE(double ended queue) following operations were performed what will be
the contents of the queue after Pu:4 Pu:5 En:9 Po Pu:8 De Po En:1 De
A. 1
В.15
C.4 5 891
D.5 8 9
24. On an array of size 12, 4 successive PARTITION procedures were called, after that how
many elements have reached their correct location?
A. 4
В.3
C.depends on pivot
25. Let P be a quick sort program to sort numbers in ascending order. Let tl and t2 be the
time taken by the program for the inputs [1 2 3 4 5] and [5 432 1] respectively. Which
of the following holds ?
A. t1 = t2
B.. 12>t1
C.tl >t2
D.tl= 12 + log5
26. Inorder and Post order Traversal of a tree will return same result if.
A.tree is a leftest tree B. not possible
C. tree is a rightest tree
27. Lets assume there are two Shortest path algorithms A & B. Both algorithms will find
same shortest path between two given nodes x & y?
A. Yes
B. No
C. Yes: if there doesn't exist multiple short paths
28. Would the hashCode be a valid hash method?
int hashCode() { return -1; }
A. Yes
B. No: it returns -1
C. No: it is not](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fa21c4e5d-e5f3-4162-b9ae-1dfa4542b013%2F0099dd8c-c429-4e1a-a747-e07bae1b9c8f%2Fw7caafq_processed.jpeg&w=3840&q=75)
Transcribed Image Text:22. Alternate Inorder traversal could be performed on a n-node BST by calling TreeMIN
and then calling, on value returned, TreeSuccessor. tmes.
А.n
....
В. п-1
C.n+1
D. lg n
23. On a DEQUE(double ended queue) following operations were performed what will be
the contents of the queue after Pu:4 Pu:5 En:9 Po Pu:8 De Po En:1 De
A. 1
В.15
C.4 5 891
D.5 8 9
24. On an array of size 12, 4 successive PARTITION procedures were called, after that how
many elements have reached their correct location?
A. 4
В.3
C.depends on pivot
25. Let P be a quick sort program to sort numbers in ascending order. Let tl and t2 be the
time taken by the program for the inputs [1 2 3 4 5] and [5 432 1] respectively. Which
of the following holds ?
A. t1 = t2
B.. 12>t1
C.tl >t2
D.tl= 12 + log5
26. Inorder and Post order Traversal of a tree will return same result if.
A.tree is a leftest tree B. not possible
C. tree is a rightest tree
27. Lets assume there are two Shortest path algorithms A & B. Both algorithms will find
same shortest path between two given nodes x & y?
A. Yes
B. No
C. Yes: if there doesn't exist multiple short paths
28. Would the hashCode be a valid hash method?
int hashCode() { return -1; }
A. Yes
B. No: it returns -1
C. No: it is not
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
Knowledge Booster
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
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education