Tag Archives: GATE-CS-2010

GATE | GATE CS 2010 | Question 65December 23, 2013

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 »

GATE | GATE CS 2010 | Question 64

5 skilled workers can build a wall in 20 days: 8 semi-skilled workers can build a wall in 25 days; 10 unskilled workers can build… Read More »

GATE | GATE CS 2010 | Question 65

If 137 + 276 = 435 how much is 731 + 672? (A) 534 (B) 1403 (C) 1623 (D) 1513 Answer: (C) Explanation: If we… Read More »

GATE | GATE CS 2010 | Question 62

Modern warfare has changed from large scale clashes of armies to suppression of civilian populations. Chemical agents that do their work silently appear to be… Read More »

GATE | GATE CS 2010 | Question 61

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 »

GATE | GATE CS 2010 | Question 60

The question below consists of a pair of related words followed by four pairs of words. Select the pair that best expresses the relation in… Read More »

GATE | GATE CS 2010 | Question 59

25 persons are in a room. 15 of them play hockey, 17 of them play football and 10 of them play both hockey and football.… Read More »

GATE | GATE CS 2010 | Question 58

Choose the most appropriate word from the options given below to complete the following sentence: If we manage to ____________ our natural resources, we would… Read More »

GATE | GATE CS 2010 | Question 57

Which of the following options is closest in meaning to the word Circuitous. (A) cyclic (B) indirect (C) confusing (D) crooked Answer: (B) Explanation: See http://www.thefreedictionary.com/circuitousQuiz… Read More »

GATE | GATE CS 2010 | Question 56

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 »

GATE | GATE CS 2010 | Question 55

Consider the data given in above question. Suppose the weights of all unused links in the previous question are changed to 2 and the distance… Read More »

GATE | GATE CS 2010 | Question 54

Consider a network with 6 routers R1 to R6 connected with links having weights as shown in the following diagram All the routers use the… Read More »

GATE | GATE CS 2010 | Question 53

Consider the data given in above question. How many different insertion sequences of the key values using the same hash function and linear probing will… Read More »

GATE | GATE CS 2010 | Question 52

A hash table of length 10 uses open addressing with hash function h(k)=k mod 10, and linear probing. After inserting 6 values into an empty… Read More »

GATE | GATE CS 2010 | Question 51

In the graph given in above question, what is the minimum possible weight of a path P from vertex 1 to vertex 2 in this… Read More »