Q. Which of the following protocol pairs can be used to send and retrieve e-mails (in that order)? (A) IMAP, POP3 (B) SMTP, POP3 (C) SMTP, MIME (D) IMAP, SMTP Ans: SMTP, POP3 Solution: SMTP is push protocol and send e-mail andPOP3 is pull protocol i.e. to retrieve e-mail.

Q. For Σ = {𝑎, 𝑏}, let us consider the regular language 𝐿 = { 𝑥 |𝑥 = 𝑎2+3𝑘 or 𝑥 = 𝑏10+12𝑘, 𝑘 ≥ 0}. Which one of the following can be a pumping length (the constant guaranteed by the pumping lemma) for 𝐿 ? (A) 3 (B) 5 (C) 9 (D) 24 Ans: 24 Solution: According to Pumping lemma, ...

Q. Which one of the following statements is NOT correct about the B+ tree data structure used for creating an index of a relational database table? (A) B+ Tree is a height-balanced tree (B) Non-leaf nodes have pointers to data records (C) Key values in each node are kept in sorted order ...

Q. Let 𝐺 be an undirected complete graph on 𝑛 vertices, where 𝑛 > 2. Then, the number of different Hamiltonian cycles in 𝐺 is equal to Ans: Option D Solution: A simple circuit in a graph G that passes through every vertex exactly once is called a Hamiltonian circuit. In Hamiltonian ...

Q. Consider the following two statements about database transaction schedules: Strict two-phase locking protocol generates conflict serializable schedules that are also recoverable. Timestamp-ordering concurrency control protocol with Thomas’ Write Rule can generate view serializable ...

Q. Let 𝐺 be an arbitrary group. Consider the following relations on 𝐺: 𝑅1: ∀𝑎, 𝑏 ∈ 𝐺, 𝑎 𝑅1𝑏 if and only if ∃𝑔 ∈ 𝐺 such that 𝑎 = 𝑔−1𝑏𝑔 𝑅2: ∀𝑎, 𝑏 ∈ 𝐺, 𝑎 𝑅2𝑏 if and only if 𝑎 = 𝑏−1 Which of the above is/are equivalence relation/relations? (A) 𝑅1 and 𝑅2 (B) 𝑅1 only (C) 𝑅2 only (D) ...

Q. Let 𝑋 be a square matrix. Consider the following two statements on 𝑋. 𝑋 is invertible. Determinant of 𝑋 is non-zero. Which one of the following is TRUE? (A) I implies II; II does not imply I. (B) II implies I; I does not imply II. (C) I does not imply II; II does not imply ...

Q. If 𝐿 is a regular language over Σ = {𝑎, 𝑏}, which one of the following languages is NOT regular ? (A) 𝐿 ⋅ 𝐿𝑅 = {𝑥𝑦 | 𝑥 ∈ 𝐿, 𝑦𝑅 ∈ 𝐿} (B) {𝑤𝑤𝑅 | 𝑤 ∈ 𝐿} (C) Prefix (𝐿) = {𝑥 ∈ 𝛴∗|∃𝑦 ∈ 𝛴∗ such that 𝑥𝑦 ∈ 𝐿} (D) Suffix (𝐿) = {𝑦 ∈ 𝛴∗|∃𝑥 ∈ 𝛴∗ such that 𝑥𝑦 ∈ 𝐿} Ans:{𝑤𝑤𝑅 | 𝑤 ∈ 𝐿} ...

Q.Let 𝑈 = {1,2, … , 𝑛}. Let 𝐴 = {(𝑥, 𝑋)|𝑥 ∈ 𝑋, 𝑋 ⊆ 𝑈}. Consider the following two statements on |𝐴|. I. |𝐴| = 𝑛2𝑛−1 II. |𝐴| = ∑𝑛𝑘=1 𝑘(𝑛) Which of the above statements is/are TRUE? (A) Only I(B) Only II (C) Both I and II(D) Neither I nor IIAns: Both I and ...

Q. In 16-bit 2’s complement representation, the decimal number −28 is: (A) 1111 1111 0001 1100(B) 0000 0000 1110 0100(C) 1111 1111 1110 0100(D) 1000 0000 1110 0100 Ans: 1111 1111 1110 0100 Solution: +28 ⇒ 0000 0000 0001 1100 –28 ⇒ 1111 1111 1110 0100 (2’s complement form)

Q. Which one of the following kinds of derivation is used by LR parsers? (A) Leftmost (B) Leftmost in reverse (C) Rightmost (D) Rightmost in reverse Ans: Rightmost in reverse Solution: Parsing is classified into two categories, i.e. Top Down Parsing and Bottom-Up Parsing. ...

Q. The chip select logic for a certain DRAM chip in a memory system design is shown below. Assume that the memory system has 16 address lines denoted by A15 to A0. What is the range of addresses (in hexadecimal) of the memory system that can get enabled by the chip select (CS) signal? (A) ...