GATE CS 2021 : Full Syllabus Rapid Mock-3 (App update required to attempt this test) for GATE & PSU CS Exams

Question 1

Select the word which means the same as the group of words given.

Giving or showing great attention to detail

Question 2

Direction: Select the most appropriate meaning of the given idiom.

Take as gospel truth

Question 3

The ratio speed of a boat to the current of water is 36 : 5. the boat goes along with the current in 5h 10 min. It will come back in ?

Question 4

The value of a single discount on some amount which is equivalent to a series of discounts of 10%, 15% and 40% on the same amount, is equal to

Question 5

Directions: Study the following information carefully and answer the questions given below.

(Marked Price and the Cost Price of the six articles are given in rupees)

If the profit on selling article A is 20%. Then find the discount on the article A.

Question 6

The divide and conquer recurrence to solve the problem of multiplication of two numbers is:

Question 7

Which of the following statement is true for the Bellman-Ford algorithm?

Question 8

Which of the following are correct?

1) Control stack keeps track of live procedure activations

2) Activation records can be managed with the help of stack

3) Dangling reference is a reference to storage that has been deallocated.

Question 9Multiple Correct Options

Consider the following CFG:

S → aB | bA | D | E

A → a | aS | bAA | c

B → b | bS | aBB | c

D → dD | Dd | d

E → EE | EdE

Which of the following statements are true for the above grammar ?[Multi-select Question]

Question 10

In a leaky bucket system if the output rate is 5 KB/sec and input burst of 50 KB/sec for 10 sec and 10 KB/sec for 50 sec then bucket size in KB is ...............

Question 11

Consider a 8-Byte long PC relative JMP instruction stored in word addressable memory of word size 16 bit. If starting address of the instruction is 434 in decimal, and -21 is present in the address field of the instruction. What is the branch address______.

Question 12

Consider a token bucket with maximum rate R = 20 Mbps. Suppose we want to make sure that the maximum rate can only be sent for atmost 5 seconds at a time, and atmost 150 Mbits can be sent over any 10-second window. Compute the required value for the bucket depth B. in Mbits.

Question 13

Consider a token ring with 500 stations and propagation time delay of 9 ms. Bandwidth is given as 10 Mbps. If token holding time is 11 ms. Find the maximum frame size (in bits), if delayed token reinsertion strategy is used? (bit delay = 2 bit)

Question 14

Consider the following statements:
(i) To increment or decrement its value Program Counter (PC) does not require ALU operation.
(ii) Memory conflict in structural dependency can be minimized using operand forwarding technique.
(iii) Delayed branch technique is used to optimize the control dependency.
Which of the following is true?

Question 15

The output of following code is-

Question 16

Minimize the following expression into their minimal form f(A,B,C,D)=∑(1,3,4,5,6,7,9,12,13)

Question 17

The eigen vectors of the matrix

is (are)

(i) (a, 0, )

(ii) (, 0, 0)

(iii) (0, 1, 1)

(iv) (0, , 0)

Question 18

Processes P1 and P2 have a producer - consumer relationship , communicating by the use of a set of shared buffers.

P1 : repeat

Obtain an empty buffer

Fill it

Return a full buffer

forever

P2 : repeat

Obtain a full buffer

Empty it

Return an empty buffer

forever

Increasing the number of buffers is likely to do which of the following ?

I. Increase the rate at which requests are satisfied(Throughput)

II. Decrease the likelihood of deadlock

III. Increase the ease of achieving a correct implementation

Question 19

Consider the following language L:

{aⁿbⁿ} U {aⁿb²ⁿ}

We have the following two options, find the correct choice regarding these options.

I. Deterministic Context Free Language

II. Non-Deterministic Context Free Language

Question 20

The following problems are solved using Dynamic Programming/Greedy Algorithms. Match these problems to their respective time complexity :

Question 21Multiple Correct Options

Consider the following statements regarding Direct Memory Access (DMA) modes. Which of the following statements are correct?

Question 22Multiple Correct Options

What will be the output of the program?

Question 23

Consider the following statements:

I. Pointer variables are allocated on the stack.

II. Optimal use of registers in the code generation is NP complete and possibly intractable.

III. LEX compiler transforms the input patterns into a transition diagram and generates code in a file.

IV. YACC is a representation of an LALR parser written in C.

The number of correct statements is:

Question 24

How many of the following statements are true about recoverable and cascadeless schedules?

I. All cascadeless schedules are also recoverable schedules.

II. All recoverable schedules are also cascadeless schedules.

III. All strict schedules are cascadeless and recoverable.

IV. All cascadeless and recoverable schedules are strict schedules.

Question 25

Consider S = {1, 2, . . . n}, each subset of S represents one vertex in a graph G. Let X and Y be being two subsets of S. There will be an edge between X and Y, if their symmetric difference is equal to 3. For n = 6, the degree of the vertex corresponding to a 3-element subset is __________________?

Note: Symmetric difference of two set is defined A and B is defined as (A\B) U (B\A)

Question 26

Let A be the matrix :

Consider a, b and c be the eighen values of Adj(A). what is the value of a+b+c__________.

Question 27

Consider the following C function executed in an OS with paging where the page size is 4 kilobytes. Further, assume that the system employs a 32-entry direct mapped TLB.

int *alloc_and_init( )

{

int counter, value=0, size=2048 ;

int *new_ptr = malloc (size * sizeof (int)) ;

/* Assume size of (int) = 4 and new_ptr is 4 KB aligned */

for (counter=0 ; counter < size ; new_ptr++, counter++)

*new_ptr = value;

Return new_ptr;

}

Assuming no page faults and no context switches during the execution of the program, what is the number of TLB misses during the execution of the for-loop.

Question 28

What will be the value of counting semaphore after the following operations?

1) 25 V operations

2) 12 V operations

3) 36 P operations

Initial value of counting semaphore is 11

Question 29

What will be the status of the input 14, 12, 90, 34, 23, 67, 35, 337, 87, 156, 389, 278, 92 after 3rd pass on applying Straight two way Merge Sort.

Question 30

Construct the Max Heap assuming the following set of integers were inserted into it in given order:

20, 32, 1, 3, 4, 5, 6, 7, 10, 23, 45

Post Order traversal of the resultant max heap was stored in an array A with an index variable i (starting from 0). Similarly level order traversal was stored in an array B using index variable j (starting from 0). For particular element , respective i and j location values from A and B were obtained and |i-j| is calculated, then calculate the difference of minimum and maximum value of |i-j|.