GATE 2022 Toppers Quiz 8

Consider the following C function which adds a given node pointed by q at the tail of the linked list. (Note that the next pointer of the new node to be inserted is already initialized as NULL).
Struct node * add (struct node * head, struct node * q)

{

if (! head) return q;

struct node * p = head;

while (p  → next! = NULL)

{

}

return head;

}

A person new to programming attempts to fill these boxes B₁, B₂, B₃ in ways as given in options. Which of following is/are correct ways of filling the boxes so that the implementation works correctly?

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

In a computer, the stack memory addressing uses?

Consider the following digital circuit:

The number of clock cycles required to reach at 110 if initial stage is 110 ________.

REFERENCE DATABASE :

EMP( EID, EName, Salary, Start_Date, End_Date)

IN_DEPT (EID, DID, Percent_Time )

BUILDING (BID, BName, Address )

IN_BUILDING( EID ,BID )

DEPT(DID, DName, Annual_Budget )

MANAGES_DEPT(EID, DID )

This is the Reference Database referred to in the following question. There are six tables describing a company, describing employees, departments, buildings, which department(s) an employee works in (and a percentage of the time for each), department managers (possibly more than one per department), and in which building an employee works (an employee may have more than one office). The primary key of each table is the attribute(s) in capitals. Other attributes are not necessarily unique.

Assume that the tables have many rows.

Which of the following queries finds the name of the Department(s) where the highest paid employee works?

Consider the description to solve for any problem ‘S’ using recursive tree method S1 below:

S1 : Recursion depth of tree is atmost log₂ n.
S2 : Total number of nodes at level i is atmost 5ⁱ.
S3 : The maximum number of leaves is atmost 5^{log n}.
S4 : The recurrence is bounded by summation.
Using all four statement if T(n) represents the time complexity to solve problem ‘S’ and gives T(n) = O(n^p).
Then the value of p is __________.

Consider a new version of TCP header called TCP++. The header of TCP++ accommodates a round trip time of 200 ms, with bandwidth of 10 Mbps. The number of bits required for the advertised window (in bits) are ________.

How many comparisons are needed to sort ' 5 ' elements by using any comparison-based sorting algorithm in worst case?