G is a graph on n vertices and 2n – 2 edges. The edges of G can be partitioned into two edge-disjoint spanning trees. Which… Read More

The minimum number of comparisons required to determine if an integer appears more than n/2 times in a sorted array of n integers is (A)… Read More

Consider the following relational schema:   Suppliers(sid:integer, sname:string, city:string, street:string) Parts(pid:integer, pname:string, color:string) Catalog(sid:integer, pid:integer, cost:real) Consider the following relational query on the above database:   SELECT… Read More

Let L = L1∩L2, where L1 and L2 are languages as defined below: L1 = {am bm can bn | m, n >= 0} L2… Read More

The running time of an algorithm is represented by the following recurrence relation: if n <= 3 then T(n) = n else T(n) = T(n/3)… Read More

Which one of the following is TRUE for any simple connected undirected graph with more than 2 vertices? (A) No two vertices have the same… Read More

Given digits 2, 2, 3, 3, 3, 4, 4, 4, 4 how many distinct 4 digit numbers greater than 3000 can be formed? (A) 50… Read More

Hari(H), Gita(G), Irfan(I) and Saira(S) are siblings (i.e., brothers and sisters). All were born on 1st January. The age difference between any two successive siblings… Read More

Choose the most appropriate word from the options given below to the complete the following sentence: His rather casual remarks on politics ___________ his lack… Read More

The weight of a sequence a0, a1, …, an-1 of real numbers is defined as a0+a1/2+…+ aa-1/2n-1. A subsequence of a sequence is obtained by deleting… Read More

What is the probability that divisor of 1099 is a multiple of 1096? (A) 1/625 (B) 4/625 (C) 12/625 (D) 16/625 Answer: (A) Explanation: Following… Read More

Consider the methods used by processes P1 and P2 for accessing their critical sections whenever needed, as given below. The initial values of shared boolean… Read More