Question # 1

A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a link) to its __________ successor

Choose an answer

levelorder

Preorder

Inorder

Postorder

The definition of transitive property is

Choose an answer

For all element x member of S, x R x

For all elements x and y, x R y if and only if y R x

For all elements x, y and z, if x R y and y R z then x R z

For all elements w, x, y and z, if x R y and w R z then x R z

A queen is a data structure where elements are,

Choose an answer

inserted at the front and removed from the back

inserted and removed from the top.

inserted at the back and removed from the front.

inserted and removed from both ends.

Consider a min heap, represented by the following array: 11,22,33,44,55 After inserting a node with value 66.Which of the following is the updated min heap?

Choose an answer

11,22,33,44,55,66

11,22,33,44,66,55

11,22,33,66,44,55

11,22,66,33,44,55

We are given N items to build a heap ,this can be done with ______ successive inserts.

Choose an answer

N-1

N

N+1

N+2

A simple sorting algorithm like selection sort or bubble sort have a wrostcase of

Choose an answer

O(1) time because all lists take the same amount of time to sort

O(n) time because it has to perform n swaps to order the list.

O(n² ) time because sorting 1 element takes O(n) time - After 1 pass through the list, either of these algorithms can guarantee that 1 element is sorted.

O(n³ ) time, because the worst case has really random input which takes longer to sort.

Let heap stored in an array as H = [50, 40, 37, 32, 28, 22, 36, 13]. In other words, the root of the heap contains the maximum element. What is the result of deleting 40 from this heap

Choose an answer

[50,32, 37,13, 28, 22, 36] according to max heap property

[37, 28, 32, 22, 36, 13]

[37, 36, 32, 28, 13, 22]

[37, 32, 36, 13, 28, 22]

Which of the following statements is correct property of binary trees?

Choose an answer

A binary tree with N internal nodes has N+1 internal links

A binary tree with N external nodes has 2N internal nodes

A binary tree with N internal nodes has N+1 external nodes.

None of above statement is a property of the binary tree

Which of the given option is NOT a factor in Union by Size:

Choose an answer

Maintain sizes (number of nodes) of all trees, and during union.

Make smaller tree, the subtree of the larger one

Make the larger tree, the subtree of the smaller one.

Implementation: for each root node i, instead of setting parent[i] to -1, set it to -k if tree rooted at i has k nodes

If the bottom level of a binary tree is NOT completely filled, depicts that the tree is NOT a

Choose an answer

Expression tree

threaded binary tree

complete binary tree

perfectly complete binary tree

Which one of the following is valid postfix expression?

Choose an answer

ab+c*d-

abc*+d-

abc+*d-

abc*)+d-

More Classes

Other Links

CS-301 Final Term Exams Preparation Virtual University MCQs With Answers

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer