GATE 2022 Toppers Weekly Quiz 2

Consider the following languages

L₂ is the complement of language denoted by a*b*c*. Here the alphabet set,

L = L₁ L₂ Then the complement of L is

Consider the following code for two processes P₀ and P₁:

Assume A and B are binary semaphore variables initialized with 1 and 0 respectively. a and b are shared variable and initial value of a = 3, b = Assume that short term scheduler always starts process P₁ first, while executing P₀ and P₁ concurrently, the sum of the value of a and b after the execution ________.

For a Poisson distribution having mean . The standard deviation of the distribution will be:

If G is a bipartite planar with n-vertices, then find the maximum number of edges in G.

Consider the following relational schema:
R(A, B, C, D, E, F, G, H ) with FD set {AB → C, AC → B, AD → E, B → D, BC → A, E → G} the following
relations are sub relations of the relation R.
R₁(A, B, C)
2. R₂(A, B, C, D)
3. R₃(A, B, C, E, G)
The number of sub relation are in BCNF __________.

Consider the below digital circuit.

What is the output(F) of the above circuit?

Given preorder and postorder traversal of binary search tree.

Preorder: 50, 27, 16, 4, 12, 34, 29, 44, 88, 65, 52, 77, 93, 92

Postorder: 12, 4, 16, 29, 44, 34, 27, 52, 77, 65, 92, 93, 88, 50

The number of nodes present at level 3 are _________. Assume root is present at level 0

Consider a disk drive with the following specifications. 16 surfaces, 128 tracks / surfaces, 256 sectors/ track, 512 B / sector, rotations speed 3600 rpm. The disk is operated in cycle stealing mode where by whenever one byte word is ready it is sent to memory; similarly, for writing, the disk interface reads a 5 byte word from the memory in each DMA cycle. Memory cycle time is 50 nsec. The maximum percentage of time that the CPU gets blocked during DMA operation is __________ . (Upto 1 decimal places)

Suppose you want to transfer a file from Delhi to Goa.

The size of file is 90,000 bytes. The file will be transferred in 1,500-byte data packets, for which 40 bytes are taken up with headers. The size of acknowledgement packets is 40 bytes including header. Every packet is acknowledged. The communication is bidirectional, and the bandwidth is 100 Mbps (megabits/sec) in each direction. Hosts can send and receive at the same time. The latency from Delhi to Goa is 5 ms, as is the latency in the opposite direction. Assume that time to process a packet is very small, so the receiver can send an acknowledgement as soon as it receives a data packet, but not before it receives the entire data packet. Assume no packet loss. With Stop-and-Wait, how long will it take to transfer the file successfully?

Consider the grammar defined by the following production rules:

S → A * C

A → B + A | B

B → A – B | A

A → id

B → id

C → id

Which of the following is true?