| Q# | Question | Answer | Marks |
|---|---|---|---|
| Q5 | Consider the following statements about reinforcement learning. A. The adaptive dynamic programming | 3 | +2.0 |
| Q17 | Which of the following is correct order of increasing time complexity of algorithms A. Tower of Han | 1 | +2.0 |
| Q28 | Which of the following are limitations of Greedy algorithms? A. They always fail for NP hard proble | 4 | +2.0 |
| Q31 | Match the LIST-I with LIST-II LIST-I LIST-II A. Dynamic | 3 | +2.0 |
| Q36 | Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R | 3 | +2.0 |
| Q41 | Match the LIST-I with LIST-II LIST-I LIST-II A. Dijkstra&# | 2 | +2.0 |
| Q57 | Arrange the following algorithms from the most efficient to least efficient based on their time comp | 3 | +2.0 |
| Q67 | Which of the following statements about DFS are correct? A. It can detect cycles in a graph B. It | 1 | +2.0 |
| Q80 | Match the LIST-I with LIST-II LIST-I (Name of Methods) LIST-II (Pro | 2 | +2.0 |
| Q82 | Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R | 1 | +2.0 |
| Q90 | Which of the following is correct solution of the given recurrence relation? T(n) = 3T(n / 4) + n | 1 | +2.0 |
| Q# | Question | Answer | Marks |
|---|---|---|---|
| Q3 | In artificial intelligence, the term "Turing Test" is primarily associated with: | 3 | +2.0 |
| Q14 | Match the LIST-I with LIST-II LIST-I LIST-II A. Expert | 1 | +2.0 |
| Q15 | Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R | 1 | +2.0 |
| Q18 | Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R | 3 | +2.0 |
| Q19 | Arrange the following steps of Natural Language Processing pipeline in correct order A. Syntax Anal | 2 | +2.0 |
| Q37 | Arrange the following sequence related to FASTUS system: A. Basic-group handling B. Structure merg | 3 | +2.0 |
| Q47 | In a multi-agent system(MAS), what are the key characteristics of individual agents? A. They must b | 3 | +2.0 |
| Q68 | Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R | 3 | +2.0 |
| Q87 | Which planning approach is used for environment with no observations? | 3 | +2.0 |
| Q# | Question | Answer | Marks |
|---|---|---|---|
| Q52 | Which of the following statements are true. A. Painters' algorithm is also called depth so | 1 | +2.0 |
| Q73 | Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R | 3 | +2.0 |
| Q84 | A normalized matrix that maps a 3D window specified by coordinates (1, 1, 1) and (4, 5, 6) on | 1 | +2.0 |
| Q# | Question | Answer | Marks |
|---|---|---|---|
| Q2 | Arrange the following interframe time interval in increasing order. A. PIFS(PCF interframe Spacing) | 4 | +2.0 |
| Q9 | Match the LIST-I with LIST-II LIST-I LIST-II A. Address | 4 | +2.0 |
| Q10 | Which of the following statement are true for link state routing A. Link state Routing is suffer fr | 2 | +2.0 |
| Q20 | Match the LIST-I with LIST-II LIST-I LIST-II A. 190.10.75. | 3 | +2.0 |
| Q21 | Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R | 3 | +2.0 |
| Q23 | Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R | 1 | +2.0 |
| Q27 | Which statements are true for digital to digital Encoding schemes. A. Unipolar encoding uses one le | 1 | +2.0 |
| Q38 | Assume a signal travels through a transmission medium and its power is reduced to one-half of means | 2 | +2.0 |
| Q50 | Dialog control is a function of the which layer | 3 | +2.0 |
| Q53 | Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R | 1 | +2.0 |
| Q55 | Match the LIST-I with LIST-II LIST-I LIST-II | 4 | +2.0 |
| Q76 | Arrange the following steps for Pulse Code Modulation (PCM). A. Sampling B. Low-Pass filter | 3 | +2.0 |
| Q# | Question | Answer | Marks |
|---|---|---|---|
| Q12 | Arrange the following events in correct order when an interrupt occurs during instruction execution. | 3 | +2.0 |
| Q34 | Which of the following are characteristics of RISC architecture: A. Large instruction set with many | 2 | +2.0 |
| Q81 | Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R | 3 | +2.0 |
| Q96 | 📄 How many CPU cycles are spent with DMA? | 1 | +2.0 |
| Q97 | 📄 How many CPU cycles are spent using programmed I/O? | 3 | +2.0 |
| Q98 | 📄 How much CPU time is consumed by DMA overhead? | 1 | +2.0 |
| Q99 | 📄 Which is more CPU-efficient for large block transfer? | 2 | +2.0 |
| Q100 | 📄 How much CPU time is consumed by programmed I/O ? | 1 | +2.0 |
| Q# | Question | Answer | Marks |
|---|---|---|---|
| Q22 | Which of the following statements are correct? A. The HAVING CLAUSE is an optional clause which tel | 2 | +2.0 |
| Q35 | In relation to Index structures for files which of the following are true? A. An index is an integr | 3 | +2.0 |
| Q45 | Arrange the following steps of the Map reduce framework A. Input Splitting B. Reducing C. Mapping | 3 | +2.0 |
| Q51 | If a transaction t a holds a lock on some data item d in shared and intention-exclusive (SIX) mode, | 4 | +2.0 |
| Q62 | Specialization process does not allow | 3 | +2.0 |
| Q72 | Consider B + tree in which the maximum number of keys in a node is 5. What is the minimum number of | 2 | +2.0 |
| Q75 | In transactions, a write-item (X) command includes the following steps. Arrange the following steps | 1 | +2.0 |
| Q85 | Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R | 1 | +2.0 |
| Q# | Question | Answer | Marks |
|---|---|---|---|
| Q11 | Match the LIST-I with LIST-II: BOOLEAN IDENTITIES LIST-I (Name) LIST-II (Ide | 2 | +2.0 |
| Q# | Question | Answer | Marks |
|---|---|---|---|
| Q1 | Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R | 4 | +2.0 |
| Q4 | Which of the following statements are true if universe of discourse for all variables consist of all | 3 | +2.0 |
| Q13 | Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R | 2 | +2.0 |
| Q24 | Match the LIST-I with LIST-II LIST-I LIST-II A. Definit | 4 | +2.0 |
| Q43 | Which of the followings logical implications are tautology? A. [~p ∧ (p ∨ q)] → q B. ~ | 3 | +2.0 |
| Q46 | If the set S= \(\left\{ \begin{bmatrix} a & 0 \\ 0 & b \end{bmatrix} : a, b \in \mathbb{Z} | 4 | +2.0 |
| Q56 | Match the LIST-I with LIST-II LIST-I (Quadric surfaces) | 3 | +2.0 |
| Q65 | Which logic is designed to address the problem of referential opacity in propositional attitudes? | 2 | +2.0 |
| Q86 | Which of the following is FALSE? | 2 | +2.0 |
| Q89 | If K n is complete simple graph of n vertices and K m,n is complete bipartite graph then arrange t | 3 | +2.0 |
| Q# | Question | Answer | Marks |
|---|---|---|---|
| Q7 | Which of the following is correct about Real time operating system. A. It permits creation of multi | 3 | +2.0 |
| Q32 | Consider the following set of processes assumed to have arrived at time 0 in order P 1 , P 2 , P 3 | 2 | +2.0 |
| Q39 | Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R | 3 | +2.0 |
| Q54 | What is a superblock object represents in virtual file system of Linux OS | 2 | +2.0 |
| Q71 | Match the LIST-I with LIST-II LIST-I LIST-II A. | 3 | +2.0 |
| Q74 | -Match the LIST-I with LIST-II LIST-I LIST-II A | 2 | +2.0 |
| Q79 | Consider a disk queue with requests for I/O to blocks on cylinders 98, 183, 37, 122, 14, 124, 65, 67 | 3 | +2.0 |
| Q# | Question | Answer | Marks |
|---|---|---|---|
| Q6 | Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R | 4 | +2.0 |
| Q16 | Arrange the following applet life cycles methods in sequence A. start() B. paint() C. init() D. | 2 | +2.0 |
| Q30 | Match the LIST-I with LIST-II LIST-I LIST-II A. Class d | 3 | +2.0 |
| Q44 | How many number of comparison are required in worst case to find out second smallest element of n el | 4 | +2.0 |
| Q48 | The inorder and preorder traversal of binary tree are d, b, e, a, f, c, g and a, b, d, e, c, f, g re | 1 | +2.0 |
| Q49 | For implicit type conversion, arrange the following from a lower size type to a high type size. A. | 4 | +2.0 |
| Q59 | Match the LIST-I with LIST-II LIST-I (file mode parameters)   | 4 | +2.0 |
| Q64 | Which of the following statements are True? A. The ++ operator can be overloaded to perform decrem | 3 | +2.0 |
| Q66 | Arrange the following prefix expressions in ascending order on the basis of their values. Α.- | 2 | +2.0 |
| Q77 | Arrange the following WebApp design layers from top to bottom: A. Navigation design B. Aesthetic D | 1 | +2.0 |
| Q83 | Which of the following is not true about constructor | 3 | +2.0 |
| Q# | Question | Answer | Marks |
|---|---|---|---|
| Q8 | Which of the following statements are correct regarding task elaboration in interface design. A. Al | 1 | +2.0 |
| Q29 | Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R | 1 | +2.0 |
| Q33 | Match the LIST-I with LIST-II LIST-I LIST-II A. Content | 4 | +2.0 |
| Q40 | Match the LIST-I with LIST-II LIST-I LIST-II A. V-Model | 4 | +2.0 |
| Q91 | 📄 What is the implied average staffing level? | 2 | +2.0 |
| Q92 | 📄 If the staff is capped at 15 engineers what is the revised calendar duration? | 3 | +2.0 |
| Q93 | 📄 What is the initial effort in Person-month (PM) before adding the contingency margin? | 3 | +2.0 |
| Q94 | 📄 Including 10% contingency margin what is the project cost? | 2 | +2.0 |
| Q95 | 📄 What is the estimated development time in months? | 3 | +2.0 |
| Q# | Question | Answer | Marks |
|---|---|---|---|
| Q26 | Match the LIST-I with LIST-II LIST-I (Grammar) LIST-II (All productions are of | 3 | +2.0 |
| Q42 | Let P and Q be two regular expressions over Σ. If P does not contain ε, then the follo | 2 | +2.0 |
| Q58 | Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R | 1 | +2.0 |
| Q60 | Arrange the following in the order of execution while proving a Language is non-Regular using Pumpin | 3 | +2.0 |
| Q69 | If r₁ and r₂ are regular expressions, then which of the following are correct. A. L(r 1 +12) = L(r | 4 | +2.0 |
| Q70 | Which of the following languages cannot be accepted by push down automata? \(A.\; L = \{ a^n b^ | 3 | +2.0 |
| Q78 | Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R | 1 | +2.0 |
| Q88 | What is the space complexity of the CYK algorithm for the P table, where n is the number of words in | 3 | +2.0 |