Related InterviewSolutions

• Let G be an undirected complete graph on n vertices, where n > 2. Then, the number of different Hamiltonian cycles in G is equal to(A) n!(B) n – 1!(C) 1(D) (n-1)! / 2
• Consider the following two statements about database transaction schedules:I. Strict two-phase locking protocol generates conflict serializable schedules that are also recoverable.II. Timestamp-ordering concurrency control protocol with Thomas’ Write Rule can generate view serializable schedules that are not conflict serializable.Which of the above statements is/are TRUE?(A) I only(B) II only(C) Both I and II(D) Neither I nor II
• Let G be an arbitrary group. Consider the following relations on G:R1: ∀a, b ∈ G, aR1b if and only if ∃g ∈ G such that a = g−1bgR2: ∀a, b ∈ G, aR2b if and only if a = b−1Which of the above is/are equivalence relation/relations?(A) R1 and R2(B) R1 only(C) R2 only(D) Neither R1 nor R2
• Consider the following C program:#include <stdio.h>int main() {float sum = 0.0, j = 1.0, i = 2.0;while (i / j > 0.0625) {j = j + j;printf("%f\n", sum);};return 0;}The number of times variable sum will be printed When the above program is executed is _________ .Note: This was Numerical Type question.(A) 5(B) 6(C) 4(D) 0
• Consider the following C program:#include<stdio.h>int main() {int a[] = {2, 4, 6, 8, 10};int i, sum = 0, *b = a + 4;for (i = 0; i < 5; i++ )sum = sum + (*b - i) - *(b - i);printf("%d\n", sum);return 0;}The output of above C program is __________ .Note: This was Numerical Type question.(A) 10(B) 8(C) 6(D) 3
• If L is a regular language over ∑ = {a, b}, which one of the following languages is NOT regular?(A) L⋅ LR {xy ⏐ x ∈ L, yR∈ L}(B) Suffix (L) = {y ∈ ∑* ⏐ ∃x ∈ ∑* such that xy ∈ L}(C) Prefix (L) = {x ∈ ∑* ⏐ ∃y ∈ ∑* such that xy ∈ L}(D) {wwR ⏐ w ∈ L}
• A relational database contains two tables Student and Performance as shown below:The primary key of the Student table is Roll_no. For the Performance table, the columns Roll_no. and Subject_code together from the primary key. Consider the SQL query given below:SELECT S.Student_name, sum(P.Marks)FROM Student S, Performance PWHERE P.Marks > 84GROUP BY S.Student_name;The number of rows returned by the above SQL query is _________ .Note: This was Numerical Type question.(A) 5(B) 4(C) 3(D) None of these.
• Consider a sequence of 14 elements: A = [-5, -10, 6, 3, -1, -2, 13, 4, -9, -1, 4, 12, -3, 0]. The subsequence sum . Determine the maximum of S(i,j), where 0 ≤ i ≤ j < 14. (Divide and conquer approach may be used)Note: This was Numerical Type question.(A) 29(B) 19(C) 39(D) 09
• Consider the following C program:void convert(int n) {if (n < 0)printf(“ % d”, n);else {convert(n / 2);printf(“ % d”, n % 2);}}Which one of the following will happen when the function convert is called with any positive integer n as argument?(A) It will print the binary representation of n in the reverse order and terminate.(B) It will print the binary representation of n but will not terminate(C) It will not print anything and will not terminate.(D) It will print the binary representation of n and terminate.
• Suppose that in an IP-over-Ethernet network, a machine X wishes to find the MAC address of another machine Y in its subnet. Which one of the following techniques can be used for this?(A) X sends an ARP request packet with broadcast IP address in its local subnet(B) X sends an ARP request packet to the local gateway’s MAC address which then finds the MAC address of Y and sends to X(C) X sends an ARP request packet with broadcast MAC address in its local subnet(D) X sends an ARP request packet to the local gateway’s IP address which then finds the MAC address of Y and sends to X