Made Easy CBT 2

1/25/2020 MADE EASY CBT
SCORE CARD QUESTIONS REPORT SOLUTION COMPARE YOUR SELF
Solution Report For All India Mock GATE 2020 : CBT-2 CS

Represent whole test solution with correct and incorrect answers.
View Your Test Analysis
Q. No Question Status
Q.1 Complete the sentence by filling in the appropriate words from the options provided.
The Maruti has become so ______ that snobbish customers, who believe their tastes are superior
to others, are ________ buy this car of the masses.
a. reputed, shirking from

b. sought after, queuing to
c. ubiquitous, disinclined to
d. affordable, waiting to
Not Attempt Correct Ans. c Solution
Q.2 Choose the correct pair from the given options which has a similar relationship to the given pair.
PROCTOR : SUPERVISE
a. prophet : rule
b. prodigal : squander
c. profiteer : consume
d. profligate : demand
Not Attempt Correct Ans. b Solution
Q.3 Which of the following will not be a number of the series 1, 8, 27, 64, 125,.....?
a. 256
b. 512
c. 729
d. 1000
Attempt Correct Correct Ans. a Solution
Q.4 6 people are sitting in a row. A is sitting towards immediate left of B and immediate right of C. C
is sitting on immediate right of F. D is sitting on immediate right of E who is to the left of F, then
which two people are sitting in the center?
a. D and B
b. A and B
c. F and C
https://cbt.onlinetestseriesmadeeasy.in/madeeasy/index.php?pageName=timeManagementReport 1/21
d. E and D
Attempt Correct Correct Ans. c Solution
Q.5
If (64)2 – (36)2 = 20k then the value of k is __________.
Attempt Correct Correct Ans. 140 Solution
Q.6 No national productivity measures are available for underground industries that may exist but
remain unreported. On the other hand, at least some industries that are run entirely by self-
employed industrialists are included in national productivity measures.
From the information given above, it can be validly concluded that
a. there are at least some industries run entirely by self-employed industrialists that are underground
industries
b. not all industries that are run entirely by self-employed industrialists operate underground
c. not all industries that are run entirely by self-employed industrialists are included in national
productivity measures
d. there are at least some industries run entirely by self-employed industrialists that are not
underground industries.
Q.7 The sole object of this work is to consider, first, whether man, like every other species, is
descended from some pre-existing form; secondly, the manner of his development; and thirdly,
the value of the differences between the so-called races of man.
Which of the following best captures the essence of the passage?
a. The work seems to locate whether man is descended from some pre-existing form.
b. The work seems to locate whether man is descended from gods, the manner of his development,
and the value of the differences between the so-called races of mammals.
c. The work will not locate whether man is descended from some pre-existing form, but the manner of
his development.
d. The work seems to locate whether man is descended from some pre-existing form, the manner of
his development, and the value of the differences between the so-called races of man.
Not Attempt Correct Ans. d Solution
Q.8 20 girls, among whom are A and B seat themselves at a round table. The probability that there
are 4 girls between A and B is:
a.
b.
c.
d.
Q.9 In the trapezium What is

the area of trapezium ABCD?
a.
b.
c.
d.
Q.10 A passenger train takes 2 hours less for a journey of 300 km if its speed is increased by 5 km/hr
from its usual speed. The usual speed of the train in km/hr is ________.
Q.11 Which of the following is true?
a. Language can contain infinite length string.

b. Language can contain infinite number of strings even when number of states in minimal DFA is
finite.
c. There exist a language which is non-regular but finite.
d. None of the above
Attempt Correct Correct Ans. b Solution
Q.12 Which of the following statements are true?

S1 : Inserting n elements into empty binary heap takes Ο(n) time.
S2 : The most efficient algorithm take Ο(m + n) time for finding number of connected
components
in undirected graph of n vertex and m edges.
a. Only S1
b. Only S2
c. Both S1 and S2
d. Neither S1 nor S2
Q.13
a. L1 / L2 is CFL
b. L1 / L2 is regular
c. L1 / L2 is DCFL
d. L1 /L2 is CSL
Q.14 Consider a micro program control unit and list of corresponding properties in control unit
design:
Which of the following is the correct match between the Micro program control unit and their
properties?
a. (P-1, 4, 6) and (Q-2, 3, 5)

b. (P-1, 4, 5) and (Q-2, 3, 6)
c. (P-2, 4, 6) and (Q-1, 3, 5)
d. (P-2, 3, 6) and (Q-1, 4, 5)
Q.15
a. a
b. b
c. c
d. d
Q.16 Let A be a finite non-empty set with cardinality n. Let x and y be two of the elements of A. The
number of subsets S ⊆ A which include atleast one of x or y is
a. 2n – 1 – 2n – 2
b. 3.2n – 2
c. 2n – 1
d. None of these
Q.17 Consider X, Y, Z are shared semaphores consider following three concurrent processes:
If on running these processes concurrently, possible outputs are:

1. CFBEAD
2. ACFDBE
3. ADCFBE
What can be the initial value of X, Y and Z so that above outputs are possible?
a. X = 2, Y = 0 and Z = 2
b. X = 1, Y = 0 and Z = 1
c. X = 2, Y = 0 and Z = 1
d. X = 1, Y = 0 and Z = 2
Q.18 If the following circuit is to be realised using minimum number of NAND gates. The number of
NAND gates required
a. 0
b. 3
c. 2
d. 4
Q.19 Consider the following statements:

S1 : Data link layer define the boundaries of frame because framing is always of fixed size.
S2 : Bit stuffing is the process of adding one extra 0 after 6th bit whenever five consecutive 1’s
follow a 0 in the data, if 0111110 is assumed as a flag.
Which of the following option is correct?
a. Only S1 is true
b. Only S2 is true
c. Both S1 and S2 are true
d. Neither of S1 or S2 is true
Attempt Correct Correct Ans. d Solution
Q.20 A binary search tree contains the numbers 10, 12, 15, 17, 20, 21, 23, 27, 30, 40, 41, 45. When the
tree is traversed in pre-order and the values in each node printed out, the sequence of values
obtained is 20, 17, 15, 10, 12, 40, 23, 21, 30, 27, 41, 45. If the tree is traversed in post-order, the
sequence obtained would be:
a. 10, 12, 17, 15, 21, 27, 30, 23, 45, 41, 40, 20
b. 12, 10, 15, 17, 21, 27, 30, 23, 45, 41, 40, 20
c. 20, 17, 40, 15, 23, 41, 10, 21, 30, 45, 12, 27
d. 12, 10, 15, 17, 23, 21, 27, 30, 45, 41, 40, 20
Q.21
Find the value of x for which following matrix is not invertible
a. x = –1
b. x = –2
c. x = –3
d. x = –4
Q.22 Let the function ƒ : R → R and g : R → R be defined by ƒ(x) = 3x and g(x) = 5. Which of the
following represents ƒοg(x) and gοƒ (x) respectively?
a. 15x and 15x

b. 15 and 5
c. 15x and 15x2
d. 15 and 15x

I. Conflict serializable testing conditions are both sufficient and necessary conditions for
serializability testing.
II. View serialiable testing conditions are both sufficient and necessary conditions for
serializability testing.
III. If schedule(S) is not conflict serializable and some blind write in schedule(S) then S always
view serializable schedule.
Which of the following statements are incorrect?
a. I and III only

b. II and III only
c. I and II only
d. I, II and III
Q.24 Consider F(p), Q(p) and L(p) denotes statements “printer p is out of service”, print job p is
queued and “print job p is lost” respectively. Then statement “If a job is queued and lost then
some printer are out of service” is represented by
a.
b.
c.
d.
Attempt Incorrect Your Ans. d Correct Ans. c Solution
Q.25 The function ƒ(A, B, C, D) represented by the given map is
a.
b.
c.
d.
Attempt Incorrect Your Ans. a Correct Ans. c Solution
Q.26
Suppose the cache memory is 10 times faster than main memory and it is used 40% of the time.
The performance is gained by introducing this cache is ______. (Upto 2 decimal places)
Attempt Correct Correct Ans. 1.56 Solution
Q.27
Suppose that the stop-and-wait protocol is used on a link with a bit rate of 32 × 106 bps and 11
μsec propagation delay. Assume that the transmission time for the acknowledgment and the
processing time at nodes are negligible. To achieve a link utilization of 50%, the minimum frame
size required is ________ bytes.
Q.28 In the mean value theorem ƒ(b) – ƒ(a) = (b – a) ƒ ′(c) determining c lying between a and b, if ƒ(x) =
x(x – 1) (x – 2), a = 0 and b = ________. (Upto 2 decimal places)
Attempt Incorrect Your Ans. 0.12 Correct Ans. 0.23 Solution
Q.29 Consider a logical address space of eight pages of 1024 words each mapped onto a physical
memory of 32 frames. The number of bits are there in the logical address is ________.
Q.30 Consider the following graphical representation of relation:
The number of the above graph represent partial ordered relation is/are ________.
Q.31 Consider the following C fragment:
The value printed by C fragment is _________ (Assume int takes 4 byte).

I. Canonical cover of FD set F is always unique.
II. If every candidate key of R is simple candidate key and no non-trivial FD like non-prime
attribute → other non-prime attribute exists then R also in BCNF.
III. If R in 3NF and not in BCNF then R must have atleast two compound candidate keys.
The number of statements correct is/are ________.
Attempt Incorrect Your Ans. 3 Correct Ans. 1 Solution
Q.33 A shift reduce parser carries out the action specified within braces immediately after reducing
with the corresponding rule of grammar:
What is the translation of xxxxyzz using the syntax directed translation scheme described by the
above rules?
Q.34 Frequency count of each char:
How many max bits required for any char by using Huffman coding is ________.
Q.35 Consider the following function:
Let arr is an array [0 to 4] which initially holds elements {1, 2, 3, 4, 5}. Test (arr[ ], 0, 3) is called.
The number of elements that will maintain their initial position after the end of the code are
__________ .
Q.36 What is time complexity of Dijkstra’s algo if graph G with n vertices and e edges represented by
adjacency matrix representation and sorted array used to choose vertices relaxation of greedy
selection?
a. θ(n2)
b. θ(n2 + logn)
c. θ(n ⋅ e)
d. θ(e + nlogn)
Q.37 Consider two node A and C at a distance 2000 m. Suppose station A starts sending a long frame
at time t1 = 0; station C starts sending a long frame at time t2 = 3 μs. Find the number of bits
station A has sent before detecting the collision?
Assume, data rate as 10 Mbps and propagation speed as 2 × 108 m/s.
a. 70 bits
b. 65 bits
c. 130 bits
d. 140 bits
Attempt Incorrect Your Ans. a Correct Ans. c Solution
Q.38 What are the number of 6 letter passwords can be created from lower case English letters such
that each password contain exactly 1 vowel?
a. 6 × 5 × 215
b. 5C × 21C × 6!
1 5
c. 266 – 216
d. 266 – 6 × 215
Attempt Incorrect Your Ans. b Correct Ans. a Solution
Q.39 A disk rotates at a speed of 3600 rpm. It has 4000 cylinders, 16 surface and 206 sectors per
tracks. Track storage capacity is 2048 bytes. What is the average latency time (in msec) and data
transfer rate (in KBps) respectively.
a. 16.66, 122.28
b. 8.33, 196.48
c. 16.66, 196.48
d. 8.33, 120
Attempt Incorrect Your Ans. c Correct Ans. d Solution
Q.40
a. 2
b. 3
c. 1
d. 0
Q.41 Consider the digital circuit given below:
In the above circuit are non inverting buffers with delay of 4 ns and 2 ns
respectively. Assume gate G1 and G2 outputs are zero before applying input Vi. The output wave
form Vo is
a.
b.
c.
d.
Q.42 An Internet Service Provider (ISP) has the following chunk of CIDR-based IP addresses available
with it : 196.225.128.0/18. The ISP wants to give half of this chunk of addresses to organization A
and a quarter to organization B, while retaining the remaining with itself. Which of the following
is a valid allocation of addresses to A and B?
a. 196.225.168.0/19 and 196.225.184.0/20

b. 196.225.128.0/19 and 196.225.176.0/20
c. 196.225.192.0/20 and 196.225.224.0/19
d. 196.225.160.0/20 and 196.225.176.0/20
Q.43 Let M be a Turing machine having Q = {q0, q1, q2, q3, q4} a set of states, input alphabet {0, 1}.
The tape alphabet are {0, 1, B, X, Y}. The symbol B is used to represent end of input string. The
initial and the final states is q0 and q4 respectively. The transitions are as follows.
Which of the following is true about M?
a. M accepts on L having 011 as substring

b. M accepts on L having 010 as substring
c. M accepts on {L = 0n1n, n > 0}
d. M accepts on L not having 1100 substring
Q.44 Which of the following is incorrect?
a.
b.
c.
d.
Q.45 Consider the following code for two sorted (decreasing order) linked list with atleast one
common elements and header of linked list-1 is h1 and header of linked list-2 is h2:
Which of the following is correct?
a. It will return intersection of two linked list

b. It will return a pointer to 1st common node of two linked list
c. It will return a pointer to last common node of two linked list
d. None of the above
Q.46 Consider given ERD:
How many foreign keys required for minimized RDBMS design of ERD?
a. 6
b. 3
c. 4
d. 5
Q.47 A computer has a cache, main memory, and a disk used for virtual memory. If a referenced word
is in the cache, 30 ns are required to access it. If it is in main memory but not in cache, 80 ns are
needed to load it into the cache, and then the reference is started again. If the word is not in main
memory, 22 ms are required to fetch the word from disk, followed by 80 ns to copy it to the cache
and the start again. The cache hit ratio is 0.8 and main memory hit ratio is 0.9.
What is the approximate average time (μs) required to access a referenced word on this system?
a. 450
b. 520
c. 440
d. 480
Q.48
If the following SLR (1) table is constructed as below then find the missing entries at E1, E2 and
E3 respectively.
a. ra, rb, 5
b. ra, ra, 6
c. rb, ra, 5
d. rb, rb, 6
Q.49
a. No solution
b. Trivial solutions
c. Unique solution
d. Infinitely many solutions
Q.50 Let P be doubly linked list. Assume Q be the pointer to the last node of linked list. What is the
worst case time complexity to delete the node just before the middle of linked list from starting
(we can use atmost 2 pointer)?
a. Ο(log n)
b. Ο(n)
c. Ο(1)
d. Ο(n log n)

S1 : Pumping lemma can be used to prove the regularity of a language.
S2 : Given a grammar, checking if the grammar is not regular is decidable problem.
S3 : If L is a regular and M is not a regular language then L.M is necessarily not regular.
Which of the following statement is correct ?
a. Only S1, S3 are correct

b. Only S2 is correct
c. Only S3 is correct
d. Only S2, S3 are correct
Q.52 Consider 4 stage instruction pipeline executed on a system:
If all instructions are executed only once, what is the throughput of system?
a. 4/13 cycles
b. 4/10 cycles
c. 3/13 cycles
d. 4/11 cycles
Q.53 Consider Host A sends a UDP datagram containing 1100 bytes of user data to host B over an
ethernet LAN. Maximum transmission unit (MTU) of the network is 206 bytes (including the
network layer overhead). Size of UDP header is 10 bytes and size of IP header is 20 bytes. There
is no option field in the IP header.
Consider the following statements:
S1 : Total 6 fragments will be there.
S2 : The offset of 4th fragment will be 69.
S3 : The MF flag of 6th fragment is set i.e. 1.

Which of the following options is correct?
a. Only S1 and S2 are true

b. Only S2 and S3 are true
c. Both S1 is true
d. All are true
Attempt Incorrect Your Ans. a Correct Ans. b Solution
Q.54 The number of ways can three 0’s, three 1’s and three 2’s be arranged, so that no three adjacent
digits are the same in an arrangement is ________.
Not Attempt Correct Ans. 1314 Solution
Q.55 Consider the following regular expression R = a*b* + b*a*. The number of equivalence classes of
Σ* to represent a language which is equivalent to R is _________.
Q.56 Assume a scenario where the size of congestion window of a TCP connection be 40 KB when a
timeout occurs. The maximum segment size (MSS) be 2 KB. Let the propagation delay be 30
msec. The time taken by the TCP connection to get back to 40 KB congestion window is
_________ msec.
Q.57 Considering the exponential average behaviour used to predict the next CPU burst. If α = 0.80
and ms and previous (T0, T1, T2, T3) runs were as 10, 12, 15, 20. The predicted value of
is _________. (Upto 1 decimal place)
Attempt Correct Correct Ans. 18.9 Solution
Q.58 Consider the given graph:
If DFS algo runs from some source, minimum size of stack required for DFS recursive algo is
________.
Q.59 A computer system implements a 36 bit virtual address. Page size of 4 KB and the size of
physical memory is 30 bits. The approximate size of page table in the system is ________ MB.
[Assume memory is byte addressable]
Q.60
Attempt Correct Correct Ans. -0.5 Solution
Q.61 Consider a modified binary search tree given below with each nodes storing value and its
priority. The priority of parent always higher than its children. The priority of root node is higher
than other nodes.
The level at which (13, 16) present after insertion of value 19 with priority 23 in modified binary
search tree at level ________ (Assume root at level-0).
Q.62 How many minimum levels of B tree are required to store 2401 keys with order of B tree node is 7
(max block pointers per node) ________ (Assume root at level 1).
Q.63 A 4-bit right shift, shift register is shifting the data to the right for every clock pulse. The serial
input D is derived using a Ex-OR gate and a 2 : 1 MUX as shown in the figure. If the initial content
of the register is 0010 at Q3Q2Q1Q0, after how many number of clock pulses the register is back
to the same state
Q.64 Find the minimum number of temporary variables are created in 3-address code for the following
expression
Consider following grammar for precedence and associativity.
Q.65 Consider the main memory and cache memory of size 4 GB and 2 MB respectively. Block size of
both main memory and cache memory is same. The size of tag bits if direct mapped cache is
used ________. (Assume memory is byte addressable)

Made Easy CBT 2

Uploaded by

Copyright:

Available Formats

You might also like

Made Easy CBT 2

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Made Easy CBT 2

Uploaded by

Copyright:

Available Formats

1/25/2020 MADE EASY CBT

SCORE CARD QUESTIONS REPORT SOLUTION COMPARE YOUR SELF

Solution Report For All India Mock GATE 2020 : CBT-2 CS

View Your Test Analysis

a. reputed, shirking from

Not Attempt Correct Ans. c Solution

Not Attempt Correct Ans. b Solution

Attempt Correct Correct Ans. a Solution

Attempt Correct Correct Ans. c Solution

Attempt Correct Correct Ans. 140 Solution

Not Attempt Correct Ans. c Solution

Not Attempt Correct Ans. d Solution

Not Attempt Correct Ans. b Solution

Q.9 In the trapezium What is

Attempt Correct Correct Ans. a Solution

Attempt Correct Correct Ans. 25 Solution

Q.11 Which of the following is true?

a. Language can contain infinite length string.

Attempt Correct Correct Ans. b Solution

Q.12 Which of the following statements are true?

Attempt Correct Correct Ans. c Solution

Not Attempt Correct Ans. b Solution

a. (P-1, 4, 6) and (Q-2, 3, 5)

Attempt Correct Correct Ans. a Solution

Not Attempt Correct Ans. b Solution

Attempt Correct Correct Ans. b Solution

If on running these processes concurrently, possible outputs are:

Attempt Correct Correct Ans. a Solution

Attempt Correct Correct Ans. a Solution

Q.19 Consider the following statements:

Attempt Correct Correct Ans. d Solution

Attempt Correct Correct Ans. b Solution

Find the value of x for which following matrix is not invertible

Attempt Correct Correct Ans. c Solution

a. 15x and 15x

Attempt Correct Correct Ans. b Solution

Q.23 Consider the following statements:

a. I and III only

Attempt Correct Correct Ans. a Solution

Attempt Incorrect Your Ans. d Correct Ans. c Solution

Q.25 The function ƒ(A, B, C, D) represented by the given map is

Attempt Incorrect Your Ans. a Correct Ans. c Solution

Attempt Correct Correct Ans. 1.56 Solution

Attempt Correct Correct Ans. 88 Solution

x(x – 1) (x – 2), a = 0 and b = ________. (Upto 2 decimal places)

Attempt Incorrect Your Ans. 0.12 Correct Ans. 0.23 Solution

Attempt Correct Correct Ans. 13 Solution

Q.30 Consider the following graphical representation of relation:

Attempt Correct Correct Ans. 0 Solution

Q.31 Consider the following C fragment:

The value printed by C fragment is _________ (Assume int takes 4 byte).

Attempt Correct Correct Ans. 21 Solution

Q.32 Consider the following statements:

Attempt Incorrect Your Ans. 3 Correct Ans. 1 Solution

Attempt Incorrect Your Ans. 2331 Correct Ans. 23131 Solution

Q.34 Frequency count of each char:

Attempt Correct Correct Ans. 6 Solution

Q.35 Consider the following function: