GATE 2022: Semi Syllabus Quiz- 1

What will be the value of x for the following expression?

(135)_x + (144)_x = (323)_x

In an n bit Carry Look ahead Adder (CLA), if t_p is the delay of each gate and all gates are available with multi bit inputs and Carry Look ahead Generator (CLG) is designed with two-level logic circuit. For computing the sum of two n bit numbers x_n–1 x_n–2 …. x₀, y_n–1 y_n–2 …. y₀together with input carry (C₀), amount of delay required for generating final result of on c_n s_n–1 s_n–2 … s₀ is _____ .

(Note: EXOR gates are available with two inputs only)

A 1-bit full adder takes 20 ns to generate carry-out bit. If the maximum rate of additions is 10 X 10⁶ additions/sec then what is the value of ‘x’ ns for the sum bit when four 1-bit full adders are cascaded?

Consider 3 processes P1, P2 and P3 arriving at time 1, 2 and 4 and their execution duration in CPU is 6, 8 and 3 time units respectively. If Round Robin CPU scheduling is used by Operating System with time slice of 2 units, then the total waiting time of P3, is ______ .

Suppose the following disk request sequence (track numbers) for a disk with 100 tracks is given: 45, 20, 90, 10, 50, 60, 80, 25, Assume that the initial position of the R/W head is on track 50. The additional distance that will be traversed by the R/W head when the Shortest Seek Time First (SSTF) algorithm is used and compared to the SCAN (Elevator) algorithm (assuming that SCAN algorithm moves towards 100 when it starts execution) is ______ tracks.

Consider system having ‘m’ resources of the same type. These resources are shared by 3 processes A, B, C which have peak time demands of 7,8,9 respectively. The minimum value of ‘m’ that ensure that deadlock will never occur is

Consider the following program.

#include<stdio.h>

#include<stdlib.h>

#include<unistd.h>

int main(void)

{

pid_t pid;

int var= 200;

pid=fork();

if (pid==0)

var=300;

fork();

printf(“%d”, var);

return 0;

}

Assuming all invocations of fork are successful, which of the following is a correct output when the program is executed on the UNIX OS?

Consider a process with single CPU burst of 100 time units and a single disk IO burst of 1000 time units at the end. Suppose the time interval for the processor is 15 time units and the process scheduling algorithm is round robin scheduling algorithm. Then, atmost how many times a process entered into ready queue before entering to the termination state while its execution ____________

Consider a paging system with a 32-bit virtual address space. Each address refers to a byte in memory.
Let the page size be 16 KB, and the main memory size be 256 MB. What is minimum size of page table? Assume page table entry has at least 2 protection bits.

Consider a Ethernet network employing CSMA/CD, where Bw = 10 Mbps, length of the cable(L) is 200m and v = 2 x 10⁸ m/sec. Calculate maximum frame size in bytes.

Consider the following statement:

(a) The minimum length of IPv4 and TCP header is 20 bytes

(b) The minimum length of IPv6 header is 40 Bytes

(c) IPv4 is connection-oriented protocol while IPv6 is not

(d) The size of the IP address in IPv6 is 8 bytes

The number of correct statement is ______?

Consider the following graph G:

The sum of edge weights of the spanning tree formed using Kruskal’s algorithm on graph G is ________.

Consider a linked list which has 10 nodes and the nodes have value 1,2,3……10 in this order from head to last. Now this linked list is passed as parameter to the below given code :
 
Now suppose the value of n taken in above code is 4 , then what will be the value printed by above code _____________.

A BFS algorithm is implemented on the following graph. Which of the following nodes will be traversed at last if the root is ‘E’ and consider lexicographic ordering while traversing?

Let A[1, ......, n] be an array of ‘n’ elements. If there are inversions are present in ‘A’. Then which of the following statements are true?

I. Quick sort takes time complexity O(n²) for sorting elements of array A

II. Merge sort takes time complexity O(n²) for sorting elements of array A

Codes:

Consider the 5 items along with their weights and values.

The Knapsack has capacity W = 60, the maximum profit that can be achieved using fractional Knapsack is ________.

Consider the following functions:

f(n) = 2^log₂ⁿ

g(n) = nlog₂n

h(n) = n^1/log2n

Which of the following statements about the asymptotic behavior of f(n), g(n) and h(n) is true?

If an undirected graph ‘G’ has n-vertices and has ‘K’ edges . The number of components in the graph is at least.