Time Left - 15:00 mins

GATE 2018 Mini Mock 5 (full syllabus)

Attempt now to get your rank among 713 students!

Question 1

Find the maximum profit for 0-1 knapsack with maximum allowable weight=11
N=5
(P1, P2, P3, P4, P5) = {30,25,15,27,36}
(W1, W2, W3, W4, W5) = {8,1,1,2,6 }

Question 2

Which of the following parser is more powerful?

Question 3

Consider the following statement about TCP/IP protocol and select which one is incorrect
I. This model was initially used by ARPANET
II. Minimum size of TCP/IP header is 26 bytes
III. TCP/IP model supports only connectionless communication in network layer
IV. In TCP/IP there is no clear distinction between services, interface, and protocols

Question 4

Assume that we have 4 KB direct mapped cache that is initially empty. The total size of memory is 2³² bytes and the block size is 4 bytes. When the processor reads from address 10, what type of miss occurs in cache?

Question 5

Consider the following Relationship Entity Diagram(ERP)

Which of the following possible relations will not hold if the above ERD is mapped into a relation model?

Person (NID, Name)
Qualification (NID, ExamID, QualifiedDate)
Exam (ExamID, NID, ExamName)
Exam (ExamID, ExamName)

Question 6

Find the minimum expression for the network shown below.

Question 7

Which of the following statements (s) is/are true regarding the process Management?

(1) The OS allocates the CPU time to various users based on certain policy.
(2) The PCB block is maintained by the CPU.
(3) The list of blocked processes is maintained in the priority order by the OS.
(4) The process switch occurs only if a process requests an I/O before the time slice is over or it consumes the full time slice.

Question 8

Consider the following CFG ‘G’ is used to generate the regular language L.

Find missing productions at X and Y in G, if L contains all the strings of a’s & b’s where each string not contains ab.

Question 9

Consider the following declaration:
void main()
{
int n, x, y, s =40;
scanf(“%d”,&n);
for(x = 1; x<=2 * n – 1; x + =2)
{
for(y=1; y <=s; y++)
printf(“ “);
for(y=1; y<=x; y++)
printf(“%d”,y);
for(y = x – 1; y >=1; y--)
printf(“%d”,y);
printf(“/n”);
s = s – 4;
}
}
The sum of all the elements in the second row, which is printed by above code is(take n > 1)

Question 10

Disk requests come into the disk driver for cylinders: 10, 22, 20, 2, 40, 6 and 38 in that order. The disk head is currently positioned over cylinder 30. A seek takes 6 msec per cylinder moved. What is the total seek time (in msec) using FCFS?

713 attempts
4 upvotes
6 comments

Tags :

GATE & PSU CS Mock Tests

Oct 6GATE & PSU CS