Home - Gate Computer Science - Previous Year Solved Papers - GATE Solved Paper 2017-19 - GATE 2018

GATE Solved Paper 2017-19 - GATE 2018 Online Exam Quiz

Important questions about GATE Solved Paper 2017-19 - GATE 2018. GATE Solved Paper 2017-19 - GATE 2018 MCQ questions with answers. GATE Solved Paper 2017-19 - GATE 2018 exam questions and answers for students and interviews.

1. The area of a square is d. What is the area of the circle which has the diagonal of the square as its diameter?

Options

A : πd

B : πd 2

C : πd 2 /4

D : πd/2

2. “A __________ investigation can sometimes yield new facts, but typically organized ones are more successful.”

Options

A : meandering

B : timely

C : consistent

D : systematic

3. What would be the smallest natural number which when divided either by 20 or by 42 or by 76 leaves a remainder of 7 in each case?

Options

A : 3047

B : 6047

C : 7987

D : 63847

4. “From where are they bringing their books? ________ bringing ________ books from _________.” The words that best fill the blanks in the above sentence are

Options

A : Their, they’re there

B : They’re, their, there

C : There, their, they’re

D : They’re, there, there

5. What is the missing number in the following sequence? 2, 12, 60, 240, 720, 1440, _______, 0

Options

A : 2880

B : 1440

C : 720

D : 0

46. The postorder traversal of a binary tree is 8, 9, 6, 7, 4, 5, 2, 3,1. The inorder traversal of the same tree is 8, 6, 9, 4, 7, 2, 5, 1, 3. The height of a tree is the length of longest path from the root to any leaf. The height of the binary tree above is __________. Note – Numerical Type question

Options

A : 3

B : 2

C : 4

D : 5

47. Two people, P and Q, decide to independently roll two identical dice, each with 6 faces. Numbered 1 to The person with the lower number wins. In case of a tie, they roll the dice repeatedly until there is no tie. Define a trial as a throw of the dice by P and Q. Assume that all 6 numbers on each dice are equiprobable and that all trials are independent. The probability (rounded to 3 decimal places) that one of them wins in the third trial is ___________. Note – Numerical Type question

Options

A : 0.6944

B : 0.1157

C : 0.023

D : 0.463

48. The value of

Options

A : 0.389

B : 0.289

C : 0.829

D : 0.428

49. The chromatic number of the following graph is __________.

Options

A : 3

B : 4

C : 5

D : 2

50. A 32-bit wide main memory unit with a capacity of 1 GB is built using 256M x 4-bit DRAM chips. The number of rows of memory cells in the DRAM chip is 2 14 . The time taken to perform one refresh operation is 50 nanoseconds. The refresh period is 2 milliseconds. The percentage (rounded to the closest integer) of the time available for performing the memory read/write operations in the main memory unit is ____________.

Options

A : 58

B : 57

C : 59

D : 60

51. Consider the sequential circuit shown in the figure, where both flip-flops used are positive edge-triggered D flip-flops.

Options

A : 2

B : 3

C : 4

D : 5

52. Consider a long-lived TCP session with an end-to-end bandwidth of 1 Gbps (= 109 bits-per-second). The session starts with a certain sequence number. The minimum time (in seconds, rounded to the closest integer) before this sequence number can be used again is _________.

Options

A : 33

B : 44

C : 34

D : 35

53. Consider a storage disk with 4 platters (numbered as 0, 1, 2 and 3), 200 cylinders (numbered as 0, 1, …., 199) and 256 sectors per track (numbered as 0,1, ….., 255). The following 6 disk requests of the form [sector number, cylinder number, platter number] are received by the disk controller at the same time: [120, 72, 2], [180, 134, 1], [60, 20, 0], [60, 20, 0], [212, 86, 3], [56, 116, 2], [118, 16, 1] Currently the head is positioned at sector number 100 of cylinder 80 and is moving towards higher cylinder numbers. The average power dissipation in moving the head over 100 cylinders is 20 milliwatts and for reversing the direction of the head movement once is 15 milliwatts. Power dissipation associated with rotational latency and switching of head between different platters is negligible. The total power consumption in milliwatts to satisfy all of the above disk requests using the Shortest Seek Time First disk scheduling algorithm is ____________.

Options

A : 75

B : 70

C : 80

D : 85

54. A processor has 16 integer registers (R0, R1, …… R15) and 64 floating point registers (F0, F1, ……, F63). It uses a 2-byte instruction format. There are four categories of instructions. Type-1, Type-2, Type-3 and Type-Type-1 category consists of four instructions, each with 3 integer register operands (3Rs). Type-2 category consists of eight instructions, each with 2 floating point register operands (2Fs). Type-3 category consists of fourteen instructions, each with one integer register operand and one floating point register operand (1R + 1F). Type-4 category consists of N instructions, each with a floating point register operand (1F). The maximum value of N is _________.

Options

A : 32

B : 64

C : 256

D : 512

55. Consider the following undirected graph G:

Options

A : 4

B : 5

C : 2

D : 3

56. Consider the minterm list form of a Boolean function F given below.

Options

A : 1

B : 2

C : 3

D : 4

57. The instruction pipeline of a RISC processor has the following stages. Instruction Fetch (IF), Instruction Decode (ID), Operand Fetch (OF), Perform Operation (PO) and Writeback (WB). The IF, ID, OF and WB stages take 1 clock cycle each for every instruction. Consider a sequence of 100 instructions. In the PO stage, 40 instructions take 3 clock cycles each, 35 instructions take 2 clock cycles each, and the remaining 25 instructions take 1 clock cycle each. assume that there are no data hazards and no control hazards. The number of clock cycles required for completion of execution of the sequence of instructions is ____________.

Options

A : 219

B : 104

C : 115

D : 220

58. Let G be a graph with 100! Vertices, with each vertex labeled by a distinct permutation of the numbers 1, 2, …. There is an edge between vertices u and v if and only if the label of u can be obtained by swapping two adjacent numbers in the label of v. Let y denote the degree of a vertex in G and z denote the number of connected components in G. Then, y + 10z = _________.

Options

A : 100

B : 109

C : 110

D : 99

59. Given a language L, define L i as follows:

Options

A : 2

B : 3

C : 2

D : 1

60. The number of possible min-heaps containing each value from {1, 2, 3, 4, 5, 6, 7} exactly once is _______.

Options

A : 80

B : 8

C : 88

D : 87

Gate Computer Science - Previous Year Solved Papers more Online Exam Quiz

Copyright © 2021
Exam-GK-MCQ-Questions.Com | Contact Us | Privacy Policy | Terms of Use | Sitemap | 0.019634962081909