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 the following C program :#include <stdio.h>#include <string.h>struct s {int i;char *c;} str[] = {100, "eclasses", 200, "geeks",300, "data",400,"structure",500,"students"};int main(){struct s *p = str;p += 1;printf("%s", p -> c);p--;printf("%s,", ++p -> c);printf(" %d, ", p[1].i);p=p+4;printf("%s", p -> c);}Which of the string(s) will be in the final output of the above C program ?Note – This question is multiple select questions (MSQ).(A) geeksclasses(B) 100(C) students(D) 200 |
| Answer» None | |
| 2. |
Choose the opposite word for ‘Paradox’Note – This question is multiple select questions (MSQ).(A) normality(B) certainty(C) axiom |
| Answer» | |
| 3. |
Which of the following is/are correct regarding uses of should/must/ought to appropriately in the sentences.Note – This question is multiple select questions (MSQ).(A) Must is stronger than should and ought. It is more like an order. Should and ought to, on the other hand, are more like pieces of advice.(B) Must can be used to talk about obligation. It is stronger than should and ought.(C) Should and ought have very similar meanings and can often replace each other. Note that ought is followed by the infinitive with to.(D) We use must in affirmative sentences to say what is necessary and to give strong advice and orders to ourselves or other people. |
| Answer» | |
| 4. |
Consider the following list of the integer:19, 23, 40, 32, 91, 25, 100, 36 Sort this list in increasing order using insertion sort and determine the number of passes, comparisons, and swaps. Here a pass means iteration of main loop. We may assume that we start checking from first element which is 19 here.Note – This question is multiple select questions (MSQ).(A) There will be total 8 passes for all 8 integers(B) Number of comparisons and Swaps for each pass for given sequences to sort in increasing order are 14 and 7 respectively(C) Number of comparisons for each pass for given sequences to sort in increasing order is 7(D) Number of swaps for each pass for given sequences to sort in increasing order is 14 |
| Answer» None | |
| 5. |
There are 5 brothers in a family. All were born at a gap of 3 years. If the sum total of ages of 5 brothers is 100. Which of the following options is/are correct ?Note – This question is multiple select questions (MSQ).(A) Age of 2nd most elder brother is 32(B) Age of youngest brother is 14(C) Difference between age of 2nd most elder brother and age of youngest brother is 9(D) Addition of age of 2nd most elder brother and age of youngest brother is 46 |
| Answer» | |
| 6. |
Which of the following is/are correct ?Note – This question is multiple select questions (MSQ).(A) BFS is vertex-based algorithm while DFS is an edge-based algorithm.(B) Memory space is efficiently utilized in DFS while space utilization in BFS is not effective.(C) BFS is optimal algorithm while DFS is not optimal.(D) None of these |
| Answer» | |
| 7. |
Consider the following Jobs with their deadline and profit:JobDeadlineProfita237b350c137d460e350f280Which of the following is/are correct profit sequence order for given jobs with respective profit and deadlines?Note – This question is multiple select questions (MSQ).(A) b, f, e, d(B) f, d, e, b(C) e, f, b, d(D) None of these |
| Answer» | |
| 8. |
Which of the following choice(s) is/are correct ?Note – This question is multiple select questions (MSQ).(A) If a table has only one candidate key then table can not be in 2 NF.(B) A relation will be in 2NF if it is in 1NF and all non-key attributes are fully functional dependent on the primary key.(C) First Normal Form (1NF) does not eliminate redundancy, but rather, it’s that it eliminates repeating groups.(D) Relation should not have any attribute in Functional Dependency which is non-prime, the attribute that doesn’t occur in any candidate key. |
| Answer» | |
| 9. |
Which of the option(s) is/are correct ?Note – This question is multiple select questions (MSQ).(A) Relation R have attributes {a1, a2, a3,…,an} can have maximum number of super keys are 2(n-1)(B) Relation R have attributes {a1, a2, a3,… ,an} and the candidate key is “a1 a2 a3” then the possible number of super keys are 2(n-3).(C) A relation R(A, B, C, D, E, F, G, H) with set of functional dependencies {CH → G, A → BC, B → CFH, E → A, F → EG} has 120 superkeys.(D) The maximum number of superkeys for the relation schema R(E,F,G,H) with E as the key is 4. |
| Answer» | |
| 10. |
Consider the following data for B-tree and B+ tree,Block size is 8 KB, Data pointer is 10 B, Block pointer is of 15 B and key size is 10 B Which of the following option is correct ?Note – This question is multiple select questions (MSQ).(A) Maximum order of leaf node of B-tree is 230(B) Maximum order of leaf node of B+ tree (Q) is 405(C) Difference of maximum order of leaf node of B-tree (P) and maximum order of leaf node of B+ tree (Q) -175(D) All of these are correct. |
| Answer» None | |
| 11. |
Consider the following statements regarding minimum number of table required in relational algebra for converting ER diagram with cardinality and participation.1. If there are only Partial participations:One-One: 2 Tables, Merge Relation to any of the side.Many-One or One-Many: 2 Tables, Merge Relation to Many side.Many-Many: 3 tables (separate table for relation)2. Any one of the side has full participation:Full participation on Many Side: 2 TablesFull Participation on one side: 1 Table3. Both Side full participations:Always one table irrespective of Cardinality.Note – This question is multiple select questions (MSQ).(A) Statement 1 is correct(B) Statement 2 is correct(C) Statement 3 is correct(D) All 1, 2, and 3 are false. |
| Answer» | |
| 12. |
The following table has two attributes A and C where A is the primary key and C is the foreign key referencing A with on-delete cascade.A C-----4 65 66 57 49 411 78 6 The set of all tuples that must be additionally deleted to preserve referential integrity when the tuple (4,6) is deleted is:Note – This question is multiple select questions (MSQ).(A) (11, 7)(B) (7, 4)(C) (4,6)(D) (9, 4) |
| Answer» | |
| 13. |
A program is called reentrant if it can be interrupted in the middle of its execution, and then be safely called again (“re-entered”) before its previous invocations complete execution. The interruption could be caused by an internal action such as a jump or call, or by an external action such as an interrupt or signal. Once the reentered invocation completes, the previous invocations will resume correct execution.Which of the following program(s) is/are reentrant ?Note – This question is multiple select questions (MSQ).(A)int t;void swap(int *x, int *y){ t = *x; *x = *y; // hardware interrupt might invoke isr() here! *y = t;}void isr(){ int x = 1, y = 2; swap(&x, &y);}(B)int t;void swap(int *x, int *y){ int s; s = t; // save global variable t = *x; *x = *y; // hardware interrupt might invoke isr() here! *y = t; t = s; // restore global variable}void isr(){ int x = 1, y = 2; swap(&x, &y);}(C)void swap(int *x, int *y){ int t = *x; *x = *y; // hardware interrupt might invoke isr() here! *y = t;}void isr(){ int x = 1, y = 2; swap(&x, &y);}(D) None of these |
| Answer» | |
| 14. |
Consider following processes with their arrival time and burst time:Process IDArrival TimeBust TimeP157P229P305P403P518P61525Which of the following option(s) is/are correct using preemptive shortest job first scheduling algorithm and all the time in nanoseconds.Note – This question is multiple select questions (MSQ).(A) Average waiting time is 9.66 ns(B) Completion time of process P2 is 32(C) Turn Round Time of process P5 is 22(D) Total Turn Round Time is 115 |
| Answer» None | |
| 15. |
Which of the following count sequence can be generated using 3 bit JK flip-flops ?Note – This question is multiple select questions (MSQ).(A) 0, 0, 0, 1, 1, 1, 2, 2, 2, 3, 3, 3, 0, 0, 0, …(B) 1, 2, 3, 4, 5, 6, 7, 1, 2, 3, 4, 5, 6, 7, …(C) 0, 4, 6, 7, 3, 2, 0, 0, 4, 6, 7, 3, 2, 0, …(D) All of the above |
| Answer» | |
| 16. |
Which of the following option is True?Note – This question is multiple select questions (MSQ).(A) If the external clock is not connected to the Flip-flop then it is the asynchronous sequential circuit.(B) If the external clock is common to all then it is called a synchronous circuit.(C) Only a few flip-flops are convertible to any other flip-flop.(D) From truth-table, we read the static input of the flip-flop while in excitation table we read dynamic input. |
| Answer» | |
| 17. |
Any set of boolean operators that is sufficient to represent all boolean expression is called complete. Which of the following is/are complete?Note – This question is multiple select questions (MSQ).(A) {→, ↚}(B) {→, ¬}(C) {↑}(D) {^, ∨} |
| Answer» | |
| 18. |
A boolean function f(X,Y,Z) is implemented using 3 x 8 decoder. Where X is LSB and Z is MSB in resulting output. The connection of fan-in is depicted below.Then which of the following option(s) is/are NOT correct?Note – This question is multiple select questions (MSQ).(A) Output function F can be represented by either Σ(1, 2, 4, 5) or π(0, 3, 6, 7)(B) Output function F can be represented by either Σ(0, 3, 6, 7) or π(1, 2, 4, 5)(C) Output function F can be represented by only π(0, 3, 6, 7)(D) Output function F can be represented by only Σ(0, 3, 6, 7) |
| Answer» | |
| 19. |
Consider the following option(s) is/are NOT correct regarding Boolean expressions.Note – This question is multiple select questions (MSQ).(A) A + A’B + A’B’C + A’B’C’D = ABCD(B) If f(A, B, C) = B⊕C, then f(A, B, C)’ = B☉C(C) Dual of (A + B + C)(A’B’)’ = A’B’C’ + A + B(D) None |
| Answer» None | |
| 20. |
A shared variable x, initialized to one, is operated on by four concurrent processes W, X, Y, Z as follows. Each of the processes W and X reads x from memory, increments by one, stores it to memory, and then terminates. Each of the processes Y and Z reads x from memory, decrements by two, stores it to memory, and then terminates. Each process before reading x invokes the P operation (i.e., wait) on a counting semaphore S and invokes the V operation (i.e., signal) on the semaphore S after storing x to memory. Semaphore S is initialized to two. Which of the following set(s) has/have possible value of x after all processes complete execution?Note – This question is multiple select questions (MSQ).(A) {-2, -1, 0, 1, 2}(B) {-3, -2, -1, 0, 1, 2}(C) {-3, -2, -1, 0, 1, 2, 3}(D) {-4, -3, -2, -1, 0, 1, 2} |
| Answer» | |
| 21. |
Which of the above statements are not True?Note – This question is multiple select questions (MSQ).(A) N3/2 < NlogN < NlogN < 2N(B) (logN)2 = log2N(C) logN * logN = log log N(D) N21/30 < N3 < eN < 4N |
| Answer» | |