Scribd
Upload
106 views3 pages

Quiz 004

This document contains a 10 question quiz on topics related to C++ sorting and graphics. The questions cover topics like pre-order tree traversal, radix sorting, properties of trees, time complexity of sorting algorithms, binary search requirements, and complexity analyses of different sorting algorithms.

Uploaded by

JOHNSON KORAI
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
106 views3 pages

Quiz 004

This document contains a 10 question quiz on topics related to C++ sorting and graphics. The questions cover topics like pre-order tree traversal, radix sorting, properties of trees, time complexity of sorting algorithms, binary search requirements, and complexity analyses of different sorting algorithms.

Uploaded by

JOHNSON KORAI
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

10/12/2019 Quiz 004

Dashboard / My courses / BL-ITE-6201-LEC-1923T / Week 7 to 8: C++ Sorting and C++ Graphics / Quiz 004

Question 1 Which indicates pre-order traversal?


Not yet
answered
Select one:
Marked out of
a. Right sub-tree, Left sub-tree and root
1.00
b. Root, Left sub-tree, Right sub-tree

c. Right sub-tree, Root, Left sub-tree

d. Left sub-tree, Right sub-tree and root

Clear my choice

Question 2 The method used by card sorter.


Not yet
answered
Select one:
Marked out of
a. Quick
1.00
b. Radix sort

c. Heap

d. Insertion

Clear my choice

Question 3 A connected graph T without any cycles is called ________________.


Not yet
answered
Select one:
Marked out of
a. circular graph
1.00
b. no cycle graph

c. non-cycle graph

d. free graph

Clear my choice

Question 4 The complexity of sorting algorithm measures the __________ as a function of the number n of items to be shorter.
Not yet
answered
Select one:
Marked out of
a. average time
1.00
b. case-complexity

c. average-case complexity

d. running time

Clear my choice

Question 5 The depth of complete binary tree is given by ________________.


Not yet
answered
Select one:
Marked out of
a. Dn = n log2n+1
1.00
b. Dn = log2n

c. Dn = n log2n

d. Dn = log2n+1

blended.amaesonline.com/abl-trimestral/mod/quiz/attempt.php?attempt=19194&cmid=3200 1/3
10/12/2019 Quiz 004

Clear my choice

Question 6 The average case occurs in linear search algorithm _______________.


Not yet
answered
Select one:
Marked out of
a. when item is the last element in the array
1.00
b. when item is not the array at all

c. when item is somewhere in the middle of the array

d. item is the last element in the array or item is not there at all

Clear my choice

Question 7 Which of the following is not the required condition for binary search algorithm?
Not yet
answered
Select one:
Marked out of
a. There must be mechanism to delete and/or insert elements in list
1.00
b. The list must be sorted

c. Number values should only be present

d. There should be the direct access to the middle element in any sub list.

Clear my choice

Question 8 A connected graph T without any cycles is called a ____________.


Not yet
answered
Select one:
Marked out of
a. A tree graph
1.00
b. Free tree

c. A tree

d. all of these

Clear my choice

Question 9 The complexity of merge sort algorithm.


Not yet
answered
Select one:
Marked out of
a. O(logn)
1.00
b. O(n logn)

c. O(n2)

d. O(n)

Clear my choice

Question 10 ___________ sorting algorithm is frequently used when n is small, where n is the total number of elements.
Not yet
answered
Select one:
Marked out of
a. Bubble
1.00
b. Heap

c. Insertion

d. Quick

Clear my choice

blended.amaesonline.com/abl-trimestral/mod/quiz/attempt.php?attempt=19194&cmid=3200 2/3
10/12/2019 Quiz 004

◄ Quiz 003 Jump to... Midterms ►

blended.amaesonline.com/abl-trimestral/mod/quiz/attempt.php?attempt=19194&cmid=3200 3/3

You might also like