Q3. Consider two relations R1(A,B) with the tuples (1.5), (3,7) and R2 (A,C) = (1,7), (4,9).
Assume that R(A,B,C) is the full natural outer join of R1 and R2 . Consider the following
tuples of the form (A,B,C): a = (1.5,null), b = (1,null,7) c = (3,null,9), d = (4,7,null), e = (1,5,7), f = (3,7,null), g = (4,null,9).
Which one of the following statements is correct?
Q4.A graph is self-complementary if it is isomorphic to its complement For all self-complementary
graphs on n vertices, n is
Answer : Option DExplaination / Solution:
An n vertex self complementary graph has exactly half number of edges of the complete
graph i.e., n(n-1)/4 edges. Since n(n-1) must be divisible by 4 , n must be congruent to 0 or
1 module 4.
Q6. A queue is implemented using an array such that ENQUEUE and DEQUEUE operations are
performed efficiently. Which one of the following statements is CORRECT (n refers to the
number of items in the queue)?
Answer : Option AExplaination / Solution: No Explaination.
Q8. Let G be a weighted connected undirected graph with distinct positive edge weights. If every edge weight is increased by the same value, then which of the following statements is/are TRUE?
P: Minimum spanning tree of G does not change Q: Shortest path between any pair of vertices does not change
Answer : Option AExplaination / Solution: No Explaination.