Question Paper & Answer Key - CSE
Question Paper & Answer Key - CSE
)
Q No Key Q No Key
1 D 26 B
2 C 27 B
3 B 28 B
4 D 29 B
5 C 30 C
6 A 31 D
7 A 32 B
8 C 33 B
9 C 34 A
10 B 35 A
11 D 36 A
12 C 37 C
13 A 38 B
14 C 39 C
15 D 40 D
16 C 41 A
17 D 42 A
18 B 43 B
19 B 44 B
20 C 45 C
21 D 46 B
22 C 47 B
23 C 48 C
24 D 49 D
25 D 50 D
Test Booklet Test Booklet No.
Series
Test Booklet for the Post of
A Assistant Professor Computer Science & Engineering
(A) 8 (B) 12
(C) 14 (D) 16
3. Dependency between statements I1: mul r1, r2, r3 and I2: add r2, r4, r5 is _________.
(A) Flow dependency (B) Anti-dependency
(C) Non-blocking caches (D) Critical word first and early restart
(A) Length of the operand vectors (B) Structural hazards among operands
6. Suppose that you want to enhance the processor used for web serving. The new processor is
10 times faster on computation in the web serving application than the original processor.
Assume that the original processor is busy with computation 40% of the time and is waiting for
i/o 60% of the time, what is the overall speedup gained by incorporating the enhancement?
10. Arrange the following concepts used in normalization in increasing order of Normal forms
(NF1, NF2, NF3, BCNF, NF4)
I. Every determinant is a candidate key.
II. Each non-key attribute be dependent on the primary key.
III. Does not contain multivalued dependencies.
IV. Should contain only atomic values.
V. Non-transitive dependency.
(A) I, II, III, IV, V (B) IV, II, V, I, III
(C) V, IV, III, II, I (D) IV, V, I, II, III
12. A protocol that permits a transaction to lock a new data item only if it has not yet unlocked any
data item, is called ________.
(A) Two-phase unlocking protocol (B) One-phase locking protocol
(C) Two-phase locking protocol (D) One-phase unlocking protocol
14. Consider a fuzzy set A defined on the interval X = [0, 10] of integers by the membership
function :
µA(x) = x/(x + 2)
Then the cut corresponding to = 0.5 will be :
(A) {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10} (B) {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}
(C) {2, 3, 4, 5, 6, 7, 8, 9, 10} (D) { }
16. A 3-input neuron is trained to output a zero when the input is 110 and a one when the input
is 111. After generalization, the output will be zero when and only when the input is :
(A) 000 or 110 or 011 or 101 (B) 010 or 100 or 110 or 101
(C) 000 or 010 or 110 or 100 (D) 100 or 111 or 101 or 001
17. Four jobs J1, J2, J3 and J4 are waiting to be run. Their expected run times are 9, 6, 3 and 5
respectively. In order to minimize average response time, the jobs should be run in the order :
(A) J1 J2 J3 J4 (B) J4 J3 J2 J1
(C) J3 J4 J1 J2 (D) J3 J4 J2 J1
18. Which of the following statement(s) is/are correct about Extensible Messaging and Presence
Protocol (XMPP)?
(i) XMPP uses XML.
(ii) It provides end-to-end encryption.
(iii) It supports QoS.
(iv) Binary data is first encoded and then transmitted in band.
(A) (ii) & (iii) only (B) (i) & (iv) only
(C) (ii), (iii) & (iv) only (D) (i), (ii) & (iii) only
22. The second derivative test for f(x, y) = x 3 – 3xy2 + 4 at (0, 0) indicates that the point is a_____.
(A) Local minimum (B) Local maximum
(C) Saddle point (D) None of the above
23. Which of the following statement(s) is/are true with reference to the way of describing XML
data?
S1. XML uses DTD to describe the data.
S2. XML uses XSL to describe the data.
S3. XML uses a description node to describe the data
Codes :
(A) S1 only (B) S2 only
(C) S1 and S3 (D) S1 and S2
26. What is the correct order of the procedure for handling a page fault?
1. Check PCB validity for memory access
2. If valid, terminate the process, else continue
3. Schedule disk operation to read the page
4. Find free frame update process and page tables after read
5. Restart the process to access the page
(A) 2-1-5-3-4 (B) 1-2-4-3-5
(C) 1-2-5-3-4 (D) 5-1-4-3-2
(A) (i), (ii), (iii) & (iv) (B) (iii) & (iv) only
(C) (i), (ii) & (iii) only (D) (ii), (iii) & (iv) only
30. The halting problem for Turing machines states that _____.
(A) It is always possible to determine if a Turing machine will halt on a given input
(B) There is a universal Turing machine that can determine if any other Turing machine will
halt
(C) It is undecidable to determine in general whether a given Turing machine will halt on a
particular input
(D) Most Turing machines can solve the halting problem
32. A hash function H defined H(key)=key mod 7, with linear probing, is used to insert the
keys 45, 44, 91, 55, 77, 18, 63 into a table indexed from 0 to 6. What will be the location of
key 63?
(A) 4 (B) 5
(C) 6 (D) 1
35. Which regex pattern correctly describes an identifier starting with a letter and followed by any
number of letters or digits?
(A) [a-zA-Z][a-zA-Z0-9] * (B) [0-9]+[a-zA-Z] *
(C) [a-zA-Z]+ (D) [a-zA-Z0-9]+
36. Which of the following statements is true for LR parsers compared to LL parsers?
(A) LR parsers can handle a more extensive class of grammars
(B) LL parsers are more general and can handle all grammars that LR parsers can
(C) LR parsers are easier to implement
(D) LL parsers are faster
40. Match List-I and List-II and select the correct answer from the codes given below :
List-I List-II
(Rule of Reference) (Symbolic Representation)
P. Modus Ponens 1. ( p q) (q r ) ( p r )
Q. Modus Tollens 2. p ( p q ) q
R. Disjunctive Syllogism 3. p ( p q) q
S. Hypothetical Syllogism 4. q ( p q) p
Codes :
P Q R S
(A) 1 2 3 4
(B) 2 4 1 3
(C) 4 2 1 3
(D) 3 4 2 1
42. Effective software project management focuses on the four P’s. What are those four P’s?
(A) People, Product, Process, Project (B) People, Product, Performance, Project
(C) People, Payment, Process, Project (D) None of the above
43. What is the worst case time complexity for search, insert and delete operations in splay tree?
(A) O(n) in all the cases
(B) O(logn) for all
(C) O(logn) for search & insert, O(n) for delete
(D) O(logn) for search and O(n) for insert & delete
44. What is the McCabe’s Cyclomatic Complexity for the below pseudo code :
void method1(int arr[50])
{
inti, j;
for(i = 0 to 50)
for(j = 0 to 50)
if(arr[i] >arr[j])
swap arr[i] and arr[j]
}
(A) 4 (B) 3
(C) 6 (D) 2
46. Which of the following sets represent five stages defined by Capability Maturity Model (CMM)
in increasing order of maturity?
(A) Initial, Defined, Repeatable, Managed, Optimized
(B) Initial, Repeatable, Defined, Managed, Optimized
(C) Initial, Defined, Managed, Repeatable, Optimized
(D) Initial, Repeatable, Managed, Defined, Optimized
47. Match List-I and List-II and select the correct answer from the codes given below :
List-I List-II
(ATTACK) (DESCRIPTIONS)
P Phishing 1 An attack where an attacker intercepts and
alters communication between two parties
without their knowledge.
Q Denial of Service (DoS) 2 An attack that floods a network or server
with excessive traffic, making it unavailable
to legitimate users.
R Man-in-the-Middle (MitM) Attack 3 A technique used to trick users into revealing
sensitive information by posing as a
trustworthy entity.
S SQL Injection 4 An attack that exploits vulnerabilities in a
web application's database query system to
access unauthorized data.
Codes :
(A) (P)-(3), (Q)-(1), (R)-(2), (S)-(4) (B) (P)-(3), (Q)-(2), (R)-(1), (S)-(4)
(C) (P)-(4), (Q)-(5), (R)-(2), (S)-(1) (D) (P)-(2), (B)-(3), (C)-(4), (S)-(1)
P. At-most-once delivery
Q. At-least-once delivery
R. Exactly-once delivery
S. Best-effort delivery
49. You are working with a network that is 172.16.0.0 and would like to support 600 hosts per
subnet. What subnet mask should you use?
(A) 255.255.192.0 (B) 255.255.224.0
(C) 255.255.248.0 (D) 255.255.252.0
50. If the frame buffer has 11-bits per pixel and 8 bits are allocated for each of the R, G, and B
components then what would be the size of the color lookup table (LUT)
(A) 2^19 bytes (B) 16384 bytes
(C) 88 bytes (D) 6144 bytes