more.json

[  {
    "questionText": "Consider the following program:\nint main()\n{\nf1();\nf2(2);\nf3();\nreturn(0);\n}\nint f1()\n{\nreturn(1);\n}\nint f2(int X)\n{\nf3();\nif (X==1)\nreturn f1();\nelse\nreturn (X*f2(X-1));\n}\nint f3()\n{\nreturn(5);\n}\nWhich one of the following options represents the activation tree corresponding to the main function?\n(A)\nmain\nf1 f2 f3\nf3  f2\nf3  f1\n(B)\nmain\nf2 f3\nf1\nf1\nf3\n(C)\nmain\nf2\nf1\nf3  f1\n(D)\nmain\nf1 f2 f3\nf3  f2  f1",
    "picture": null,
    "options": [
      "A) main f1 f2 f3 f3  f2 f3  f1",
      "B) main f2 f3 f1 f1 f3",
      "C) main f2 f1 f3  f1",
      "D) main f1 f2 f3 f3  f2  f1"
    ],
    "answer": [
      "A"
    ],
    "score": 2,
    "questionType": "MCQ",
    "exam": {
      "category": "Gate",
      "branch": "Computer Science and Information Technology",
      "code": "CS",
      "year": 2023
    },
    "chapter": "Programming and Data Structures",
    "topic": "Recursion",
    "difficultyLvl": "Medium"
  },
  {
    "questionText": "The format of a single-precision floating-point number as per the IEEE 754 standard is:\nSign (1bit)\nExponent (8 bits)\nMantissa (23 bits)\nChoose the largest floating-point number among the following options.",
    "picture": null,
    "options": [
      "A) Sign Exponent Mantissa\n0 0111 1111 1111 1111 1111 1111 1111 111",
      "B) Sign Exponent Mantissa\n0 1111 1110 1111 1111 1111 1111 1111 111",
      "C) Sign Exponent Mantissa\n0 1111 1111 1111 1111 1111 1111 1111 111",
      "D) Sign Exponent Mantissa\n0 0111 1111 0000 0000 0000 0000 0000 000"
    ],
    "answer": [
      "B"
    ],
    "score": 1,
    "questionType": "MCQ",
    "exam": {
      "category": "Gate",
      "branch": "Computer Science and Information Technology",
      "code": "CS",
      "year": 2024
    },
    "chapter": "Digital Logic",
    "topic": "Number representations and computer arithmetic (fixed and floating point)",
    "difficultyLvl": "Medium"
  },
  {
    "questionText": "In the 4 × 4 array shown below, each cell of the first three rows has either a cross (X) or a number. The number in a cell represents the count of the immediate neighboring cells (left, right, top, bottom, diagonals) NOT having a cross (X). Given that the last row has no crosses (X), the sum of the four numbers to be filled in the last row is",
    "picture": null,
    "options": [
      "A) 11",
      "B) 10",
      "C) 12",
      "D) 9"
    ],
    "answer": [
      "A"
    ],
    "score": 2,
    "questionType": "MCQ",
    "exam": {
      "category": "Gate",
      "branch": "Computer Science and Information Technology",
      "code": "CS",
      "year": 2024
    },
    "chapter": "General Aptitude",
    "topic": "Logical Reasoning",
    "difficultyLvl": "Hard"
  },
  {
    "questionText": "The pie charts depict the shares of various power generation technologies in the total electricity generation of a country for the years 2007 and 2023. The renewable sources of electricity generation consist of Hydro, Solar and Wind. Assuming that the total electricity generated remains the same from 2007 to 2023, what is the percentage increase in the share of the renewable sources of electricity generation over this period?",
    "picture": null,
    "options": [
      "A) 25%",
      "B) 50%",
      "C) 77.5%",
      "D) 62.5%"
    ],
    "answer": [
      "D"
    ],
    "score": 2,
    "questionType": "MCQ",
    "exam": {
      "category": "Gate",
      "branch": "Computer Science and Information Technology",
      "code": "CS",
      "year": 2024
    },
    "chapter": "General Aptitude",
    "topic": "Data Interpretation",
    "difficultyLvl": "Medium"
  },
  {
    "questionText": "Consider the following context-free grammar where the start symbol is 𝑆 and the set of terminals is {𝑎,𝑏,𝑐,𝑑}. 𝑆 → 𝐴𝑎𝐴𝑏 | 𝐵𝑏𝐵𝑎 𝐴 → 𝑐𝑆 | 𝜖 𝐵 → 𝑑𝑆 | 𝜖 The following is a partially-filled LL(1) parsing table. 𝑎 𝑏 𝑐 𝑑 $ 𝑆 𝑆 → 𝐴𝑎𝐴𝑏 𝑆 → 𝐵𝑏𝐵𝑎 (1) (2) 𝐴 𝐴 → 𝜖 (3) 𝐴 → 𝑐𝑆 𝐵 (4) 𝐵 → 𝜖 𝐵 → 𝑑𝑆 Which one of the following options represents the CORRECT combination for the numbered cells in the parsing table? Note: In the options, “blank” denotes that the corresponding cell is empty.",
    "picture": null,
    "options": [
      "A) (1) 𝑆 → 𝐴𝑎𝐴𝑏 (2) 𝑆 → 𝐵𝑏𝐵𝑎 (3) 𝐴 → 𝜖 (4) 𝐵 → 𝜖",
      "B) (1) 𝑆 → 𝐵𝑏𝐵𝑎 (2) 𝑆 → 𝐴𝑎𝐴𝑏 (3) 𝐴 → 𝜖 (4) 𝐵 → 𝜖",
      "C) (1) 𝑆 → 𝐴𝑎𝐴𝑏 (2) 𝑆 → 𝐵𝑏𝐵𝑎 (3) blank (4) blank",
      "D) (1) 𝑆 → 𝐵𝑏𝐵𝑎 (2) 𝑆 → 𝐴𝑎𝐴𝑏 (3) blank (4) blank"
    ],
    "answer": [
      "A"
    ],
    "score": 2,
    "questionType": "MCQ",
    "exam": {
      "category": "Gate",
      "branch": "Computer Science and Information Technology",
      "code": "CS",
      "year": 2024
    },
    "chapter": "Theory of Computation",
    "topic": "Context-Free Grammars and Parsing",
    "difficultyLvl": "Hard"
  },
    {
    "questionText": "Consider a multi-threaded program with two threads T1 and T2. The threads share two semaphores: s1 (initialized to 1) and s2 (initialized to 0). The threads also share a global variable x (initialized to 0). The threads execute the code shown below.\n// code of T1\nwait(s1);\nx = x+1;\nprint(x);\nwait(s2);\nsignal(s1);\n// code of T2\nwait(s1);\nx = x+1;\nprint(x);\nsignal(s2);\nsignal(s1);\nWhich of the following outcomes is/are possible when threads T1 and T2 execute concurrently?",
    "picture": null,
    "options": [
      "A) T1 runs first and prints 1, T2 runs next and prints 2",
      "B) T2 runs first and prints 1, T1 runs next and prints 2",
      "C) T1 runs first and prints 1, T2 does not print anything (deadlock)",
      "D) T2 runs first and prints 1, T1 does not print anything (deadlock)"
    ],
    "answer": [
      "B",
      "C"
    ],
    "score": 2,
    "questionType": "MSQ",
    "exam": {
      "category": "Gate",
      "branch": "Computer Science and Information Technology",
      "code": "CS",
      "year": 2024
    },
    "chapter": "Operating System",
    "topic": "Concurrency and synchronization",
    "difficultyLvl": "Hard"
  },
  {
    "questionText": "Let S1 and S2 be two stacks. S1 has capacity of 4 elements. S2 has capacity of 2 elements. S1 already has 4 elements: 100, 200, 300, and 400, whereas S2 is empty, as shown below. Only the following three operations are available:\nPushToS2: Pop the top element from S1 and push it on S2.\nPushToS1: Pop the top element from S2 and push it on S1.\nGenerateOutput: Pop the top element from S1 and output it to the user.\nNote that the pop operation is not allowed on an empty stack and the push operation is not allowed on a full stack.\nWhich of the following output sequences can be generated by using the above operations?",
    "picture": null,
    "options": [
      "A) 100, 200, 400, 300",
      "B) 200, 300, 400, 100",
      "C) 400, 200, 100, 300",
      "D) 300, 200, 400, 100"
    ],
    "answer": [
      "B",
      "C",
      "D"
    ],
    "score": 2,
    "questionType": "MSQ",
    "exam": {
      "category": "Gate",
      "branch": "Computer Science and Information Technology",
      "code": "CS",
      "year": 2024
    },
    "chapter": "Programming and Data Structures",
    "topic": "Stacks and queues",
    "difficultyLvl": "Medium"
  },
  {
    "questionText": "The number of distinct minimum-weight spanning trees of the following graph is _________",
    "picture": null,
    "options": [],
    "answer": [
      "9"
    ],
    "score": 2,
    "questionType": "NAT",
    "exam": {
      "category": "Gate",
      "branch": "Computer Science and Information Technology",
      "code": "CS",
      "year": 2024
    },
    "chapter": "Algorithms",
    "topic": "Graph traversals, minimum spanning trees",
    "difficultyLvl": "Medium"
  },
  {
    "questionText": "The chromatic number of a graph is the minimum number of colours used in a proper colouring of the graph. The chromatic number of the following graph is _________",
    "picture": null,
    "options": [],
    "answer": [
      "2"
    ],
    "score": 2,
    "questionType": "NAT",
    "exam": {
      "category": "Gate",
      "branch": "Computer Science and Information Technology",
      "code": "CS",
      "year": 2024
    },
    "chapter": "Engineering Mathematics",
    "topic": "Graphs: connectivity, matching, colouring",
    "difficultyLvl": "Medium"
  },
  {
    "questionText": "Consider the following two sets:\nSet X Set Y\nP. Lexical Analyzer 1. Abstract Syntax Tree\nQ. Syntax Analyzer 2. Token\nR. Intermediate Code Generator 3. Parse Tree\nS. Code Optimizer 4. Constant Folding\nWhich one of the following options is the CORRECT match from Set X to Set Y?",
    "options": [
      "A) P – 4; Q – 1; R – 3; S – 2",
      "B) P – 2; Q – 3; R – 1; S – 4",
      "C) P – 2; Q – 1; R – 3; S – 4",
      "D) P – 4; Q – 3; R – 2; S – 1"
    ],
    "answer": [
      "B"
    ],
    "score": 1,
    "questionType": "MCQ",
    "exam": {
      "category": "Gate",
      "branch": "Computer Science and Information Technology",
      "code": "CS",
      "year": 2024
    },
    "chapter": "Compiler Design",
    "topic": "Lexical analysis, parsing, syntax-directed translation",
    "difficultyLvl": "Medium"
  },
  {
    "questionText": "Which one of the following regular expressions is equivalent to the language accepted by the DFA given below?",
    "options": [
      "A) 0∗1(0 + 10∗1)∗",
      "B) 0∗(10∗11)∗0∗",
      "C) 0∗1(010∗1)∗0∗",
      "D) 0(1 + 0∗10∗1)∗0∗"
    ],
    "answer": [
      "A"
    ],
    "score": 1,
    "questionType": "MCQ",
    "exam": {
      "category": "Gate",
      "branch": "Computer Science and Information Technology",
      "code": "CS",
      "year": 2024
    },
    "chapter": "Theory of Computation",
    "topic": "Regular expressions and finite automata",
    "difficultyLvl": "Hard"
  },
  {
    "questionText": "Let 𝑀 be the 5-state NFA with 𝜖-transitions shown in the diagram below. Which one of the following regular expressions represents the language accepted by 𝑀?",
    "options": [
      "A) (00)∗ + 1(11)∗",
      "B) 0∗ + (1 + 0(00)∗)(11)∗",
      "C) (00)∗ + (1 + (00)∗)(11)∗",
      "D) 0+ + 1(11)∗ + 0(11)∗"
    ],
    "answer": [
      "B"
    ],
    "score": 2,
    "questionType": "MCQ",
    "exam": {
      "category": "Gate",
      "branch": "Computer Science and Information Technology",
      "code": "CS",
      "year": 2024
    },
    "chapter": "Theory of Computation",
    "topic": "Regular expressions and finite automata",
    "difficultyLvl": "Hard"
  },
  {
    "questionText": "Consider the following expression: 𝑥[𝑖] = (𝑝 + 𝑟) ∗ −𝑠[𝑖] + 𝑢/𝑤. The following sequence shows the list of triples representing the given expression, with entries missing for triples (1), (3), and (6). Which one of the following options fills in the missing entries CORRECTLY?\n(0) + 𝑝 𝑟\n(1)\n(2) uminus (1)\n(3)\n(4) / 𝑢 𝑤\n(5) + (3) (4)\n(6)\n(7) = (6) (5)",
    "options": [
      "A) (1) =[] 𝑠 𝑖 (3) * (0) (2) (6) []= 𝑥 𝑖",
      "B) (1) []= 𝑠 𝑖 (3) – (0) (2) (6) =[] 𝑥 (5)",
      "C) (1) =[] 𝑠 𝑖 (3) * (0) (2) (6) []= 𝑥 (5)",
      "D) (1) []= 𝑠 𝑖 (3) – (0) (2) (6) =[] 𝑥 𝑖"
    ],
    "answer": [
      "A"
    ],
    "score": 2,
    "questionType": "MCQ",
    "exam": {
      "category": "Gate",
      "branch": "Computer Science and Information Technology",
      "code": "CS",
      "year": 2024
    },
    "chapter": "Compiler Design",
    "topic": "Intermediate code generation",
    "difficultyLvl": "Hard"
  },
  {
    "questionText": "Consider 4-variable functions f1, f2, f3, f4 expressed in sum-of-minterms form as given below.\nf1 = ∑(0,2,3,5,7,8,11,13)\nf2 = ∑(1,3,5,7,11,13, 15)\nf3 = ∑(0,1,4,11)\nf4 = ∑(0,2,6,13)\nWith respect to the circuit given above, which of the following options is/are CORRECT?",
    "options": [
      "A) 𝒀 = ∑(0,1,2,11,13)",
      "B) 𝒀 = Π(3,4, 5,6,7,8,9,10,12,14,15)",
      "C) 𝒀 = ∑(0,1,2,3,4,5,6,7)",
      "D) 𝒀 = Π(8,9,10,11,12,13,14,15)"
    ],
    "answer": [
      "C",
      "D"
    ],
    "score": 2,
    "questionType": "MSQ",
    "exam": {
      "category": "Gate",
      "branch": "Computer Science and Information Technology",
      "code": "CS",
      "year": 2024
    },
    "chapter": "Digital Logic",
    "topic": "Boolean algebra",
    "difficultyLvl": "Medium"
  }
]