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

Choose the grammatically INCORRECT sentence:

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

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?

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

Find the sum of the expression

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

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?

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?

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.

Function f is known at the following points:

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

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

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

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

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.

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.

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?

An index is clustered, if

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.

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

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?

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

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?

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?

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

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?

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