GATE 2018 CS – Possible Answer Key

 

APTITUDE

  1. Area of Square : D
  2. A ________________ Investigation can sometime : A (Meandering)
  3. Find out missing One : B (1440)
  4. What is smallest natural Number : C (7987)
  5. ______ Bringing __________ Books from ________ : B (they’r,their,there)
  6. Amount of Money need to Paid : B (2Lac)
  7.  A six sided unbiased Dice : C (5 Green 2 Red)
  8. Angle Based : A
  9. Male to Female Ration : B (1:1)
  10. Value of xyz : C (1)

1-25 : 1 Marks Question

26 – 55 : 2 Marks Question


Check GATE 2018 Rank Predictor


TECHNICAL

  1. NFA DFA : D
  2. RISC : D (1,2,3)
  3. Height of Binary tree : 4
  4. ER : A
  5. Undecidability : D (i,ii,iii are UD)
  6. Slow Start Phase: C
  7. Size of Largest possible subgroup : 42
  8. Time Complexicity of Enque – Dequeue : B
  9. Set of Recursive enumerable language : B (Intersection)
  10. Highest Eigen Value : 3
  11. Parsing : B
  12. Generating Function : D
  13. Wrap Around Time : 34/35 sec
  14. DRAM Refreshing : 59
  15. SQL : D (Full outer join)
  16. Integration : 0.28 (Approx)
  17. Match the Column UPD, IPV6 : C
  18. Chromatic Number : 3
  19. Effective memory access time :
  20. Output : 0c
  21. Counter value: 4
  22. D Flip Flop based Question : 2
  23. XOR XNOR Based Que : D
  24. Interrupt :  A
  25. Dice Probability : 0.023
  26. Producer consumer problem : C
  27. No. of minimum spanning tree : 4
  28. Which of the Above are CFL : B
  29. No. of times Print : 10230
  30. Physical address space of computer System is 2p : B (tag Bit)
  31. Number of min Heap : 80
  32. SQL 3NF but not BCNF : B
  33. SQL Natural Join: C
  34. Pipelining : 219
  35. Matrix P has eigen vector : D
  36. Number system based question : 3 and 4
  37. Fragment Offset : 144
  38. Deadlock : A (safe)
  39. Deadlock Resources : 2
  40. Order : 2
  41. Essential Prime Implicant : 3
  42. Associativity & Precedence: A
  43. Countable : D
  44. Output : Hi Bye Bye Hi
  45. Matrix Multiplication : C
  46. Preposition : A
  47. BFS/DFS : A (Option i is true)
  48. Cylinder Seek Time : 85
  49. Probability (bayes Theorem) : 0.6
  50. Token Sequence : D
  51. Graph Based 100! : 109*
  52. Greedy – Optimal : 16
  53. Maximum Value of N : 32
  54. Sum : 5
  55. Max Distance between 2 Node P and Q : 50

Check Also :

Question Paper and Response Released

Answer Key by GatePoint is Available

16 Comments

  1. Dice problem: 2 people throws dice at the same time.. If one of them get a higher number than the other, he wins. What is the probability that one of them wins in the third trail.?
    1/6 *1/6* 5/6=0.023

Leave a Reply

Your email address will not be published. Required fields are marked *