| Q# | Question | Answer | Marks |
|---|---|---|---|
| Q12 | Let G be a simple undirected graph, T D be a DFS tree on G, and T B be the BFS tree on | 3 | +2.0 |
| Q17 | Match List I with List II List I List II | 4 | +2.0 |
| Q22 | Let G be a directed graph whose vertex set is the set of numbers from 1 to 100. There is an edge fro | 4 | +2.0 |
| Q23 | Consider the undirected graph below: Using Prim's algorithm to construct a minimum span | 3 | +2.0 |
| Q28 | The running time of an algorithm is O(g(n)) if and only if (A) its worst-case running time is O( | 1 | +2.0 |
| Q82 | If algorithm A and another algorithm B take log 2 (n) and √n microseconds, respectively, | 2 | +2.0 |
| Q100 | In a binary max heap containing n numbers, the smallest element can be found in ______ time. &n | 1 | +2.0 |
| Q# | Question | Answer | Marks |
|---|---|---|---|
| Q20 | Which of the following statements are true? (A) Minimax search is breadth-first: it processes al | 3 | +2.0 |
| Q29 | Given below are two statements: If two variables V 1 and V 2 are used for clustering | 3 | +2.0 |
| Q32 | Match List I with List II List I List II | 1 | +2.0 |
| Q56 | Given below are two statements: Statement I: A genetic algorithm is a stochastic hill-climbing | 1 | +2.0 |
| Q72 | The process of removing details from a given state representation is called ______ | 4 | +2.0 |
| Q77 | Which of the following is NOT true in problem solving in artificial intelligence? | 4 | +2.0 |
| Q99 | Match List I with List II List I List II | 1 | +2.0 |
| Q# | Question | Answer | Marks |
|---|---|---|---|
| Q34 | Given below are two statements: Statement I: Bezier curves are curves that interpolate all of | 4 | +2.0 |
| Q52 | Concerning phong shading and Gouraud shading in a 3D scene, which of the following statements are t | 3 | +2.0 |
| Q59 | Match List - I with List - II. List I gives 3 × 3 matrices representing 2D transformations an | 4 | +2.0 |
| Q62 | In the context of 3D Computer graphics, which of the following statements is/are correct? (A) Un | 1 | +2.0 |
| Q74 | Given below are different properties of 3D projections from A-D. Identify the correct order on the | 3 | +2.0 |
| Q# | Question | Answer | Marks |
|---|---|---|---|
| Q5 | Given below are two statements: One is labeled as Assertion (A) and the other is labeled as Reason | 1 | +2.0 |
| Q25 | Match List I with List II List I List II | 2 | +2.0 |
| Q30 | Given below are two statements: Statement I: The laws of nature put two fundamental limits on | 1 | +2.0 |
| Q33 | Protocols in which the sender sends one frame and then waits for an acknowledgement before proceedin | 3 | +2.0 |
| Q39 | period of a signal is 100 ms. Then the frequency The of this signal in kilohertz is ______. | 3 | +2.0 |
| Q42 | Using ‘RSA’ public key cryptosystem. if p = 3, q = 11 and d = 7, find the value of e and | 3 | +2.0 |
| Q55 | Firewall is a device that filters access to the protected network from the outside network. Firewal | 4 | +2.0 |
| Q61 | Consider a code with only four valid code words: 0000000000, 0000011111, 1111100000, and 1111111111. | 1 | +2.0 |
| Q92 | Post office protocol (POP) is a message access protocol which is used to extract message for client | 4 | +2.0 |
| Q# | Question | Answer | Marks |
|---|---|---|---|
| Q7 | A non-pipeline system takes 50ns to process a task. The same task can be processed in six-segment p | 2 | +2.0 |
| Q9 | Which of the following cloud concept/s is/are related to pooling and sharing of resources? (A) V | 1 | +2.0 |
| Q15 | Which of the following statements with respect to K-segment pipelining are true ? (A) Maximum sp | 1 | +2.0 |
| Q24 | Which of the following statements with respect to multiprocessor system are true? (A) Multiproce | 3 | +2.0 |
| Q43 | Given below are two statements: Statement I: Hardwired control unit can be optimized to produc | 1 | +2.0 |
| Q45 | Match List I with List II List I List II | 3 | +2.0 |
| Q60 | The following program is stored in memory unit of the basic computer. What is the content of the ac | 4 | +2.0 |
| Q63 | Consider a machine with a byte addressable main memory of 2 16 bytes and block size of 8 bytes. Ass | 1 | +2.0 |
| Q73 | Arrange the following types of machine in descending order of complexity. (A) SISD (B) MIMD | 3 | +2.0 |
| Q87 | 📄 If T is the capacity of a track in bytes, and S is the capacity of each surface in byte, then (T, S) | 3 | +2.0 |
| Q88 | 📄 What is the capacity of the disk, in bytes ? | 2 | +2.0 |
| Q89 | 📄 If the disk platters rotate at 5400 rpm (revolutions per minute), then approximately what is the max | 1 | +2.0 |
| Q90 | 📄 If one track of data can be transferred per revolution, then what is the data transfer rate ? | 4 | +2.0 |
| Q91 | 📄 Given below are two statements: Statement I: The disk has a total number of 2000 cylinders. | 1 | +2.0 |
| Q# | Question | Answer | Marks |
|---|---|---|---|
| Q37 | In the context of concurrency control, a given pair of operations in a schedule is called conflict | 2 | +2.0 |
| Q41 | Consider a relational schema S = (U, V, W, X, Y, Z) on which the following functional dependencies | 4 | +2.0 |
| Q57 | The data node and name node in HADOOP are | 1 | +2.0 |
| Q68 | Match List I with List II List I (E – R symbols) | 3 | +2.0 |
| Q94 | 📄 Refer table, structures given above, University decided to give all employees in the ‘SCIENCE | 2 | +2.0 |
| Q95 | 📄 Which of the following query/queries return the employee ID and name of employees whose salary is g | 4 | +2.0 |
| Q96 | 📄 In reference to the above given table structures, which of the following query/queries will drop th | 1 | +2.0 |
| Q97 | 📄 Given below are two statements to find the sum of salaries of all employees of the English departme | 3 | +2.0 |
| Q98 | 📄 On the basis of above given table structures, retrieve the distinct employee ID (EMPID) of all emplo | 3 | +2.0 |
| Q# | Question | Answer | Marks |
|---|---|---|---|
| Q2 | Consider the statement below. A person who is radical (R) is electable (E) if he/she is conserva | 4 | +2.0 |
| Q3 | Consider the following argument with premise \(({\forall _x}P\left( x \right)) \vee Q\left( x | 2 | +2.0 |
| Q8 | Given below are two statements: Statement I: 5 divides n 5 - n whenever n is a nonn | 1 | +2.0 |
| Q18 | Find the lexicographic ordering of the bit strings given below based on the ordering 0 < 1. ( | 2 | +2.0 |
| Q26 | Which of the following pairs of propositions are not logically equivalent ? | 4 | +2.0 |
| Q27 | Which of the following statements are true ? (A) A sentence α entails another sentenc | 4 | +2.0 |
| Q31 | Consider the following statements: (A) Any tree is 2-colorable (B) A graph G has no cycles of | 3 | +2.0 |
| Q35 | If f(x) = x is my friend, and p(x) = x is perfect. then correct logical translation of the statement | 2 | +2.0 |
| Q44 | Match List I with List II Let R 1 = {(1, 1), (2, 2), (3, 3)} and R 2 = {(1, 1), (1, 2), ( | 4 | +2.0 |
| Q53 | How many ways are there to pack six copies of the same book into four identical boxes, where a box c | 4 | +2.0 |
| Q69 | What kind of clauses are available in conjunctive normal form ? | 1 | +2.0 |
| Q71 | Consider the following linear programming (LP): Max. Z = 2x 1 + 3x 2 Such that 2 | 4 | +2.0 |
| Q84 | Consider the following properties: A. Reflexive B. Antisymmetric C. Symmetric Let A = { | 4 | +2.0 |
| Q85 | The number of positive integers not exceeding 100 that are either odd or the square of an integer is | 3 | +2.0 |
| Q# | Question | Answer | Marks |
|---|---|---|---|
| Q6 | Consider a single-level page table system. with the page table stored in the memory. If the hit rat | 2 | +2.0 |
| Q11 | Assuming that the system call fork () never fails, consider the following C programs P1 and P2 exec | 3 | +2.0 |
| Q48 | Consider a hypothetical machine with 3 pages of physical memory, 5 pages of virtual memory, and < | 4 | +2.0 |
| Q70 | Suppose you have a Linux file system where the block size is 2K bytes, a disk address is 32 bits, an | 2 | +2.0 |
| Q79 | Consider a disk system having 60 cylinders. Disk requests are received by a disk drive for cylinders | 3 | +2.0 |
| Q# | Question | Answer | Marks |
|---|---|---|---|
| Q13 | Which among the following statement(s) is (are) true? (A) A hash function takes a message of arb | 3 | +2.0 |
| Q19 | Consider the following pseudo-code fragment, where a and b are integer variables that have been ini | 4 | +2.0 |
| Q58 | A complete n-ary tree is a tree in which each node has n children or no children. Let I be the numbe | 3 | +2.0 |
| Q66 | Consider the following recursive Java function f that takes two long arguments and returns a float | 1 | +2.0 |
| Q67 | Suppose you are compiling on a machine with 1-byte chars, 2-byte shorts, 4-byte ints, and 8-byte do | 3 | +2.0 |
| Q75 | In HTML, <map> is used for | 2 | +2.0 |
| Q86 | Which of the following statements regarding XML is/are True ? (A) XML is a set of tags designed | 3 | +2.0 |
| Q# | Question | Answer | Marks |
|---|---|---|---|
| Q1 | Arrange the following types of Cohesion from best to worst type. (A) Logical Cohesion (B) Seq | 4 | +2.0 |
| Q14 | A Software project was estimated at 864 Function Points. A six person team will be assigned to proj | 2 | +2.0 |
| Q16 | Modifying the software by restructuring is called | 3 | +2.0 |
| Q21 | Match List I with List II With reference to CMM developed by Software Engineering Institute (SEI | 3 | +2.0 |
| Q46 | A Company has a choice of two languages L 1 and L 2 to develop a software for their client. Numbe | 3 | +2.0 |
| Q50 | Which of the following UML diagrams has a static view ? | 2 | +2.0 |
| Q51 | Software reliability is described with respect to (A) Execution Time (B) Calendar Time (C) | 3 | +2.0 |
| Q64 | To create an object-behavioral model, the analyst performs the following steps: (A) Evaluates al | 1 | +2.0 |
| Q76 | Which of the following is/are behavioral testing technique(s) ? (A) Equivalence Partitioning | 2 | +2.0 |
| Q93 | Given below are two statements: Statement I: Quality control involves the series of inspection | 1 | +2.0 |
| Q# | Question | Answer | Marks |
|---|---|---|---|
| Q10 | Consider the following regular expressions: (a) r = a(b + a)* (b) s = a(a + b) + (c) t = | 2 | +2.0 |
| Q36 | Let L 1 and L 2 be languages over ∑ = {a, b} represented by the regular expressions | 3 | +2.0 |
| Q38 | Which of the following grammars is (are) ambiguous? (A) s → ss | asb | bsa | λ | 4 | +2.0 |
| Q40 | Match List I with List II: L R : Regular language, LCF: Context free language L REC : Recursi | 3 | +2.0 |
| Q47 | Which of the following statements is true ? | 1 | +2.0 |
| Q54 | Consider L = L 1 ∩ L 2 Where L 1 = {0 m 1 m 20 n 1 n |m, n >= 0} L | 3 | +2.0 |
| Q65 | Consider the following languages: \({L_1} = \{ {a^{{{̇ z}^z}}}|̇ Z\;is\;an\;integer\} \) | 4 | +2.0 |
| Q78 | Given below are two statements: Statement I: The problem "Is L 1 ∧ L 2 = ϕ?&qu | 1 | +2.0 |
| Q81 | Let G 1 and G 2 be arbitrary context free languages and R an arbitrary regular language. Consi | 4 | +2.0 |