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

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


Test Description

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

Computer Science And Information Technology - CS 2013 GATE Paper (Practice Test) for GATE 2024 is part of GATE preparation. The Computer Science And Information Technology - CS 2013 GATE Paper (Practice Test) questions and answers have been prepared according to the GATE exam syllabus.The Computer Science And Information Technology - CS 2013 GATE Paper (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 2013 GATE Paper (Practice Test) below.
Solutions of Computer Science And Information Technology - CS 2013 GATE Paper (Practice Test) questions in English are available as part of our course for GATE & Computer Science And Information Technology - CS 2013 GATE Paper (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 2013 GATE Paper (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 2013 GATE Paper (Practice Test) - Question 1

Q. No. 1 – 5 Carry One Mark Each

Q.

Complete the sentence:
Universalism is to particularism as diffuseness is to ________

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

The relation is that of antonyms

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

Were you a bird, you ___________ in the sky.

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

Which one of the following options is the closest in meaning to the word given below?
Nadir

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

Nadir in the lowest point on a curve

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

Choose the grammatically INCORRECT sentence:

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

What will be the maximum sum of 44, 42, 40, ... ?

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

The maximum sum is the sum of 44, 42,- - - - -2.
The sum of ‘n’ terms of an AP

In this case, n = 22, a = 2 and d = 2
Sum =11[4 + 21×2] =11×46 = 506

Computer Science And Information Technology - CS 2013 GATE Paper (Practice Test) - Question 6

Q. No. 6 – 10 Carry Two Marks Each

Q.

Out of all the 2-digit integers between 1 and 100, a 2-digit number has to be selected at
random. What is the probability that the selected number is not divisible by 7?

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

The number of 2 digit multiples of 7 = 13
Probability of choosing a number
Not divisible by 7 =(90-13)/90 =77/90

Computer Science And Information Technology - CS 2013 GATE Paper (Practice Test) - Question 7

A tourist covers half of his journey by train at 60 km/h, half of the remainder by bus at 30
km/h and the rest by cycle at 10 km/h. The average of the tourist in km/h during his entire
journey is

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

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

Find the sum of the expression

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

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

The current erection cost of a structure is Rs. 13,200. If the labour wages per day increase by
1/5 of the current wages and the working hours decrease by 1/24 of the current period, then
the new cost of erection in Rs. is

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

Let ‘W’ be the labour wages, and ‘T’ be the working hours.
Now, total cost is a function of W× T
Increase in wages = 20%
 Revised wages = 1.2 W

 

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

After several defeats in wars, Robert Bruce went in exile and wanted to commit suicide. Just
before committing suicide, he came across a spider attempting tirelessly to have its net. Time
and again, the spider failed but that did not deter it to refrain from making attempts. Such
attempts by the spider made Bruce curious. Thus, Bruce started observing the nearimpossible
goal of the spider to have the net. Ultimately, the spider succeeded in having its
net despite several failures. Such act of the spider encouraged Bruce not to commit suicide.
And then, Bruce went back again and won many a battle, and the rest is history.


Which one of the following assertions is best supported by the above information?

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

Q. No. 11 – 35 Carry One Mark Each

Q.

Consider an undirected random graph of eight vertices. The probability that there is an edge
between a pair of vertices is ½. What is the expected number of unordered cycles of length
three?

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

P(edge) =1/2
Number of ways we can choose the vertices out of 8 is
(Three edges in each cycle)
Expected number of unordered cycles of length 3 =  x (1/2)3 =7

 

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

Which of the following statements is/are TRUE for undirected graphs?
P: Number of odd degree vertices is even.
Q: Sum of degrees of all vertices is even.

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

Q: Sum of degrees of all vertices = 2×(number of edges)

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

Function f is known at the following points:

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

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

Which one of the following functions is continuous at x = 3 ?

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

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

Which one of the following expressions does NOT represent exclusive NOR of x and y?

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

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

In a k-way set associative cache, the cache is divided into v sets, each of which consists of k
lines. The lines of a set are placed in sequence one after another. The lines in set s are
sequenced before the lines in set (s+1). The main memory blocks are numbered 0 onwards.
The main memory block numbered j must be mapped to any one of the cache lines from

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

Position of main memory block in the cache (set) = (main memory block number) MOD
(number of sets in the cache).
As the lines in the set are placed in sequence, we can have the lines from 0 to (K – 1) in each
set.
Number of sets = v, main memory block number = j
First line of cache = (j mod v)*k; last line of cache = (j mod v)*k + (k – 1)

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

What is the time complexity of Bellman-Ford single-source shortest path algorithm on a
complete graph of n vertices?

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

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

Which of the following statements are TRUE?
(1) The problem of determining whether there exists a cycle in an undirected graph is in P.
(2) The problem of determining whether there exists a cycle in an undirected graph is in NP.
(3) If a problem A is NP-Complete, there exists a non-deterministic polynomial time
algorithm to solve A.

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

1. Cycle detection using DFS:  O(V+ E) = O(V2) and it is polynomial problem
2. Every P-problem is NP(since P
NP)
3. NP − complete
 NP
Hence, NP-complete can be solved in non-deterministic polynomial time

 

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

Which of the following statements is/are FALSE?
(1) For every non-deterministic Turing machine, there exists an equivalent deterministic
Turing machine.
(2) Turing recognizable languages are closed under union and complementation.
(3) Turing decidable languages are closed under intersection and complementation
(4) Turing recognizable languages are closed under union and intersection.

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

(1) NTM DTM
(2) RELs are closed under union & but not complementation
(3) Turing decidable languages are recursive and recursive languages are closed under
intersection and complementation
(4) RELs are closed under union & intersection but not under complementation

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

Three concurrent processes X, Y, and Z execute three different code segments that access and
update certain shared variables. Process X executes the P operation (i.e., wait) on semaphores
a, b and c; process Y executes the P operation on semaphores b, c and d; process Z executes
the P operation on semaphores c, d, and a before entering the respective code segments. After
completing the execution of its code segment, each process invokes the V operation (i.e.,
signal) on its three semaphores. All semaphores are binary semaphores initialized to one.
Which one of the following represents a deadlock-free order of invoking the P operations by
the processes?

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

Suppose X performs P(b) and preempts, Y gets chance, but cannot do its first wait i.e., P(b),
so waits for X, now Z gets the chance and performs P(a) and preempts, next X gets chance.
X cannot continue as wait on ‘a’ is done by Z already, so X waits for Z. At this time Z can
continue its operations as down on c and d. Once Z finishes, X can do its operations and so Y.
In any of execution order of X, Y, Z one process can continue and finish, such that waiting is
not circular. In options (A),(C) and (D) we can easily find circular wait, thus deadlock

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

An index is clustered, if

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

Clustered index is built on ordering non key field and hence if the index is clustered then the
data records of the file are organized in the same order as the data entries of the index.

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

Assume that source S and destination D are connected through two intermediate routers
labeled R. Determine how many times each packet has to visit the network layer and the data
link layer during a transmission from S to D.

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

From above given diagram, its early visible that packet will visit network layer 4 times, once
at each node [S, R, R, D] and packet will visit Data Link layer 6 times. One time at S and one
time at D, then two times for each intermediate router R as data link layer is used for link to
link communication.
Once at packet reaches R and goes up from physical –DL-Network and second time when
packet coming out of router in order Network – DL- Physical

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

The transport layer protocols used for real time multimedia, file transfer, DNS and
email, respectively are

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

Real time multimedia needs connectionless service, so under lying transport layer protocol
used is UDP
File transfer rums over TCP protocol with port no-21
DNS runs over UDP protocol within port no-53
Email needs SMTP protocol which runs over TCP protocol within port no – 25

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

Using public key cryptography, X adds a digital signature σ to message M, encrypts <M,
σ >, and sends it to Y, where it is decrypted. Which one of the following sequences of keys is
used for the operations?

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

 

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

Match the problem domains in Group I with the solution technologies in Group II.

Computer Science And Information Technology - CS 2013 GATE Paper (Practice Test) - Question 26

A scheduling algorithm assigns priority proportional to the waiting time of a process. Every
process starts with priority zero(the lowest priority). The scheduler re-evaluates the process
priorities every T time units and decides the next process to schedule. Which one of the
following is TRUE if the processes have no I/O operations and all arrive at time zero?

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

The given scheduling definition takes two parameters, one is dynamically assigned process
priority and the other is ‘T’ time unit to re-evaluate the process priorities.
This dynamically assigned priority will be deciding processes order in ready queue of round
robin algorithm whose time quantum is same as ‘T’ time units. As all the processes are
arriving at the same time, they will be given same priority but soon after first ‘T’ time burst
remaining processes will get higher priorities

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

What is the maximum number of reduce moves that can be taken by a bottom-up parser for a
grammar with no epsilon- and unit-production (i.e., of type A → and A→a) to parse a
string with n tokens?

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

To have maximum number of reduce moves, all the productions will be of the typeA→αb
(where  and  could be terminals or non-terminals). Consider the following illustration
then:

 

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

Consider the languages and . Which one of the following represents  ?

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

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

Which one of the following is the tightest upper bound that represents the time complexity of
inserting an object into a binary search tree of n nodes?

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

For skewed binary search tree on n nodes, the tightest upper bound to insert a node is O(n)

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

Which one of the following is the tightest upper bound that represents the number of swaps
required to sort n numbers using selection sort?

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

The maximum number of swaps that takes place in selection sort on n numbers is n

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