GATE CSE 2017 Set 1 | GATE CSE Year Wise Previous Years Questions

GATE CSE 2017 Set 1

MCQ (Single Correct Answer)

-0.33

Consider the following table :

Algorithms	Design Paradigms
(P) Kruskal	(ii) Greedy
(Q) Quicksort	(i) Divide and Conquer
(R) Floyd–Warshall	(iii) Dynamic Programming

Match the algorithms to the design paradigms they are based on.

$(\mathrm{P}) \leftrightarrow$ (ii), $\quad(\mathrm{Q}) \leftrightarrow$ (iii), (R) $\leftrightarrow$ (i)

$(\mathrm{P}) \leftrightarrow$ (iii), (Q) $\leftrightarrow$ (i), $\quad$ (R) $\leftrightarrow$ (ii)

$(\mathrm{P}) \leftrightarrow$ (ii), $\quad(\mathrm{Q}) \leftrightarrow$ (i), $\quad(\mathrm{R}) \leftrightarrow$ (iii)

$(\mathrm{P}) \leftrightarrow$ (i),$\quad(\mathrm{Q}) \leftrightarrow$ (ii), $\quad(\mathrm{R}) \leftrightarrow$ (iii)

GATE CSE 2017 Set 1

MCQ (Single Correct Answer)

-0.3

A sender S sends a message m to receiver R, which is digitally signed by S with its private key. In this scenario, one or more of the following security violations can take place.

I. S can launch a birthday attack to replace m with a fraudulent message.
II. A third party attacker can launch a birthday attack to replace m with a fraudulent message.
III. R can launch a birthday attack to replace m with a fraudulent message.

Which of the following are possible security violations?

I and II only

I only

II only

II and III only

GATE CSE 2017 Set 1

MCQ (Single Correct Answer)

-0.33

Let $T$ be a binary search tree with 15 nodes. The minimum and maximum possible heights of $T$ are :

Note : The height of a tree with a single node is 0.

4 and 15 respectively

3 and 14 respectively

4 and 14 respectively

3 and 15 respectively

GATE CSE 2017 Set 1

MCQ (Single Correct Answer)

-0.33

The $n$-bit fixed-point representation of an unsigned real number $X$ uses $f$ bits for the fraction part. Let $i=n-f$. The range of decimal values for $X$ in this representation is

$2^{-f}$ to $2^i$

$2^{-f}$ to $\left(2^i-2^{-f}\right)$

0 to $2^i$

0 to $\left(2^i-2^{-f}\right)$

PREVIOUS NEXT

GATE CSE Papers

2025