Question 25 Maximum number of edges in a n-node undirected graph without self loops is A n2 B n(n-1)/2 C n-1 D (n+1)(n)/2 Engineering-MathematicsGraph-Theory Question 25 […]
Question 12 Match the following with respect to RDBMS : A (a)-(iii), (b)-(iv), (c)-(i), (d)-(ii) B (a)-(iv), (b)-(iii), (c)-(ii), (d)-(i) C (a)-(iv), (b)-(ii), (c)-(iii), (d)-(i) D […]
Question 2 Consider a system with byte-addressable memory, 32 bit logical addresses, 4 kilobyte page size and page table entries of 4 bytes each. The size […]