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 statements is/are TRUE regarding JAVA ?(a) Constants that cannot be changed are declared using the ‘static’ keyword.(b) A class can only inherit one class but can implement multiple interfaces.(A) Only (a) is TRUE.(B) Only (b) is TRUE.(C) Both (a) and (b) are TRUE.(D) Neither (a) nor (b) are TRUE. |
| Answer» | |
| 2. |
What is the output of the following JAVA program ?Class Test {public static void main(String[] args) {Test obj = new Test();obj.start();}void start() {String stra = ”do”;String strb = method(stra);System.out.print(“: ”+stra + strb);}String method(String stra) {stra = stra + ”good”;System.out.print(stra);return“ good”;}}(A) dogood : dogoodgood(B) dogood : gooddogood(C) dogood : dodogood(D) dogood : dogood |
| Answer» | |
| 3. |
Which of the following statements is/are TRUE ?(a) In HTML, character entities are used to incorporate external content into a web page, such as images.(b) Once a web server returns a cookie to a browser, the cookie will be included in all future requests from the browser to the same server.(A) Only (a) is TRUE.(B) Only (b) is TRUE.(C) Both (a) and (b) are TRUE.(D) Neither (a) nor (b) is TRUE. |
| Answer» | |
| 4. |
In 8085 microprocessor the address bus is of __________ bits.(A) 4(B) 8(C) 16(D) 32 |
| Answer» | |
| 5. |
If a file consisting of 50,000 characters takes 40 seconds to send, then the data rate is __________.(A) 1 kbps(B) 1.25 kbps(C) 2 kbps(D) 10 kbps |
| Answer» None | |
| 6. |
A micro-instruction format has micro-ops field which is divided into three subfields F1, F2, F3 each having seven distinct micro-operations, condition field CD for four status bits, branch field BR having four options used in conjunction with address field ADF. The address space is of 128 memory locations. The size of micro-instruction is:(A) 17(B) 20(C) 24(D) 32 |
| Answer» | |
| 7. |
Consider the following four schedules due to three transactions (indicated by the subscript) using read and write on a data item X, denoted by r(X) and w(X) respectively. Which one of them is conflict serializable ?S1: r1(X); r2(X); w1(X); r3(X); w2(X)S2: r2(X); r1(X); w2(X); r3(X); w1(X)S3: r3(X); r2(X); r1(X); w2(X); w1(X)S4: r2(X); w2(X); r3(X); r1(X); w1(X)(A) S1(B) S2(C) S3(D) S4 |
| Answer» | |
| 8. |
Suppose a database schedule S involves transactions T1, T2, ………….,Tn. Consider the precedence graph of S with vertices representing the transactions and edges representing the conflicts. If S is serializable, which one of the following orderings of the vertices of the precedence graph is guaranteed to yield a serial schedule ?(A) Topological order(B) Depth – first order(C) Breadth – first order(D) Ascending order of transaction indices |
| Answer» | |
| 9. |
If every non-key attribute is functionally dependent on the primary key, then the relation is in __________ .(A) First normal form(B) Second normal form(C) Third normal form(D) Fourth normal form |
| Answer» | |
| 10. |
Consider a relation R (A, B, C, D, E, F, G, H), where each attribute is atomic, and following functional dependencies exist.CH → GA → BCB → CFHE → AF → EGThe relation R is __________ .(A) in 1NF but not in 2NF(B) in 2NF but not in 3NF(C) in 3NF but not in BCNF(D) in BCNF |
| Answer» | |
| 11. |
User level threads are threads that are visible to the programmer and are unknown to the kernel. The operating system kernel supports and manages kernel level threads. Three different types of models relate user and kernel level threads.Which of the following statements is/are true ?(a)(i) The Many – to – one model maps many user threads to one kernel thread(ii) The one – to – one model maps one user thread to one kernel thread(iii) The many – to – many model maps many user threads to smaller or equal kernel threads(b)(i) Many – to – one model maps many kernel threads to one user thread(ii) One – to – one model maps one kernel thread to one user thread(iii) Many – to – many model maps many kernel threads to smaller or equal user threads(A) (a) is true; (b) is false(B) (a) is false; (b) is true(C) Both (a) and (b) are true(D) Both (a) and (b) are false |
| Answer» | |
| 12. |
Suppose we want to download text documents at the rate of 100 pages per second. Assume that a page consists of an average of 24 lines with 80 characters in each line. What is the required bit rate of the channel?(A) 192 kbps(B) 512 kbps(C) 1.248 Mbps(D) 1.536 Mbps |
| Answer» None | |
| 13. |
Given two relations R1(A, B) and R2(C, D), the result of following querySelect distinct A, Bfrom R1, R2is guaranteed to be same as R1 provided one of the following condition is satisfied.(A) R1 has no duplicates and R2 is empty.(B) R1 has no duplicates and R2 is non – empty.(C) Both R1 and R2 have no duplicates.(D) R2 has no duplicates and R1 is non – empty. |
| Answer» | |
| 14. |
Consider a system with five processes P0 through P4 and three resource types A, B and C. Resource type A has seven instances, resource type B has two instances and resource type C has six instances suppose at time T0we have the following allocation.If we implement Deadlock detection algorithm we claim that system is __________.(1) Semaphore(2) Deadlock state(3) Circular wait(4) Not in deadlock state(A) (1), (2) and (3)(B) (1) and (3)(C) (3) and (4)(D) Only option (4) |
| Answer» | |
| 15. |
“If X, then Y unless Z” is represented by which of the following formulae in propositional logic?(A) (X ∧ Y) → ¬ Z(B) (X ∧ ¬ Z) → Y(C) X → (Y ∧ ¬ Z)(D) Y → (X ∧ ¬ Z) |
| Answer» | |
| 16. |
Which of the following statements is not correct?(A) Every recursive language is recursively enumerable.(B) L = {0n1n 0n │n=1, 2 , 3, ….} is recursively enumerable.(C) Recursive languages are closed under intersection.(D) Recursive languages are not closed under intersection. |
| Answer» | |
| 17. |
Consider the following two well-formed formulas in prepositional logic.F1 : P ⇒ ¬ PF2 : (P ⇒ ¬ P) ∨ (¬ P ⇒ P)Which of the following statements is correct?(A) F1 is Satisfiable, F2 is valid(B) F1 is unsatisfiable, F2 is Satisfiable(C) F1 is unsatisfiable, F2 is valid(D) F1 and F2 both are Satisfiable |
| Answer» | |
| 18. |
Standard planning algorithms assume environment to be __________.(A) Both deterministic and fully observable(B) Neither deterministic nor fully observable(C) Deterministic but not fully observable(D) Not deterministic but fully observable |
| Answer» | |
| 19. |
Context free grammar is not closed under:(A) Concatenation(B) Complementation(C) Kleene Star(D) Union |
| Answer» | |
| 20. |
Consider the following languages:L1 = {am bn │ m ≠ n}L2 = {am bn │ m = 2n+1}L3 = {am bm │ m ≠ 2n}Which one of the following statement is correct ?(A) Only L1 and L2 are context free languages(B) Only L1 and L3 are context free languages(C) Only L2 and L3 are context free languages(D) L1, L2 and L3 are context free languages |
| Answer» | |
| 21. |
A text is made up of the characters a, b, c, d, e each occurring with the probability 0.11, 0.40, 0.16, 0.09 and 0.24 respectively. The optimal Huffman coding technique will have the average length of:(A) 2.40(B) 2.16(C) 2.26(D) 2.15 |
| Answer» None | |
| 22. |
Consider a disk queue with requests for I/O to blocks on cylinders 98, 183, 37, 122, 14, 124, 65, 67. Suppose SSTF disk scheduling algorithm implemented to meet the requests then the total number of head movements are __________ if the disk head is initially at 53.(A) 224(B) 248(C) 236(D) 240 |
| Answer» | |