The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Questions by Mk Utkarsh
User Mk Utkarsh
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Mk Utkarsh
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+2
votes
1
answer
1
Data communication and networking by forouzan 12.7 Exercise Qn 16
16. In a CDMA/CD network with a data rate of 10 Mbps, the maximum distance between any station pair is found to be 2500 m for the correct operation of the collision detection process. What should be the maximum distance if we increase the data rate to 100 Mbps? To 1 Gbps? To 10 Gbps?
asked
Nov 7
in
Computer Networks

61
views
computernetworks
pure_aloha
slotted_aloha
0
votes
1
answer
2
Data communication and networking by forouzan 12.7 Exercise Qn 15
15. In a CDMA/CD network with a data rate of 10 Mbps, the minimum frame size is found to be 512 bits for the correct operation of the collision detection process. What should be the minimum frame size if we increase the data rate to 100 Mbps? To 1 Gbps? To 10 Gbps?
asked
Nov 7
in
Computer Networks

27
views
computernetworks
pure_aloha
slotted_aloha
0
votes
0
answers
3
Data communication and networking by forouzan 12.7 Exercise
11. We have a pure ALOHA network with 100 stations. If $T_{fr} = 1 \mu s$, what is the number of frames each station can send to achieve the maximum efficiency. 12. Repeat Exercise 11 for slotted ALOHA.
asked
Nov 7
in
Computer Networks

28
views
computernetworks
slotted_aloha
pure_aloha
0
votes
1
answer
4
Maths: Limits
$\LARGE \lim_{n \rightarrow \infty} \frac{n^{\frac{3}{4}}}{log^9 n}$
asked
May 26
in
Calculus

142
views
engineeringmathematics
calculus
limits
+1
vote
0
answers
5
Find Asymptotic upper bound (http://www.csd.uwo.ca/~moreno/CS433CS9624/Resources/master.pdf)
asked
Apr 19
in
Algorithms

116
views
asymptoticnotations
timecomplexity
+2
votes
1
answer
6
Rosen 7e, Advance Counting techniques , Question 6.f
Find the generating function for the sequence $\left \{ a_n \right \} where $ $a_n = \Large \binom{10}{n+1} $ ... $\Large \color{red}{ \frac{( 1+x )^{10}  1}{x} }$ Please verify
asked
Mar 7
in
Combinatory

47
views
kennethrosen
discretemathematics
generatingfunctions
+1
vote
1
answer
7
MadeEasy Test Series 2019: Databases  Transaction And Concurrency
Consider the following schedule $\text{S : r2(A), w1(B), w1(C), R3(B), r2(B), r1(A), commit_1, r2(C), commit_2, w3(A), commit_3 }$ Consider the following statements : S1 : Schedule(S) is conflict ... ) is strict recoverable schedule. S4 : Schedule(S) is allowed by strict 2PL. How many above statements true about schedule(S) ?
asked
Jan 20
in
Databases

304
views
transactions
madeeasytestseries2019
madeeasytestseries
0
votes
0
answers
8
Asynchronous counter (Applied course mock 3)
MOD8 synchronous down counter MOD8 asynchronous up counter MOD10 asynchronous up counter MOD8 asynchronous down counter Please explain why it is down counter?
asked
Jan 15
in
Digital Logic

116
views
digitalcounter
+1
vote
1
answer
9
Interrupt Service Routing ( Applied course Mock 3)
Consider a process P1 that is executing on a Linuxlike OS on a single core system. When P1 is executing, a disk interrupt occurs, causing P1 to go to kernel mode to service that interrupt. The interrupt delivers all the disk blocks that unblock ... is ready P1 is ready and P2 is running P1 is running and P2 is ready P1 is blocked and P2 is ready
asked
Jan 15
in
Operating System

136
views
interrupts
0
votes
1
answer
10
ER Model (Applied Course Mock 3)
In ER model, which of the following is TRUE about weak entity Weak entity is not always existence dependent i.e., weak entity can exist without the entity with which it has a relationship Weak entity has a primary key that is partially or totally derived from the parent entity in a relationship Only I Only II Both I and II Neither I nor II
asked
Jan 14
in
Databases

118
views
erdiagram
0
votes
0
answers
11
Number of conflict serial orderings (with commit) Applied Course FT1
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?___________
asked
Jan 8
in
Databases

148
views
transactionandconcurrency
+2
votes
1
answer
12
Propositional logic self doubt
q = you can access the library r = you have a valid ID s = you have paid subscription fee of that day Consider the following English sentence “You cannot access the library if you don’t have a valid ID unless you have paid subscription fee of that day” which of the following is the correct logical expression? $q \rightarrow (r \vee s )$ $(q \rightarrow r) \vee s$
asked
Jan 7
in
Mathematical Logic

72
views
propositionallogic
discretemathematics
firstorderlogic
mathematicallogic
0
votes
0
answers
13
MadeEasy Subject Test 2019: Digital Logic  Flip Flop
The input to the LED is connected to the output $\overline{Q}$ of the master slave flipflop. The duration for which the LED will be ON in the time duration of T is _____ sec.
asked
Dec 14, 2018
in
Digital Logic

186
views
madeeasytestseries
digitallogic
flipflop
0
votes
0
answers
14
Strict Schedule or not
$S: r_1(A), w_2(A), Commit_2, w_3(A), Commit_3,w_1(A), Commit_1$ I think the given schedule is strict recoverable schedule Please confirm
asked
Dec 6, 2018
in
Databases

88
views
transactionandconcurrency
0
votes
0
answers
15
Testbook  Linked List
int find (struct node * first, int n) { while (first data ! = n) first = first — next; if (first data = = n) return(1); else return (1); in the above code segment if the value of 'n' is 5, then the function return 1, but if the value of 'n' is 9, then what does it do ?
asked
Dec 5, 2018
in
DS

134
views
linkedlists
datastructure
+1
vote
2
answers
16
GATE200322 Self doubt
The unusual $\Theta(n^2)$ implementation of Insertion Sort to sort an array uses linear search to identify the position where an element is to be inserted into the already sorted part of the array. If, instead, we use binary search to identify the ... case will be O(nlogn) because here no matter what the binary search will be performed for every element. Can someone confirm?
asked
Dec 3, 2018
in
Algorithms

153
views
algorithms
sorting
0
votes
2
answers
17
Self doubt SQL
Select Rating From professor P2 Where 5>=(Select count (*) From professor P3 Where P2.Rating <= P3.Rating); Can someone please explain the query?
asked
Dec 2, 2018
in
Databases

172
views
sql
0
votes
0
answers
18
Decidability Doubt
$L_1 = \{ \text{<M>}  \ \text{M is a TM, } \text{M}_0 \ \text{is a TM that halts on all inputs and, } \text{M}_0 \in L(M) \}$ ... infinite because $\exists$ infinite number of TM's which accept $\Sigma^*$. Now $L(M)$ is not even RE. If that then how $L_1$ is RE. Please explain both.
asked
Nov 23, 2018
in
Theory of Computation

90
views
theoryofcomputation
decidability
recursiveandrecursivelyenumerablelanguages
turingmachine
0
votes
0
answers
19
Self doubt decidability
$\text{L}_1 = \{\text{<M>}\text{M is a TM and L(M) is infinite} \}$ Not RE $\text{L}_2 = \{ \text{<M>}  \text{M is a TM and L(M) is countable} \}$ and $\text{L}_3 = \{ \text{<M>}  \text{M is a TM and L(M) is uncountable}\}$ both are Recursive how?
asked
Nov 23, 2018
in
Theory of Computation

69
views
decidability
0
votes
1
answer
20
Equivalence Problems
Equivalence of 2 CFL's is decidable or not? Equivalence of 2 Regular languages is decidable or not? Equivalence of 2 CSL is decidable or not? Equivalence of 2 Recursive languages is decidable or not? Equivalence of 2 DPDA's is decidable or not? Equivalence of 2 PDA's is decidable or not?
asked
Nov 20, 2018
in
Theory of Computation

80
views
theoryofcomputation
0
votes
0
answers
21
Self doubt C programming
https://gateoverflow.in/45555/cprogrammingpredicttheoutput main() { { extern int i; int i=20; { const volatile unsigned i=30; printf("%d",i); } printf("%d",i); } printf("%d",i); } int i; rude explained how output is printed but its giving error when i'm trying to run the program here https://ideone.com/xteXgV
asked
Nov 10, 2018
in
Programming

91
views
programminginc
output
0
votes
0
answers
22
Consider an undirected random graph of eight vertices.
Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is $\large \frac{1}{2}$. What is the probability that graph contains exactly 2 cycles of length 3?
asked
Oct 30, 2018
in
Probability

76
views
probability
0
votes
2
answers
23
Sum of Data dependencies
$I_1 : MUL \ \ \ \ \ R_1, R_2, R_3$ // $R_1 \leftarrow R_2 \times R_3$ $I_2 : ADD \ \ \ \ \ R_4, R_4, R_1$ $I_3 : MUL \ \ \ \ \ R_1, R_5, R_6$ $I_2 : SUB \ \ \ \ \ R_4, R_4, R_1$ Sum of RAW, WAR and WAW dependencies is _____.
asked
Oct 23, 2018
in
CO and Architecture

67
views
datahazards
datadependences
coandarchitecture
0
votes
1
answer
24
Pipeline : Number of RAW dependencies
Consider the below instructions executed on a 5 stage(IF,ID,EX,MA,WB) RISC pipeline with operand forwarding. I1: ADD R0,R1,R2 (R0=R1+R2) I2: SUB R3,R0,R2 I3:MUL R4,R3,R0 I4:DIV R5,R4,R0 How many RAW dependencies?
asked
Oct 23, 2018
in
CO and Architecture

234
views
datahazards
hazards
coandarchitecture
pipelining
datadependences
+4
votes
1
answer
25
Lexical Analysis
Consider the following code $x = (y + 5) + (^*z) * 10  x /3 $ Which of the following correctly identified by lexical analysis after scanning the above code? 5 Identifiers 3 literals 4 Identifiers 6 literals
asked
Oct 22, 2018
in
Compiler Design

217
views
compilerdesign
lexicalanalysis
0
votes
0
answers
26
Infix to postfix (Complicated declarations)
Please convert it to postfix by using stack and explain in detail void (*bsd_signal(int sig, void (*func)(int)))(int);
asked
Oct 20, 2018
in
Programming

159
views
stack
datastructure
infixpostfix
+1
vote
1
answer
27
Programming execution doubt
#include<stdio.h> #define type int type foo(type b) { return b*b; } #undef type #define type float int main() { float a = foo(1.1); printf("%1.2f", a); } Please explain line by line execution of this program.
asked
Oct 19, 2018
in
Programming

108
views
programminginc
+1
vote
1
answer
28
Kenneth Rosen Edition 6th Exercise 7.4 Question 4g (Page No. 496)
Find a closed form of the generating function of the following sequence $0, 1, 2, 4, 8, 16, 32,64,.....$
asked
Oct 14, 2018
in
Combinatory

104
views
generatingfunctions
kennethrosen
discretemathematics
0
votes
1
answer
29
Kenneth Rosen Edition 6th Exercise 7.4 Question 3e (Page No. 496)
Find closed form for the generating function of the following sequence $\binom{7}{0}, \binom{7}{1}, \binom{7}{2}, ......., \binom{7}{7},0,0,0,0,0,...$
asked
Oct 13, 2018
in
Combinatory

109
views
generatingfunctions
discretemathematics
kennethrosen
+1
vote
0
answers
30
Probability of missing the bus
You arrive at bus stop some time uniformly distributed between $10:00$ and $10:15$ and bus leaves the bus stop sometime uniformly distributed between $10:00$ and $10:25$. What is the probability of you missing the bus?
asked
Oct 5, 2018
in
Probability

117
views
probability
uniformdistribution
Page:
1
2
3
4
5
6
next »
50,650
questions
56,242
answers
194,293
comments
95,944
users