GATE  >  GATE Past Year Papers for Practice (All Branches)  >  Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) Download as PDF

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


Test Description

65 Questions MCQ Test GATE Past Year Papers for Practice (All Branches) | Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test)

Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) for GATE 2022 is part of GATE Past Year Papers for Practice (All Branches) preparation. The Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) questions and answers have been prepared according to the GATE exam syllabus.The Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) MCQs are made for GATE 2022 Exam. Find important definitions, questions, notes, meanings, examples, exercises, MCQs and online tests for Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) below.
Solutions of Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) questions in English are available as part of our GATE Past Year Papers for Practice (All Branches) for GATE & Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) solutions in Hindi for GATE Past Year Papers for Practice (All Branches) 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 2014 GATE Paper (Practice Test) | 65 questions in 180 minutes | Mock test for GATE preparation | Free important questions MCQ to study GATE Past Year Papers for Practice (All Branches) for GATE Exam | Download free PDF with solutions
1 Crore+ students have signed up on EduRev. Have you?
Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) - Question 1

Q. 1 – Q. 5 carry one mark each.

Which of the following options is the closest in meaning to the phrase underlined in the sentence
below?
It is fascinating to see life forms "cope with" varied environmental conditions.

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

In the above phrase, underlined part is *cope with*.

“Cope” – It’s a verb.
Meaning – deal effectively with some difficulty.
Example Sentence – “his ability to cope with stress”

“adopt” – verb.
Meaning – choose to take up or follow (an idea, method, or course of action).
Sentence – “this approach has been adopted by many big banks”

“adapt” – verb.
Meaning – become adjusted to new conditions.
sentence -“a large organization can be slow to adapt to change”

“adept” – adjective
Meaning – very skilled or proficient at something.
Sentence – “she is adept at cutting through red tape”

“accept” – verb
Meaning – consent to receive or undertake (something offered).
Sentence – “he accepted a pen as a present”

Hence, only “adapt” goes right with the phrase described in the question.

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

Choose the most appropriate word from the options given below to complete the following
sentence.
He could not understand the judges awarding her the first prize, because he thought that her
performance was quite __________.

Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) - Question 3

In a press meet on the recent scam, the minister said, "The buck stops here". What did the minister
convey by the statement?

*Answer can only contain numeric values
Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) - Question 4

If (z + 1/z)2 = 98, compute (z2 + 1/z2).


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

The roots of ax2 + bx+ ?? = 0 are real and positive. a, b and c are real. Then ax2 + b|x| + c = 0
has

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

Q. 6 – Q. 10 carry two marks each.

The Palghat Gap (or Palakkad Gap), a region about 30 km wide in the southern part of the Western
Ghats in India, is lower than the hilly terrain to its north and south. The exact reasons for the
formation of this gap are not clear. It results in the neighbouring regions of Tamil Nadu getting
more rainfall from the South West monsoon and the neighbouring regions of Kerala having higher summer temperatures

What can be inferred from this passage?

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

Geneticists say that they are very close to confirming the genetic roots of psychiatric illnesses such
as depression and schizophrenia, and consequently, that doctors will be able to eradicate these
diseases through early identification and gene therapy.
On which of the following assumptions does the statement above rely?

*Answer can only contain numeric values
Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) - Question 8

Round-trip tickets to a tourist destination are eligible for a discount of 10% on the total fare. In
addition, groups of 4 or more get a discount of 5% on the total fare. If the one way single person
fare is Rs 100, a group of 5 tourists purchasing round-trip tickets will be charged Rs ___________.


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

In a survey, 300 respondents were asked whether they own a vehicle or not. If yes, they were further asked to mention whether they own a car or scooter or both. The irresponses are tabulated below.


What percent of respondents do not own a scooter?

*Answer can only contain numeric values
Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) - Question 10

When a point inside of a tetrahedron (a solid with four triangular surfaces) is connected by straight
lines to its corners, how many (new) internal planes are created with these lines? _____________


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

Q. 11 – Q. 35 carry one mark each.

Consider the statement


“Not all that glitters is gold”


Predicate glitters (x) is true if x glitters and predicate gold(x) is true if x is gold. Which one of
the following logical formulae represents the above statement?

*Answer can only contain numeric values
Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) - Question 12

Suppose you break a stick of unit length at a point chosen uniformly at random. Then the expected
length of the shorter stick is ________ .


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

Let G=(V,E) be a directed graph where V is the set of vertices and E the set of edges. Then which
one of the following graphs has the same strongly connected components as G ?

*Answer can only contain numeric values
Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) - Question 14

Consider the following system of equations:

3x + 2y = 1
4x + 7z = 1
x + y + z = 3
x – 2y + 7z = 0
The number of solutions for this system is __________________


*Answer can only contain numeric values
Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) - Question 15

The value of the dot product of the eigenvectors corresponding to any pair of different eigenvalues
of a 4-by-4 symmetric positive definite matrix is _____________________.


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

Let the function

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

Consider the following Boolean expression for F:

*Answer can only contain numeric values
Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) - Question 18

The base (or radix) of the number system such that the following equation holds is____________.

312/20 = 13.1


*Answer can only contain numeric values
Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) - Question 19

A machine has a 32-bit architecture, with 1-word long instructions. It has 64 registers, each of
which is 32 bits long. It needs to support 45 instructions, which have an immediate operand in
addition to two register operands. Assuming that the immediate operand is an unsigned integer, the
maximum value of the immediate operand is __


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

Consider the following program in C language:
#include <stdio.h>
main()
{
int i;
int *pi = &i;
scanf(“%d”,pi);
printf(“%d ”, i+5);
}
Which one of the following statements is TRUE?

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

*Answer can only contain numeric values
Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) - Question 22

Consider a rooted n node binary tree represented using pointers. The best upper bound on the time required to determne the numebr of subtree having exactly 4 nodes is 0 (na logb n). then the value of a + 10b is ______.


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

consider the directed graph given below

which one of the following is true

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

Let P be a  quicksort program to sort numbers in ascending order using the first elements as the pivot. Let t1 ad t2 be the number of comparisons made by P for the inputs [1 2 3 4 5] and [4 1 5 3 2] respectively. wich one of the following holds

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

Which one of the following is true ?

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

Consider the finite automaton in the following figure.

What is the set of reachable states for the input string 0011?

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

Which one of the following is FALSE?

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

Match the following:
1) Waterfall model                                            a) Specifications can be developed incrementally
2) Evolutionary model                                       b) Requirements compromises are inevitable
3) Component-based software engineering         c) Explicit recognition of risk
4) Spiral development                                      d) Inflexible partitioning of the project into stages

*Answer can only contain numeric values
Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) - Question 29

Suppose a disk has 201 cylinders, numbered from 0 to 200. At some time the disk arm is at cylinder
100, and there is a queue of disk access requests for cylinders 30, 85, 90, 100, 105, 110, 135 and
145. If Shortest-Seek Time First (SSTF) is being used for scheduling the disk access, the request for
cylinder 90 is serviced after servicing ____________ number of requests.


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

Which one of the following is FALSE?

Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) - Question 31

Consider the relation scheme R = (E,F,G,H,I,J,L,M,N) and the set of functional dependencies
{{E,F} → {G}, {F} → {I,J}, {E,H} → {K,L}, {K} → {M}, {L} → {N}} on R. What is the key for
R ?

Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) - Question 32

Given the following statements:
        S1: A foreign key declaration can always be replaced by an equivalent check assertion in SQL.
S2: Given the table R(a,b,c) where a and b together form the primary key, the following is a valid table definition.
CREATE TABLE S (
a INTEGER,
d INTEGER,
e INTEGER,
PRIMARY KEY (d),
FOREIGN KEY (a) references R)

Which one of the following statements is CORRECT?

Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) - Question 33

Consider the following three statements about link state and distance vector routing protocols, for a
large network with 500 network nodes and 4000 links.
[S1] The computational overhead in link state protocols is higher than in distance vector protocols.
[S2] A distance vector protocol (with split horizon) avoids persistent routing loops, but not a link
state protocol.
[S3] After a topology change, a link state protocol will converge faster than a distance vector
protocol.
Which one of the following is correct about S1, S2, and S3 ?

Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) - Question 34

Which of the following are used to generate a message digest by the network security protocols?
(P) RSA

(Q) SHA-1

(R) DES

(S) MD5

Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) - Question 35

Identify the correct order in which the following actions take place in an interaction between a web
browser and a web server.
1. The web browser requests a webpage using HTTP.
2. The web browser establishes a TCP connection with the web server.
3. The web server sends the requested webpage using HTTP.
4. The web browser resolves the domain name using DNS.

*Answer can only contain numeric values
Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) - Question 36

Q. 36 – Q. 65 carry two marks each.

Q

Consider a token ring network with a length of 2 km having 10 stations including a monitoring
station. The propagation speed of the signal is 2 × 10?? m/s and the token transmission time is
ignored. If each station is allowed to hold the token for 2 μsec, the minimum time for which the
monitoring station should wait (in μsec)before assuming that the token is lost is _______.


*Answer can only contain numeric values
Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) - Question 37

Let the size of congestion window of a TCP connection be 32 KB when a timeout occurs. The round
trip time of the connection is 100 msec and the maximum segment size used is 2 KB. The time taken
(in msec) by the TCP connection to get back to 32 KB congestion window is _________.


*Answer can only contain numeric values
Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) - Question 38

Consider a selective repeat sliding window protocol that uses a frame size of 1 KB to send data on a
1.5 Mbps link with a one-way latency of 50 msec. To achieve a link utilization of 60%, the
minimum number of bits required to represent the sequence number field is ________.


Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) - Question 39

Consider the following four schedules due to three transactions (indicated by the subscript) using
read and write on a data item x, denoted by r(x) and w(x) respectively. Which one of them is
conflict serializable?

Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) - Question 40

Given the following two statements:
S1: Every table with two single-valued attributes is in 1NF, 2NF, 3NF
and BCNF.
S2: AB→C, D→E, E→C is a minimal cover for the set of functional
dependencies AB→C, D→E, AB→E, E→C.
Which one of the following is CORRECT?

Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) - Question 41

An operating system uses the Banker’s algorithm for deadlock avoidance when managing the
allocation of three resource types X, Y, and Z to three processes P0, P1, and P2. The table given
below presents the current system state. Here, the Allocation matrix shows the current number of
resources of each type allocated to each process and the Max matrix shows the maximum number
of resources of each type required by each process during its execution.

 

There are 3 units of type X, 2 units of type Y and 2 units of type Z still available. The system is
currently in a safe state. Consider the following independent requests for additional resources in the
current state:
REQ1: P0 requests 0 units of X, 0 units of Y and 2 units of Z
REQ2: P1 requests 2 units of X, 0 units of Y and 0 units of Z
Which one of the following is TRUE?

*Answer can only contain numeric values
Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) - Question 42

Consider the following set of processes that need to be scheduled on a single CPU. All the times are
given in milliseconds.

Using the shortest remaining time first scheduling algorithm, the average process turnaround time
(in msec) is ____________________.


*Answer can only contain numeric values
Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) - Question 43

Assume that there are 3 page frames which are initially empty. If the page reference string is 1, 2, 3,
4, 2, 1, 5, 3, 2, 4, 6, the number of page faults using the optimal replacement policy is__________.


Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) - Question 44

A canonical set of items is given below
S ? L . > R
Q ? R .
On input symbol < the set has

Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) - Question 45

Let L be a language and  be its complement. Which one of the following is NOT a viable
possibility?

 

Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) - Question 46

Which of the regular expressions given below represent the following DFA?

I) 0*1(1+00*1)*
II) 0*1*1+11*0*1
III) (0+1)*1

*Answer can only contain numeric values
Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) - Question 47

There are 5 bags labeled 1 to 5. All the coins in a given bag have the same weight. Some bags
have coins of weight 10 gm, others have coins of weight 11 gm. I pick 1, 2, 4, 8, 16 coins
respectively from bags 1 to 5. Their total weight comes out to 323 gm. Then the product of the
labels of the bags having 11 gm coins is ___.


Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) - Question 48

Suppose a polynomial time algorithm is discovered that correctly computes the largest clique in a
given graph. In this scenario, which one of the following represents the correct Venn diagram of the
complexity classes P, NP and NP Complete (NPC)?

*Answer can only contain numeric values
Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) - Question 49

The minimum number of comparisons required to find the minimum and the maximum of 100
numbers is _________________.


Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) - Question 50

Consider a hash table with 9 slots. The hash function is h(k) = k mod 9. The collisions are
resolved by chaining. The following 9 keys are inserted in the order: 5, 28, 19, 15, 20, 33,

Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) - Question 51

Consider the following C function in which size is the number of elements in the array E:


int MyX(int *E, unsigned int size)
{
int Y = 0;
int Z;
int i, j, k;
for(i = 0; i < size; i++)
Y = Y + E[i];
for(i = 0; i < size; i++)
for(j = i; j < size; j++)
{
Z = 0;
for(k = i; k <= j; k++)
Z = Z + E[k];
if (Z > Y)
Y = Z;
}
return Y;
}
The value returned by the function MyX is the

Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) - Question 52

Consider the following pseudo code. What is the total number of multiplications to be performed?
D = 2
for i = 1 to n do
for j = i to n do
for k = j + 1 to n do
D = D * 3

*Answer can only contain numeric values
Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) - Question 53

Consider a 6-stage instruction pipeline, where all stages are perfectly balanced.Assume that there is
no cycle-time overhead of pipelining. When an application is executing on this 6-stage pipeline, the
speedup achieved with respect to non-pipelined execution if 25% of the instructions incur 2
pipeline stall cycles is ______________________.


Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) - Question 54

Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) - Question 55

Consider the 4 - to -1 multiplexer with two select lines S1 and S0 given below

The minimal sum of product form of the boolean expression for the output F of the multiplexer is 

*Answer can only contain numeric values
Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) - Question 56

The function F(x) = x sin x satisfies the following equations:  f" (x) + f(x) + t cos x= 0. The value of t is 


Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) - Question 57

A function f(x) is continuous in the interval [0,2]. It is known that f(0) = f(2) = -1 and f(1) =1 . which one of the following statemnts must be true?

*Answer can only contain numeric values
Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) - Question 58

four fair six-sided dice are rolled. the probability that the sum of the results being 22 is x/ 1296 . The value of x is 


*Answer can only contain numeric values
Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) - Question 59

A pennant is a sequence of numbers, each number being 1 or 2. An n-pennant is a sequence of
numbers with sum equal to n. For example, (1,1,2) is a 4-pennant. The set of all possible 1-pennants
is {(1)}, the set of all possible 2-pennants is {(2), (1,1)}and the set of all 3-pennants is {(2,1),
(1,1,1), (1,2)}. Note that the pennant (1,2) is not the same as the pennant (2,1). The number of 10-
pennants is ______________.


*Answer can only contain numeric values
Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) - Question 60

Let S denote the set of all functions f: {0,1} → {0,1}. Denote by N the number of functions
from S to the set {0,1}. The value of log2 log2 N  is ______.


*Answer can only contain numeric values
Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) - Question 61

Consider an undirected graph G where self-loops are not allowed. The vertex set of G is {(i, j): 1 ≤
i ≤ 12, 1 ≤ j ≤ 12}. There is an edge between (a,b) and (c,d) if |a − c| ≤ 1 and |b − d| ≤ 1.
The number of edges in this graph is __________.


Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) - Question 62

An ordered n-tuple (d1, d2, … , dn) with d1 ≥ d2 ≥ ? ≥ dn is called graphic if there exists a simple
undirected graph with n vertices having degrees d1 , d2, ? , dn respectively. Which of the following
6-tuples is NOT graphic?

Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) - Question 63

f the following propositional logic formulas is TRUE when exactly two of p, q, and r
are TRUE?

Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) - Question 64

Given the following schema:


employees(emp-id, first-name, last-name, hire-date,
             dept-id, salary)
departments(dept-id, dept-name, manager-id, location-id)

You want to display the last names and hire dates of all latest hires in their respective departments
in the location ID 1700. You issue the following query:

SQL>SELECT last-name, hire-date
FROM employees
WHERE (dept-id, hire-date) IN
(SELECT dept-id, MAX(hire-date)
FROM employees JOIN departments USING(dept-id)
WHERE location-id = 1700
GROUP BY dept-id);

 

What is the outcome?

*Answer can only contain numeric values
Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) - Question 65

Consider two processors P1 and P2 executing the same instruction set. Assume that under identical
conditions, for the same input, a program running on P2 takes 25% less time but incurs 20% more
CPI (clock cycles per instruction) as compared to the program running on P1. If the clock frequency
of P1 is 1GHz, then the clock frequency of P2 (in GHz) is _________.


Use Code STAYHOME200 and get INR 200 additional OFF
Use Coupon Code
Information about Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) Page
In this test you can find the Exam questions for Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test) solved & explained in the simplest way possible. Besides giving Questions and answers for Computer Science And Information Technology - CS 2014 GATE Paper (Practice Test), EduRev gives you an ample number of Online tests for practice