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. |
Choose the most appropriate word from the options given below to the complete the following sentence:His rather casual remarks on politics ___________ his lack of seriousness about the subject.(A) masked(B) belied(C) betrayed(D) suppressed |
| Answer» | |
| 2. |
Given digits 2, 2, 3, 3, 3, 4, 4, 4, 4 how many distinct 4 digit numbers greater than 3000 can be formed?(A) 50(B) 51(C) 52(D) 54 |
| Answer» | |
| 3. |
#include<stdio.h>int f(int *a, int n){if(n <= 0) return 0;else if(*a % 2 == 0) return *a + f(a+1, n-1);else return *a - f(a+1, n-1);}int main(){int a[] = {12, 7, 13, 4, 11, 6};printf("%d", f(a, 6));getchar();return 0;}(A) -9(B) 5(C) 15(D) 19 |
| Answer» None | |
| 4. |
A computer system has an L1 cache, an L2 cache, and a main memory unit connected as shown below. The blocksize in L1 cache is 4 words. The blocksize in L2 cache is 16 words. The memory access times are 2 nanoseconds. 20 nanoseconds and 200 nanoseconds for L1 cache, L2 cache and main memory unit respectively.When there is a miss in L1 cache and a hit in L2 cache, a block is transferred from L2 cache to L1 cache. What is the time taken for this transfer?(A) 2 nanoseconds(B) 20 nanoseconds(C) 22 nanoseconds(D) 88 nanoseconds |
| Answer» | |
| 5. |
A main memory unit with a capacity of 4 megabytes is built using 1M × 1-bit DRAM chips. Each DRAM chip has 1K rows of cells with 1K cells in each row. The time taken for a single refresh operation is 100 nanoseconds. The time required to perform one refresh operation on all the cells in the memory unit is:-A.100 nanosecondsB.100×210 nanosecondsC.100×220 nanosecondsD.3200×220 nanoseconds(A) A(B) B(C) C(D) D |
| Answer» | |
| 6. |
Which data structure in a compiler is used for managing information about variables and their attributes?(A) Abstract syntax tree(B) Symbol table(C) Semantic stack(D) Parse Table |
| Answer» | |
| 7. |
P is a 16-bit signed integer. The 2’s complement representation of P is (F87B)16.The 2’s complement representation of 8*P(A) (C3D8)16(B) (187B)16(C) (F878)16(D) (987B)16 |
| Answer» | |
| 8. |
Let w be any string of length n is {0,1}*. Let L be the set of all substrings of w. What is the minimum number of states in a non-deterministic finite automaton that accepts L?(A) n-1(B) n(C) n+1(D) 2n-1 |
| Answer» | |
| 9. |
Which of the following concurrency control protocols ensure both conflict serialzability and freedom from deadlock?I. 2-phase lockingII. Time-stamp ordering(A) I only(B) II only(C) Both I and II(D) Neither I nor II |
| Answer» | |
| 10. |
Suppose the predicate F(x, y, t) is used to represent the statement that person x can fool person y at time t. which one of the statements below expresses best the meaning of the formula ∀x∃y∃t(¬F(x, y, t))?(A) Everyone can fool some person at some time(B) No one can fool everyone all the time(C) Everyone cannot fool some person all the time(D) No one can fool some person at some time |
| Answer» | |
| 11. |
What is the possible number of reflexive relations on a set of 5 elements?(A) 210(B) 215(C) 220(D) 225 |
| Answer» | |
| 12. |
Newton-Raphson method is used to compute a root of the equation x2-13=0 with 3.5 as the initial value. The approximation after one iteration is(A) 3.575(B) 3.676(C) 3.667(D) 3.607 |
| Answer» None | |
| 13. |
Let G = (V,E) be a graph. Define ξ(G) = Σd id x d, where id is the number of vertices of degree d in G. If S and T are two different trees with ξ(S) = ξ(T),then(A) |S| = 2|T|(B) |S| = |T|-1(C) |S| = |T|(D) |S| = |T|+1 |
| Answer» None | |
| 14. |
In a binary tree with n nodes, every node has an odd number of descendants. Every node is considered to be its own descendant. What is the number of nodes in the tree that have exactly one child?(A) 0(B) 1(C) (n-1)/2(D) n-1 |
| Answer» None | |
| 15. |
A 5-stage pipelined processor has Instruction Fetch(IF),Instruction Decode(ID),Operand Fetch(OF),Perform Operation(PO)and Write Operand(WO)stages.The IF,ID,OF and WO stages take 1 clock cycle each for any instruction.The PO stage takes 1 clock cycle for ADD and SUB instructions,3 clock cycles for MUL instruction,and 6 clock cycles for DIV instruction respectively.Operand forwarding is used in the pipeline.What is the number of clock cycles needed to execute the following sequence of instructions? Instruction Meaning of instruction I0 :MUL R2 ,R0 ,R1 R2 ¬ R0 *R1 I1 :DIV R5 ,R3 ,R4 R5 ¬ R3/R4 I2 :ADD R2 ,R5 ,R2 R2 ¬ R5+R2 I3 :SUB R5 ,R2 ,R6 R5 ¬ R2-R6(A) 13(B) 15(C) 17(D) 19 |
| Answer» | |
| 16. |
What does the following program print?#includevoid f(int *p, int *q){p = q;*p = 2;}int i = 0, j = 1;int main(){f(&i, &j);printf("%d %d \n", i, j);getchar();return 0;}(A) 2 2(B) 2 1(C) 0 1(D) 0 2 |
| Answer» None | |
| 17. |
Two alternative packages A and B are available for processing a database having 10k records.Package A requires 0.0001n2 time units and package B requires 10nlog10n time units to process n records. What is the smallest value of k for which package B will be preferred over A?(A) 12(B) 10(C) 6(D) 5 |
| Answer» | |
| 18. |
A relational schema for a train reservation database is given below.Passenger (pid, pname, age)Reservation (pid, class, tid)Table: Passengerpid pname age----------------- 0 Sachin 65 1 Rahul 66 2 Sourav 67 3 Anil 69Table : Reservationpid class tid--------------- 0 AC 8200 1 AC 8201 2 SC 8201 5 AC 8203 1 SC 8204 3 AC 8202What pids are returned by the following SQL query for the above instance of the tables?SELECT pidFROM Reservation ,WHERE class ‘AC’ AND EXISTS (SELECT * FROM Passenger WHERE age > 65 AND Passenger. pid = Reservation.pid)(A) 1, 0(B) 1, 2(C) 1, 3(D) 1, 5 |
| Answer» | |
| 19. |
Consider a B+-tree in which the maximum number of keys in a node is 5. What is the minimum number of keys in any non-root node?(A) 1(B) 2(C) 3(D) 4 |
| Answer» | |
| 20. |
What is the appropriate pairing of items in the two columns listing various activities encountered in a software life cycle? P. Requirements Capture 1.Module Development and IntegrationQ. Design 2.Domain AnalysisR. Implementation 3.Structural and Behavioral ModelingS. Maintenance 4.Performance Tuning(A) P-3, Q-2, R-4, S-1(B) P-2, Q-3, R-1, S-4(C) P-3, Q-2, R-1, S-4(D) P-2, Q-3, R-4, S-1 |
| Answer» | |
| 21. |
The cyclomatic complexity of each of the modules A and B shown below is 10. What is the cyclomatic complexity of the sequential integration shown on the right hand side?(A) 19(B) 21(C) 20(D) 10 |
| Answer» None | |
| 22. |
A system uses FIFO policy for page replacement. It has 4 page frames with no pages loaded to begin with. The system first accesses 100 distinct pages in some order and then accesses the same 100 pages but now in the reverse order. How many page faults will occur?(A) 196(B) 192(C) 197(D) 195 |
| Answer» | |
| 23. |
What is the probability that divisor of 1099 is a multiple of 1096?(A) 1/625(B) 4/625(C) 12/625(D) 16/625 |
| Answer» | |
| 24. |
The degree sequence of a simple graph is the sequence of the degrees of the nodes in the graph in decreasing order. Which of the following sequences can not be the degree sequence of any graph?(I) 7, 6, 5, 4, 4, 3, 2, 1(II) 6, 6, 6, 6, 3, 3, 2, 2(III) 7, 6, 6, 4, 4, 3, 2, 2(IV) 8, 7, 7, 6, 4, 2, 1, 1 (A) I and II(B) III and IV(C) IV only(D) II and IV |
| Answer» | |
| 25. |
Consider the methods used by processes P1 and P2 for accessing their critical sections whenever needed, as given below. The initial values of shared boolean variables S1 and S2 are randomly assigned. Method Used by P1while (S1 == S2) ;Critica1 SectionS1 = S2;Method Used by P2while (S1 != S2) ;Critica1 SectionS2 = not (S1);Which one of the following statements describes the properties achieved?(A) Mutual exclusion but not progress(B) Progress but not mutual exclusion(C) Neither mutual exclusion nor progress(D) Both mutual exclusion and progress |
| Answer» | |