GATE Exam  >  GATE Tests  >  Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - GATE MCQ

Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - GATE MCQ


Test Description

30 Questions MCQ Test - Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test)

Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) for GATE 2024 is part of GATE preparation. The Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) questions and answers have been prepared according to the GATE exam syllabus.The Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) MCQs are made for GATE 2024 Exam. Find important definitions, questions, notes, meanings, examples, exercises, MCQs and online tests for Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) below.
Solutions of Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) questions in English are available as part of our course for GATE & Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) solutions in Hindi for GATE course. Download more important topics, notes, lectures and mock test series for GATE Exam by signing up for free. Attempt Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) | 65 questions in 180 minutes | Mock test for GATE preparation | Free important questions MCQ to study for GATE Exam | Download free PDF with solutions
Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 1

A test has questions worth 100 marks totals. There are two types of questions, multiple choice questions are worth 3 marks each and essay questions are worth 11 marks each. How many multiple choice questions does the exam have?

Detailed Solution for Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 1

Let us consider all choices :

Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 2

There are 5 buildings called V, W, X, Y, Z in a row (not necessarily in order). V is to the West of W, Z is to the East of X and the West of V. W is to West of Y. Which building is in the middle?

Detailed Solution for Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 2

V is to the West of W,

V

W

Z is to the East of X and the West of V.

X

Z

V

W

W is to West of Y.

X

Z

V

W

Y

Therefore, V is in middle. So option A is correct.

1 Crore+ students have signed up on EduRev. Have you? Download the App
Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 3

Saturn is __________ to be seen on a clear night with the naked eye?

Detailed Solution for Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 3

With adjectives and adverbs, enough comes after adjectives and adverbs. 
With nouns, enough comes before noun.
In the given question, enough is used with bright which is an adjective, so enough will come after the adjective.
So bright enough is the correct option. 

Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 4

There are 3 red socks, 4 green socks and 3 blue socks. You choose 2 socks. The probability that they are of the same color is

Detailed Solution for Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 4

Ways to collect both Red = 3C2

Ways to collect both Green = 3C2

Ways to collect both Blue = 4C2

Total Ways = 10C2

P(Socks of Same Colour) = (3C2 + 4C2+ 3C2 ) /  10C2 = 4/15

Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 5

Chose the option with words that are not synonyms.

Detailed Solution for Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 5
  • Yield - produce or provide
  • Resistance - the refusal to accept or comply with something. Rest are all synonyms. Hence, (D) is correct.
Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 6

The numbers of the roots of ex + 0.5x2 -2 = 0 in the range [-5, 5] are

Detailed Solution for Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 6

The given function is a continuous function in range [-5, 5]. The Intermediate Value Theorem states if a continuous function has values of opposite sign inside an interval, then it has a root in that interval. The function changes sign twice in range [-5, 5].

  1. It becomes positive to negative in range [-5, 0] when ex + 0.5x2 becomes less than 2.
  2. It becomes positive to negative in range [0, 5] when ex + 0.5x2 becomes more than 2.
Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 7

There are three boxes, one contains apples, another contains oranges and last one contains both apples and oranges. All three are known to be incorrectly labelled. You are permitted to open just one box and then pull out and inspect only one fruit. Which box would you open to determine the contents of all three boxes?

Detailed Solution for Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 7

In given question there are three boxes incorrectly labeled:

  • Box 3 labeled as Apples and Oranges - Original Content can be Apple or Orangle (This box will have only one fruit, so whichever we pick would  be the correct label). Let's say the picked item was Apple, therefore the box labeled Orange will have Apples and Oranges.)
  • Box 2 - Oranges - This box will definitely not have orange (as its mislabeled) and it can not contain only apple (As it is in box 3) - So this will have Original Content- both oranges and Apples
  • Box 1 - Apples - This is the leftover box and it can now have Original Content - Orange

Therefore option B is correct

Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 8

X is 30 digit number starting with 4 followed 7. Then number X3 will have

Detailed Solution for Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 8

X = 4777....(till 30 digits)
or X = 4.7777⋯ ∗ 1029
X29 = (4.777⋯∗1029)3
 
= (4.777…)∗ 10 87
So, (X3 ) requires 3 + 87 = 90 digits.

Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 9

"We lived in culture and denied any merit to literally works, Considering them important only when they were handmaidens to something seemingly more urgent - namely ideology. This was a country where all gestures even the most private , interpreted as political terms." The author's believes that ideology is not as important as literature is revealed by the word :

Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 10

An air pressure contour line join the locations in the region having the same atmospheric pressure. The following is the air pressure contour of a geographical region. The contour line are shown as 0.05 bar intervals in this plot.

Q. If the probability of thunderstorm is given by how fast air pressure rises or drops over a region. Which of the following region is most likely to have thunderstorm.

Detailed Solution for Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 10

Region R has maximum air pressure variation as it  which has maximum number of lines crossing the area. Therefore option C is correct 

Alternate Solution
We have to see for the region which has maximum change in air pressure for thunderstorm.
In region P – the air pressure changes only once by 0.05 as only 2 lines are crossing the region. The first line with the air pressure 0.95 and the next one is with pressure 0.9. 
In region Q – No line crosses the region which implies that the air pressure doesn’t change.
In region R – the air pressure changes at 4 places resulting in maximum change in air pressure in the whole region. The minimum pressure in R is 0.65 and the maximum is 0.8.
In region S – the air pressure in the region in 0.95 and other contouring line is outside the region thus no change in air pressure within the region.
Thus the probability of thunderstorm is maximum in region R. 

Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 11

Let pqr denote the statement "It is raining", "It is cold", and "It is pleasant", respectively. Then the statement "It is not raining and it is pleasant, and it is not pleasant only if it is raining and it is cold" is represented by:

Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 12

Match the following according to input(from the left column) to the compiler phase(in the right column) that process it:

Detailed Solution for Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 12

P - iii Syntax tree is input to semantic analyser Q - iv Character stream is input to lexical analyser. R - i Intermediate code is input to code generator S -ii  Token stream is input to syntax analyser. Therefore option C

Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 13

In a file allocation system, which of the following allocation scheme(s) can be used if no external fragmentation is allowed? 

I. Contiguous 
II. Linked 
III. Indexed 

Detailed Solution for Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 13

In contiguous allocation there is always possibility of external fragmentation. Both indexed and linked allocation are free from external fragmentation.

Therefore, option D

Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 14

Note: This question appeared as Numerical Answer Question in GATE.

Detailed Solution for Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 14

Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 15

The representation of the value of a 16-bit unsigned integer X in a hexadecimal number system is BCA9. The representation of the value of X in octal number system is:

Detailed Solution for Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 15

Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 16

An ER model of a database consists of entity types A and B. These are connected by a relationship R which does not have its own attribute. Under which of the following conditions, can the relational table for R be merged with that of A? 

Detailed Solution for Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 16

In one to many or many to one participation, relation is merged in table which is on many side and if there is total participation then relation is merged in that side. Therefore, option C is correct

Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 17

Match the algorithms with their time complexities:

Detailed Solution for Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 17
  • Tower of Hanoi - Ɵ(2n)
  • Heap sort worst case - Ɵ(n log n)
  • Binary Search - Ɵ(log n)
  • Addition of two nxn matrices - Ɵ (n2)

Therefore Option C is correct

Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 18

Consider the following statements about the routing protocols, Routing Information Protocol(RIP) and Open Shortest Path First(OSPF) in an IPv4 network. 

I. RIP uses distance vector routing 
II. RIP packets are sent using UDP 
III. OSPF packets are sent using TCP 
IV. OSPF operation is based on link-state routing 
Which of the following above are CORRECT?

Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 19

Detailed Solution for Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 19

Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 20

The maximum number of IPv4 router address addresses that can be listed in the record route (RR) option field of an IPv4 header is ____. 
Note: This question appeared as Numerical Answer Type.

Detailed Solution for Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 20

Record Route is an optional field used to record address. 
In IPv4 header, 40 bytes are reserved for OPTIONS. For Record Route to stores, 1 byte is used to store type of option, 1 byte for length and 1 byte for pointer. Out of 40, 37 bytes are left. 
An IP4 address takes 32 bits or 4 bytes. 
We can store at most floor(37/4) = 9 router addresses. 

Alternate Solution
In IPV4 frame format there are 40 bytes of option field, out of which only 38 bytes can be used, 2 bytes are reserved . Also one IPV4 adress is of 4 bytes 
Thus maxmimum IPV4 address that can be hold <= 38/4 = 9

Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 21

Consider the following tables T1 and T2:

Q. In table T1, P is the primary key, Q is the foreign key referencing R in table T2 with on-delete cascade and on-update cascade. In table T2, R is the primary key and S is the foreign key referencing P in the table T1 with on-delete set NULL and on-update cascade. In order to delete record (3,8) from table, numbers of additional record that need to be deleted from table T1 is 

Detailed Solution for Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 21

Given,

  • Q -> R(Primary Key)
  • S -> P (Primary Key)

Entry to be deleted - P (3) and Q(8)

  • Q can be deleted directly
  • Now, S - > P but the relationship given is on delete set NULL, Therefore when  we delete 3 from  T1 ,the  entry in T2 having 3 will be NULL.

Therfore, Option A  - Answer is 0 entries

Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 22

Breath First Search(BFS) has been implemented using queue data structure.

 

Q. Which one of the following is a possible order of visiting the nodes in the graph above.

Detailed Solution for Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 22

In BFS, we print a starting node, then its adjacent, then adjacent of adjacent, and so on..

Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 23

Consider a socket API on Linux machine that supports UDP socket. A connected UDP socket is a UDP socket on which connect function has already been called. Which of the following statements is/are correct ?

I. A connected UDP socket can be used to communicate with multiple peers simultaneously.

II. A process can successfully call connect function again for an already connected UDP socket.

Detailed Solution for Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 23

I. A connected UDP socket can be used to communicate with multiple peers simultaneously is WRONG : Even if UDP is connectionless, every UDP socket has a single specified IP number and port number to connect to. Therefore we can not use same socket to connect to multiple peers simultaneously. II. A process can successfully call connect function again for an already connected UDP socket is RIGHT : We can call connect again to connect to a new peer and disconnect previous peer if implementation allows

Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 24

Let L1 and L2 be any context-free language and R be any regular language. Then, which of the following is correct ?

I. L1 ∪ L2 is context-free.
II. L1' is context-free.
III. L1-R is context-free.
IV. L1 ∩ L2

Detailed Solution for Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 24

Context free language are closed under union and difference with regular language.
It is not closed under complementation and intersection . Complement of CFL is recursive language .

Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 25

Match the following:

Detailed Solution for Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 25
  • static char var; -> A variable located in data section of memory as it is static in nature
  • m = malloc(10); m = null; ->This is a lost memory which cannot be freed as m=NULL
  • Char *Ptr[10]; -> 10 memory locations of char type are allocated to store addresses
  • register int var1;-> Request to allocate a CPU register to store data
Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 26

Identity the language generated by following grammar where S is the start variable.

S --> XY
X --> aX | a
Y --> aYb | ∈

Detailed Solution for Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 26

S --> XY
X --> aX | a // This produces only "a"
Y --> aYb | ∈ // This produces and "a" for every "b"

Option (A) and (B) are wrong because n can be zero also due to epsilon in Y Option (D) is wrong because Y-->aYb produces equal number of a's and b's.
Since there is one variable X which produces at least one a.
Therefore numbers of a's are always greater than numbers of b's.

Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 27

G is undirected graph with n vertices and 25 edges such that each vertex has degree at least 3. Then the maximum possible value of n is ________

Detailed Solution for Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 27

As per handshaking lemma,

Sum of degree of all vertices < = 2 * no. of edges.

Let v be number of vertices in graph.
==> 3*v <= 2*25
==> Minimum value of v = 16

Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 28

The minimum possible number of states of a deterministic finite automaton that accepts a regular language L = {w1aw2 | w1, w2 ∈{a,b}* , |w1| = 2, w2>=3} is_______

Detailed Solution for Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 28

Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 29

Given the following binary number in 32 bit (single precision) IEEE-754 format:

00111110011011010000000000000000

 

Q. The decimal value closest to this floating-point number is:

Detailed Solution for Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 29

In 32-bit IEEE-754 format

1st bit represent sign
2-9th bit represent exponent and 10-32 represent Mantissa (Fraction part)

Sign = 0, so positive 
2-9 bits — 01111100 when subtracted by 01111111 i.e., 126 decimal value gives -> 0000 0011 
Which is -3.(negative as the value is less than 126) 
As number is less than 126 it is subtracted otherwise 126 would have been subtracted from it in 32 bit representation. 
Mantissa is normal ,hence, 1.M can be used .Which is 1.1101101. 
Thus, 
Data + 1.1101101 * 2^-3 (±M * B^(±e)) 
Mantissa shift right 3 times -> 
+0.0011101101 
= 0.228 
= 2.28 * 10^-1 
Thus, option c is correct. 

Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) - Question 30

A Circular queue has been implemented using singly linked list where each node consists of a value and a pointer to next node. We maintain exactly two pointers FRONT and REAR pointing to the front node and rear node of queue. Which of the following statements is/are correct for circular queue so that insertion and deletion operations can be performed in O(1) i.e. constant time.

I. Next pointer of front node points to the rear node.

II. Next pointer of rear node points to the front node.

View more questions
Information about Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) Page
In this test you can find the Exam questions for Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test) solved & explained in the simplest way possible. Besides giving Questions and answers for Computer Science And Information Technology - CS 2017 GATE Paper - 2 (Practice Test), EduRev gives you an ample number of Online tests for practice
Download as PDF