Name: Soa Technology
Address: IN

July 17, 2021

Heap sort is more efficient for small size of file.

Each statement below is either TRUE or FALSE. Choose the most appropriate one andENTER in the “tear-off” sheet attached to the question paper, following instructionstherein.

July 17, 2021

A complete binary tree with 10 leaves

July 17, 2021

Given 2 sorted lists of size “m” and “n” respectively.

July 17, 2021

Which of the following expressions accesses the (i,j) th entry of a matrix stored in column major form?

July 17, 2021

The smallest number of keys that will force a B- tree of order 3 have a height 3 is:

July 17, 2021

The time complexity of the Depth First Search algorithm to traverse a graph of “n” vertices and “e” edges is:

July 17, 2021

If j=2, m=1, x=3, y=4. What is the value of the expression j++ = = m = = y * x

July 17, 2021

Which of the following types of expressions does not require precedence rules for evaluation?

July 17, 2021

Which of the following data structure may give overflow error, even though the current number of elements in it, is less than its size

July 17, 2021

Adjacency matrix for a digraph is

Heap sort is more efficient for small size of file.

Heap sort is more efficient for small size of file.

A complete binary tree with 10 leaves

Given 2 sorted lists of size “m” and “n” respectively.

Which of the following expressions accesses the (i,j) th entry of a matrix stored in column major form?

The smallest number of keys that will force a B- tree of order 3 have a height 3 is:

The time complexity of the Depth First Search algorithm to traverse a graph of “n” vertices and “e” edges is:

If j=2, m=1, x=3, y=4. What is the value of the expression j++ = = m = = y * x

Which of the following types of expressions does not require precedence rules for evaluation?

Which of the following data structure may give overflow error, even though the current number of elements in it, is less than its size

Adjacency matrix for a digraph is

Soa Technology

External Links

Recent Posts