## GATE | GATE 2017 MOCK II | Question 27

Find the maximum value of the expression (x+y+k) where (x,y) satisfies the equation (x-2)2 + (y-3)2 = 25 (A) (5+k) + 5√2 (B) 5+k (C)… Read More »

Reads text from a character-input stream, buffering characters so as to provide for the efficient reading of characters, arrays, and lines. The buffer size may… Read More »

## GATE | GATE 2017 MOCK II | Question 26

Consider the following instance of knapsack problem: The maximum weight of 12 is allowed in the knapsack. Find the value of maximum profit with the… Read More »

## GATE | GATE 2017 MOCK II | Question 25

Given a hash table with n keys and m slots with simple uniform hashing. If collisions are resolved by chaining then what is the probability… Read More »

## GATE | GATE 2017 MOCK II | Question 24

Let f(n) = Σ [(log(n/2i) +100] where i limits from 0 to k, and n = 2k. Find the time complexity of f(n). (A) θ(n)… Read More »

## GATE | GATE 2017 MOCK II | Question 23

Considering the data given in the previous question, if the stack A had 4 entries, then the number of possible permutations that can be printed… Read More »

## GATE | GATE 2017 MOCK II | Question 22

Linked Questions 22-23 Stack A has the entries as following sequence a, b, c (with ‘a’ on top), stack B is empty, as shown in… Read More »

## GATE | GATE 2017 MOCK II | Question 21

Which data structure would be the most appropriate to implement a collection of values with the following three characteristics? i) Items are retrieved and removed… Read More »

## GATE | GATE 2017 MOCK II | Question 20

Consider the following statements: S1 : DFS of a directed graph always produces the same number of edges in the traversal, irrespective of the starting… Read More »

## GATE | GATE 2017 MOCK II | Question 19

Consider the following pseudo code. x = 0; for (i = 1 to n) for (j = 1 to 4i – 3) x = x… Read More »

## GATE | GATE 2017 MOCK II | Question 18

Let X and Y be the integers representing the number of simple graphs possible with 3 labeled vertices and 3 unlabeled vertices respectively. Let X… Read More »

## GATE | GATE 2017 MOCK II | Question 17

Consider the case: f(n) = O(g(n)). Then, following two statements are claimed to be inferred from the above case. Statement I: 2f(n) = O(2g(n)) Statement… Read More »

## GATE | GATE 2017 MOCK II | Question 16

Consider the following statements about Bellman ford algorithm for finding shortest path in a directed connected graph G having integral edge weights. Statement I: It… Read More »