ISRO Quiz-3

Consider the following statements

Statement 1- In Dijkstra algorithm, number of relaxations is always less than number of the edges.

Statement 2- number of distinct spanning trees depends on the edge’s weight in the tree.

Statement 3- For any connected undirected edge weight graph, shortest path between any two vertices may or may not be always unique.

Number of statements that are correct

Which languages necessarily need heap allocation in the runtime environment?

Suppose CRC generator polynomial is x³+x²+1 and data that user wants to send is 1011011. Then extra bits that needed to append is

A CPU has 24-bit instructions. A program starts at address 300 (in decimal). Which one of the following is a legal program counter (all values in decimal)?

What will be the output of given C code?

main()

{

int i=1;

printf("%d%d%d",i,++i,i++);

}

What will be the output printed by the following C program?

void main ( )

{

int x = 1, i, y = 2;

for (i = 0; i < 5; i++)

{

x << 1;

y = x + i;

}

printf(“%d, %d”, x, y);

}

Calculate the order of leaf (p_leaf) and non leaf (p) nodes of a B⁺tree based on the information given below
Search key field = 12 bytes
Record pointer =10 bytes
Block pointer = 8 bytes
Block size = 1 KB