GATE Exam 2022 Computer Science and Information Technology (CS) Question Paper With Answer Key

GATE-2022

CS: Computer Science and Information Technology

General Aptitude

Q.1 – Q.5 Carry ONE mark each.

1. The _________ is too high for it to be considered _________.

(A)  fair / fare

(B)  faer / fair

(C)  fare / fare

(D)  fare / fair

Answer: (D)

2. A function y(x) is defined in the interval [0, 1] on the x-axis as

Which one of the following is the area under the curve for the interval [0, 1] on

the x-axis?

(A)  5/6

(B)  6/5

(C)  13/6

(D)  6/13

Answer: (C)

3. Let r be a root of the equation x2 + 2x + 6 = 0.

Then the value of the expression (r + 2)(r + 3)(r + 4)(r + 5) is

(A)  51

(B)  −51

(C)  126

(D)  −126

Answer: (D)

4. Given below are four statements.

Statement 1: All students are inquisitive.

Statement 2: Some students are inquisitive.

Statement 3: No student is inquisitive.

Statement 4: Some students are not inquisitive.

From the given four statements, find the two statements that CANNOT BE TRUE simultaneously, assuming that there is at least one student in the class.

(A)  Statement 1 and Statement 3

(B)  Statement 1 and Statement 2

(C)  Statement 2 and Statement 4

(D)  Statement 3 and Statement 4

Answer: (A)

5. A palindrome is a word that reads the same forwards and backwards. In a game of words, a player has the following two plates painted with letters.

From the additional plates given in the options, which one of the combinations of additional plates would allow the player to construct a five-letter palindrome.The player should use all the five plates exactly once. The plates can be rotated in their plane.

Answer: (B)

6. Some people believe that “what gets measured, improves”. Some others believe that “what gets measured, gets gamed”. One possible reason for the difference in the beliefs is the work culture in organizations. In organizations with good work culture, metrics help improve outcomes. However, the same metrics are counterproductive in organizations with poor work culture.

Which one of the following is the CORRECT logical inference based on the information in the above passage?

(A)  Metrics are useful in organizations with poor work culture

(B)  Metrics are useful in organizations with good work culture

(C)  Metrics are always counterproductive in organizations with good work culture

(D)  Metrics are never useful in organizations with good work culture

Answer: (B)

7. In a recently conducted national entrance test, boys constituted 65% of those who appeared for the test. Girls constituted the remaining candidates and they accounted for 60% of the qualified candidates.

Which one of the following is the correct logical inference based on the information provided in the above passage?

(A)  Equal number of boys and girls qualified

(B)  Equal number of boys and girls appeared for the test

(C)  The number of boys who appeared for the test is less than the number of girlswho appeared

(D)  The number of boys who qualified the test is less than the number of girls whoqualified

Answer: (D)

8. A box contains five balls of same size and shape. Three of them are green coloured balls and two of them are orange coloured balls. Balls are drawn from the box one at a time. If a green ball is drawn, it is not replaced. If an orange ball is drawn, it is replaced with another orange ball.

First ball is drawn. What is the probability of getting an orange ball in the next draw?

(A)  1/2

(B)  8/25

(C)  19/50

(D)  23/50

Answer: (D)

9. The corners and mid-points of the sides of a triangle are named using the distinct letters P, Q, R, S, T and U, but not necessarily in the same order. Consider the following statements:

• The line joining P and R is parallel to the line joining Q and S.

• P is placed on the side opposite to the corner T.

• S and U cannot be placed on the same side.

Which one of the following statements is correct based on the above information?

(A)  P cannot be placed at a corner

(B)  S cannot be placed at a corner

(C)  U cannot be placed at a mid-point

(D)  R cannot be placed at a corner

Answer: (B)

10. A plot of land must be divided between four families. They want their individual plots to be similar in shape, not necessarily equal in area. The land has equally spaced poles, marked as dots in the below figure. Two ropes, R1 and R2, are already present and cannot be moved.

What is the least number of additional straight ropes needed to create the desired plots? A single rope can pass through three poles that are aligned in a straight line.

(A)  2

(B)  4

(C)  5

(D)  3

Answer: (D)

Computer Science and Information Technology

Q.11 – Q.35 Carry ONE mark Each

11. Which one of the following statements is TRUE for all positive functions f (n) ?

(A)  f(n2) = θ (f(n)2),when f(n) is a polynomial

(B)  f(n2 ) = o(f (n)2)

(C)  f(n2) = O(f(n)2),when f(n) is an exponential function

(D)  f(n2) = Ω(f (n)2)

Answer: (A)

12. Which one of the following regular expressions correctly represents the language of the finite automaton given below?

(A) ab*bab* + ba*aba*

(B) (ab*b)*ab* + (ba*a)*ba*

(C) (ab*b + ba*a)* (a* + b*)

(D) (ba*a + ab*b)*(ab* + ba*)

Answer: (D)

13. Which one of the following statements is TRUE?

(A) The LALR(1) parser for a grammar G cannot have reduce-reduce conflict if the LR(1) parser for G does not have reduce-reduce conflict.

(B) Symbol table is accessed only during the lexical analysis phase.

(C) Data flow analysis is necessary for run-time memory management.

(D) LR(1) parsing is sufficient for deterministic context-free languages.

Answer: (D)

14. In a relational data model, which one of the following statements is TRUE?

(A) A relation with only two attributes is always in BCNF.

(B) If all attributes of a relation are prime attributes, then the relation is in BCNF.

(C) Every relation has at least one non-prime attribute.

(D) BCNF decompositions preserve functional dependencies.

Answer: (A)

15. Consider the problem of reversing a singly linked list. To take an example, given the linked list below, 

the reversed linked list should look like

Which one of the following statements is TRUE about the time complexity of algorithms that solve the above problem in O(1) space?

(A) The best algorithm for the problem takes θ(n) time in the worst case.

(B) The best algorithm for the problem takes θ (n log n) time in the worst case.

(C) The best algorithm for the problem takes θ (n2 ) time in the worst case.

(D) It is not possible to reverse a singly linked list in O(1) space.

Answer: (A)

16.  Suppose we are given n keys, m hash table slots, and two simple uniform hash functions 1 h and 2 h . Further suppose our hashing scheme uses 1 h for the odd keys and 2 h for the even keys. What is the expected number of keys in a slot?

(A)  m/n

(B)  n/m

(C)  2n/m

(D)  n/2m

Answer: (B)

17. Which one of the following facilitates transfer of bulk data from hard disk to main memory with the highest throughput?

(A) DMA based I/O transfer

(B) Interrupt driven I/O transfer

(C) Polling based I/O transfer

(D) Programmed I/O transfer

Answer: (A)

18. Let R1 and R2 be two 4-bit registers that store numbers in 2’s complement form. For the operation R1+R2, which one of the following values of R1 and R2 gives an arithmetic overflow?

(A) R1 = 1011 and R2 = 1110

(B) R1 = 1100 and R2 = 1010

(C) R1 = 0011 and R2 = 0100

(D) R1 = 1001 and R2 = 1111

Answer: (B)

19. Consider the following threads, T1, T2, and T3 executing on a single processor, synchronized using three binary semaphore variables, S1, S2, and S3, operated upon using standard wait() and signal(). The threads can be context switched in any order and at any time.

Which initialization of the semaphores would print the sequence BCABCABCA….?

(A) S1 = 1; S2 = 1; S3 = 1

(B) S1 = 1; S2 = 1; S3 = 0

(C) S1 = 1; S2 = 0; S3 = 0

(D) S1 = 0; S2 = 1; S3 = 1

Answer: (C)

20. Consider the following two statements with respect to the matrices Am×n, Bn×m, Cn×n and Dn×n.

Statement 1: tr(AB) = tr(BA)

Statement 2: tr(CD) = tr(DC)

where tr() represents the trace of a matrix. Which one of the following holds?

(A) Statement 1 is correct and Statement 2 is wrong.

(B) Statement 1 is wrong and Statement 2 is correct.

(C) Both Statement 1 and Statement 2 are correct.

(D) Both Statement 1 and Statement 2 are wrong.

Answer: (C)

21. What is printed by the following ANSI C program?

(A) 1, 10, 11

(B) 1, 10, 14

(C) 10, 14, 11

(D) 10, 10, 14

Answer: (D)

22. Consider an enterprise network with two Ethernet segments, a web server and a firewall, connected via three routers as shown below.

What is the number of subnets inside the enterprise network?

(A)  3

(B)  12

(C)  6

(D)  8

Answer: (C)

Q.23 – Q.27 Multiple Select Questions (MSQ), carry ONE mark each.

23. Which of the following statements is/are TRUE?

(A) Every subset of a recursively enumerable language is recursive.

(B) If a language L and its complement   are both recursively enumerable, then L must be recursive.

(C) Complement of a context-free language must be recursive.

(D) If L1 and L2 are regular, then L1 ⋂ L2 must be deterministic context-free.

Answer: (B, C, D)

24. Let WB and WT be two set associative cache organizations that use LRU algorithm for cache block replacement. WB is a write back cache and WT is a write through cache. Which of the following statements is/are FALSE?

(A) Each cache block in WB and WT has a dirty bit.

(B) Every write hit in WB leads to a data transfer from cache to main memory.

(C) Eviction of a block from WT will not lead to data transfer from cache to main memory.

(D) A read miss in WB will never lead to eviction of a dirty block from WB.

Answer: (A, B, D)

25. Consider the following three relations in a relational database.

Employee(eId, Name), Brand(bId, bName), Own(eId, bId)

Which of the following relational algebra expressions return the set of eIds

who own all the brands?

(A)  Πeld(Πeld, bld(Own)/ Πbld(Brand))

(B)  Πeld(Own) – Πeld((Πeld(Own) × Πbld(Brand)) – Πeld, bld(Own))

(C)  Πeld eld, bld(Own)/ Πbld(Own))

(D)  Πeld((Πeld(Own) × Πbld(Own))/ Πbld(Brand))

Answer: (A, B)

26. Which of the following statements is/are TRUE with respect to deadlocks?

(A) Circular wait is a necessary condition for the formation of deadlock.

(B) In a system where each resource has more than one instance, a cycle in its wait-for graph indicates the presence of a deadlock.

(C) If the current allocation of resources to processes leads the system to unsafe state, then deadlock will necessarily occur.

(D) In the resource-allocation graph of a system, if every edge is an assignment edge, then the system is not in deadlock state.

Answer: (A, D)

27. Which of the following statements is/are TRUE for a group G ?

(A) If for all x, y ∈ G, (xy)2 = x2 y2, then G is commutative.

(B) If for all x ∈ G, x2 = 1, then G is commutative. Here, 1 is the identity element of G.

(C) If the order of G is 2, then G is commutative.

(D) If G is commutative, then a subgroup of G need not be commutative.

Answer: (A, B, C)

Q.28 – Q.35 Numerical Answer Type (NAT), carry ONE mark each.

28. Suppose a binary search tree with 1000 distinct elements is also a complete binary tree. The tree is stored using the array representation of binary heap trees. Assuming that the array indices start with 0, the 3rd largest element of the tree is stored at index________.

Answer: (509 to 509)

29. Consider the augmented grammar with {+, *, (, ), id} as the set of terminals.

S’ → S

S → S + R | R

R → R* P | P

P → (S) | id

If I0 is the set of two LR(0) items {[S’ → S ], [S → S, + R]}, then goto(closure(I0), +) contains exactly __________ items.

Answer: (5 to 5)

30. Consider a simple undirected graph of 10 vertices. If the graph is disconnected, then the maximum number of edges it can have is _________.

Answer: (36 to 36)

31. Consider a relation R(A, B,C,D, E) with the following three functional dependencies.

AB → C; BC → D; C → E;

The number of superkeys in the relation R is _______.

Answer: (8 to 8)

32. The number of arrangements of six identical balls in three identical bins is______.

Answer: (7 to 7)

33. A cache memory that has a hit rate of 0.8 has an access latency 10 ns and miss penalty 100 ns. An optimization is done on the cache to reduce the miss rate. However, the optimization results in an increase of cache access latency to 15 ns, whereas the miss penalty is not affected. The minimum hit rate (rounded off to two decimal places) needed after the optimization such that it should not increase the average memory access time is _______.

Answer: (0.85 to 0.85)

34. The value of the following limit is _______.

Answer: (-0.5 to -0.5)

35. Consider the resolution of the domain name www.gate.org. in by a DNS resolver. Assume that no resource records are cached anywhere across the DNS servers and that iterative query mechanism is used in the resolution. The number of DNS query-response pairs involved in completely resolving the domain name is__________.

Answer: (4 to 4)

Q.36 – Q.45 Multiple Choice Questions (MCQ), carry TWO marks each.

36. Which one of the following is the closed form for the generating function of the sequence {an}n0 defined below?

Answer: (A)

37. Consider a simple undirected unweighted graph with at least three vertices. If A is the adjacency matrix of the graph, then the number of 3-cycles in the graph is given by the trace of

(A) A3

(B) A3 divided by 2

(C) A3 divided by 3

(D) A3 divided by 6

Answer: (D)

38. Which one of the following statements is FALSE?

(A) The TLB performs an associative search in parallel on all its valid entries using page number of incoming virtual address.

(B) If the virtual address of a word given by CPU has a TLB hit, but the subsequent search for the word results in a cache miss, then the word will always be present in the main memory.

(C) The memory access time using a given inverted page table is always same for all incoming virtual addresses.

(D) In a system that uses hashed page tables, if two distinct virtual addresses V1 and V2 map to the same value while hashing, then the memory access time of these addresses will not be the same.

Answer: (C)

39. Let Ri(z) and Wi(z) denote read and write operations on a data element z by a transaction Ti, respectively. Consider the schedule S with four transactions.

S:R4(x)R2(x)R3(x)R1(y)W1(y)W2(x)W3(y)R4(y)

Which one of the following serial schedules is conflict equivalent to S?

(A)  T1 → T3 → T4 T2      

(B)  T1 → T4 → T3 T2

(C)  T4 → T1 → T3 T2

(D)  T3 → T1 → T4 T2

Answer: (A)

40. Consider a digital display system (DDS) shown in the figure that displays the contents of register X. A 16-bit code word is used to load a word in X, either from S or from R. S is a 1024-word memory segment and R is a 32-word register file. Based on the value of mode bit M, T selects an input word to load in X. P and Q interface with the corresponding bits in the code word to choose the addressed word. Which one of the following represents the functionality of P, Q, and T?

(A) P is 10:1 multiplexer; Q is 5:1 multiplexer; T is 2:1 multiplexer

(B) P is 10:210 decoder; Q is 5:25 decoder; T is 2:1 encoder

(C) P is 10:210 decoder; Q is 5:25 decoder; T is 2:1 multiplexer

(D) P is 1:10 de-multiplexer; Q is 1:5 de-multiplexer; T is 2:1 multiplexer

Answer: (C)

41. Consider three floating point numbers A , B and C stored in registers RA, RB and RC, respectively as per IEEE-754 single precision floating point format. The 32-bit content stored in these registers (in hexadecimal form) are as follows.

Which one of the following is FALSE?

(A)  A + C = 0

(B)  C = A + B

(C)  B = 3C

(D)  (B – C) > 0

Answer: (B)

42. Consider four processes P, Q, R, and S scheduled on a CPU as per round robin algorithm with a time quantum of 4 units. The processes arrive in the order P, Q, R, S, all at time t = 0. There is exactly one context switch from S to Q, exactly one context switch from R to Q, and exactly two context switches from Q to R. There is no context switch from S to P. Switching to a ready process after the termination of another process is also considered a context switch. Which one of the following is NOT possible as CPU burst time (in time units) of these processes?

(A) P = 4, Q = 10, R = 6, S = 2

(B) P = 2, Q = 9, R = 5, S = 1

(C) P = 4, Q = 12, R = 5, S = 4

(D) P = 3, Q = 7, R = 7, S = 3

Answer: (D)

43. What is printed by the following ANSI C program?

Answer: (A)

44. What is printed by the following ANSI C program?

ASCII encoding for relevant characters is given below

Answer: (A)

45. Consider solving the following system of simultaneous equations using LU decomposition.

x1 + x2 – 2x3 = 4

x1 + 3x2 – x3 = 7

2x1 + x2 – 5x3 = 7

where L and U are denoted as

Which one of the following is the correct combination of values for L32, U33, and x1 ?

Answer: (D)

Q.46 – Q.555 Multiple Select Questions (MSQ), carry TWO marks each.

46. Which of the following is/are undecidable?

(A)  Given two Turing machines M1 and M2, decide if  L(M1) = L(M2).

(B)  Given a Turing machine M, decide if L(M) is regular.

(C)  Given a Turing machine M, decide if M accepts all strings.

(D)  Given a Turing machine M, decide if M takes more than 1073 steps on every

Answer: (A, B, C)

47. Consider the following languages:

L1 = {anwan | w ∈ {a, b}*}

L2 = {wxwR | w, x ∈ {a, b}*, |w|, |x| > 0}

Note that wR is the reversal of the string w. Which of the following is/are TRUE?

(A)  L1 and L2 are regular.

(B)  L1 and L2 are context-free.

(C)  L1 is regular and L2 is context-free

(D)  L1 and L2 are context-free but not regular.

Answer: (A, B, C)

48. Consider the following languages:

L1 ={ww| w ∈{a,b}*}

L2 ={anbncm |m,n ≥ 0}

L3 ={ambncn |m,n ≥ 0}

Which of the following statements is/are FALSE?

(A) L1 is not context-free but L2 and L3 are deterministic context-free.

(B) Neither L1 nor L2 is context-free.

(C) L2, L3 and L2 ⋂ L3 all are context-free.

(D) Neither L1 nor its complement is context-free.

Answer: (B, C, D)

49. Consider a simple undirected weighted graph G, all of whose edge weights are distinct. Which of the following statements about the minimum spanning trees of G is/are TRUE?

(A) The edge with the second smallest weight is always part of any minimum spanning tree of G .

(B) One or both of the edges with the third smallest and the fourth smallest weights are part of any minimum spanning tree of G .

(C) Suppose S ⊆ V be such that S ≠ϕ and S ≠ V. Consider the edge with the minimum weight such that one of its vertices is in S and the other in V \ S . Such an edge will always be part of any minimum spanning tree of G.

(D) G can have multiple minimum spanning trees.

Answer: (A, B, C)

50. The following simple undirected graph is referred to as the Peterson graph.

Which of the following statements is/are TRUE?

(A) The chromatic number of the graph is 3.

(B) The graph has a Hamiltonian path.

(C) The following graph is isomorphic to the Peterson graph

(D) The size of the largest independent set of the given graph is 3. (A subset of vertices of a graph form an independent set if no two vertices of the subset are adjacent.)

Answer: (A, B, C)

51. Consider the following recurrence:

Then, which of the following statements is/are TRUE?

(A)  f(2n – 1) = 2n – 1

(B)  f(2n) = 1

(C)  f(5∙2n) = 2n+1 + 1

(D)  f(2n + 1) = 2n + 1

Answer: (A, B, C)

52. Which of the properties hold for the adjacency matrix A of a simple undirected unweighted graph having n vertices?

(A) The diagonal entries of A2 are the degrees of the vertices of the graph.

(B) If the graph is connected, then none of the entries of An1 + In can be zero.

(C) If the sum of all the elements of A is at most 2(n – 1), then the graph must be acyclic.

(D) If there is at least a 1 in each of A ’s rows and columns, then the graph must be

connected.

Answer: (A)

53. Which of the following is/are the eigenvector(s) for the matrix given below?

Answer: (A, C, D)

54. Consider a system with 2 KB direct mapped data cache with a block size of 64 bytes. The system has a physical address space of 64 KB and a word length of 16 bits. During the execution of a program, four data words P, Q, R, and S are accessed in that order 10 times (i.e., PQRSPQRS…). Hence, there are 40 accesses to data cache altogether. Assume that the data cache is initially empty and no other data words are accessed by the program. The addresses of the first bytes of P, Q, R, and S are 0xA248, 0xC28A, 0xCA8A, and 0xA262, respectively. For the execution of the above program, which of the following statements is/are TRUE with respect to the data cache?

(A) Every access to S is a hit.

(B) Once P is brought to the cache it is never evicted.

(C) At the end of the execution only R and S reside in the cache.

(D) Every access to R evicts Q from the cache.

Answer: (A, B, D)

55. Consider routing table of an organization’s router shown below:

Which of the following prefixes in CIDR notation can be collectively used to correctly aggregate all of the subnets in the routing table?

(A) 12.20.164.0/20

(B) 12.20.164.0/22

(C) 12.20.164.0/21

(D) 12.20.168.0/22

Answer: (B, D)

Q.56 – Q.65 Numerical Answer Type (NAT), carry TWO marks each.

56. Consider the relational database with the following four schemas and their respective instances.

The number of rows returned by the above SQL query is _______.

Answer: (2 to 2)

57. Consider a network with three routers P, Q, R shown in the figure below. All the links have cost of unity.

The routers exchange distance vector routing information and have converged on the routing tables, after which the link Q−R fails. Assume that P and Q send out routing updates at random times, each at the same average rate. The probability of a routing loop formation (rounded off to one decimal place) between P and Q, leading to count-to-infinity problem, is ______.

Answer: (0.5 to 0.5)

58. Let G(V , E) be a directed graph, where V = {1, 2, 3, 4, 5} is the set of vertices and E is the set of directed edges, as defined by the following adjacency matrix A.

A[i][j] = 1 indicates a directed edge from node i to node j. A directed spanning tree of G, rooted at r ∈ V , is defined as a subgraph T of G such that the undirected version of T is a tree, and T contains a directed path from r to every other vertex in V. The number of such directed spanning trees rooted at vertex 5 is ______.

Answer: (24 to 24)

59. Consider a 100 Mbps link between an earth station (sender) and a satellite (receiver) at an altitude of 2100 km. The signal propagates at a speed of 3 × 108 m/s. The time taken (in milliseconds, rounded off to two decimal places) for the receiver to completely receive a packet of 1000 bytes transmitted by the sender is_________.

Answer: (7.07 to 7.09)

60. Consider the data transfer using TCP over a 1 Gbps link. Assuming that the maximum segment lifetime (MSL) is set to 60 seconds, the minimum number of bits required for the sequence number field of the TCP header, to prevent the sequence number space from wrapping around during the MSL is ______.

Answer: (33 to 33)

61. A processor X1 operating at 2 GHz has a standard 5-stage RISC instruction pipeline having a base CPI (cycles per instruction) of one without any pipeline hazards. For a given program P that has 30% branch instructions, control hazards incur 2 cycles stall for every branch. A new version of the processor X2 operating at same clock frequency has an additional branch predictor unit (BPU) that completely eliminates stalls for correctly predicted branches. There is neither any savings nor any additional stalls for wrong predictions. There are no structural hazards and data hazards for X1 and X2. If the BPU has a prediction accuracy of 80%, the speed up (rounded off to two decimal places) obtained by X2 over X1 in executing P is_ ______.

Answer: (1.42 to 1.45)

62. Consider the queues Q1 containing four elements and Q2 containing none (shown as the Initial State in the figure). The only operations allowed on these two queues are Enqueue (Q, element) and Dequeue (Q), The minimum number of Enqueue operations on Q1 required to place the elements of Q1 in Q2 in reverse order (shown as the Final State in the figure) without using any additional storage is _______.

Answer: (0 to 0)

63. Consider two files systems A and B , that use contiguous allocation and linked allocation, respectively. A file of size 100 blocks is already stored in A and also in B. Now, consider inserting a new block in the middle of the file (between 50th and 51st block), whose data is already available in the memory. Assume that there are enough free blocks at the end of the file and that the file control blocks are already in memory. Let the number of disk accesses required to insert a block in the middle of the file in A and B are nA and nB respectively, then the value of nA + nB is _____.

Answer: (153 to 153)

64. Consider a demand paging system with four page frames (initially empty) and LRU page replacement policy. For the following page reference string

7, 2, 7, 3, 2, 5, 3, 4, 6, 7, 7,1, 5, 6,1

the page fault rate, defined as the ratio of number of page faults to the number of memory accesses (rounded off to one decimal place) is_ ______.

Answer: (0.6 to 0.6)

65. Consider the following grammar along with translation rules.

Here # and % are operators and id is a token that represents an integer and id•val represents the corresponding integer value. The set of non-terminals is {S,T, R, P} and a subscripted non-terminal indicates an instance of the non-terminal.

Using this translation scheme, the computed value of S•val for root of the parse tree for the expression 20 #10%5 #8%2%2 is _______.

Answer: (80 to 80)

Latest Govt Job & Exam Updates:

View Full List ...