NIELIT STQC 2021 Quiz-39

Consider a Binary tree, whose root is at level 1. Each level ‘i’ of it subsequently has exactly ‘i’ nodes. The height of such a Binary tree, having a total of “n” elements is

Consider the following graph

Which of the following is correct about self-relocating program?

Consider a scenario where packetization needs to be implemented, where

3 hops to reach the destination

Data available= 1000 Bytes

Header size, H= 100 B

Bandwidth, Bw = 10 Bps and neglect the propagation time.

which of the following packet size will result in less total time delay?

Consider the heap tree (max heap):

After two deletion operation, which of the following max heap are valid:
1. 20, 8, 19, 7, 6, 9, 3, 1, 2
2. 20, 19, 8, 7, 6, 3, 9, 1, 2
3. 20, 8, 19, 7, 6, 9, 1, 3, 2
4. 20, 19, 8, 7, 6, 9, 3, 1, 2

Consider a relation Employees and assertion A be declared by the following:

CREATE TABLE Employees (

Name CHAR (50) PRIMARY KEY,

dept CHAR (20),

salary INT

);

CREATE ASSERTION A CHECK (‘’Toy’ IN (

SELECT dept

FROM Employees

GROUP BY dept

HAVING AVG (salary) ≥ 50000)

);

Which of the following best describes the constraints enforce by this assertion?

Let G be a graph with p vertices and q edges. Suppose degree of each vertex is n or n + 1. If number of vertices with degree n is x, then x = _____ .

Consider the following function:

Which of the following is true?

What are the eigen values of matrix given below:

A =

Matrix multiplication is associative if _____ condition satisfied