Related InterviewSolutions

• 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
• Choose the opposite word for ‘Paradox’Note – This question is multiple select questions (MSQ).(A) normality(B) certainty(C) axiom
• 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.
• 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
• 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
• 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
• 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
• 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.
• 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.
• 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.