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. |
Which of the following statement is false?(A) A tree with n nodes has (n-1) edges.(B) A labeled rooted binary tree can be uniquely constructed given its postorder and preorder traversal results.(C) A complete binary tree with n internal nodes has (n+1) leaves.(D) The maximum number of nodes in a binary tree of height h is (2^(h+1) -1). |
| Answer» | |
| 2. |
Let A be a two dimensional array declared as follows:A: array [1 ... 10] [1 ... 15] of integer;Assuming that each integer takes one memory location, the array is stored in row-major order and the first element of the array is stored at location 100, what is the address of the element a[i][j] ?(A) 15i+ j+ 84(B) 15j+ i+ 84(C) 10i+ j+ 89(D) 10j+ i+ 89 |
| Answer» | |
| 3. |
A computer has six tape drives, with n processes competing for them. Each process may need two drives. What is the maximum value of n for the system to be deadlock free?(A) 6(B) 5(C) 4(D) 3 |
| Answer» | |
| 4. |
Suppose we have a database consisting of the following three relations.FREQUENTS(student, parlor) giving the parlors each student visits.SERVES(parlor, ice-cream) indicating what kind of ice-creams each parlor serves.LIKES(student, ice-cream) indicating what ice-creams each parlor serves.(Assuming that each student likes at least one ice-cream and frequents at least one parlor)Express the following in SQL:Print the students that frequent at least one parlor that serves some ice-cream that they like. |
| Answer» None | |
| 5. |
The string 1101 does not belong to the set represented by(A) 110* (0+1)(B) 1(0+1)* 101(C) (10)* (01)* (00+11)*(D) (00+(11)*0)* |
| Answer» | |
| 6. |
Let L be the set of all binary strings whose last two symbols are same. The number of states in the minimal state deterministic finite-state automaton accepting L is(A) 2(B) 5(C) 8(D) 3 |
| Answer» | |
| 7. |
Which of the following is true?(A) Unless enabled, a CPU will not be able to process interrupts.(B) Loop instructions cannot be interrupted till they complete.(C) A processor checks for interrupts before executing a new instruction.(D) Only level triggered interrupts are possible in microprocessors. |
| Answer» | |
| 8. |
Design a synchronous counter to go through the following states:1, 4, 2, 3, 1, 4, 2, 3, 1, 4,……….. |
| Answer» | |
| 9. |
Which of the following statement is false?(A) Every finite subset of a non-regular set is regular(B) Every subset of a regular set is regular(C) Every finite subset of a regular set is regular(D) The intersection of two regular sets is regular |
| Answer» None | |
| 10. |
Which of the following algorithm design technique is used in finding all pairs of shortest distances in a graph?(A) Dynamic programming(B) Backtracking(C) Greedy(D) Divide and Conquer |
| Answer» | |
| 11. |
Give the correct matching for the following pairs:A. O(log n) 1. Selection sortB. O(n) 2. Insertion sortC. O(nlog n) 3. Binary searchD. O(n^2) 4. Merge sortcodes: A B C Da. 3 1 2 4b. 3 1 4 2c. 1 3 4 2d. 1 4 3 2(A) a(B) b(C) c(D) d |
| Answer» | |
| 12. |
In serial communications employing 8 data bits, a parity bit and 2 stop bits, the minimum band rate required to sustain a transfer rate of 300 characters per second is(A) 2400 band(B) 19200 band(C) 4800 band(D) 1200 band |
| Answer» | |
| 13. |
The octal representation of an integer is (342)8. If this were to be treated as an eight bit integer in an 8085 based computer, its decimal equivalent is(A) 226(B) -98(C) 76(D) -30 |
| Answer» | |
| 14. |
Which of the following devices should get higher priority in assigning interrupts?(A) Hard disk(B) Printer(C) Keyboard(D) Floppy disk |
| Answer» | |
| 15. |
Which of the following addressing modes permits relocation without any change whatsoever in the code?(A) Indirect addressing(B) Indexed addressing(C) Base register addressing(D) PC relative addressing |
| Answer» | |