Search results for 2018 / GATE Overflow for GATE CSE

67 votes

14 answers

1

GATE CSE 2018 | Question: 46
The number of possible min-heaps containing each value from $\{1,2,3,4,5,6,7\}$ exactly once is _______

The number of possible min-heaps containing each value from $\{1,2,3,4,5,6,7\}$ exactly once is _______

gatecse

39.1k views

gatecse asked Feb 14, 2018

79 votes

7 answers

2

GATE CSE 2018 | Question: 26
Consider a matrix P whose only eigenvectors are the multiples of $\begin{bmatrix} 1 \\ 4 \end{bmatrix}$. Consider the following statements. P does not have an inverse P has a repeated eigenvalue P cannot be diagonalized Which one of the ... III are necessarily true Only II is necessarily true Only I and II are necessarily true Only II and III are necessarily true

Consider a matrix P whose only eigenvectors are the multiples of $\begin{bmatrix} 1 \\ 4 \end{bmatrix}$.Consider the following statements.P does not have an inverseP has ...

gatecse

27.4k views

gatecse asked Feb 14, 2018

41 votes

9 answers

3

GATE CSE 2018 | Question: 22
Consider the sequential circuit shown in the figure, where both flip-flops used are positive edge-triggered $\text{D}$ flip-flops. The number of states in the state transition diagram of this circuit that have a transition back to the same state on some value of "in" is ____

Consider the sequential circuit shown in the figure, where both flip-flops used are positive edge-triggered $\text{D}$ flip-flops.The number of states in the state trans...

gatecse

23.2k views

gatecse asked Feb 14, 2018

37 votes

9 answers

4

GATE CSE 2018 | Question: 14
Consider the following statements regarding the slow start phase of the TCP congestion control algorithm. Note that cwnd stands for the TCP congestion window and MSS window denotes the Maximum Segments Size: The cwnd increases by $2$ MSS on every successful acknowledgment The cwnd ... true Only $\text{(iv)}$ is true Only $\text{(i)}$ and $\text{(iv)}$ are true

Consider the following statements regarding the slow start phase of the TCP congestion control algorithm. Note that cwnd stands for the TCP congestion window and MSS wind...

gatecse

23.4k views

gatecse asked Feb 14, 2018

66 votes

7 answers

5

GATE CSE 2018 | Question: 51
A processor has $16$ integer registers $\text{(R0, R1}, \ldots ,\text{ R15)}$ and $64$ floating point registers $\text{(F0, F1}, \ldots , \text{F63)}.$ It uses a $2\text{- byte}$ instruction format. There are four categories of ... $\text{(1F)}.$ The maximum value of $\text{N}$ is _________.

A processor has $16$ integer registers $\text{(R0, R1}, \ldots ,\text{ R15)}$ and $64$ floating point registers $\text{(F0, F1}, \ldots , \text{F63)}.$ It uses a $2\text{...

gatecse

24.3k views

gatecse asked Feb 14, 2018

34 votes

5 answers

6

GATE CSE 2018 | Question: 24
Consider a system with $3$ processes that share $4$ instances of the same resource type. Each process can request a maximum of $K$ instances. Resources can be requested and releases only one at a time. The largest value of $K$ that will always avoid deadlock is ___

Consider a system with $3$ processes that share $4$ instances of the same resource type. Each process can request a maximum of $K$ instances. Resources can be requested a...

gatecse

21.8k views

gatecse asked Feb 14, 2018

43 votes

8 answers

7

GATE CSE 2018 | Question: 54
Consider an IP packet with a length of $4,500\;\text{bytes}$ that includes a $20\text{-byte}\;\textsf{IPv4}$ header ans $40\text{-byte}$ TCP header. The packet is forwarded to an $\textsf{IPv4}$ router that supports a ... that the fragmentation offset value stored in the first fragment is $0$. The fragmentation offset value stored in the third fragment is ________.

Consider an IP packet with a length of $4,500\;\text{bytes}$ that includes a $20\text{-byte}\;\textsf{IPv4}$ header ans $40\text{-byte}$ TCP header. The packet is forward...

gatecse

19.2k views

gatecse asked Feb 14, 2018

60 votes

8 answers

8

GATE CSE 2018 | Question: 50
The instruction pipeline of a RISC processor has the following stages: Instruction Fetch $(IF)$, Instruction Decode $(ID)$, Operand Fetch $(OF)$, Perform Operation $(PO)$ and Writeback $(WB)$, The $IF$, $ID$, $OF$ and $WB$ ... no data hazards and no control hazards. The number of clock cycles required for completion of execution of the sequence of instruction is _____.

The instruction pipeline of a RISC processor has the following stages: Instruction Fetch $(IF)$, Instruction Decode $(ID)$, Operand Fetch $(OF)$, Perform Operation $(PO)$...

gatecse

23.9k views

gatecse asked Feb 14, 2018

46 votes

5 answers

9

GATE CSE 2018 | Question: 29
#include<stdio.h> void fun1(char* s1, char* s2){ char* temp; temp = s1; s1 = s2; s2 = temp; } void fun2(char** s1, char** s2){ char* temp; temp = *s1; *s1 = *s2; *s2 = temp; } int main(){ char *str1="Hi", *str2 = "Bye"; fun1 ... of the program above is: $\text{Hi Bye Bye Hi}$ $\text{Hi Bye Hi Bye}$ $\text{Bye Hi Hi Bye}$ $\text{Bye Hi Bye Hi}$

#include<stdio.h void fun1(char* s1, char* s2){ char* temp; temp = s1; s1 = s2; s2 = temp; } void fun2(char s1, char s2){ char* temp; temp = *s1; *s1 = *s2; *s2 = temp;...

gatecse

15.1k views

gatecse asked Feb 14, 2018

42 votes

9 answers

10

GATE CSE 2018 | Question: 2
Consider the following C program: #include<stdio.h> struct Ournode{ char x, y, z; }; int main() { struct Ournode p={'1', '0', 'a'+2}; struct Ournode *q=&p; printf("%c, %c", *((char*)q+1), *((char*)q+2)); return 0; } The output of this program is: 0, c 0, a+2 '0', 'a+2' '0', 'c'

Consider the following C program:#include<stdio.h struct Ournode{ char x, y, z; }; int main() { struct Ournode p={'1', '0', 'a'+2}; struct Ournode *q=&p; printf("%c, %c",...

gatecse

20.4k views

gatecse asked Feb 14, 2018

52 votes

6 answers

11

GATE CSE 2018 | Question: 27
Let $N$ be the set of natural numbers. Consider the following sets, $P:$ Set of Rational numbers (positive and negative) $Q:$ Set of functions from $\{0,1\}$ to $N$ $R:$ Set of functions from $N$ to $\{0, 1\}$ $S:$ Set of finite subsets of $N$ Which of the above sets are countable? $Q$ and $S$ only $P$ and $S$ only $P$ and $R$ only $P, Q$ and $S$ only

Let $N$ be the set of natural numbers. Consider the following sets,$P:$ Set of Rational numbers (positive and negative)$Q:$ Set of functions from $\{0,1\}$ to $N$$R:$ Set...

gatecse

22.0k views

gatecse asked Feb 14, 2018

48 votes

4 answers

12

GATE CSE 2018 | Question: 41
Consider the relations $r(A, B)$ and $s(B, C)$, where $s.B$ is a primary key and $r.B$ is a foreign key referencing $s.B$. Consider the query $Q: r \bowtie (\sigma_{B<5} (s))$ Let LOJ denote the natural left outer-join operation. Assume that $r$ and $s$ contain no null ... $r \: LOJ \: (\sigma_{B<5} (s))$ $\sigma_{B<5} (r) \: LOJ \: s$

Consider the relations $r(A, B)$ and $s(B, C)$, where $s.B$ is a primary key and $r.B$ is a foreign key referencing $s.B$. Consider the query$Q: r \bowtie (\sigma_{B<5} (...

gatecse

15.7k views

gatecse asked Feb 14, 2018

46 votes

3 answers

13

GATE CSE 2018 | Question: 23
A $32\text{-bit}$ wide main memory unit with a capacity of $1\;\textsf{GB}$ is built using $256\textsf{M} \times 4\text{-bit}$ DRAM chips. The number of rows of memory cells in the DRAM chip is $2^{14}$. The ... The percentage (rounded to the closest integer) of the time available for performing the memory read/write operations in the main memory unit is _________.

A $32\text{-bit}$ wide main memory unit with a capacity of $1\;\textsf{GB}$ is built using $256\textsf{M} \times 4\text{-bit}$ DRAM chips. The number of rows of memory ce...

gatecse

25.8k views

gatecse asked Feb 14, 2018

47 votes

7 answers

14

GATE CSE 2018 | Question: 30
Let $G$ be a simple undirected graph. Let $T_D$ be a depth first search tree of $G$. Let $T_B$ be a breadth first search tree of $G$. Consider the following statements. No edge of $G$ is a cross edge with respect to $T_D$. (A cross edge in $G$ ... $\mid i-j \mid =1$. Which of the statements above must necessarily be true? I only II only Both I and II Neither I nor II

Let $G$ be a simple undirected graph. Let $T_D$ be a depth first search tree of $G$. Let $T_B$ be a breadth first search tree of $G$. Consider the following statements.No...

gatecse

27.3k views

gatecse asked Feb 14, 2018

33 votes

5 answers

15

GATE CSE 2018 | Question: 32
Consider the following C code. Assume that unsigned long int type length is $64$ bits. unsigned long int fun(unsigned long int n) { unsigned long int i, j=0, sum = 0; for( i=n; i>1; i=i/2) j++; for( ; j>1; j=j/2) sum++; return sum; } The value returned when we call fun with the input $2^{40}$ is: $4$ $5$ $6$ $40$

Consider the following C code. Assume that unsigned long int type length is $64$ bits.unsigned long int fun(unsigned long int n) { unsigned long int i, j=0, sum = 0; for(...

gatecse

16.0k views

gatecse asked Feb 14, 2018

63 votes

5 answers

16

GATE CSE 2018 | Question: 43
Let $G$ be a graph with $100!$ vertices, with each vertex labelled by a distinct permutation of the numbers $1, 2,\ldots, 100.$ There is an edge between vertices $u$ and $v$ if and only if the label of $u$ can be obtained by swapping two adjacent ... denote the degree of a vertex in $G$, and $z$ denote the number of connected components in $G$. Then, $y+10z=$ ______.

Let $G$ be a graph with $100!$ vertices, with each vertex labelled by a distinct permutation of the numbers $1, 2,\ldots, 100.$ There is an edge between vertices $u$ and ...

gatecse

19.8k views

gatecse asked Feb 14, 2018

41 votes

4 answers

17

GATE CSE 2018 | Question: 44
Consider Guwahati, $(G)$ and Delhi $(D)$ whose temperatures can be classified as high $(H)$, medium $(M)$ and low $(L)$. Let $P(H_G)$ denote the probability that Guwahati has high temperature. Similarly, $P(M_G)$ ... , then the probability (correct to two decimal places) that Guwahati has high temperature given that Delhi has high temperature is ________.

Consider Guwahati, $(G)$ and Delhi $(D)$ whose temperatures can be classified as high $(H)$, medium $(M)$ and low $(L)$. Let $P(H_G)$ denote the probability that Guwahati...

gatecse

13.9k views

gatecse asked Feb 14, 2018

42 votes

11 answers

18

GATE CSE 2018 | Question: 1
Which one of the following is a closed form expression for the generating function of the sequence $\{a_n\}$, where $a_n = 2n +3 \text{ for all } n=0, 1, 2, \dots$? $\frac{3}{(1-x)^2}$ $\frac{3x}{(1-x)^2}$ $\frac{2-x}{(1-x)^2}$ $\frac{3-x}{(1-x)^2}$

Which one of the following is a closed form expression for the generating function of the sequence $\{a_n\}$, where $a_n = 2n +3 \text{ for all } n=0, 1, 2, \dots$?$\frac...

gatecse

22.7k views

gatecse asked Feb 14, 2018

37 votes

5 answers

19

GATE CSE 2018 | Question: 42
Consider the following four relational schemas. For each schema , all non-trivial functional dependencies are listed, The bolded attributes are the respective primary keys. $\text{Schema I:}$ Registration(rollno, courses) Field courses' is a set-valued attribute containing the ... $\text{Schema I}$ $\text{Schema II}$ $\text{Schema III}$ $\text{Schema IV}$

Consider the following four relational schemas. For each schema , all non-trivial functional dependencies are listed, The bolded attributes are the respective primary key...

gatecse

11.9k views

gatecse asked Feb 14, 2018

44 votes

5 answers

20

GATE CSE 2018 | Question: 11
In an Entity-Relationship (ER) model, suppose $R$ is a many-to-one relationship from entity set E1 to entity set E2. Assume that E1 and E2 participate totally in $R$ and that the cardinality of E1 is greater than the cardinality of E2. Which ... Every entity in E2 is associated with exactly one entity in E1 Every entity in E2 is associated with at most one entity in E1

In an Entity-Relationship (ER) model, suppose $R$ is a many-to-one relationship from entity set E1 to entity set E2. Assume that E1 and E2 participate totally in $R$ and ...

gatecse

27.9k views

gatecse asked Feb 14, 2018

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true