InterviewSolution

Explore topic-wise InterviewSolutions in .

This section includes InterviewSolutions, each offering curated multiple-choice questions to sharpen your knowledge and support exam preparation. Choose a topic below to get started.

1.	Let R be the set of all binary relations on the set {1, 2, 3}. Suppose a relation is chosen from R at random. The probability that the chosen relation is reflexive (round off to 3 decimal places) is ________ .Note – This question was Numerical Type.(A) 0.125(B) 0.25(C) 0.50(D) 0.625
Answer» None

2.	Let G be a group of 35 elements. Then the largest possible size of a subgroup of G other than G itself is ________ .Note – This question was Numerical Type.(A) 1(B) 5(C) 7(D) 35
Answer» None

3.	A multiplexer is placed between a group of 32 registers and an accumulator to regulate data movement such that at any given point in time the content of only one register will move to the accumulator. The number of select lines needed for the multiplexer is _________ .Note – This question was Numerical Type.(A) 5(B) 6(C) 4(D) 7
Answer»

4.	If there are m input lines n output lines for a decoder that is used to uniquely address a byte addressable 1 KB RAM, then the minimum value of m+n is ________ .Note – This question was Numerical Type.(A) 18(B) 1034(C) 10(D) 1024
Answer» None

5.	What is the worst case time complexity of inserting n elements into an empty linked list, if the linked list needs to be maintained in sorted order ?(A) Θ(n)(B) Θ(n log n)(C) Θ(n2)(D) Θ(1)
Answer»

6.	A computer system with a word length of 32 bits has a 16 MB byte- addressable main memory and a 64 KB, 4-way set associative cache memory with a block size of 256 bytes. Consider the following four physical addresses represented in hexadecimal notation.A1 = 0x42C8A4,A2 = 0x546888,A3 = 0x6A289C,A4 = 0x5E4880 Which one of the following is TRUE ?(A) A1 and A4 are mapped to different cache sets.(B) A2 and A3 are mapped to the same cache set.(C) A3 and A4 are mapped to the same cache set.(D) A1 and A3 are mapped to the same cache set.
Answer»

7.	Consider three registers R1, R2, and R3 that store numbers in IEEE−754 single precision floating point format. Assume that R1 and R2 contain the values (in hexadecimal notation) 0x42200000 and 0xC1200000, respectively.If R3 = R1 / R2, what is the value stored in R3 ?(A) 0x40800000(B) 0xC0800000(C) 0x83400000(D) 0xC8500000
Answer»

8.	Consider the Boolean function z(a,b,c).Which one of the following minterm lists represents the circuit given above ?(A) z = ∑(0, 1, 3, 7)(B) z = ∑(1, 4, 5, 6, 7)(C) z = ∑(2, 4, 5, 6, 7)(D) z = ∑(2, 3, 5)
Answer»

9.	Let A and B be two n×n matrices over real numbers. Let rank(M) and det(M) denote the rank and determinant of a matrix M, respectively. Consider the following statements.I. rank(AB) = rank(A)rank (B)II. det(AB) = det(A)det(B)III. rank(A+B) ≤ rank(A) + rank(B)IV. det(A+B) ≤ det(A) + det(B) Which of the above statements are TRUE ?(A) I and II only(B) I and IV only(C) II and III only(D) III and IV only
Answer» None

10.	Which of the following languages are undecidable? Note that ⟨M⟩ indicates encoding of the Turing machine M.L1 = { ⟨M⟩ ∣ L(M)=∅ }L2 = { ⟨M,w,q⟩ ∣ M on input w reaches state q in exactly 100 steps }L3 = { ⟨M⟩ ∣ L(M) is not recursive }L4 = { ⟨M⟩ ∣ L(M) contains at least 21 members }(A) L1, L3, and L4 only(B) L1 and L3 only(C) L2 and L3 only(D) L2, L3, and L4 only
Answer»

11.	Consider a double hashing scheme in which the primary hash function is h1(k) = k mod 23, and the secondary hash function is h2(k) = 1+(k mod 19). Assume that the table size is 23. Then the address returned by probe 1 in the probe sequence (assume that the probe sequence begins at probe 0) for key value k = 90 is ________ .Note – This question was Numerical Type.(A) 13(B) 15(C) 21(D) 23
Answer» None

12.	Assume that you have made a request for a web page through your web browser to a web server. Initially the browser cache is empty. Further, the browser is configured to send HTTP requests in non-persistent mode. The web page contains text and five very small images. The minimum number of TCP connections required to display the web page completely in your browser is ________ .Note – This question was Numerical Type.(A) 6(B) 7(C) 8(D) 9
Answer»

13.	Consider the following grammar.S → aSB ∣ dB → b The number of reduction steps taken by a bottom-up parser while accepting the string aaadbbb is ________ .Note – This question was Numerical Type.(A) 6(B) 7(C) 8(D) 4
Answer» None

14.	Consider a non-pipelined processor operating at 2.5 GHz. It takes 5 clock cycles to complete an instruction. You are going to make a 5- stage pipeline out of this processor. Overheads associated with pipelining force you to operate the pipelined processor at 2 GHz. In a given program, assume that 30% are memory instructions, 60% are ALU instructions and the rest are branch instructions. 5% of the memory instructions cause stalls of 50 clock cycles each due to cache misses and 50% of the branch instructions cause stalls of 2 cycles each. Assume that there are no stalls associated with the execution of ALU instructions. For this program, the speedup achieved by the pipelined processor over the non-pipelined processor (round off to 2 decimal places) is __________ .Note – This question was Numerical Type.(A) 2.16(B) 2.50(C) 1.50(D) 1.16
Answer»

15.	Consider the following statements.I. Symbol table is accessed only during lexical analysis and syntax analysis.II. Compilers for programming languages that support recursion necessarily need heap storage for memory allocation in the run-time environment.III. Errors violating the condition ‘any variable must be declared before its use’ are detected during syntax analysis.Which of the above statements is/are TRUE ?(A) I only(B) I and III only(C) Ⅱ only(D) None of Ⅰ, Ⅱ and Ⅲ
Answer»

16.	Consider allocation of memory to a new process. Assume that none of the existing holes in the memory will exactly fit the process’s memory requirement. Hence, a new hole of smaller size will be created if allocation is made in any of the existing holes. Which one of the following statement is TRUE ?(A) The hole created by first fit is always larger than the hole created by next fit.(B) The hole created by worst fit is always larger than the hole created by first fit.(C) The hole created by best fit is never larger than the hole created by first fit.(D) The hole created by next fit is never larger than the hole created by best fit.
Answer»

17.	Consider the language L = { an ∣ n≥0 }∪{ anbn ∣ n≥0 } and the following statements.I. L is deterministic context-free.II. L is context-free but not deterministic context-free.III. L is not LL(k) for any k.Which of the above statements is/are TRUE ?(A) Ⅰ only(B) Ⅱ only(C) Ⅰ and Ⅲ only(D) Ⅲ only
Answer»