GATE Computer Science And IT Last Year Paper - 2018-2019 StudyChaCha

#1
January 24th, 2014, 05:52 PM
 Unregistered Guest Posts: n/a
GATE Computer Science And IT Last Year Paper

Will you please provide me question paper for GATE computer science and information technology subject ??
#2
January 25th, 2014, 10:18 AM
 Super Moderator Join Date: Jun 2011 Posts: 35,928
Re: GATE Computer Science And IT Last Year Paper

Here I am giving you question paper for GATE computer science and information technology subject in PDF files attached with it ..

Some questions are given below :

Q.1 A binary operation ⊕ on a set of integers is defined as 2 2 y x y x . Which one of the following
(A) Commutative but not associative (B) Both commutative and associative
(C) Associative but not commutative (D) Neither commutative nor associative

Q.2 Suppose p is the number of cars per minute passing through a certain road junction between 5 PM
and 6 PM, and p has a Poisson distribution with mean 3. What is the probability of observing fewer
than 3 cars during any given minute in this interval?
(A) 8/(2e3) (B) 9/(2e3) (C) 17/(2e3) (D) 26/(2e3)

Q.4 The smallest integer that can be represented by an 8-bit number in 2’s complement form is
(A) -256 (B) -128 (C) -127 (D) 0

Q.5 In the following truth table, V = 1 if and only if the input is valid.
Inputs Outputs
D0 D1 D2 D3 X0 X1 V
0 0 0 0 x x 0
1 0 0 0 0 0 1
x 1 0 0 0 1 1
x x 1 0 1 0 1
x x x 1 1 1 1

What function does the truth table represent?
(A) Priority encoder (B) Decoder
(C) Multiplexer (D) Demultiplexer

Q.6 Which one of the following is the tightest upper bound that represents the number of swaps
required to sort n numbers using selection sort?
(A) O(log n) (B) O(n) (C) O(n log n) (D) O(n2)

Q.7 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?
(A) O(1) (B) O(log n) (C) O(n) (D) O(n log n)

Q.8 Consider the languages 1 L and a L 2 . Which one of the following represents 1 2 1 L L L U ?
(A) {є} (B) Φ (C) a* (D) {є, a}

Q.9 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?
(A) n/2 (B) n-1 (C) 2n-1 (D) 2n

Q.10 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?
(A) This algorithm is equivalent to the first-come-first-serve algorithm.
(B) This algorithm is equivalent to the round-robin algorithm.
(C) This algorithm is equivalent to the shortest-job-first algorithm.
(D) This algorithm is equivalent to the shortest-remaining-time-first algorithm.

Q.12 The transport layer protocols used for real time multimedia, file transfer, DNS and email,
respectively are
(A) TCP, UDP, UDP and TCP
(B) UDP, TCP, TCP and UDP
(C) UDP, TCP, UDP and TCP
(D) TCP, UDP, TCP and UDP

Q.13 Using public key cryptography, X adds a digital signature σ to message M, encrypts , and
sends it to Y, where it is decrypted. Which one of the following sequences of keys is used for the
operations?
(A) Encryption: X’s private key followed by Y’s private key; Decryption: X’s public key followed
by Y’s public key
(B) Encryption: X’s private key followed by Y’s public key; Decryption: X’s public key followed
by Y’s private key
(C) Encryption: X’s public key followed by Y’s private key; Decryption: Y’s public key followed
by X’s private key
(D) Encryption: X’s private key followed by Y’s public key; Decryption: Y’s private key followed
by X’s public key

Q.15 An index is clustered, if
(A) it is on a set of fields that form a candidate key.
(B) it is on a set of fields that include the primary key.
(C) the data records of the file are organized in the same order as the data entries of the index.
(D) the data records of the file are organized not in the same order as the data entries of the index.

Q.17 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.
(A) 1 and 4 only (B) 1 and 3 only (C) 2 only (D) 3 only

Q.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.
(A) 1, 2 and 3 (B) 1 and 2 only (C) 2 and 3 only (D) 1 and 3 only

Q.24 Consider an undirected random graph of eight vertices. The probability that there is an edge
between a pair of vertices is 1/2. What is the expected number of unordered cycles of length three?
(A) 1/8 (B) 1 (C) 7 (D) 8

Q.25 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.
(A) P only (B) Q only (C) Both P and Q (D) Neither P nor Q
Attached Files
 GATE CS and IT paper.pdf (383.7 KB, 40 views) GATE CS and IT paper 1.pdf (215.1 KB, 23 views)
__________________

#3
January 2nd, 2015, 02:55 PM
 Super Moderator Join Date: Nov 2011 Posts: 31,703
Re: GATE Computer Science And IT Last Year Paper

Hello friend as you want the last year GATE Computer Science And IT Papers so here I am providing you please have a look…..

SECTION – A
1.1 The probability that it will rain today is 0.5. The probability that it will rain tomorrow is 0.6. The probability that it will rain either today or tomorrow is 0.7. What is the probability that it will rain today and tomorrow?
(a) 0.3 (b) 0.25 (c) 0.35 (d) 0.4

1.4 The concatenation of two lists is to be performed on 0(1) time. Which of the following implementations of a list should be used?

(c) Circular doubly linked list (d) Array implementation of list
1.5 The correct matching for the following pairs is

(A) All pairs shortest paths (1) Greedy
(B) Quick Sort (2) Depth-First search
(C) Minimum weight spanning tree (3) Dynamic Programming
(D) Connected Components (4) Divide and Conquer
(a) A – 2 B – 4 C – 1 D – 3 (b) A – 3 B – 4 C – 1 D – 2
(c) A – 3 B – 4 C – 2 D – 1 (d) A – 4 B – 1 C – 2 D – 3

1.7 Which of the following is essential for converting an infix expression to the postfix form efficiently
(a) An operator stack (b) An operand stack
(c) An operand stack and an operator stack
(d) A parse tree

1.8 A language L allows declaration of arrays whose sizes are not known during compilation. It is required to make efficient use of memory. Which one of the following is true
(a) A compiler using static memory allocation can be written for L
(b) A compiler cannot be written for L; an interpreter must be used.
(c) A compiler using dynamic memory allocation can be written for L
(d) None of the above

1.9 The conditional expansion facility of macro processor is provided to
(a) test a condition during the execution of the expanded program
(b) to expand certain model statements depending upon the value of a condition during the execution of the expanded program
(C) to implement recursion
(d) to expand certain model statements depending upon the value of a condition during the process of macro expansion.

1.10 Heap allocation is required for languages.
(a) that support recursion
(b) that support dynamic data structures
(c) that use dynamic scope rules
(d) None of the above

Rest of the question here is the attachment given below please click on it….
Attached Files
 GATE Computer Science And IT Last Year Paper-1.pdf (254.8 KB, 24 views) GATE Computer Science And IT Last Year Paper-2.pdf (453.0 KB, 44 views) GATE Computer Science And IT Last Year Paper-3.pdf (411.7 KB, 11 views)
__________________

Message:
Options

 Forum Jump StudyChaCha Discussion Forum     General Topics     Exams     MBA / Business Schools     Study Abroad and Immigration Consultancy     Career and Jobs Questions by Topics     Medicine and Health     Management

All times are GMT +6.5. The time now is 04:30 PM.

 -- Default Style -- Default vBulletin -- Lightweight MBA Discussion - Job Discussion - Contact Us - StudyChaCha - Blog Archives - Forum Archive - Partners : Management Forum Eduvark MBA Forum Courses Forum Top