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 program :#include <stdio.h>main( ){ int i, inp; float x, term=1, sum=0; scanf(“%d %f ”, & inp, &x); for(i=1; i<=inp; i++) { term = term * x/i; sum = sum + term ; } printf(“Result = %f\n”, sum);}The program computes the sum of which of the following series?(A) x + x2/2 + x3/3 + x4/4 +...(B) x + x2/2! + x3/3! + x4/4! +...(C) 1 + x2/2 + x3/3 + x4/4 +...(D) 1 + x2/2! + x3/3! + x4/4! +... |
| Answer» | |
| 2. |
Which of the following property/ies a Group G must hold, in order to be an Abelian group?(a)The distributive property(b)The commutative property(c)The symmetric propertyCodes:(A) (a) and (b)(B) (b) and (c)(C) (a) and (b)(D) (a), (b) and (c) |
| Answer» | |
| 3. |
Consider the compound propositions given below as:(a)p ∨ ~(p ∧ q)(b)(p ∧ ~q) ∨ ~(p ∧ q)(c)p ∧ (q ∨ r)Which of the above propositions are tautologies?(A) (a) and (c)(B) (b) and (c)(C) (a) and (b)(D) only (a) |
| Answer» | |
| 4. |
Which of the following statement(s) is/are false ?(a) A connected multigraph has an Euler Circuit if and only if each of its vertices has even degree.(b) A connected multigraph has an Euler Path but not an Euler Circuit if and only if it has exactly two vertices of odd degree.(c) A complete graph (Kn) has a Hamilton Circuit whenever n ≥ 3.(d)A cycle over six vertices (C6) is not a bipartite graph but a complete graph over 3 vertices is bipartite.Codes:(A) (a) only(B) (b) and (c)(C) (c) only(D) (d) only |
| Answer» | |
| 5. |
A tree with n vertices is called graceful, if its vertices can be labelled with integers 1, 2,….n such that the absolute value of the difference of the labels of adjacent vertices are all different. Which of the following trees are graceful?codes:(A) (a) and (b)(B) (b) and (c)(C) (a) and (c)(D) (a), (b) and (c) |
| Answer» | |
| 6. |
Let P(m, n) be the statement “m divides n” where the Universe of discourse for both the variables is the set of positive integers. Determine the truth values of the following propositions.(a)∃m ∀n P(m, n)(b)∀n P(1, n)(c) ∀m ∀n P(m, n)Codes :(A) (a) – True; (b) – True; (c) – False(B) (a) – True; (b) – False; (c) – False(C) (a) – False; (b) – False; (c) – False(D) (a) – True; (b) – True; (c) – True |
| Answer» | |
| 7. |
Which of the following arguments are not valid ?(a)“If Gora gets the job and works hard, then he will be promoted. If Gora gets promotion, then he will be happy. He will not be happy, therefore, either he will not get the job or he will not work hard”.(b)“Either Puneet is not guilty or Pankaj is telling the truth. Pankaj is not telling the truth, therefore, Puneet is not guilty”.(c)If n is a real number such that n>1, then n2>1. Suppose that n2>1, then n>1.Codes :(A) (a) and (c)(B) (b) and (c)(C) (a), (b) and (c)(D) (a) and (b) |
| Answer» | |
| 8. |
Consider the graph given below:The two distinct sets of vertices, which make the graph bipartite are:(A) (v1, v4, v6); (v2, v3, v5, v7, v8)(B) (v1, v7, v8); (v2, v3, v5, v6)(C) (v1, v4, v6, v7); (v2, v3, v5, v8)(D) (v1, v4, v6, v7, v8); (v2, v3, v5) |
| Answer» | |
| 9. |
A relation R = {A, B, C, D, E, F,G} is given with following set of functional dependencies:F = {AD → E, BE → F, B → C, AF → G}Which of the following is a candidate key ?(A) A(B) AB(C) ABC(D) ABD |
| Answer» | |
| 10. |
Data which improves the performance and accessibility of the database are called:(A) Indexes(B) User Data(C) Application Metadata(D) Data Dictionary |
| Answer» | |
| 11. |
3. Which of the following is/are not true?(a)The set of negative integers is countable.(b)The set of integers that are multiples of 7 is countable.(c)The set of even integers is countable.(d)The set of real numbers between 0 and ½ is countable.(A) (a) and (c)(B) (b) and (d)(C) (b) only(D) (d) only |
| Answer» | |
| 12. |
match the following datbas terms to their function:(A) (1)(B) (2)(C) (3)(D) (4) |
| Answer» | |
| 13. |
Loop unrolling is a code optimization technique:(A) that avoids tests at every iteration of the loop.(B) that improves performance by decreasing the number of instructions in a basic block.(C) that exchanges inner loops with outer loops(D) that reorders operations to allow multiple computations to happen in parallel |
| Answer» | |
| 14. |
A three dimensional array in ‘C’ is declared as int A[x][y][z]. Consider that array elements are stored in row major order and indexing begins from 0. Here, the address of an item at the location A[p][q][r] can be computed as follows (where w is the word length of an integer):(A) &A[0][0][0] + w(y * z * q + z * p + r)(B) &A[0][0][0] + w(y * z * p + z*q + r)(C) &A[0][0][0] + w(x * y * p + z * q+ r)(D) &A[0][0][0] + w(x * y * q + z * p + r) |
| Answer» | |
| 15. |
The inorder traversal of the following tree is:(A) 2 3 4 6 7 13 15 17 18 18 20(B) 20 18 18 17 15 13 7 6 4 3 2(C) 15 13 20 4 7 17 18 2 3 6 18(D) 2 4 3 13 7 6 15 17 20 18 18 |
| Answer» | |
| 16. |
An ideal sort is an in-place-sort whose additional space requirement is __________.(A) O (log2 n)(B) O (n log2 n)(C) O (1)(D) O (n) |
| Answer» | |
| 17. |
The number of disk pages access in B – tree search, where h is height, n is the number of keys, and t is the minimum degree, is:(A) θ(logn h * t)(B) θ(logt n * h)(C) θ(logh n)(D) θ(logt n) |
| Answer» | |
| 18. |
Which of the following is not a congestion policy at network layer?(A) Flow Control Policy(B) Packet Discard Policy(C) Packet Lifetime Management Policy(D) Routing Algorithm |
| Answer» | |
| 19. |
In Unix, the login prompt can be changed by changing the contents of the file __________.(A) contrab(B) init(C) gettydefs(D) inittab |
| Answer» | |