GATE 2022 Rapid Revision Weekly Quiz 6

Match List-I with List-II and select the correct answer using the codes given below the lists:

List-I

A- Target code generation

B- Lexical analyzer

C- Type checking

D- Syntax analyzer

List-II

1- Check the structure of the program.

2- Analysis of entire program by reading each character.

3- High level language is translated into machine dependent language.

4- Checks the consistency requirements in a context of the program.

Assume a slow start mechanism is used and assume there is no congestion. The round trip time is 20 ms and the maximum segment size is 24 KB . How much time is required to reach 24 KB of window size with packet size of 2 KB?

Which of the following recurrence relation represents the number of nodes N(h) in a minimal AVL tree of height ‘h’ ?

Consider the following statements S₁, S₂ and S₃.

S₁: Every unsatisfiable is a contingency.

S₂: Every valid is a contingency.

S₃: Every invalid is a contradiction.

Which of the following options represent the correct statements?

For function  the maximum occurs in interval [–1, 2] when x is equal to

Consider L₁ be a language in which number of b’s is thrice the number of a’s. L₂ be a language in which every ‘a’ is being followed by exact 3 b’s. Which of the following is correct ?

Consider the following elements,  find the maximum sum of a contiguous subarray of the given element list S using the dynamic algorithm, S = (2, 8, –16, 10, –8, 30, 10)?

Consider the following statements:

S₁ : More than one word are put in one cache block to reduce the miss penalty.

S₂ : Virtual memory increases the degree of multiprogramming.

S₃ : Increasing the RAM of a computer typically improves performance because virtual memory increase.

How many of the above statements are correct?

Consider the following schedule :

W1(X), W2(X), W3(X), R2(X), W4(X)

For which of the following time stamps assignment to the transactions T1,T2,T3,T4, will the given schedule be possible under Thomas write rule time stamp ordering protocol ?

In the following circuit all are 4 × 1 multiplexer.

The output "f' is

Three concurrent processes P1, P2 and P3 are concurrently updating a shared variable xyz (with initial value of 100)as follows:

P1: xyz = xyz + 10;

P2: xyz = xyz – 20;

P3: xyz = xyz * 2;

When a process executes instruction such as a = b # c then it read b, c from memory, performs b # c then writes the result into memory location of “a”.

What will be the minimum value of xyz after execution of the three processes?

Consider the following CFG:
S → Aa| ca
A → c | d
(Where S, A are nonterminal and a, c, d are terminals)
How many conflict occur (both shift reduce and reduce-reduce) in CLR(1) parsing construction _______