Question # 1

By using __________we avoid the recursive method of traversing a Tree, which makes use of stacks and consumes a lot of memory and time.

Choose an answer

Binary tree only

Threaded binary tree

Heap data structure

Huffman encoding

By using _____ we avoid recursive method of traversing a tree,which makes use of stacks and consumes a lot of memory and time.

Choose an answer

Binary tree only

Threaded binary tree

Heap data structure

Huffman encoding

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

Choose an answer

N

N²

Nlog2N

log₂N

A kind of expression where the operator is present between two operands called ________ expressions .

Choose an answer

Postfix

Infix

Prefix

None of the above

Here is an array of ten integers: 5 3 8 9 1 7 0 2 6 4 The array after the FIRST iteration of the large loop in a selection sort (sorting from smallest to largest).

Choose an answer

0 3 8 9 1 7 5 2 6 4

2 6 4 0 3 8 9 1 7 5

2 6 4 9 1 7 0 3 8 5

0 3 8 2 6 4 9 1 7 5

A complete binary tree of height 3 has between _____ node

Choose an answer

8-14

8-15

8-16

8-17

Consider a min heap, represented by the following array: 3,4,6,7,5,10 After inserting a node with value 1.Which of the following is the updated min heap?

Choose an answer

3,4,6,7,5,10,1

3,4,6,7,5,1,10

3,4,1,5,7,10,6

1,4,3,5,7,10,6close to correct but correct ans is 1,4,3,7,5,10,6

The data of the problem is of 2 GB and the hard disk is of 1 GB capacity,to solve this problem we should

Choose an answer

use better data structure

Increase the hard disk space

Use the better algorithm

Use as much data as we can store on the hard disk

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

If you know the size of the data structure in advance, i.e., at compile time, which one of the following is a good data structure to use.

Choose an answer

Array

List

Both

None of the above

Suppose we are sorting an array of eight integers using quick sort, and we have just finished the first partitioning with the array looking like this: 2 5 1 7 9 12 11 10 Which statement is correct?

Choose an answer

The pivot could be either the 7 or the 9

The pivot could be the 7, but it is not the 9.

The pivot is not the 7, but it could be the 9.

Neither the 7 nor the 9 is the pivot.

Binary Search is an algorithm of searching, used with the ______ data

Choose an answer

Sorted

Unsorted

Heterogeneous

Random

A binary tree of N nodes has _____

Choose an answer

Log₁₀N Levels

Log₂ N levels

N/2 Levels

N X2 Levels

Which of the following is NOT a correct statement about Table ADT.

Choose an answer

n a table, the type of information in columns may be different. yes

A table consists of several columns, known as entities.

The row of a table is called a record.

A major use of table is in databases where we build and use tables for keeping information.

In an array list the current element is

Choose an answer

the first element

the middle element

the last element

The element where the current pointer points to

A binary relation R over S is called an equivalence relation if it has following property(s)

Choose an answer

Reflexivity

Symmetry

Transitivity

All of the given options

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)

If there are 56 internal node in a binary tree then how many external nodes this binary tree will have ?

Choose an answer

54

55

56

57

Which of the following is a non linear data structure?

Choose an answer

Linked List

Stack

Tree

Queue

Huffman encoding uses _________ tree to develop codes of varying lengths for the letters used in the original message

Choose an answer

Linked List

Stack

Queue

Binary tree

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

Choose an answer

31

32

33

66

Select the FALSE statement binary tree.

Choose an answer

Every binary tree has at least one node.

Every non-empty tree has exactly one root node.

Every node has at most two children.

Every non-root node has exactly one parent.

A binary tree with 24 internal node has ____ external node.

Choose an answer

22

23

48

25

Use of binary tree in compression of data is known as _______

Choose an answer

Traversal

Heap

Union

Huffman encoding

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

Choose an answer

Choose an answer

Choose an answer