# GATE 2022: Semi Syllabus Quiz- 1

Attempt now to get your rank among 232 students!

Question 1

(135)_{x} + (144)_{x} = (323)_{x}

Question 2

How many literals are there in the minimized expression of E?

Question 3

_{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

_{0}, y

_{n–1}y

_{n–2}…. y

_{0}together with input carry (C

_{0}), amount of delay required for generating final result of on c

_{n}s

_{n–1}s

_{n–2}… s

_{0}is _____ .

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

Question 4

^{6}additions/sec then what is the value of ‘x’ ns for the sum bit when four 1-bit full adders are cascaded?

Question 5

Question 6

Question 7

Question 8

Question 9

Question 10

#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?

Question 11

Question 12

Semaphore X:=0;

/*Process now forks into concurrent processes P1 & P2*/

Consider the following statements about processes P1 and P2:

I : It is possible for process P1 to starve.

II. It is possible for process P2 to starve.

Which of the following holds?

Question 13

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.

Question 14

^{8}m/sec. Calculate maximum frame size in bytes.

Question 15

Question 16

(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 ______?

Question 17

Question 18

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

Question 19

Now suppose the value of n taken in above code is 4 , then what will be the value printed by above code _____________.

Question 20

Question 21

I. Quick sort takes time complexity O(n^{2}) for sorting elements of array A

II. Merge sort takes time complexity O(n^{2}) for sorting elements of array A

Codes:

Question 22

Question 23

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

Question 24

f(n) = 2^{log}_{2}^{n}

g(n) = nlog_{2}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?

Question 25

- 232 attempts
- 0 upvotes
- 0 comments

Tags :

GATE & PSU CSGeneral