Recent activity by Shubhgupta / GATE Overflow for GATE CSE

1 answer

1

Test by Bikram | Mock GATE | Test 3 | Question: 37
In a college, the $CSMA / CD$ protocol has a bandwidth of $512$ $Mbps$ and distance of $2$ $km/s$. If the signal speed is $2,00,000$ $km$, then the minimum frame size in order to detect a collision is _________ $bytes$.

In a college, the $CSMA / CD$ protocol has a bandwidth of $512$ $Mbps$ and distance of $2$ $km/s$.If the signal speed is $2,00,000$ $km$, then the minimum frame size in o...

438 views

commented Feb 1, 2019

1 answer

2

Test by Bikram | Mock GATE | Test 3 | Question: 24
A $4-bit$ carry-lookahead adder adds two $4-bit$ numbers. The adder is designed only using $AND, OR, NOT, NAND $ and $NOR$ gates. We assume that all the inputs are available in both complemented and uncompleted forms. The delay ... using two-level $AND-OR$ logic. Thus, the overall propagation delay of the adder is ______ in terms of time units.

A $4-bit$ carry-lookahead adder adds two $4-bit$ numbers. The adder is designed only using $AND, OR, NOT, NAND $ and $NOR$ gates. We assume that all the inputs are availa...

605 views

commented Feb 1, 2019

1 answer

3

Dbms recoverablity
Consider the following schedule R1(a) W1(a) R2(a) commit2 W1(a) commit1 Is this schedule recoverable.I feel it is recoverable even though there is a dirty read

Consider the following scheduleR1(a) W1(a) R2(a) commit2 W1(a) commit1Is this schedule recoverable.I feel it is recoverable even though there is a dirty read

581 views

commented Jan 30, 2019

2 answers

4

Made easy mock test 1 DBMS super keys
Consider the following relation R(A1, A2,...A15) with (A1,A2, ... A6) of relation R are simple candidate key. The number of possible superkey in relation R is_

Consider the following relation R(A1, A2,...A15) with (A1,A2, ... A6) of relation R are simple candidate key. The number of possible superkey in relation R is_

1.3k views

commented Jan 30, 2019

2 answers

5

Test by Bikram | Mock GATE | Test 2 | Question: 53
A logic circuit has three input bits: $x_0$, $x_1$, and $x_2$, where $x_0$ is the least significant bit and $x_2$ is the most significant bit. The output from the circuit is $1$ when its input is any of the $3-bit$ numbers $1$, $4$, $5$, ... $\sim x_2x_0 + \sim x_2 +\sim x_1$ $x_2+ \sim x_1x_0$ $\sim x_1x_0+x_2 \sim x_0$

A logic circuit has three input bits: $x_0$, $x_1$, and $x_2$, where $x_0$ is the least significant bit and $x_2$ is the most significant bit. The output from the circuit...

7.6k views

comment reshown Jan 30, 2019

2 answers

6

Test by Bikram | Mock GATE | Test 1 | Question: 48
State whether the following statements are true or false? $(P\to Q) \rightarrow (Q\to P)$ always holds, for all propositions $P, Q$. $\left ( \left ( P\vee Q \right )\rightarrow Q \right )$ $\rightarrow$ ... true, $b$ is false Both $a$ and $b$ are true $a$ is false, $b$ is true. Both $a$ and $b$ are false.

State whether the following statements are true or false?$(P\to Q) \rightarrow (Q\to P)$ always holds, for all propositions $P, Q$.$\left ( \left ( P\vee Q \right )\right...

825 views

commented Jan 30, 2019

0 answers

7

IEEE smallest difference
What is the minimum difference between two successive real numbers representable in this system?

What is the minimum difference between two successive real numbers representable in this system?

1.5k views

commented Jan 30, 2019

0 answers

8

selfdoubt-ME-testseries
we define a new measure ,called GoldIndex(G,C).it takes two arguments as input namely a graph G and set of colors C respectively . the subroutine outputs an integer denoting the number of ways assigning colors to vertices in G such that at least two vertices ... 't know where m i going wrong ,please help me- i know their solution is correct but i want to verify my approach-

we define a new measure ,called GoldIndex(G,C).it takes two arguments as input namely a graph G and set of colors C respectively . the subroutine outputs an integer denot...

348 views

commented Jan 29, 2019

1 answer

9

crypt arithmetic
If 356 + 123 = 512 .Then what is the value of 653 + 321? 1.215 2.974 3.1004 4.1304 How to solve these type questions?

If 356 + 123 = 512 .Then what is the value of 653 + 321?1.2152.9743.10044.1304How to solve these type questions?

918 views

commented Jan 27, 2019

2 answers

10

made easy test series
In a RSA cryptosystem , a participant uses two prime numbers p and Q is 17 and 11 respectively to generate his/her public key and private keys. if the public key of participant is 7 and cipher text(C) is 11, then the original message (M) is______?

In a RSA cryptosystem , a participant uses two prime numbers p and Q is 17 and 11 respectively to generate his/her public key and private keys. if the public key of part...

3.1k views

commented Jan 27, 2019

1 answer

11

Ace pregate
Let S={a,b,c,d,e}. Number of strings of length 5 possible with the letters of S , so that atleast two A's are consecutive is? Answer given is : 421

Let S={a,b,c,d,e}. Number of strings of length 5 possible with the letters of S , so that atleast two A's are consecutive is?Answer given is : 421

408 views

answered Jan 27, 2019

0 answers

12

made easy test series
What is the number of generators in a group G, such that Ο(G) = 87?

What is the number of generators in a group G, such that Ο(G) = 87?

1.2k views

commented Jan 26, 2019

1 answer

13

Virtual Gate Test Series: Theory Of Computation - Languages
Let Σ = {a, b}. For a word w ∈ Σ* , let na(x) denote the number of a’s in w and let nb(x) denote the number of b’s in w. Consider the following language: L := {xy | x, y ∈ Σ* , na(x) = nb(y)} What can we say about L? L is regular, but not context-free. L is context-free, but not regular. L is Σ*. None of these.

Let Σ = {a, b}. For a word w ∈ Σ* , let na(x) denote the number of a’s in w and let nb(x) denote the number of b’s in w. Consider the following language:L := {xy ...

356 views

answered Jan 26, 2019

2 answers

14

Virtual Gate Test Series: Databases - Schedule
Which of the following is/are true? I. Every strict schedule is cascade less schedule and recoverable schedule II. Every cascade less schedule is recoverable schedule III. Every cascading rollback schedule is recoverable schedule IV. Every cascading rollback schedule is a ... of the above I, II, and IV only II, III, IV, and V only I, II, and III only

Which of the following is/are true?I. Every strict schedule is cascade less schedule and recoverable scheduleII. Every cascade less schedule is recoverable scheduleIII. E...

1.6k views

commented Jan 26, 2019

0 answers

15

made easy test
what is 2nd statement want to ask about. please elaborate I could not understand 2nd statement

what is 2nd statement want to ask about. please elaborate I could not understand 2nd statement

334 views

commented Jan 22, 2019

4 answers

16

Ace Test Series: Operating System - Reader Writer Problem

2.0k views

commented Jan 21, 2019

0 answers

17

made easy test
solution is provided that my doubt is can we find 3rd or 4th (and so on) smallest in 3 or 4 comparison in min heap.

solution is provided that my doubt is can we find 3rd or 4th (and so on) smallest in 3 or 4 comparison in min heap.

186 views

commented Jan 21, 2019

1 answer

18

made easy mock 2
consider the language L= {$x^{l}y^{m}z^{n}$|(l+m+n) is divisible by 5} which of the following is correct? L is recursive CSL CFL regular

consider the language L= {$x^{l}y^{m}z^{n}$|(l+m+n) is divisible by 5}which of the following is correct?L is recursiveCSLCFLregular

541 views

commented Jan 21, 2019

1 answer

19

ME Test

376 views

commented Jan 21, 2019

2 answers

20

made easy test series
Consider the following language:? L= {w | w $\epsilon$ {0,1}* , w has equal number of occurrences of ‘001’ and ‘010’} Is L regular? If so, please provide a DFA for L.

Consider the following language:?L= {w | w $\epsilon$ {0,1}* , w has equal number of occurrences of ‘001’ and ‘010’}Is L regular? If so, please provide a DFA for ...

3.3k views

commented Jan 20, 2019

1 answer

21

Testbook Test Series: Computer Networks - Sliding Window
Frames of 20000 bytes are sent over 10 MBps full duplex link between 2 hosts. Propagation is 45 ms.Suppose that the sliding window protocol is used with the sender window size of 16 and acknowledgements are piggybacked.After sending 35 frames , what is the minimum time sender will have to wait before starting transmission of the next frame

Frames of 20000 bytes are sent over 10 MBps full duplex link between 2 hosts. Propagation is 45 ms.Suppose that the sliding window protocol is used with the sender window...

1.2k views

commented Jan 18, 2019

1 answer

22

GATE Overflow | Mock GATE | Test 1 | Question: 32
A sequential search operation is performed on an array $A$ for the key value of $'x'$ (ignore quotes). Consider the following piece of assembly language code that uses back patching to perform the sequential search. i=0; P: if (i<A.length) goto ____; ... in the blanks provided ordered from top to bottom? R T U P R U T P P U T R P T U R

A sequential search operation is performed on an array $A$ for the key value of $'x'$ (ignore quotes). Consider the following piece of assembly language code that uses ba...

660 views

answered Jan 17, 2019

1 answer

23

CPU Scheduling (SRTF)
I have solved this but not getting the answer…. will any one verify its correctness plz Thank you:)

I have solved this but not getting the answer…. will any one verify its correctness plzThank you:)

2.9k views

commented Jan 17, 2019

7 answers

24

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...

27.6k views

commented Jan 17, 2019

8 answers

25

GATE CSE 2018 | Question: 15
Two people, $P$ and $Q$, decide to independently roll two identical dice, each with $6$ faces, numbered $1$ to $6$. The person with the lower number wins. In case of a tie, they roll the dice repeatedly until there is no tie. Define a ... and that all trials are independent. The probability (rounded to $3$ decimal places) that one of them wins on the third trial is ____

Two people, $P$ and $Q$, decide to independently roll two identical dice, each with $6$ faces, numbered $1$ to $6$. The person with the lower number wins. In case of a ti...

11.2k views

commented Jan 17, 2019

0 answers

26

SELF DOUBT ANTISYMMETRIC PROPERTY
((X,Y):X DIVIDED BY Y ) IS A RELATION . IS IT ANTISYMMETRIC??

((X,Y):X DIVIDED BY Y ) IS A RELATION .IS IT ANTISYMMETRIC??

328 views

commented Jan 16, 2019

0 answers

27

Number of conflict serial orderings (with commit) Applied Course FT-1
Consider the following order of transactions: T2: R(y); T3:W(y); T3: commit; T1: W(y); T1: commit; T2: R(x); T2: W(z); T2: commit; T4: R(y);T4: R(x); T4: commit. Let the above schedule be S, if S is serializable, then how many conflict serial orderings of S is possible?___________

Consider the following order of transactions:T2: R(y); T3:W(y); T3: commit; T1: W(y); T1: commit; T2: R(x); T2: W(z); T2: commit; T4: R(y);T4: R(x); T4: commit.Let the ab...

2.0k views

commented Jan 16, 2019

1 answer

28

Applied Course Test 1
The number of states in a minimal DFA that accepts set of all strings beginning with 1 that, when interpreted as a binary integer is a multiple of 5 over the alphabet={0,1}. For example, strings 101, 1010 and 1111 are in the language?

The number of states in a minimal DFA that accepts set of all strings beginning with 1 that, when interpreted as a binary integer is a multiple of 5 over the alphabet={0,...

4.9k views

commented Jan 15, 2019

0 answers

29

self doubtpid
pid=fork(); if (pid !=0) fork(); fork(); no . of child process are created when above program are executed.?

pid=fork();if (pid !=0)fork();fork();no . of child process are created when above program are executed.?

601 views

commented Jan 15, 2019

2 answers

30

mad easy cbt 1
Let A be ternary tree with each node having 0 or 3 children . Let T have 25 node .The number of leaf nodes in ternary tree are

Let A be ternary tree with each node having 0 or 3 children . Let T have 25 node .The number of leaf nodes in ternary tree are

694 views

comment edited Jan 13, 2019

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