| Q# | Question | Answer | Marks |
|---|---|---|---|
| Q12 | Consider the following graph: For the graph; the following sequences of depth first search | 4 | +2.0 |
| Q25 | The solution of the recurrence relation 7(n) = 3T(n/4) + n lg n is | 2 | +2.0 |
| Q42 | Assume that f(n) and g(n) are asymptotically positive. Which of the following is correct? | 3 | +2.0 |
| Q48 | Which of the following algorithm design approach is used in Quick sort algorithm? | 3 | +2.0 |
| Q52 | A top down approach to programming calls for: Statement I: Working from the general to the spe | 2 | +2.0 |
| Q61 | Consider the following statements of approximation algorithm: Statement I: Vertex-cover is a p | 2 | +2.0 |
| Q89 | Consider the following algorithms and their running times: Algorithms Comple | 3 | +2.0 |
| Q# | Question | Answer | Marks |
|---|---|---|---|
| Q19 | Consider the following statements: Statement I: LALR parser is more powerful than canonical LR | 3 | +2.0 |
| Q# | Question | Answer | Marks |
|---|---|---|---|
| Q15 | Which of the following is correct for the destination address 4A ∶ 30 ∶ 10 ∶ 21 ∶ 10 ∶ 1A? | 1 | +2.0 |
| Q18 | Consider an error free 64 kbps satellite channel used to send 512 byte data frames in one direction | 3 | +2.0 |
| Q20 | Match List I with List II: List I List II (A) BIND ( | 2 | +2.0 |
| Q30 | Match List I with List II: List I List II (A) DES (I | 2 | +2.0 |
| Q51 | Which layer divides each message into packets at the source and re-assembles them at the destination | 2 | +2.0 |
| Q54 | Match List I with List II: List I List II (A) Physical la | 4 | +2.0 |
| Q64 | Using 'RSA' algorithm, if p = 13, q = 5 and e = 7, the value of d and cipher value of '6 | 3 | +2.0 |
| Q65 | A classless address is given as 167.199.170.82/27. The number of addresses in the network is | 2 | +2.0 |
| Q81 | Which one is a connectionless transport - layer protocol that belongs to the Internet protocol famil | 2 | +2.0 |
| Q82 | The representation of 4 bit code 1101 into 7 bit, even parity Hamming code is | 1 | +2.0 |
| Q87 | Which mode is a block cipher implementation as a self synchronizing stream cipher? | 2 | +2.0 |
| Q96 | 📄 The sender window size to get the maximum efficiency is | 3 | +2.0 |
| Q97 | 📄 The maximum achievable throughput is | 2 | +2.0 |
| Q98 | 📄 The transmission and propagation delays are respectively | 1 | +2.0 |
| Q99 | 📄 The minimum number of bits required in the sequence number field of the packet is | 2 | +2.0 |
| Q100 | 📄 If only 6 bits are reserved for sequence number field, then the efficiency of the system is | 1 | +2.0 |
| Q# | Question | Answer | Marks |
|---|---|---|---|
| Q8 | Given below are two statements: Statement I: Consider 20 bit 'Branch' microinstruction | 3 | +2.0 |
| Q26 | Consider the following two lists: List I List II (A) Stac | 2 | +2.0 |
| Q44 | A 4-stage pipeline has the stage delay as 150, 120, 160 and 140 ns respectively. Registers that are | 2 | +2.0 |
| Q59 | In a cache memory, if address has 9 bits in Tag field and 12 bits in index field, the size of main m | 4 | +2.0 |
| Q68 | For multiprocessor system, interconnection network - cross bar switch is an example of | 1 | +2.0 |
| Q74 | Consider a memory system having address spaced at a distance of m, T = Bank cycle time and n number | 1 | +2.0 |
| Q# | Question | Answer | Marks |
|---|---|---|---|
| Q5 | Consider the following statements: Statement I: Conservative 2 PL is a deadlock-free protocol. | 2 | +2.0 |
| Q13 | In a database, a rule is defined as (P1 and P2) or P3? R1 (0.8) and R2 (0.3), where P1, P2, P3 are p | 2 | +2.0 |
| Q28 | In reference to Big data, consider the following database: (A) Memcached (B) Couch DB (C) | 2 | +2.0 |
| Q33 | Consider a B-tree of height h, minimum degree t ≥ 2 that contains any n-key, where n ≥ 1. Whic | 2 | +2.0 |
| Q43 | Let R (ABCDEFGH) be a relation schema and F be the set of dependencies F = {A → B, ABCD → | 1 | +2.0 |
| Q67 | Match List I with List II: List I List II (A) BCNF ( | 3 | +2.0 |
| Q88 | A trigger is | 4 | +2.0 |
| Q90 | Consider the following statements: Statement I: Composite attributes cannot be divided into sm | 4 | +2.0 |
| Q91 | 📄 Which of the following relational algebra query/queries computes/compute the name of sailors who ha | 4 | +2.0 |
| Q92 | 📄 Which of the following relational algebra query computes the names of sailor who have reserved all b | 2 | +2.0 |
| Q93 | 📄 Which of the following relational algebra query/queries computes/compute the names of sailors who h | 1 | +2.0 |
| Q94 | 📄 Which of the following relational algebra query computes the Sid's of sailors with age over 20 w | 1 | +2.0 |
| Q95 | 📄 Which of the following relational algebra query computes the names of sailors who have reserved a re | 1 | +2.0 |
| Q# | Question | Answer | Marks |
|---|---|---|---|
| Q35 | Consider a logic gate circuit. with 8 input lines (D 0 , D 1 ..... D 7 ) and 3 output lines (A 0 , | 1 | +2.0 |
| Q73 | Consider the following in Boolean Algebra X: a ∨ (b ∧ (a ∨ c)) = (a ∨ b) ∧ (a | 4 | +2.0 |
| Q85 | The number of gate inputs, required to realize expression ABC + AB̅CD + EF̅ + AD is | 4 | +2.0 |
| Q# | Question | Answer | Marks |
|---|---|---|---|
| Q3 | The logic expression (P̅ ∧ Q) ∨ (P ∧ Q̅) ∨ (P ∧ Q) is equivalent to | 3 | +2.0 |
| Q4 | Consider α, β, γ as logical variables. Identify which of the following represents | 3 | +2.0 |
| Q6 | Let ∈ = 0.0005, and Let Re be the relation {(x, y) = R 2 ∶ |x − y| < ∈}, Re cou | 1 | +2.0 |
| Q31 | Given below are two statements: one is labelled as Assertion (A) and the other is labelled as Reas | 1 | +2.0 |
| Q46 | Given below are two statements: Statement I: "Grandparent is a parent of one's parent | 1 | +2.0 |
| Q63 | Let ({a, b}, *) be a semigroup, where a * a = b. (A) a * b = b * a (B) b * b = b Choose th | 4 | +2.0 |
| Q78 | Consider the primal problem: Maximize z = 5x 1 + 12x 2 + 4x 3 Subject to x 1 + 2x 2 + x | 2 | +2.0 |
| Q86 | There are three boxes. First box has 2 white, 3 black and 4 red balls. Second box has 3 white, 2 bla | 1 | +2.0 |
| Q# | Question | Answer | Marks |
|---|---|---|---|
| Q1 | What is called Journaling in Linux operating system? | 2 | +2.0 |
| Q16 | Match List I with List II: List I List II (A) Firmware | 4 | +2.0 |
| Q21 | A magnetic tape drive has transport speed of 200 inches per second and a recording density of 1600 b | 2 | +2.0 |
| Q29 | Consider the following: List I List II (A) Stack algorith | 1 | +2.0 |
| Q58 | For the following page reference string 4, 3, 2, 1, 4, 3, 5, 4, 3, 2, 1, 5. the number of page fault | 3 | +2.0 |
| Q62 | Match List I with List II: List I List II (A) Least frequ | 3 | +2.0 |
| Q71 | If an operating system does not allow a child process to exist when the parent process has been term | 2 | +2.0 |
| Q83 | The total storage capacity of a floppy disk having 80 tracks and storing 128 bytes/sector is 163840 | 4 | +2.0 |
| Q# | Question | Answer | Marks |
|---|---|---|---|
| Q10 | Which mechanism in XML allows organizations to specify globally unique names as element tags in docu | 4 | +2.0 |
| Q17 | Consider the following: List I List II (A) Activation rec | 4 | +2.0 |
| Q23 | The condition num! = 65 cannot be replaced by | 4 | +2.0 |
| Q32 | Consider the traversal of a tree Preorder → ABCEIFJDGHKL Inorder → EICFJBGDKHLA | 4 | +2.0 |
| Q38 | Pointers cannot be used to | 2 | +2.0 |
| Q40 | Consider the hash table of size 11 that uses open addressing with linear probing. Let h(k) = k mod 1 | 2 | +2.0 |
| Q41 | Match List I with List II: List I List II (A) Localizatio | 3 | +2.0 |
| Q53 | Which statement is false? | 3 | +2.0 |
| Q57 | How many rotations are required during the construction of an AVL tree if the following elements ar | 2 | +2.0 |
| Q69 | The number of nodes of height h in any n-element heap is atmost: | 1 | +2.0 |
| Q79 | Of the following, which is NOT a logical error? | 2 | +2.0 |
| Q# | Question | Answer | Marks |
|---|---|---|---|
| Q14 | Alpha and Beta testing are forms of | 3 | +2.0 |
| Q24 | Modules X and Y operate on the same input and output, then the cohesion is | 4 | +2.0 |
| Q34 | A good software requirement specification does NOT have the characteristic | 4 | +2.0 |
| Q36 | The process to gather the software requirements from client, analyze and document is known as - | 4 | +2.0 |
| Q39 | Given below are two statements: one is labelled as Assertion (A) and the other is labelled as Reaso | 3 | +2.0 |
| Q47 | Size and complexity are a part of | 4 | +2.0 |
| Q50 | Consider the following related to Fourth Generation Technique (4GT): (A) It controls efforts. | 4 | +2.0 |
| Q55 | The model in which the requirements are implemented by its category is | 1 | +2.0 |
| Q60 | Fault base testing technique is | 4 | +2.0 |
| Q72 | Which of the following is an indirect measure of product? | 4 | +2.0 |
| Q76 | Which Metrics are derived by normalizing quality and/or productivity measures by considering the siz | 4 | +2.0 |
| Q80 | RAD software process model stands for | 1 | +2.0 |
| Q84 | If every requirement can be checked by a cost-effective process, then SRS is called | 1 | +2.0 |
| Q# | Question | Answer | Marks |
|---|---|---|---|
| Q7 | Consider the following statements about Context Free Language (CFL): Statement I: CFL is close | 1 | +2.0 |
| Q9 | Consider L = {ab, aa, baa} Which of the following string is NOT in L*? | 1 | +2.0 |
| Q11 | Consider the following NPDA = ({q 0 , q 1 , q f }, {a, b}, {1, z}, δ, q 0 , z, {q f }) &de | 1 | +2.0 |
| Q22 | Consider two lists A and B of three strings on {0, 1} X: List A | 1 | +2.0 |
| Q27 | The reduced grammar equivalent to the grammar, whose production rules are given below, is S &rar | 1 | +2.0 |
| Q37 | Match List I with List II: List I List II (A) Type 0 | 2 | +2.0 |
| Q45 | Consider the properties of recursively enumerable sets: (A) Finiteness (B) Context Freedom | 4 | +2.0 |
| Q49 | Consider the production rules of grammer G: S → AbB A → aAb ∣ λ B → | 1 | +2.0 |
| Q70 | Consider the grammer S → SbS | a. Consider the following statements: The string abababa | 1 | +2.0 |
| Q75 | Consider the language L = {a n b m ∶ n ≥ 4, m ≤ 3} Which of the following regular express | 3 | +2.0 |