InterviewSolution
Saved Bookmarks
InterviewSolution
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. |
Consider two events E1 and E2 such that probability of E1, Pr[E1]=1/2, probability of E2, Pr[E2]=1/3, and probability of E1 and E2, Pr[E1 and E2]=1/5, Which of the following statement is/are True?(A) Pr[E1 and E2] is 2/3(B) Events E1 and E2 are independent.(C) Events E1 and E2 are not independent.(D) Pr[E1/E2]= 4/5 |
| Answer» | |
| 2. |
Which of the following is/are advantages of virtual memory?a) Faster access to memory on an average.b) Processes can be given protected address spaces.c) Linker can assign addresses independent of where the program will be loaded in physical memory.d) Programs larger than the physical memory size can be run.(A) a and b(B) b and c(C) b and d(D) All of the above |
| Answer» | |
| 3. |
Which of the following expressions is not equivalent to X‾ ?(A) x NAND x(B) x NOR x(C) x NAND 1(D) x NOR 1 |
| Answer» | |
| 4. |
Which of the following function implements the Karnaugh map shown below?(A) a(B) b(C) c(D) d |
| Answer» | |
| 5. |
A multi-user, multi-processing operating system cannot be implemented on hardware that does not support:a)Address translationb)DMA for disk transferc)At least two modes of CPU execution (privileged and non-privileged).d)Demand Paging(A) Only A(B) Both A, B(C) A, B and C(D) A, B and D |
| Answer» | |
| 6. |
Let LD be the set of all languages accepted by a PDA by final state and LF the set of all languages accepted by empty stack. Which of the following is true?(A) a(B) b(C) c(D) d |
| Answer» | |
| 7. |
Listed below are some operating system abstractions (in the left column) and the hardware components or mechanism (in the right column) that they are abstractions of. Which of the following matching of pairs is correct?A. Thread 1. InterruptB. Virtual address space 2. MemoryC. File system 3. CPUD. Signal 4. Disk(A) A-2, B-4, C-3, D-1(B) A-1, B-2, C-3, D-4(C) A-3, B-2, C-4, D-1(D) A-4, B-1, C-2, D-3 |
| Answer» | |
| 8. |
Context free languages are closed under-(A) Union, Intersection(B) Union, Kleene closure(C) Intersection, Complement(D) Complement, Kleene closure |
| Answer» | |
| 9. |
Consider the regular expression (0+1)(0+1)… n times. The minimum state finite automaton that recognizes the language represented by this regular expression contains:(A) n states(B) n+1 states(C) n+2 states(D) None of the above |
| Answer» | |
| 10. |
Which of the following disk strategies is likely to give the best throughput?(A) Farthest cylinder next(B) Nearest cylinder next(C) First come first served(D) Elevator algorithm |
| Answer» | |
| 11. |
(A) A software interrupt(B) Polling(C) An indirect jump(D) A privileged instruction |
| Answer» | |
| 12. |
Arrange the following configurations for CPU in decreasing order of operating speeds;Hardwired Control, vertical microprogramming, horizontal microprogramming(A) Hardwired control, Vertical microprogramming, Horizontal microprogramming.(B) Hardwired control, Horizontal microprogramming, Vertical microprogramming.(C) Horizontal microprogramming, Vertical microprogramming, Hardwired control.(D) Vertical microprogramming, Horizontal microprogramming, Hardwired control. |
| Answer» | |
| 13. |
(A) It takes O(nlog n)time(B) It maintains the relative order of occurrence of non-distinct elements(C) It uses divide and conquer paradigm(D) It takes O(n) space |
| Answer» | |
| 14. |
If one uses straight two-way merge sort algorithm to sort the following elements in ascending order 20, 47, 15, 8, 9, 4, 40, 30, 12, 17then the order of these elements after the second pass of the algorithm is:(A) 8, 9, 15, 20, 47, 4, 12, 17, 30, 40(B) 8, 15, 20, 47, 4, 9, 30, 40, 12, 17(C) 15, 20, 47, 4, 8, 9, 12, 30, 40, 17(D) 4, 8, 9, 15, 20, 47, 12, 17, 30, 40 |
| Answer» | |
| 15. |
Suppose we want to arrange the ii numbers stored in an array such that all negative values occur before all positive ones. Minimum number of exchanges required in the worst case is:(A) n-1(B) n(C) n+1(D) None of the above |
| Answer» | |
| 16. |
Consider the schema R= ( S, T, U, V ) and the dependencies S→T, T→U, U→V and V→S. Let R (R1 and R2) be a decomposition such that R1∩R2≠Ø. The decomposition is:(A) Not in 2NF(B) In 2NF but not in 3NF(C) In 3NF but not in 2NF(D) In both 2NF and 3NF |
| Answer» | |
| 17. |
Which of the following is correct?(A) B-trees are for storing data on disk and B+ trees are for main memory.(B) Range queries are faster on B+ trees.(C) B-trees are for primary indexes and B+ trees are for secondary indexes.(D) The height of a B+ tree is independent of the number of records. |
| Answer» | |
| 18. |
Given the programming constructs i)assignment ii)for loops where the loop parameter cannot be changed within the loop iii)if-then-else iv)forward go to v)arbitrary go to vi)non-recursive procedure call vii)recursive procedure/function call viii)repeat loop, which constructs will you not include in a programming language such that it should be possible to program the terminates (i.e. halting) function in the same programming language.(A) ii), iii), iv)(B) v), vii), viii)(C) vi), vii), viii)(D) iii), v), viii) |
| Answer» | |
| 19. |
For the schedule given below, which of the following is Correct?1 Read A2 Read B3 Write A4 Read A5 Write A6 Write B7 Read B8 Write B (A) This schedule is serialisable and can occur in a scheme using 2PL protocol.(B) This schedule is serialisable but cannot occur in a scheme using 2PL protocol.(C) This schedule is not serialisable but can occur in a scheme using 2PL protocol.(D) This schedule is not serialisable and cannot occur in a scheme using 2PL protocol. |
| Answer» | |
| 20. |
The Newton-Raphson method is to be used to find the root of the equation f(x)=0 wherex0 is the initial approximation and f ‘ is the derivative of f. The method converges:(A) Always(B) Only if f is a polynomial(C) Only if f(x0) <0(D) None of the above |
| Answer» | |
| 21. |
The main memory of a computer has 2 cm blocks while the cache has 2c blocks. If the cache uses the set associative mapping scheme with 2 blocks per set, then the block k of main memory maps to the set:(A) (k mod m) of the cache(B) (k mod c) of the cache(C) (k mod 2c) of the cache(D) (k mod 2cm) of the cache |
| Answer» None | |
| 22. |
The minimum number of record movements required to merge five files A (with 10 records), B (with 20 records), C (with 15 records), D (with 5 records) and E (with 25 records) is:(A) 165(B) 90(C) 75(D) 65 |
| Answer» None | |