Recent questions tagged difficult / GATE Overflow for GATE CSE

6 votes

1 answer

61

TIFR CSE 2019 | Part B | Question: 12
Let $G=(V,E)$ be a directed graph with $n(\geq 2)$ vertices, including a special vertex $r$. Each edge $e \in E$ has a strictly positive edge weight $w(e)$. An arborescence in $G$ rooted at $r$ is a subgraph $H$ of $G$ ... is acyclic $w^*$ is less than the weight of the minimum weight directed Hamiltonian cycle in $G$, when $G$ has a directed Hamiltonian cycle

Let $G=(V,E)$ be a directed graph with $n(\geq 2)$ vertices, including a special vertex $r$. Each edge $e \in E$ has a strictly positive edge weight $w(e)$. An arborescen...

Arjun

2.5k views

Arjun asked Dec 18, 2018

5 votes

1 answer

62

Mathematics: GATE 2017 MA
ANSWER GIVEN IS 0.27-0.37

ANSWER GIVEN IS 0.27-0.37

Amit puri

392 views

Amit puri asked Sep 16, 2017

50 votes

7 answers

63

GATE CSE 2017 Set 2 | Question: 31
For any discrete random variable $X$, with probability mass function $P(X=j)=p_j, p_j \geq 0, j \in \{0, \dots , N \}$, and $\Sigma_{j=0}^N \: p_j =1$, define the polynomial function $g_x(z) = \Sigma_{j=0}^N \: p_j \: z^j$. For a certain ... . The expectation of $Y$ is $N \beta(1-\beta)$ $N \beta$ $N (1-\beta)$ Not expressible in terms of $N$ and $\beta$ alone

For any discrete random variable $X$, with probability mass function$P(X=j)=p_j, p_j \geq 0, j \in \{0, \dots , N \}$, and $\Sigma_{j=0}^N \: p_j =1$, define the polynomi...

Arjun

16.1k views

Arjun asked Feb 14, 2017

86 votes

4 answers

64

GATE CSE 2017 Set 1 | Question: 39
Let $A$ and $B$ be finite alphabets and let $\#$ be a symbol outside both $A$ and $B$. Let $f$ be a total function from $A^{*}$ to $B^{*}$. We say $f$ is computable if there exists a Turing machine $M$ which given an ... $L_{f}$ is recursive, but not conversely. If $f$ is computable then $L_{f}$ is recursively enumerable, but not conversely.

Let $A$ and $B$ be finite alphabets and let $\#$ be a symbol outside both $A$ and $B$. Let $f$ be a total function from $A^{*}$ to $B^{*}$. We say $f$ is computable if th...

Arjun

18.5k views

Arjun asked Feb 14, 2017

10 votes

2 answers

65

GATE CSE 1988 | Question: 15
Consider the DFA $M$ and NFA $M_{2}$ as defined below. Let the language accepted by machine $M$ be $L$. What language machine $M_{2}$ accepts, if $F2=A?$ $F2=B?$ $F2=C?$ $F2=D?$ $M=(Q, \Sigma, \delta, q_0, F)$ $M_{2}=(Q2, \Sigma, \delta_2, q_{00}, F2)$ ... $D=\{\langle p, q, r \rangle \mid p,q \in Q; r \in F\}$

Consider the DFA $M$ and NFA $M_{2}$ as defined below. Let the language accepted by machine $M$ be $L$. What language machine $M_{2}$ accepts, if$F2=A?$$F2=B?$$F2=C?$$...

go_editor

2.9k views

go_editor asked Dec 20, 2016

3 votes

1 answer

66

Gate 2006 Questions
Are Gate 2006 questions really tough? I'm hardly able to solve few questions. How should I approach such questions.

Are Gate 2006 questions really tough?I'm hardly able to solve few questions.How should I approach such questions.

target2017

981 views

target2017 asked Dec 12, 2016

29 votes

1 answer

67

List out All Difficult Confusing GATE Questions
Listing out all those GATE questions that need some expert answers . ( / whoses actual given answers are bit confusing / best answer not choosen ). Which may require in depth subject understanding . It will help in last month preparation ... comment them below. @arjun Sir, need expert in detail answers for all these questions... Could you pls do ?

Listing out all those GATE questions that need some expert answers . ( / whoses actual given answers are bit confusing / best answer not choosen ). Which may require in d...

pC

8.8k views

pC asked Aug 27, 2016

0 votes

2 answers

68

Peterson Davie 3.38c
Suppose an $IP$ packet is fragmented into $10$ fragments, each with a $1$% (independent) probability of loss. To a reasonable approximation, this means there is a $10$% chance of losing the whole packet due to loss of a fragment. What is the ... loss of the whole packet if the packet is transmitted twice, (c) Explain how use of the Ident field might be applicable here.

Suppose an $IP$ packet is fragmented into $10$ fragments, each with a $1$% (independent) probability of loss. To a reasonable approximation, this means there is a $10$% c...

makhdoom ghaya

696 views

makhdoom ghaya asked Apr 24, 2016

0 votes

1 answer

69

Peterson Davie 3.38b
Suppose an $IP$ packet is fragmented into $10$ fragments, each with a $1$% (independent) probability of loss. To a reasonable approximation, this means there is a $10$% chance of losing the whole packet due to loss of a fragment. What is ... loss of the whole packet if the packet is transmitted twice, (b) Assuming any given fragment may have been part of either transmission?

Suppose an $IP$ packet is fragmented into $10$ fragments, each with a $1$% (independent) probability of loss. To a reasonable approximation, this means there is a $10$% c...

makhdoom ghaya

777 views

makhdoom ghaya asked Apr 24, 2016

0 votes

2 answers

70

Peterson Davie 3.38a
Suppose an $IP$ packet is fragmented into $10$ fragments, each with a $1$% (independent) probability of loss. To a reasonable approximation, this means there is a $10$% chance of losing the whole packet due to loss of a fragment. What is ... of the whole packet if the packet is transmitted twice, (a) Assuming all fragments received must have been part of the same transmission?

Suppose an $IP$ packet is fragmented into $10$ fragments, each with a $1$% (independent) probability of loss. To a reasonable approximation, this means there is a $10$% c...

makhdoom ghaya

514 views

makhdoom ghaya asked Apr 24, 2016

0 votes

0 answers

71

Peterson Davie 3.30
A stage of an $n \times n$ banyan network consists of $(n/2) 2 \times 2$ switching elements. The first stage directs packets to the correct half of the network, the next stage to the correct quarter, and so on, until the packet is routed to the correct output ... of $2 \times 2$ switching elements needed to make an $n \times n$ banyan network. Verify your answer for $n = 8$.

A stage of an $n \times n$ banyan network consists of $(n/2) 2 \times 2$ switching elements. The first stage directs packets to the correct half of the network, the next ...

makhdoom ghaya

384 views

makhdoom ghaya asked Apr 24, 2016

0 votes

0 answers

72

Peterson Davie 2.41
Coaxial cable Ethernet was limited to a maximum of $500$m between repeaters, which regenerate the signal to $100$% of its original amplitude. Along one $500$-m segment, the signal could decay to no less than $14$% of its original value $(8.5 dB)$ ... %. Such a signal, even along $2500$ m, is still strong enough to be read; why then are repeaters required every $500$ m?

Coaxial cable Ethernet was limited to a maximum of $500$m between repeaters, which regenerate the signal to $100$% of its original amplitude. Along one $500$-m segment, t...

makhdoom ghaya

388 views

makhdoom ghaya asked Apr 23, 2016

0 votes

0 answers

73

Peterson Davie 2.21b
With $1$ parity bit we can detect all $1$-bit errors. Show that at least one generalization fails, as follows: (b) Find an $N$ (not necessarily minimal) such that no $32$-bit error detection code applied to $N$-bit blocks can detect all errors altering up to $8$ bits.

With $1$ parity bit we can detect all $1$-bit errors. Show that at least one generalization fails, as follows:(b) Find an $N$ (not necessarily minimal) such that no $32$-...

makhdoom ghaya

336 views

makhdoom ghaya asked Apr 20, 2016

0 votes

0 answers

74

Peterson Davie 2.21a
With $1$ parity bit we can detect all 1-bit errors. Show that at least one generalization fails, as follows: (a) Show that if messages $m$ are $8$ bits long, then there is no error detection code $e = e(m)$ of size $2$ bits that can detect all $2$-bit errors. ... $2$-bit error, and show that some pair of messages $m_{1}$ and $m_{2}$ in $M$ must have the same error code $e$.

With $1$ parity bit we can detect all 1-bit errors. Show that at least one generalization fails, as follows:(a) Show that if messages $m$ are $8$ bits long, then there is...

makhdoom ghaya

298 views

makhdoom ghaya asked Apr 20, 2016

0 votes

0 answers

75

Peterson Davie 2.17
Show that the Internet checksum can be computed by first taking the $32$-bit ones complement sum of the buffer in $32$-bit units, then taking the $16$-bit ones complement sum of the upper and lower half words, and finishing as before by complementing the result. (To take a $32$-bit ones complement sum on $32$-bit twos complement hardware, you need access to the “overflow” bit.)

Show that the Internet checksum can be computed by first taking the $32$-bit ones complement sum of the buffer in $32$-bit units, then taking the $16$-bit ones complement...

makhdoom ghaya

469 views

makhdoom ghaya asked Apr 19, 2016

1 votes

5 answers

76

Kenneth Rosen Edition 6th Exercise 1.1 Question 43 (Page No. 20)
Fuzzy logic is used in artificial intelligence. In fuzzy logic, a proposition has a truth value that is a number between 0 and 1, inclusive.A proposition with a truth value of 0 is false and one with a truth value of 1 ... least n of the statements in this list are false. Answer part (b) assuming that the list contains 99 statements

Fuzzy logic is used in artificial intelligence. In fuzzy logic, a proposition has a truth value that is a number between 0 and 1, inclusive.A proposition with a truth val...

go_editor

3.7k views

go_editor asked Apr 16, 2016

0 votes

1 answer

77

Kenneth Rosen Edition 6th Exercise 1.1 Question 42 (Page No. 20)
Fuzzy logic is used in artificial intelligence. In fuzzy logic, a proposition has a truth value that is a number between 0 and 1, inclusive.A proposition with a truth value of 0 is false and one with a truth ... half the time. Use these truthvalues to solve below exercise. Is the assertion This statement is false a proposition?

Fuzzy logic is used in artificial intelligence. In fuzzy logic, a proposition has a truth value that is a number between 0 and 1, inclusive.A proposition with a truth val...

go_editor

791 views

go_editor asked Apr 16, 2016

9 votes

1 answer

78

GATE2011 GG: GA-9
The quality of services delivered by a company consists of six factors as shown below in the radar diagram. The dots in the figure indicate the score for each factor on a scale of $0$ to $10.$ The standardized coefficient for each factor is given in the parentheses. ... the above factors to the overall quality of services delivered by the company is $10\%$ $20\%$ $24\%$ $40\%$

The quality of services delivered by a company consists of six factors as shown below in the radar diagram. The dots in the figure indicate the score for each factor on a...

Akash Kanase

1.7k views

Akash Kanase asked Feb 15, 2016

112 votes

7 answers

79

GATE CSE 2016 Set 1 | Question: 50
Consider the following proposed solution for the critical section problem. There are $n$ processes : $P_0....P_{n-1}$. In the code, function $\text{pmax}$ ... in the critical section at any time The bounded wait condition is satisfied The progress condition is satisfied It cannot cause a deadlock

Consider the following proposed solution for the critical section problem. There are $n$ processes : $P_0....P_{n-1}$. In the code, function $\text{pmax}$ returns an inte...

Sandeep Singh

47.6k views

Sandeep Singh asked Feb 12, 2016

143 votes

12 answers

80

GATE CSE 2016 Set 1 | Question: 41
Let $Q$ denote a queue containing sixteen numbers and $S$ be an empty stack. $Head(Q)$ returns the element at the head of the queue $Q$ without removing it from $Q$. Similarly $Top(S)$ returns the element at the top of $S$ without removing ... = Pop(S); Enqueue (Q, x); end end The maximum possible number of iterations of the while loop in the algorithm is _______.

Let $Q$ denote a queue containing sixteen numbers and $S$ be an empty stack. $Head(Q)$ returns the element at the head of the queue $Q$ without removing it from $Q$. Simi...

Sandeep Singh

35.0k views

Sandeep Singh asked Feb 12, 2016

85 votes

8 answers

81

GATE CSE 2016 Set 2 | Question: 28
Consider a set $U$ of $23$ different compounds in a chemistry lab. There is a subset $S$ of $U$ of $9$ compounds, each of which reacts with exactly $3$ compounds of $U$. Consider the following statements: Each compound in U \ S reacts ... \ S reacts with an even number of compounds. Which one of the above statements is ALWAYS TRUE? Only I Only II Only III None.

Consider a set $U$ of $23$ different compounds in a chemistry lab. There is a subset $S$ of $U$ of $9$ compounds, each of which reacts with exactly $3$ compounds of $U$. ...

Akash Kanase

16.7k views

Akash Kanase asked Feb 12, 2016

0 votes

3 answers

82

Patterson Chap 2 Q 19
19. Suppose we want to transmit the message 1011 0010 0100 1011 and protect it from errors using the CRC8 polynomial x8+ x2+ x1 + 1. (a) Use polynomial long division to determine the message that should be transmitted. (b) Suppose the leftmost ... link. What is the result of the receiver’s CRC calculation? How does the receiver know that an error has occurred?

19. Suppose we want to transmit the message 1011 0010 0100 1011and protect it from errors using the CRC8 polynomialx8+ x2+ x1 + 1.(a) Use polynomial long division to dete...

Akash Kanase

5.4k views

Akash Kanase asked Dec 15, 2015

2 votes

2 answers

83

Difficult Reccurance
Solve the recurrences. A) T(1) = 1, T(2) = 6, T(3) = 13, and for all n ≥ 4, T(n) = T(n − 3) + 5n − 9. B) T(1) = 1, and for all n ≥ 2, T(n)=2T(n − 1) + n2 − 2n + 1.

Solve the recurrences.A) T(1) = 1, T(2) = 6, T(3) = 13, and for all n ≥ 4, T(n) = T(n − 3) + 5n − 9.B) T(1) = 1, and for all n ≥ 2, T(n)=2T(n − ...

Prasanna

523 views

Prasanna asked Nov 26, 2015

4 votes

2 answers

84

TIFR CSE 2014 | Part A | Question: 4
Consider numbers greater than one that satisfy the following properties: They have no repeated prime factors; For all primes $p \geq 2$, $p$ divides the number if and only if $p − 1$ divides the number. The number of such numbers is $0$ $5$ $100$ Infinite None of the above

Consider numbers greater than one that satisfy the following properties:They have no repeated prime factors;For all primes $p \geq 2$, $p$ divides the number if and only ...

makhdoom ghaya

1.2k views

makhdoom ghaya asked Nov 9, 2015

70 votes

5 answers

85

GATE CSE 2015 Set 3 | Question: 51
Consider the following reservation table for a pipeline having three stages $S_1, S_2 \text{ and } S_3$ ... $} & & & \text{$X$} & \\\hline \end{array}$ The minimum average latency (MAL) is ______

Consider the following reservation table for a pipeline having three stages $S_1, S_2 \text{ and } S_3$.$$\begin{array}{|ccccc|} \hline \textbf{Time} \rightarrow \\\hline...

go_editor

41.3k views

go_editor asked Feb 16, 2015

92 votes

12 answers

86

GATE CSE 2015 Set 3 | Question: 24
In a room there are only two types of people, namely $\text{Type 1}$ and $\text{Type 2}$. $\text{Type 1}$ people always tell the truth and $\text{Type 2}$ people always lie. You give a fair coin to a person in that room, without knowing which type ... person is of $\text{Type 2}$, then the result is tail If the person is of $\text{Type 1}$, then the result is tail

In a room there are only two types of people, namely $\text{Type 1}$ and $\text{Type 2}$. $\text{Type 1}$ people always tell the truth and $\text{Type 2}$ people always l...

go_editor

17.9k views

go_editor asked Feb 14, 2015

94 votes

8 answers

87

GATE CSE 2015 Set 1 | Question: 39
Consider the operations $\textit{f (X, Y, Z) = X'YZ + XY' + Y'Z'}$ and $\textit{g (X, Y, Z) = X'YZ + X'YZ' + XY}$ Which one of the following is correct? Both $\left\{\textit{f} \right\}$ and ... $\left\{ \textit{f}\right\}$ nor $\left\{\textit{g}\right\}$ is functionally complete

Consider the operations$\textit{f (X, Y, Z) = X'YZ + XY' + Y'Z'}$ and $\textit{g (X, Y, Z) = X'YZ + X'YZ' + XY}$Which one of the following is correct?Both $\left\{\textit...

makhdoom ghaya

27.3k views

makhdoom ghaya asked Feb 13, 2015

70 votes

5 answers

88

GATE CSE 2015 Set 2 | Question: 34
Assume that the bandwidth for a $\text{TCP}$ connection is $1048560$ bits/sec. Let $\alpha$ be the value of RTT in milliseconds (rounded off to the nearest integer) after which the $\text{TCP}$ window scale option is needed. Let $\beta$ be the maximum possible ... $^{16}$ $500$ milliseconds, $65535$ $\times $2$^{14}$ $500$ milliseconds, $65535$ $\times $2$^{16}$

Assume that the bandwidth for a $\text{TCP}$ connection is $1048560$ bits/sec. Let $\alpha$ be the value of RTT in milliseconds (rounded off to the nearest integer) afte...

go_editor

27.9k views

go_editor asked Feb 12, 2015

29 votes

4 answers

89

GATE CSE 2015 Set 2 | Question: GA-8
In a triangle $PQR, PS$ is the angle bisector of $\angle QPR \text{ and } \angle QPS =60^\circ$. What is the length of $PS$ ? $\left(\dfrac{(q+r)} {qr}\right)$ $\left(\dfrac {qr} {q+r}\right)$ $\large \sqrt {(q^2 + r^2)}$ $\left(\dfrac{(q+r)^2} {qr}\right)$

In a triangle $PQR, PS$ is the angle bisector of $\angle QPR \text{ and } \angle QPS =60^\circ$. What is the length of $PS$ ?$\left(\dfrac{(q+r)} {qr}\right)$$\left(\dfra...

go_editor

11.1k views

go_editor asked Feb 12, 2015

12 votes

3 answers

90

GATE CSE 2015 Set 1 | Question: GA-5
Which one of the following combinations is incorrect? Acquiescence - Submission Wheedle - Roundabout Flippancy - Lightness Profligate - Extravagant

Which one of the following combinations is incorrect?Acquiescence - SubmissionWheedle - RoundaboutFlippancy - LightnessProfligate - Extravagant

makhdoom ghaya

5.1k views

makhdoom ghaya asked Feb 11, 2015

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