Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by vupadhayayx86
2
votes
1
GATE CSE 1989 | Question: 3-v
Which of the following well-formed formulas are equivalent? $P \rightarrow Q$ $\neg Q \rightarrow \neg P$ $\neg P \vee Q$ $\neg Q \rightarrow P$
Which of the following well-formed formulas are equivalent?$P \rightarrow Q$$\neg Q \rightarrow \neg P$$\neg P \vee Q$$\neg Q \rightarrow P$
3.7k
views
answered
Oct 8, 2019
Mathematical Logic
gate1989
normal
mathematical-logic
propositional-logic
multiple-selects
+
–
0
votes
2
GATE2013 CE: GA-9
A firm is selling its product at Rs. $60$ per unit. The total cost of production is Rs. $100$ and firm is earning total profit of Rs. $500$. Later, the total cost increased by $30\%.$ By what percentage the price should be increased to maintained the same profit level. $5$ $10$ $15$ $30$
A firm is selling its product at Rs. $60$ per unit. The total cost of production is Rs. $100$ and firm is earning total profit of Rs. $500$. Later, the total cost increas...
8.0k
views
answered
Apr 24, 2019
Quantitative Aptitude
quantitative-aptitude
gate2013-ce
profit-loss
+
–
6
votes
3
GATE CSE 2019 | Question: 20
An array of $25$ distinct elements is to be sorted using quicksort. Assume that the pivot element is chosen uniformly at random. The probability that the pivot element gets placed in the worst possible location in the first round of partitioning (rounded off to $2$ decimal places) is ________
An array of $25$ distinct elements is to be sorted using quicksort. Assume that the pivot element is chosen uniformly at random. The probability that the pivot element ge...
16.3k
views
answered
Feb 4, 2019
Algorithms
gatecse-2019
numerical-answers
algorithms
quick-sort
probability
1-mark
+
–
0
votes
4
In Go-Back-N protocol, if the maximum window size is 127, what is the range of the sequence number?
In Go-Back-N protocol, if the maximum window size is 127, what is the range of the sequence number? A. 0 to 127 B. 0 to 128 C. 1 to 127 D. 1 to 128 Answer given is A Please explain :) Thanks.
In Go-Back-N protocol, if the maximum window size is 127, what is the range of the sequence number?A. 0 to 127 B. 0 to 128 C. 1 to 127 D. 1 to 128Answer given is APlease ...
13.7k
views
answered
Jan 6, 2019
Computer Networks
computer-networks
go-back-n
sliding-window
+
–
0
votes
5
GATE CSE 1992 | Question: 02,xvii
Which of the following regular expression identities is/are TRUE? $r^{(^\ast)} =r^\ast$ $(r^\ast s^\ast)=(r+s)^\ast$ $(r+s)^\ast = r^\ast + s^\ast$ $r^\ast s^\ast = r^\ast+s^\ast$
Which of the following regular expression identities is/are TRUE?$r^{(^\ast)} =r^\ast$$(r^\ast s^\ast)=(r+s)^\ast$$(r+s)^\ast = r^\ast + s^\ast$$r^\ast s^\ast = r^\ast+s^...
14.5k
views
answered
Dec 13, 2018
Theory of Computation
gate1992
theory-of-computation
regular-expression
easy
multiple-selects
+
–
0
votes
6
GATE CSE 2010 | Question: 41
Let $w$ be any string of length $n$ in $\{0,1\}^*$. Let $L$ be the set of all substrings of $w$. What is the minimum number of states in non-deterministic finite automation that accepts $L$? $n-1$ $n$ $n+1$ $2^{n-1}$
Let $w$ be any string of length $n$ in $\{0,1\}^*$. Let $L$ be the set of all substrings of $w$. What is the minimum number of states in non-deterministic finite automati...
24.0k
views
answered
Dec 12, 2018
Theory of Computation
gatecse-2010
theory-of-computation
finite-automata
normal
minimal-state-automata
+
–
0
votes
7
GATE CSE 2003 | Question: 55
Consider the NFA $M$ shown below. Let the language accepted by $M$ be $L$. Let $L_1$ be the language accepted by the NFA $M_1$ obtained by changing the accepting state of $M$ to a non-accepting state and by changing the non-accepting states of $M$ to accepting states. Which ... statements is true? $L_1 = \{0,1\}^*-L$ $L_1 = \{0,1\}^*$ $L_1 \subseteq L$ $L_1 = L$
Consider the NFA $M$ shown below.Let the language accepted by $M$ be $L$. Let $L_1$ be the language accepted by the NFA $M_1$ obtained by changing the accepting state of ...
14.4k
views
answered
Dec 12, 2018
Theory of Computation
gatecse-2003
theory-of-computation
finite-automata
normal
+
–
–1
votes
8
GATE CSE 1994 | Question: 3.9
Every subset of a countable set is countable. State whether the above statement is true or false with reason.
Every subset of a countable set is countable.State whether the above statement is true or false with reason.
3.1k
views
answered
Dec 5, 2018
Set Theory & Algebra
gate1994
set-theory&algebra
normal
set-theory
countable-uncountable-set
true-false
+
–
1
votes
9
GATE CSE 2008 | Question: 64, ISRO2009-13
Which of the following statements about synchronous and asynchronous I/O is NOT true? An ISR is invoked on completion of I/O in synchronous I/O but not in asynchronous I/O In both synchronous and asynchronous I/O, an ISR (Interrupt Service ... process waiting for the completion of I/O is woken up by the ISR that is invoked after the completion of I/O
Which of the following statements about synchronous and asynchronous I/O is NOT true?An ISR is invoked on completion of I/O in synchronous I/O but not in asynchronous I/O...
17.7k
views
answered
Nov 5, 2018
CO and Architecture
gatecse-2008
operating-system
io-handling
normal
isro2009
+
–
0
votes
10
GateBook Mock-Test-2
Suppose datagrams are limited to 1,500 bytes (including header) between source Host A and destination Host B. Assuming a 20-byte IP header and a 20-byte TCP header, how many datagrams would be required to send an MP3 consisting of 4 million bytes?
Suppose datagrams are limited to 1,500 bytes (including header) between source Host A and destination Host B. Assuming a 20-byte IP header and a 20-byte TCP header, how m...
7.6k
views
answered
Oct 30, 2018
Computer Networks
computer-networks
gatebook-mt2
ip-packet
+
–
3
votes
11
GATE CSE 2015 Set 2 | Question: 52
$\text{Host A}$ sends a $\text{UDP}$ datagram containing $8880\text{ bytes}$ of user data to $\text{host B}$ over an $\text{Ethernet LAN}.$ Ethernet frames may carry data up to $1500\text{ bytes (i.e. MTU = 1500 bytes)}.$ Size of $\text{UDP}$ ... be the contents of offset field in the last fragment? $6$ and $925$ $6$ and $7400$ $7$ and $1110$ $7$ and $8880$
$\text{Host A}$ sends a $\text{UDP}$ datagram containing $8880\text{ bytes}$ of user data to $\text{host B}$ over an $\text{Ethernet LAN}.$ Ethernet frames may carry data...
25.6k
views
answered
Oct 30, 2018
Computer Networks
gatecse-2015-set2
computer-networks
ip-packet
normal
+
–
16
votes
12
GATE CSE 2006 | Question: 46
Station $A$ needs to send a message consisting of $9$ packets to Station $B$ using a sliding window (window size $3$) and go-back-$n$ error control strategy. All packets are ready and immediately available for transmission. If every $5$th packet that $A$ ... what is the number of packets that $A$ will transmit for sending the message to $B$? $12$ $14$ $16$ $18$
Station $A$ needs to send a message consisting of $9$ packets to Station $B$ using a sliding window (window size $3$) and go-back-$n$ error control strategy. All packets ...
41.4k
views
answered
Oct 27, 2018
Computer Networks
gatecse-2006
computer-networks
sliding-window
normal
+
–
5
votes
13
GATE CSE 2016 Set 1 | Question: 10
A queue is implemented using an array such that ENQUEUE and DEQUEUE operations are performed efficiently. Which one of the following statements is CORRECT ($n$ refers to the number of items in the queue) ? Both operations can be performed in $O(1)$ ... both operations will be $\Omega (n)$. Worst case time complexity for both operations will be $\Omega (\log n)$
A queue is implemented using an array such that ENQUEUE and DEQUEUE operations are performed efficiently. Which one of the following statements is CORRECT ($n$ refers to ...
23.4k
views
answered
Sep 30, 2018
DS
gatecse-2016-set1
data-structures
queue
normal
+
–
0
votes
14
GATE CSE 1994 | Question: 19
Given a set: $S = \left\{x \mid \text{ there is an x-block of 5's in the decimal expansion of } \pi\right\}$ (Note: $x$-$block$ is a maximal block of $x$ successive $5$'s) Which of the following statements is true with ... that a language $L_1$ is regular and that the language $L_1 \cup L_2$ is regular, is the language $L_2$ always regular? Prove your answer.
Given a set:$$S = \left\{x \mid \text{ there is an x-block of 5's in the decimal expansion of } \pi\right\}$$(Note: $x$-$block$ is a maximal block of $x$ successive $5$'s...
5.4k
views
answered
Sep 19, 2018
Theory of Computation
gate1994
theory-of-computation
identify-class-language
normal
descriptive
+
–
2
votes
15
GATE CSE 2005 | Question: 57
Consider the languages: $L_1 = \left\{ww^R \mid w \in \{0, 1\}^* \right\}$ $L_2 = \left\{w\text{#}w^R \mid w \in \{0, 1\}^* \right\}$, where $\text{#}$ ... of the following is TRUE? $L_1$ is a deterministic CFL $L_2$ is a deterministic CFL $L_3$ is a CFL, but not a deterministic CFL $L_3$ is a deterministic CFL
Consider the languages:$L_1 = \left\{ww^R \mid w \in \{0, 1\}^* \right\}$$L_2 = \left\{w\text{#}w^R \mid w \in \{0, 1\}^* \right\}$, where $\text{#}$ is a special symbol$...
8.5k
views
answered
Sep 18, 2018
Theory of Computation
gatecse-2005
theory-of-computation
context-free-language
easy
+
–
7
votes
16
GATE CSE 2016 Set 2 | Question: 33
Consider a $3 \ \text{GHz}$ (gigahertz) processor with a three stage pipeline and stage latencies $\large\tau_1,\tau_2$ and $\large\tau_3$ such that $\large\tau_1 =\dfrac{3 \tau_2}{4}=2\tau_3$. If the longest pipeline stage is split into two pipeline stages of equal latency , the new frequency is __________ $\text{GHz}$, ignoring delays in the pipeline registers.
Consider a $3 \ \text{GHz}$ (gigahertz) processor with a three stage pipeline and stage latencies $\large\tau_1,\tau_2$ and $\large\tau_3$ such that $\large\tau_1 =\dfrac...
19.2k
views
answered
Jul 19, 2018
CO and Architecture
gatecse-2016-set2
co-and-architecture
pipelining
normal
numerical-answers
+
–
0
votes
17
Hamacher COA 5.7,p-362
A computer uses a small direct-mapped cache between the main memory and the processor. The cache has four 16-bit words, and each word has an associated 13-bit tag, as shown in Figure P5.2a. When a miss occurs during a read operation, the ... the cache is $1\tau$. Calculate the execution time for each pass. Ignore the time taken by the processor between memory cycles.
A computer uses a small direct-mapped cache between the main memory and the processor. The cache has four 16-bit words, and each word has an associated 13-bit tag, as sho...
978
views
answered
Jun 15, 2018
CO and Architecture
co-and-architecture
cache-memory
secondary-storage
+
–
0
votes
18
Carl Hamacher Chapter 4 Excercise Q.10
A computer is required to accept characters from 20 video terminals. The main memory area to be used for storing data for each terminal is pointed to by a pointer PNTR n, where n=1 through 20. Input data must be collected from the terminals while ... for solution a but i am not able to figure it out why.!! Can anyone explain me the solution.Thanks in advance.
A computer is required to accept characters from 20 video terminals. The main memoryarea to be used for storing data for each terminal is pointed to by a pointer PNTRn, w...
402
views
answered
May 27, 2018
CO and Architecture
co-and-architecture
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register