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
Recent activity by abcS
3
answers
1
GATE CSE 2004 | Question: 22
How many $8-bi$t characters can be transmitted per second over a $9600$ baud serial communication link using asynchronous mode of transmission with one start bit, eight data bits, two stop bits and one parity bit? $600$ $800$ $876$ $1200$
How many $8-bi$t characters can be transmitted per second over a $9600$ baud serial communication link using asynchronous mode of transmission with one start bit, eight d...
15.8k
views
commented
Feb 3, 2022
Computer Networks
gatecse-2004
computer-networks
serial-communication
normal
out-of-gate-syllabus
+
–
1
answer
2
GATE Overflow Test Series | Discrete Mathematics | Test 2 | Question: 12
A game of cards is played among $4$ friends. After the initial split of $52$ cards, the tallest person told that he has got $4$ Aces and all the remaining $9$ cards are of the same suit. Total number of ways in which this is possible is $\_\_\_$
A game of cards is played among $4$ friends. After the initial split of $52$ cards, the tallest person told that he has got $4$ Aces and all the remaining $9$ cards are o...
396
views
commented
Jan 27, 2022
Combinatory
go2025-dm-2
numerical-answers
combinatory
counting
moderate
+
–
1
answer
3
GATE Overflow Test Series | Mock GATE | Test 4 | Question: 58
Consider the following schedule $\textbf{Schedule}$ ... The number of view equivalent serial schedules of the given schedule is ________
Consider the following schedule$$\textbf{Schedule}$$$$\begin{array}{|c|c|c|}\hlineT_{1} & T_{2} & T_{3}\\\hlineR(x) & &\\\hline& R(x) &\\\hlineW(y) & & \\\hline& &R(x)\\\...
521
views
commented
Jan 26, 2022
Databases
go2025-mockgate-4
numerical-answers
databases
transactions-and-concurrency-control
+
–
1
answer
4
GATE Overflow Test Series | Mock GATE | Test 4 | Question: 34
Which one of the following is/are correct? (Mark all the appropriate choices) Compulsory misses can be reduced by increasing the total cache size. Capacity misses can be reduced by increasing the block size. Conflict ... reduced by increasing the value of associativity. Compulsory misses can be reduced by increasing the cache block size.
Which one of the following is/are correct? (Mark all the appropriate choices)Compulsory misses can be reduced by increasing the total cache size.Capacity misses can be re...
334
views
commented
Jan 25, 2022
CO and Architecture
go2025-mockgate-4
easy
cache-memory
co-and-architecture
multiple-selects
+
–
2
answers
5
GATE Overflow Test Series | Linear Algebra | Test 1 | Question: 4
Given a matrix $A = \dfrac{1}{2} \begin{bmatrix} 1 &1 &1 &1 \\ 1 &-1 &1 &-1 \\ 1 &1 &-1 &-1 \\ 1& -1 &-1 &1 \end{bmatrix},$ then $(AA^{-1})^{T}$ is _______ $I$ $\frac{1}{2} I$ $4I$ $\frac{1}{4}I$
Given a matrix $A = \dfrac{1}{2} \begin{bmatrix} 1 &1 &1 &1 \\ 1 &-1 &1 &-1 \\ 1 &1 &-1 &-1 \\ 1& -1 &-1 &1 \end{bmatrix},$ then $(AA^{-1})^{T}$ is _______$I$$\frac{1}{2}...
283
views
commented
Jan 23, 2022
Linear Algebra
go2025-linear-algebra-1
matrix
+
–
11
answers
6
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...
22.8k
views
commented
Jan 18, 2022
Combinatory
gatecse-2018
generating-functions
normal
combinatory
1-mark
+
–
4
answers
7
GATE CSE 2014 Set 2 | Question: 16
Let $A\:\leq_m\:B$ denotes that language $A$ is mapping reducible (also known as many-to-one reducible) to language $B$. Which one of the following is FALSE? If $A\: \leq_m B$ and $B$ is recursive then $A$ ... then $A$ is recursively enumerable. If $A\: \leq_m B$ and $B$ is not recursively enumerable then $A$ is not recursively enumerable.
Let $A\:\leq_m\:B$ denotes that language $A$ is mapping reducible (also known as many-to-one reducible) to language $B$. Which one of the following is FALSE?If $A\: \leq_...
17.5k
views
commented
Jan 17, 2022
Theory of Computation
gatecse-2014-set2
theory-of-computation
recursive-and-recursively-enumerable-languages
normal
+
–
1
answer
8
GATE Overflow Test Series | Mock GATE | Test 2 | Question: 45
Consider the following C program int Dosomething(struct treenode *root , int sum) { if(root==NULL) return sum; sum = Dosomething(root -> left, sum); sum = Dosomething(root -> right, sum); if(root -> ... the first parameter and the second parameter has the value $1,$ then the value returned by the function will be _________
Consider the following C programint Dosomething(struct treenode *root , int sum) { if(root==NULL) return sum; sum = Dosomething(root - left, sum); sum = Dosomething(root ...
672
views
commented
Jan 15, 2022
DS
go2025-mockgate-2
numerical-answers
binary-tree
pseudocode
+
–
3
answers
9
GATE CSE 1995 | Question: 1.3
In a vectored interrupt: The branch address is assigned to a fixed location in memory The interrupting source supplies the branch information to the processor through an interrupt vector The branch address is obtained from a register in the processor None of the above
In a vectored interrupt:The branch address is assigned to a fixed location in memoryThe interrupting source supplies the branch information to the processor through an in...
14.7k
views
commented
Jan 11, 2022
CO and Architecture
gate1995
co-and-architecture
interrupts
normal
+
–
2
answers
10
fast retransmit and fast recovery mechanism
Consider the following plot of TCP window size as a function of time. Assume TCP is operating with slow start, congestion avoidance, fast retransmit and fast recovery mechanism. What is the time interval where the slow start ... value of threshold. It starts congestion avoidance phase again. Please explain in more details about the concept underlying?
Consider the following plot of TCP window size as a function of time. Assume TCP is operating with slow start, congestion avoidance, fast retransmit and fast recovery mec...
2.0k
views
commented
Jan 10, 2022
Computer Networks
computer-networks
tcp
congestion-control
+
–
1
answer
11
Token Bucket
Token Bucket mechanism is used for congestion control at router. Bucket capacity in 700 Bytes (initially full), token arrival rate is 200 Bytes/sec and maximum output rate is 300 Bytes/sec. The amount of time (in sec) required to transmit 3000 Bytes file is _____.
Token Bucket mechanism is used for congestion control at router. Bucket capacity in 700 Bytes (initially full), token arrival rate is 200 Bytes/sec and maximum output rat...
4.3k
views
commented
Jan 8, 2022
Computer Networks
computer-networks
token-bucket
+
–
6
answers
12
GATE CSE 2016 Set 1 | Question: 43
Consider the transition diagram of a PDA given below with input alphabet $\Sigma=\{a,b\}$ and stack alphabet $\Gamma = \{X,Z\}$. $Z$ is the initial stack symbol. Let $L$ ... on every input $L =\{a^n\mid n \geq0 \} \cup \{a^nb^n \mid n \geq 0\}$ and is deterministic context-free
Consider the transition diagram of a PDA given below with input alphabet $\Sigma=\{a,b\}$ and stack alphabet $\Gamma = \{X,Z\}$. $Z$ is the initial stack symbol. Let $L$ ...
16.9k
views
commented
Jan 7, 2022
Theory of Computation
gatecse-2016-set1
theory-of-computation
pushdown-automata
normal
+
–
4
answers
13
GATE CSE 2017 Set 2 | Question: 48
If a random variable $X$ has a Poisson distribution with mean $5$, then the expectation $E\left [ \left ( x+2 \right )^{2} \right ]$ equals ___.
If a random variable $X$ has a Poisson distribution with mean $5$, then the expectation $E\left [ \left ( x+2 \right )^{2} \right ]$ equals ___.
16.4k
views
commented
Jan 5, 2022
Probability
gatecse-2017-set2
expectation
poisson-distribution
numerical-answers
probability
+
–
5
answers
14
GATE CSE 2017 Set 1 | Question: 19
Let $X$ be a Gaussian random variable with mean 0 and variance $\sigma ^{2}$. Let $Y$ = $\max\left ( X,0 \right )$ where $\max\left ( a,b \right )$ is the maximum of $a$ and $b$. The median of $Y$ is ______________ .
Let $X$ be a Gaussian random variable with mean 0 and variance $\sigma ^{2}$. Let $Y$ = $\max\left ( X,0 \right )$ where $\max\left ( a,b \right )$ is the maximum of $a$ ...
20.6k
views
commented
Jan 4, 2022
Probability
gatecse-2017-set1
probability
numerical-answers
normal-distribution
+
–
5
answers
15
GATE CSE 1999 | Question: 3
Mr. X claims the following: If a relation R is both symmetric and transitive, then R is reflexive. For this, Mr. X offers the following proof: “From xRy, using symmetry we get yRx. Now because R is transitive xRy and yRx together imply xRx. Therefore, R is reflexive”. Give an example of a relation R which is symmetric and transitive but not reflexive.
Mr. X claims the following: If a relation R is both symmetric and transitive, then R is reflexive. For this, Mr. X offers the following proof:“From xRy, using symme...
3.0k
views
commented
Dec 29, 2021
Set Theory & Algebra
gate1999
set-theory&algebra
relations
normal
descriptive
+
–
2
answers
16
GATE CSE 2010 | Question: 25
Which of the following statements are true? Shortest remaining time first scheduling may cause starvation Preemptive scheduling may cause starvation Round robin is better than FCFS in terms of response time I only I and III only II and III only I, II and III
Which of the following statements are true?Shortest remaining time first scheduling may cause starvationPreemptive scheduling may cause starvationRound robin is better th...
20.6k
views
commented
Nov 22, 2021
Operating System
gatecse-2010
operating-system
process-scheduling
easy
+
–
6
answers
17
GATE IT 2005 | Question: 76
A company has a class $C$ network address of $204.204.204.0$. It wishes to have three subnets, one with $100$ hosts and two with $50$ ... $204.204.204.128/255.255.255.128$ $204.204.204.64/255.255.255.192$ $204.204.204.0/255.255.255.192$
A company has a class $C$ network address of $204.204.204.0$. It wishes to have three subnets, one with $100$ hosts and two with $50$ hosts each. Which one of the followi...
15.3k
views
commented
Nov 14, 2021
Computer Networks
gateit-2005
computer-networks
subnetting
normal
+
–
7
answers
18
GATE CSE 2008 | Question: 40
The minimum number of comparisons required to determine if an integer appears more than $\frac{n}{2}$ times in a sorted array of $n$ integers is $\Theta(n)$ $\Theta(\log n)$ $\Theta(\log^*n)$ $\Theta(1)$
The minimum number of comparisons required to determine if an integer appears more than $\frac{n}{2}$ times in a sorted array of $n$ integers is$\Theta(n)$$\Theta(\log n)...
36.7k
views
commented
Nov 11, 2021
Algorithms
gatecse-2008
normal
algorithms
time-complexity
+
–
2
answers
19
GATE CSE 1988 | Question: 4ii
Using binary full adders and other logic gates (if necessary), design an adder for adding $4$-bit number (including sign) in $2’s$ complement notation.
Using binary full adders and other logic gates (if necessary), design an adder for adding $4$-bit number (including sign) in $2’s$ complement notation.
3.0k
views
commented
Jun 19, 2021
Digital Logic
gate1988
digital-logic
descriptive
adder
+
–
1
answer
20
Peter Linz Edition 4 Exercise 5.2 Question 2 (Page No. 144)
Find an s-grammar for $L =$ {$a^nb^n : n ≥ 1$}.
Find an s-grammar for $L =$ {$a^nb^n : n ≥ 1$}.
481
views
commented
Jun 9, 2021
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
grammar
+
–
1
answer
21
Peter Linz Edition 4 Exercise 4.3 Question 3 (Page No. 122)
Show that the language $L = \{w : n_a (w) = n_b(w) \}$ is not regular. Is $L^*$ regular?
Show that the language $L = \{w : n_a (w) = n_b(w) \}$ is not regular. Is $L^*$ regular?
342
views
answer edited
May 30, 2021
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
pumping-lemma
regular-language
+
–
2
answers
22
Given Language is REC or Non RE
Which of the following is true for the given language? $L=$ {<TM> | TM halts on every input} <TM> is encoding of the Turing machine (A) $L$ is Recursive and $\overline{L}$ is also Recursive (B) $L$ is Recursive ... Enumerable and $\overline{L}$ is Recursive Enumerable (D) $L$ is Non Recursive Enumerable and $\overline{L}$ is Non Recursive Enumerable
Which of the following is true for the given language?$L=$ {<TM | TM halts on every input}<TM is encoding of the Turing machine(A) $L$ is Recursive and $\overline{L}$ is ...
3.1k
views
commented
Oct 31, 2020
Theory of Computation
theory-of-computation
difficult
recursive-and-recursively-enumerable-languages
decidability
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register