GATE 2018 Mini Mock 1 (full syllabus) for GATE & PSU CS Exams

Question 1

The number of students in a class who have answered correctly, wrongly, or not attempted each question in an exam, are listed in the table below. The marks for each question are also listed. There is no negative or partial marking.

What is the average of the marks obtained by the class in the examination?

Question 2

Load the keys 23, 13, 21, 14, 7, 8, and 15 in this order, in a hash table of size 7 using quadratic probing with c(i) = ±i² the hash function h(key) = key % 7.
[Note: The required probe sequences are given by:

h_i (key) = (h(key) ±i²)%7, i = 0, 1, 2, 3 … n

How many collisions can occur in the hash table?

Question 3

Choose the most appropriate word from the options given below to complete the following sentence: _____ his behavior, I decided to trust him.

Question 4

Consider the following CFG ‘G’:
S → ABC
A → Aa/aB
B → Bb/ε
C → Cc/ε
Which of the following is correct?

Question 5

Consider the following statements:
S1: Processing
S2: Transmission
S3: Propagation
S4: Queuing
Which of the above statement(s) causes of packet delay?

Question 6

If ‘relftaga’ means carefree, ‘otaga’ means careful and ‘fertaga’ means careless, which of the following could mean ‘aftercare’?

Question 7

Consider a 4-stage pipeline with a respective delay of 10 ns, 40 ns, 20 ns and 30 ns. Interface register used between the stages have the delay of 5 ns. What is the performance gain of a pipeline?

Question 8

#include<stdio.h>
int main()
{
int i, j, k;
for(j =1; j<=4; j++)
{
If(j * j == 16)
goto secretplace;
}
for(i=1; i< =5; i++)
{
k = i * i;
j = k + 2;
secretplace:
print(“Murph’s second law\n”);
printf(“Good computers are always priced….\n”);
printf(“just beyond your budget\n”);
}
return 0;
}
Select the correct statement

Question 9

The AS clause can appear in

Question 10

Consider a 3 to 8 decoder with its enable as active-high and the inputs to the decoder are A (MSB), B, and C (as LSB).

The output X is:

Question 11

Consider the following circuit. what will be f?

Question 12

Which of the following is False?

Question 13

Which of the following statements is not correct for a square matrix A? (| A | ≠ 0)

Question 14

Let

where (a, b) a=Start time, b=Finish time
Find the minimum number of machines required to schedule all the task.

Question 15

A code for the entire TM M consists of all codes for the transitions, in some order, separated by pairs of 1’s

Where each of C’s is the code for one transition M. If there are total 5 transition rules, then how many possible codes are there for machine M?