Question # 1

Consider the following postfix expression S and the initial values of the variable,

S = A B - C + D E F - + ^ Assume that A=3, B=2, C=1, D=1, E=2, F=3 What would be the final output of the stack?

Choose an answer

1

2

0

-1

A compound data structure is the data structure which can have multiple data items of same type or of different types,which of the following can be considered compound data structure ?

Choose an answer

Arrays

LinkLists

Binary Search Trees

All of the given options

If a max heap is implemented using a partially filled array called data, and the array contains n elements (n > 0), where is the entry with the greatest value?

Choose an answer

Data[0]

data[1]

data[n-1]

data[n]

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.

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

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 statement statement is true about dummy node of threaded binary type?

Choose an answer

This dummy node never has a value

This dummy node has always some dummy values

This dummy node has either no value or some dummy value

This dummy node has always some integer value

A binary tree with 33 internal nodes has _______ links to internal nodes.

Choose an answer

31

32

33

66

Every AVL is

Choose an answer

Binary tree

Complete tree

None of these

Binary Search tree

Which of the following is a property of binary tree?

Choose an answer

A binary tree of N external nodes has N internal node.

A binary tree of N internal nodes has N+ 1 external node

A binary tree of N external nodes has N+ 1 internal node

A binary tree of N internal nodes has N- 1 external node.

_________ is a data structure that can grow easily dynamically at run time without having to copy existing elements.

Choose an answer

Array ()

List

Both of these

None of these

If there are N elements in an array then the number of maximum steps needed to find an element using Binary Search is _______

Choose an answer

N

N²

Nlog₂n

log₂N

If there are 23 external nodes in a binary tree then what will be the no. of internal nodes in this binary tree?

Choose an answer

23

24

21

22 (n-1)

Compiler uses which one of the following to evaluate a mathematical equation

Choose an answer

Binary Tree

Binary Search Tree

Parse Tree

AVL Tree

Here is a small function definition:

void f(int i, int &k)

{ i

= 1; k = 2;

}

Suppose that a main program has two integer variables x and y, which are given the value 0. Then the main program calls f(x,y); What are the values of x and y after the function f finishes?

Choose an answer

Both x and y are still 0.

x is still 0, but y is now 2.

x is now 1, and y is now 2.

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

The _______ method of list will position the currentNode and lastCurrentNode at the start of the list.

Choose an answer

Remove

Back

If both pointers of the node in a binary tree are NULL then it will be a/an _______ .

Choose an answer

Inner node

Leaf node

Root node

None of the given options

Which of the following is not true regarding the maze generation ?

Choose an answer

Randomly remove walls until the entrance and exit cells are in same set

Removing a wall is the same as doing union of operation

Removing a randomly chosen wall if the cell is separatedare already in the same set

Do not remove a randomly chosen wall if the cells it separates are already in the same set.

it will be efficient to place stack elements at the start of the list because insertion and removal take _______time.

Choose an answer

Variable

Constant

Inconsistent

None of the above

The maximum number of external nodes for a binary tree of height H is

Choose an answer

2^h

2^h+1

2^h+2

2^h+3

More Classes

Other Links

PHY-101 Quiz OnlineTest 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

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