Binary tree sort implemented using a self balancing binary search tree takes O(n log n) time in the worst case but still it is slower than merge sort.

The binary tree sort implemented using a self – balancing binary search tree takes ______ time is worst case.

A

O(n log n)

B

O(n)

C

O(n2)

D

O(log n)

We create a binary search tree B1 by inserting the numbers 1, 2, 3, 4, 5 into an empty binary search tree. We create another binary search tree B2 by inserting the numbers into an empty binary search tree in the reverse order. What is the difference between the right-most element of B1 and the left-most element of B2?

A

1

B

3

C

4

D

2

The worst case time complexity of insertion sort is O(n2). What will be the worst case time complexity of insertion sort if the correct position for inserting element is calculated using binary search?

A

O(nlogn)

B

O(n2)

C

O(n)

D

O(logn)

Which of the following is/are correct about a strictly binary tree? A. A binary tree is called strictly binary tree if every non-leaf node of it has non empty left and right sub tree B. In strictly binary tree can have two children or no child C. A strictly binary tree with n leaves always contact 2n-1 nodes

A

Only A

B

Only B

C

A and B

D

A, B and C

The usual O(n2) implementation of insertion sort to sort an array uses linear search to identify the position where an element is to be inserted into the already sorted part of the array. If, instead, we use binary search to identify the position, the worst case running time will

A

remain O(n²)

B

become O(n(log n)²)

C

become O(n logn)

D

become O(n)

Given below are two quantities named A and B. Based on the given information, you have to determine the relation between the two quantities. You should use the given data and your knowledge of Mathematics to choose between the possible answers. Quantity A: A person who travels a certain distance to his office by his car.If he increases his speed by 8 km/hr, he takes 2 hours less time but if he drives 8 km/hr slower, he takes 4 hours more time. Find the distance of office from home. Quantity B: A person who travels a certain distance to his office by his car. If he increases his speed by 10 km/hr, he takes 1 hour less time but if he further increases his speed by 5 km/hr, he takes further 20 minutes lesser time. Find the distance of office from home.

A

Quantity A > Quantity B

B

Quantity A < Quantity B

C

Quantity A ≥ Quantity B

D

Quantity A ≤ Quantity B

E

Quantity A = Quantity B or No relation.

Which of the following are true? (i) A programming language option does not permit global variables of any king and has no nesting of procedures/functions, but permits recursion can be implemented with static storage allocation (ii) Multi-level access link (or display) arrangement is needed to arrange activation records-only if the programming language being implemented has nesting of procedures/function (iii) Recursion in programming languages cannot be implemented with dynamic storage allocation (iv) Nesting of procedures/functions and recursion require a dynamic heap allocation scheme and cannot be implemented with a stack-based allocation scheme for activation records (v) Languages which permit a function to return a function as its result cannot be implemented with a stack-based storage allocation scheme for activation records.

A

(ii) and (v) only

B

(i), (iii) and (iv) only

C

(i), (ii) and (v)

D

(ii), (iii) and (v) only

The worst case time complexity of tree sort remains unaffected when implemented with an unbalanced tree or a balanced tree.

A

True

B

False

Consider the pseudocode given below. The function DoSomething() takes as argument a pointer to the root of an arbitrary tree represented by the leftMostChild-rightSibling representation. Each node of the tree is of type treeNode. typedef struct treeNode* treeptr; struct treeNode { treeptr leftMostChild, rightSibling; }; int DoSomething (treeptr tree) { int value=0; if (tree != NULL) { if (tree->leftMostChild == NULL) value = 1; else value = DoSomething(tree->leftMostChild); value = value + DoSomething(tree->rightSibling); } return(value); } When the pointer to the root of a tree is passed as the argument to DoSomething, the value returned by the function corresponds to the

A

number of internal nodes in the tree

B

height of the tree

C

number of nodes without a right sibling in the tree

D

number of leaf nodes in the tree

log 3 + log 9 + log 27 + ……………i. ধারার পরবর্তী পদ log 81 ii. একটি সমান্তর ধারা iii. এর সাধারণ অন্তর log 6 নিচের কোনটি সঠিক?

A

i ও ii

B

i ও iii

C

ii ও iii

D

i, ii ও iii

Binary tree sort implemented using a self balancing binary search tree takes O(n log n) time in the worst case but still it is slower than merge sort.

Related Questions