## GATE | GATE MOCK 2017 | Question 25

Consider the following C code: int A; int main() { for(int i=1; i < 100 ; i++) for(int j=1; j < 100;j++) A[i][j] = (i/j)*(j/i);… Read More »

## GATE | GATE MOCK 2017 | Question 24

If Kruskal’s algorithm is used for finding a minimum spanning tree of a weighted graph G with n vertices and m edges and edge weights… Read More »

## GATE | GATE MOCK 2017 | Question 23

Consider a sorted array of n numbers. What would be the time complexity of the best known algorithm to find a pair ‘a’ and ‘b’… Read More »

## GATE | GATE MOCK 2017 | Question 22

What will be the output produced by the following C code: int main() { int array; printf(“%d”,( (array == *array) && (*array == array) ));… Read More »

## GATE | GATE MOCK 2017 | Question 21

Consider a directed graph with n vertices and m edges such that all edges have same edge weights. Find the complexity of the best known… Read More »

## GATE | GATE MOCK 2017 | Question 20

(A) A (B) B (C) C (D) D Answer: (A) Explanation: Quiz of this Question My Personal Notes arrow_drop_up Save

## GATE | GATE MOCK 2017 | Question 19

Suppose a stack is to be implemented with a linked list instead of an array. What would be the effect on the time complexity of… Read More »

## GATE | GATE MOCK 2017 | Question 18

Which of the following statement is false ? (A) Indirect addressing can be used to pass array as a parameter. (B) Complex Instruction Set Computing(CISC)… Read More »

## GATE | GATE MOCK 2017 | Question 17

The complement of the function F = (A + B’)(C’ + D)(B’ + C) is: (A) A’B + CD’ + BC’ (B) AB’ + C’D… Read More »

## GATE | GATE MOCK 2017 | Question 16

The Boolean function f implemented in the figure shown below, using two input multiplexers is: (A) AB’C + ABC’ (B) A’B’C + A’BC’ (C) A’BC… Read More »

## GATE | GATE MOCK 2017 | Question 15

The initial state of a mod 10 up counter is 1000. What would be the state after 54 clock pulses? (A) 1000 (B) 0001 (C)… Read More »

## GATE | GATE MOCK 2017 | Question 14

(A) 1 (B) 2 (C) 3 (D) 0 Answer: (D) Explanation: It is echelon form. Rank of Q = 2 < n-1 We know that… Read More »

## GATE | GATE MOCK 2017 | Question 13

Let A = {a, b, c, d }, B = { p, q, r, s } denote sets. R : A –> B, R is… Read More »

## GATE | GATE MOCK 2017 | Question 12

Which of the below given sorting techniques has highest best-case runtime complexity. (A) Quick sort (B) Selection sort (C) Insertion sort (D) Bubble sort Answer:… Read More »

## GATE | GATE MOCK 2017 | Question 11

Find the Integral value of f(x) = x * sinx within the limits 0, π. (A) π (B) 2π (C) π/2 (D) 0 Answer: (A)… Read More »