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. |
If the time is now 4 O’clock, what will be the time after 101 hours from now ?(A) 9 O’clock(B) 8 O’clock(C) 5 O’clock(D) 4 O’clock |
| Answer» | |
| 2. |
Let m=(313)4 and n=(322)4. Find the base 4 expansion of m+n.(A) (635)4(B) (32312)4(C) (21323)4(D) (1301)4 |
| Answer» None | |
| 3. |
Suppose there are six files F1, F2, F3, F4, F5, F6 with corresponding sizes 150 KB, 225 KB, 75 KB, 60 KB, 275 KB and 65 KB respectively. The files are to be stored on a sequential device in such a way that optimizes access time. In what order should the files be stored ?(A) F5, F2, F1, F3, F6, F4(B) F4, F6, F3, F1, F2, F5(C) F1, F2, F3, F4, F5, F6(D) F6, F5, F4, F3, F2, F1 |
| Answer» | |
| 4. |
Which module gives control of the CPU to the process selected by the short – term schedular ?(A) Dispatcher(B) Interrupt(C) Schedular(D) Threading |
| Answer» | |
| 5. |
Consider the graph given below :Use Kruskal’s algorithm to find a minimal spanning tree for the graph. The List of the edgesof the tree in the order in which they are chosen is ?(A) AD, AE, AG, GC, GB, BF(B) GC, GB, BF, GA, AD, AE(C) GC, AD, GB, GA, BF, AE(D) AD, AG, GC, AE, GB, BF |
| Answer» | |
| 6. |
Two atomic operations permissible on Semaphores are __________ and __________.(A) wait, stop(B) wait, hold(C) hold, signal(D) wait, signal |
| Answer» | |
| 7. |
How many distinguishable permutations of the letters in the word BANANA are there ?(A) 720(B) 120(C) 60(D) 360 |
| Answer» | |
| 8. |
Find the boolean product A⊙B of the two matrices.(A) (1)(B) (2)(C) (3)(D) (4) |
| Answer» | |
| 9. |
Negation of the proposition is:(A) (1)(B) (2)(C) (3)(D) (4) |
| Answer» | |
| 10. |
Let G be an undirected connected graph with distinct edge weight. Let Emax be the edge with maximum weight and Emin the edge with minimum weight. Which of the following statements is false?(A) Every minimum spanning tree of G must contain Emin.(B) If Emax is in minimum spanning tree, then its removal must disconnect G.(C) No minimum spanning tree contains Emax(D) G has a unique minimum spanning tree. |
| Answer» | |
| 11. |
Consider the following program fragment in assembly language :mov ax, 0hmov cx, 0A hdoloop :dec axloop doloopWhat is the value of ax and cx registers after the completion of the doloop ?(A) ax=FFF5 h and cx=0 h(B) ax=FFF6 h and cx=0 h(C) ax=FFF7 h and cx=0A h(D) ax=FFF5 h and cx=0A h |
| Answer» | |
| 12. |
Consider the following assembly program fragment :stcmov al, 11010110bmov cl, 2rcl al, 3rol al, 4shr al, clmul clThe contents of the destination register ax (in hexadecimal) and the status of Carry Flag (CF) after the execution of above instructions, are:(A) ax=003CH; CF=0(B) ax=001EH; CF=0(C) ax=007BH; CF=1(D) ax=00B7H; CF=1 |
| Answer» | |
| 13. |
The following numbers are inserted into an empty binary search tree in the given order:10, 1, 3, 5, 15, 12, 16What is the height of the binary search tree ?(A) 3(B) 4(C) 5(D) 6 |
| Answer» | |
| 14. |
Match the following with respect to RDBMS :(A) (1)(B) (2)(C) (3)(D) (4) |
| Answer» | |
| 15. |
Which of the following regular expressions, each describing a language of binary numbers (MSB to LSB) that represents non-negative decimal values, does not include even values ?(A) 0*1+0*1*(B) 0*1*0+1*(C) 0*1*0*1+(D) 0+1*0*1* |
| Answer» | |
| 16. |
Consider an array representation of an n element binary heap where the elements are stored from index 1 to index n of the array. For the element stored at index i of the array (i<=n), the index of the parent is:(A) floor ((i+1)/2)(B) ceiling ((i+1)/2)(C) floor (i/2)(D) ceiling (i/2) |
| Answer» | |
| 17. |
In RDBMS, different classes of relations are created using __________ technique to prevent modification anomalies.(A) Functional Dependencies(B) Data integrity(C) Referential integrity(D) Normal Forms |
| Answer» | |
| 18. |
Which of the following statements is/are TRUE ?(i) The grammar S → SS | a is ambiguous (where S is the start symbol).(ii) The grammar S → 0S1 | 01S | e is ambiguous (the special symbol e represents the empty string and S is the start symbol).(iii) The grammar (where S is the start symbol).S → T/UT → x S y ? xy ? eU → yTgenerates a language consisting of the string yxxyy.(A) Only (i) and (ii) are TRUE(B) Only (i) and (iii) are TRUE(C) Only (ii) and (iii) are TRUE(D) All of (i), (ii) and (iii) are TRUE |
| Answer» None | |
| 19. |
In SQL, __________ is an Aggregate function.(A) SELECT(B) CREATE(C) AVG(D) MODIFY |
| Answer» | |
| 20. |
__________ SQL command changes one or more fields in a record.(A) LOOK-UP(B) INSERT(C) MODIFY(D) CHANGE |
| Answer» | |
| 21. |
Match the description of several parts of a classic optimizing compiler in List – I, with the names of those parts in List – II:(A) (1)(B) (2)(C) (3)(D) (4) |
| Answer» | |