Recent activity by vnc / GATE Overflow for GATE CSE

0 answers

1

TestBook TestSeries
(i)An ICMP message is generated if IP datagram header is corrupted (ii) No ICMP message is generated if IP address in data link frame is broadcast or multicast address. Both are correct Only (i) correct Only (ii) correct Both are incorrect

(i)An ICMP message is generated if IP datagram header is corrupted(ii) No ICMP message is generated if IP address in data link frame is broadcast or multicast address.Bot...

502 views

commented Feb 4, 2017

0 answers

2

TestBook TestSeries
in a binary search tree, the key with value 5 was searched after traversing nodes with values 1, 3, 4, 6, 7, 8, 9 not necessarily in this order. Lets P is the probability that 3rd element on the search path beginning from root is either 3 or 8, ... are the number of different orders possible in which given nodes can be traversed before finding node with value 5. Find N ∕ 10 + P

in a binary search tree, the key with value 5 was searched after traversing nodes with values 1, 3, 4, 6, 7, 8, 9 not necessarily in this order. Lets P is the probability...

464 views

asked Jan 29, 2017

1 answer

3

TestBook TestSeries
Consider the following statements : i) An ambiguous grammar can not generate DCFL. ii) An unambiguous grammar will always generate deterministic context free language. iii) Any non-empty language admits an ambiguous grammar. iv) All regular grammars are unambiguous. Which of the above is/are TRUE? i) and iv) only ii) and iii) only iii) only ii) and iv) only

Consider the following statements :i) An ambiguous grammar can not generate DCFL.ii) An unambiguous grammar will always generate deterministic context free language.iii) ...

393 views

asked Jan 29, 2017

1 answer

4

TestBook TestSeries
TLB lookup time (th) = 20 ns TLB hit ratio (ht) = 99% Memory access time (ts) = 100 ns Page fault rate (hp) =0.05% Swap page time (in or out) (tp) = 5000,000 ns What is the effective access time (EAT) if we assume that all pages currently in main memory are dirty? 5118.91 ns 51.21 ns 5120.9 ns None of the above

TLB lookup time (th) = 20 nsTLB hit ratio (ht) = 99%Memory access time (ts) = 100 nsPage fault rate (hp) =0.05%Swap page time (in or out) (tp) = 5000,000 nsWhat is the ef...

730 views

commented Jan 23, 2017

1 answer

5

TestBook Test Series
Let T be a B-tree of order m and height h. if n is the number of key elements in T then the maximum value of n is (m-1)h-1 (m-1)h-1+1 Mh-1 Mh+1+1

Let T be a B-tree of order m and height h. if n is the number of key elements in T then the maximum value of n is(m-1)h-1(m-1)h-1+1Mh-1Mh+1+1

1.4k views

answer selected Jan 14, 2017

3 answers

6

TestBook Test Series
If (65)x = (52)y, then what is the minimum value of x+y ?

If (65)x = (52)y, then what is the minimum value of x+y ?

965 views

answer selected Jan 11, 2017

2 answers

7

TestBook Test Series
Consider the following information about a hypothetical organization. Assume the cache is physically addressed TLB:hit rate is 95%,access time is 1 cycle Cache: hit rate is 90%,access time is 1 cycle When TLB and cache both get miss,page fault rate is 1% ... cycles Page table is always kept in main memory. Compute the average memory access time? 1 cycle 2 cycle 3 cycle 4 cycle

Consider the following information about a hypothetical organization.Assume the cache is physically addressedTLB:hit rate is 95%,access time is 1 cycleCache: hit rate is ...

667 views

commented Jan 11, 2017

1 answer

8

TestBook Test Series
Assume a sequence of memory accesses is made that have a high degree of temporal locality, which one of these cache would be likely to have the best performance? A 4-way set associative cache with 2-byte blocks A 2-way set associative cache with 4-byte blocks A direct mapped cache with 4-byte blocks A direct mapped cache with 8-byte blocks

Assume a sequence of memory accesses is made that have a high degree of temporal locality, which one of these cache would be likely to have the best performance?A 4-way s...

304 views

asked Jan 10, 2017

5 answers

9

GATE IT 2005 | Question: 27
Which of the following statements is TRUE about CSMA/CD: IEEE $802.11$ wireless LAN runs CSMA/CD protocol Ethernet is not based on CSMA/CD protocol CSMA/CD is not suitable for a high propagation delay network like satellite network There is no contention in a CSMA/CD network

Which of the following statements is TRUE about CSMA/CD:IEEE $802.11$ wireless LAN runs CSMA/CD protocolEthernet is not based on CSMA/CD protocolCSMA/CD is not suitable f...

13.7k views

commented Jan 10, 2017

2 answers

10

MadeEasy Test Series
Consider the following schedule S : r1(A) w2(A) r3(A) w4(A) r5(A) w6(A) The number of schedules equal to given schedule(s) which not conflict equal to schedule(s) are _______.

Consider the following scheduleS : r1(A) w2(A) r3(A) w4(A) r5(A) w6(A)The number of schedules equal to given schedule(s) which not conflict equal to schedule(s) are _____...

1.2k views

commented Jan 10, 2017

1 answer

11

MadeEasy Subject Test: Databases - Transactions
Consider the following schedule : S::r1(A),r3(D),w1(B),r2(B),r4(B),w2(C),r5(C),w4(E),r5(E),w5(B) The number of serial schedules which are view equal to schedule (S) ___________.

Consider the following schedule :S::r1(A),r3(D),w1(B),r2(B),r4(B),w2(C),r5(C),w4(E),r5(E),w5(B)The number of serial schedules which are view equal to schedule (S) _______...

390 views

asked Jan 10, 2017

1 answer

12

Testbook Test series
How much memory is needed to store addition table of two 8 bit numbers 64Kx9 64Kx8 64Kx16 64Kx18

How much memory is needed to store addition table of two 8 bit numbers64Kx964Kx864Kx1664Kx18

377 views

commented Jan 10, 2017

5 answers

13

GATE CSE 1994 | Question: 3.11
State True or False with reason Logical data independence is easier to achieve than physical data independence.

State True or False with reasonLogical data independence is easier to achieve than physical data independence.

7.7k views

answered Jan 2, 2017

8 answers

14

GATE CSE 2013 | Question: 27
What is the logical translation of the following statement? "None of my friends are perfect." $∃x(F (x)∧ ¬P(x))$ $∃ x(¬ F (x)∧ P(x))$ $ ∃x(¬F (x)∧¬P(x))$ $ ¬∃ x(F (x)∧ P(x))$

What is the logical translation of the following statement?"None of my friends are perfect."$∃x(F (x)∧ ¬P(x))$$∃ x(¬ F (x)∧ P(x))$$ ∃x(¬F (x)∧¬P(x))$$ ¬�...

14.2k views

commented Dec 21, 2016

9 answers

15

GATE CSE 1991 | Question: 03,xii
If $F_1$, $F_2$ and $F_3$ are propositional formulae such that $F_1 \land F_2 \rightarrow F_3$ and $F_1 \land F_2 \rightarrow \sim F_3$ are both tautologies, then which of the following is true: Both $F_1$ and $F_2$ are tautologies The conjunction $F_1 \land F_2$ is not satisfiable Neither is tautologous Neither is satisfiable None of the above

If $F_1$, $F_2$ and $F_3$ are propositional formulae such that $F_1 \land F_2 \rightarrow F_3$ and $F_1 \land F_2 \rightarrow \sim F_3$ are both tautologies, then which ...

8.9k views

commented Dec 21, 2016

10 answers

16

GATE CSE 2002 | Question: 1.8
"If $X$ then $Y$ unless $Z$" is represented by which of the following formulas in propositional logic? ("$\neg$" is negation, "$\land$" is conjunction, and "$\rightarrow$" is implication) $(X\land \neg Z) \rightarrow Y$ $(X \land Y) \rightarrow \neg Z$ $X \rightarrow(Y\land \neg Z)$ $(X \rightarrow Y)\land \neg Z$

"If $X$ then $Y$ unless $Z$" is represented by which of the following formulas in propositional logic? ("$\neg$" is negation, "$\land$" is conjunction, and "$\rightarrow$...

14.8k views

answered Dec 21, 2016

11 answers

17

GATE CSE 2016 Set 2 | Question: 01
Consider the following expressions: $false$ $Q$ $true$ $P\vee Q$ $\neg Q\vee P$ The number of expressions given above that are logically implied by $P \wedge (P \Rightarrow Q)$ is ___________.

Consider the following expressions:$false$$Q$$true$$P\vee Q$$\neg Q\vee P$The number of expressions given above that are logically implied by $P \wedge (P \Rightarrow Q)$...

20.0k views

answered Dec 21, 2016

3 answers

18

TIFR CSE 2011 | Part A | Question: 12
The action for this problem takes place in an island of Knights and Knaves, where Knights always make true statements and Knaves always make false statements and everybody is either a Knight or a Knave. Two friends A and B lives in a house. The census ... a Knave. A is a Knave and B is a Knight. Both are Knaves. Both are Knights. No conclusion can be drawn.

The action for this problem takes place in an island of Knights and Knaves, where Knights always make true statements and Knaves always make false statements and everybod...

2.1k views

comment edited Dec 21, 2016

8 answers

19

GATE CSE 1996 | Question: 2.13, ISRO2016-28
The average number of key comparisons required for a successful search for sequential search on $n$ items is $\frac{n}{2}$ $\frac{n-1}{2}$ $\frac{n+1}{2}$ None of the above

The average number of key comparisons required for a successful search for sequential search on $n$ items is$\frac{n}{2}$$\frac{n-1}{2}$$\frac{n+1}{2}$None of the above

31.6k views

answered Dec 10, 2016

7 answers

20

GATE CSE 2002 | Question: 2.12
A weight-balanced tree is a binary tree in which for each node, the number of nodes in the left sub tree is at least half and at most twice the number of nodes in the right sub tree. The maximum possible height (number of nodes on the path from the root to the furthest ... which of the following? $\log_2 n$ $\log_{\frac{4}{3}} n$ $\log_3 n$ $\log_{\frac{3}{2}} n$

A weight-balanced tree is a binary tree in which for each node, the number of nodes in the left sub tree is at least half and at most twice the number of nodes in the rig...

23.4k views

commented Dec 9, 2016

2 answers

21

TIFR CSE 2013 | Part B | Question: 13
Given a binary tree of the following form and having $n$ nodes, the height of the tree is $\Theta \left(\log n\right)$ $\Theta \left(n\right)$ $\Theta \left(\sqrt{n}\right)$ $\Theta \left(n / \log n\right)$ None of the above.

Given a binary tree of the following form and having $n$ nodes, the height of the tree is$\Theta \left(\log n\right)$$\Theta \left(n\right)$$\Theta \left(\sqrt{n}\right)$...

3.5k views

commented Dec 8, 2016

5 answers

22

GATE IT 2006 | Question: 18
$\textsf{HELO}$ and $\textsf{PORT}$, respectively, are commands from the protocols: $\textsf{FTP}$ and $\textsf{HTTP}$ $\textsf{TELNET}$ and $\textsf{POP3}$ $\textsf{HTTP}$ and $\textsf{TELNET}$ $\textsf{SMTP}$ and $\textsf{FTP}$

$\textsf{HELO}$ and $\textsf{PORT}$, respectively, are commands from the protocols:$\textsf{FTP}$ and $\textsf{HTTP}$$\textsf{TELNET}$ and $\textsf{POP3}$$\textsf{HTTP}$ ...

8.2k views

answered Dec 4, 2016

4 answers

23

GATE IT 2005 | Question: 77
Assume that "host1.mydomain.dom" has an IP address of $145.128.16.8$. Which of the following options would be most appropriate as a subsequence of steps in performing the reverse lookup of $145.128.16.8$ ? In the following options "NS" is ... -addr.arpa domains Directly query a NS for $145.$in-addr.arpa and then a NS for $128.145.$in-addr.arpa domains

Assume that "host1.mydomain.dom" has an IP address of $145.128.16.8$. Which of the following options would be most appropriate as a subsequence of steps in performing the...

10.1k views

answered Dec 4, 2016

8 answers

24

GATE CSE 2006 | Question: 34
Consider the regular language $L=(111+11111)^{*}.$ The minimum number of states in any DFA accepting this languages is: $3$ $5$ $8$ $9$

Consider the regular language $L=(111+11111)^{*}.$ The minimum number of states in any DFA accepting this languages is:$3$$5$$8$$9$

34.2k views

commented Dec 2, 2016

5 answers

25

GATE CSE 2009 | Question: 51
A hard disk has $63$ sectors per track, $10$ platters each with $2$ recording surfaces and $1000$ cylinders. The address of a sector is given as a triple $\langle c, h, s \rangle$, where $c$ is the cylinder number, $h$ is the surface number ... $\langle 400, 16, 29 \rangle$ corresponds to sector number: $505035$ $505036$ $505037$ $505038$

A hard disk has $63$ sectors per track, $10$ platters each with $2$ recording surfaces and $1000$ cylinders. The address of a sector is given as a triple $\langle c, h, s...

19.7k views

commented Nov 28, 2016

7 answers

26

GATE CSE 2014 Set 2 | Question: 39
Consider the expression tree shown. Each leaf represents a numerical value, which can either be $0$ or $1$. Over all possible choices of the values at the leaves, the maximum possible value of the expression represented by the tree is ___.

Consider the expression tree shown. Each leaf represents a numerical value, which can either be $0$ or $1$. Over all possible choices of the values at the leaves, the max...

9.5k views

answered Oct 5, 2016

7 answers

27

GATE CSE 2010 | Question: 37
The program below uses six temporary variables $a, b, c, d, e, f$. a = 1 b = 10 c = 20 d = a + b e = c + d f = c + e b = c + e e = b + f d = 5 + e return d + f Assuming that all operations take their operands from registers, what is the minimum number of registers needed to execute this program without spilling? $2$ $3$ $4$ $6$

The program below uses six temporary variables $a, b, c, d, e, f$.a = 1 b = 10 c = 20 d = a + b e = c + d f = c + e b = c + e e = b + f d = 5 + e return d + fAssuming tha...

21.8k views

answered Oct 4, 2016

3 answers

28

GATE CSE 2007 | Question: 18
Which one of the following is a top-down parser? Recursive descent parser. Operator precedence parser. An LR(k) parser. An LALR(k) parser.

Which one of the following is a top-down parser?Recursive descent parser.Operator precedence parser.An LR(k) parser.An LALR(k) parser.

9.7k views

answered Oct 4, 2016

4 answers

29

GATE CSE 2003 | Question: 17
Assume that the SLR parser for a grammar G has $n_1$ states and the LALR parser for G has $n_2$ states. The relationship between $n_1$ and $n_2$ is $n_1$ is necessarily less than $n_2$ $n_1$ is necessarily equal to $n_2$ $n_1$ is necessarily greater than $n_2$ None of the above

Assume that the SLR parser for a grammar G has $n_1$ states and the LALR parser for G has $n_2$ states. The relationship between $n_1$ and $n_2$ is$n_1$ is necessarily le...

11.3k views

answered Oct 3, 2016

5 answers

30

GATE CSE 1991 | Question: 10b
Consider the following grammar for arithmetic expressions using binary operators $-$ and $/$ which are not associative $E \rightarrow E -T\mid T$ $T \rightarrow T/F\mid F$ $F \rightarrow (E) \mid id$ ($E$ is the start symbol ... with redundant parentheses. Do this with minimum number of changes to the given production rules and adding at most one more production rule.

Consider the following grammar for arithmetic expressions using binary operators $-$ and $/$ which are not associative$E \rightarrow E -T\mid T$$T \rightarrow T/F\mid F$ ...

4.0k views

commented Sep 30, 2016

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