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
Questions by Dulqar
5
votes
2
answers
31
CN - Fragmentation Offset [Modified Gate Question]
A host X send a message to host Y having two intermediate networks in between them.A TCP message consisting of 2100 bytes is passed to IP for delivery across two hosts. In first network has MTU of 1200 bytes second ... Assume that IP overhead per packet is 20 bytes. What is the fragmentation offset for the Last fragment that reaches destination
A host X send a message to host Y having two intermediate networks in between them.A TCP message consisting of 2100 bytes is passed to IP for delivery across two hosts. ...
4.4k
views
asked
Jan 20, 2017
Computer Networks
computer-networks
fragmentation
tcp
+
–
4
votes
1
answer
32
TCP Data Transfer Rate [modified Gate Question]
Consider three IP networks A,B and C. Host $H_A$ in network A sends messages each containing 200 bytes of application data to a host $H_C$ in network C. This passes through an intermediate network B . The maximum packet size ... is the rate at which application data is transferred to host $H_C$ ? Ignore errors, acknowledgements, and other overheads.
Consider three IP networks A,B and C. Host $H_A$ in network A sends messages each containing 200 bytes of application data to a host $H_C$ in network C. This passes throu...
514
views
asked
Jan 20, 2017
Computer Networks
computer-networks
tcp
+
–
0
votes
3
answers
33
Protocols
Which protocol is most appropriate for the situation described below . High Defnition Video streaming TCP UDP FTP SMTP
Which protocol is most appropriate for the situation described below . High Defnition Video streamingTCPUDPFTPSMTP
729
views
asked
Jan 19, 2017
Computer Networks
computer-networks
+
–
0
votes
1
answer
34
Virtual Gate Test Series: Programming & DS - Define
#define THIS 0 #define THAT 0 #include <stdio.h> int main(int argc, char const *argv[]) { #ifdef THIS && THAT printf("if\n"); #else printf("else\n"); #endif return 0; } What is the output? What happens if the first two lines are not initializing. i.e., #define THIS #define THAT
#define THIS 0 #define THAT 0 #include <stdio.h int main(int argc, char const *argv[]) { #ifdef THIS && THAT printf("if\n"); #else printf("else\n"); #endif return 0; }Wha...
288
views
asked
Jan 15, 2017
Programming in C
programming-in-c
virtual-gate-test-series
+
–
0
votes
0
answers
35
How to know 1:1 or n:n participation
By looking into er table how do we know it is 1:1 or N:N relation
By looking into er table how do we know it is 1:1 or N:N relation
248
views
asked
Jan 14, 2017
Databases
databases
+
–
2
votes
1
answer
36
CO Moemory Hierarchy
Consider a 3 Level Memory System with the following specifications (H1,H2,H3) = (0.8,0.9,1) (T1,T2,T3) = (2,100,500) nano sec / word IF there is miss at L1 and Hit at L2 .A 2-Word block must be transfered from L2 to L1 IF there is miss at both ... Taken Given that the data width between L1 to L2 and L2 to L3 is 4 Word block is Tavg-2 What is the ratio of Tavg-1 to Tavg-2
Consider a 3 Level Memory System with the following specifications(H1,H2,H3) = (0.8,0.9,1)(T1,T2,T3) = (2,100,500) nano sec / wordIF there is miss at L1 and Hit at L2 .A...
1.3k
views
asked
Jan 13, 2017
CO and Architecture
co-and-architecture
memory-hierarchy
cache-memory
+
–
0
votes
0
answers
37
Justify the statement
Deadlock avoidance is less restrictive than deadlock prevention
Deadlock avoidance is less restrictive than deadlock prevention
142
views
asked
Jan 12, 2017
Operating System
operating-system
+
–
0
votes
2
answers
38
OS Test -1
A computer has 20 tape drivers, with n processes competing for them. Each process may need five drivers. What is the maximum value of n for the system to be deadlock free?
A computer has 20 tape drivers, with n processes competing for them. Each process may need five drivers. What is the maximum value of n for the system to be deadlock free...
318
views
asked
Jan 12, 2017
CO and Architecture
test-series
+
–
1
votes
0
answers
39
How to Simplify ?
$\frac{1}{10^{9}}[30*10^{-3}]+(1-\frac{1}{10^{9}})[300*10^{-9}]$ Answer should be in nano seconds
$\frac{1}{10^{9}}[30*10^{-3}]+(1-\frac{1}{10^{9}})[300*10^{-9}]$ Answer should be in nano seconds
275
views
asked
Jan 12, 2017
Quantitative Aptitude
test-series
+
–
1
votes
2
answers
40
How Q1 and Q2 are Equal ?
Please Explain How Q1 and Q2 are equal using state Minimization Technique State Equivalance Algorithm Table Filling Algorithm a b Q1 Q2 Q1 Q2 Q1 Q2
Please Explain How Q1 and Q2 are equal using state Minimization TechniqueState Equivalance AlgorithmTable Filling Algorithm abQ1Q2Q1Q2Q1Q2
972
views
asked
Jan 9, 2017
Theory of Computation
theory-of-computation
+
–
4
votes
2
answers
41
How to convert a Decimal Number to IEEE754 Representation ?
How to represnet 1.1 using IEEE 754 Single Precision and Double Precision Number Representation . Please explain in detail
How to represnet 1.1 using IEEE 754 Single Precision and Double Precision Number Representation . Please explain in detail
1.9k
views
asked
Jan 9, 2017
CO and Architecture
floating-point-representation
ieee-representation
+
–
6
votes
1
answer
42
Regular Expression - Equality
I want to know whether the following Regular Expressions are Equal ? (a+b) * = (a* + b*)* = (a* + b)* = (a + b*)* = (a* b*)* = (b* a*)* = a*(ba*)* = (a*b)*a*
I want to know whether the following Regular Expressions are Equal ?(a+b) * = (a* + b*)* = (a* + b)* = (a + b*)* = (a* b*)* = (b* a*)* = a*(ba*)* ...
5.1k
views
asked
Jan 9, 2017
Theory of Computation
regular-expression
theory-of-computation
+
–
3
votes
1
answer
43
Float Stored as
Cosider the code snippet CODE 1 float a= 10.25; if(a==10.25) ptint " A " else print "B" print "C" CODE 2 float a =10.25; n=15.25; while(n!=10.25) { print "*"; n--; } Number of times * printed ? Please explain the output in both cases
Cosider the code snippetCODE 1float a= 10.25; if(a==10.25) ptint " A " else print "B" print "C"CODE 2float a =10.25; n=15.25; while(n!=10.25) { print "*"; n ; } Number of...
357
views
asked
Jan 8, 2017
Programming in C
programming-in-c
+
–
0
votes
1
answer
44
Maths Logics
Is the given statement True ? Please explain $\forall_x \left \{ P(x) \vee Q(x) \right \}\Leftrightarrow \forall_x P(x) \vee \forall_x Q(x) $ $\forall_x \left \{ P(x) \wedge Q(x) \right \}\Leftrightarrow \forall_x P(x) \wedge \forall_x Q(x) $ ... $\exists_x \left \{ P(x) \wedge Q(x) \right \}\Leftrightarrow \exists_x P(x) \wedge \exists_x Q(x) $
Is the given statement True ? Please explain$\forall_x \left \{ P(x) \vee Q(x) \right \}\Leftrightarrow \forall_x P(x) \vee \forall_x Q(x) $$\forall_x \left \{ P(x) \wed...
716
views
asked
Jan 7, 2017
Mathematical Logic
mathematical-logic
+
–
2
votes
1
answer
45
Transform the sentence to Logical Statement
" Lazy and Smart People Are Dangerous " What I think is that $\forall(x) (\text{Lazy}(x) \wedge\text{Smart}(x) \rightarrow Dangerous(s) )$ Is it correct ? If YES https://gateoverflow.in/800/gate2009-23 if NO Explain why ?
" Lazy and Smart People Are Dangerous "What I think is that $\forall(x) (\text{Lazy}(x) \wedge\text{Smart}(x) \rightarrow Dangerous(s) )$Is it correct ?If YEShttps://gate...
536
views
asked
Jan 7, 2017
Mathematical Logic
mathematical-logic
easy
first-order-logic
+
–
5
votes
1
answer
46
Minimum and Maximum number of Tuples in the Following Relations
Given R with n tuples S with m tuples n<m then How many minimum and maximum tuples in follwing relations . Please Justify with Reason / Examples R-S S-R R Left Join S R Natural Join S R/S S/R
Given R with n tuples S with m tuples n<m then How many minimum and maximum tuples in follwing relations . Please Justify with Reason / ExamplesR-SS-RR Left Join SR Nat...
9.6k
views
asked
Jan 6, 2017
Databases
databases
+
–
3
votes
2
answers
47
What is the general idea to approach to problems in Dynamic Programming ?
Could someone tell me What is the general idea to approach to problems in Dynamic Programming ? ie. Given a problem How do I start my thinking :P , Im not getting a clue to deal with DP problems . Making Recursive Equations etc ... would give us 25, 10, 5, but the best solution only requires 2 coins - 2 of the 20 cent coins
Could someone tell me What is the general idea to approach to problems in Dynamic Programming ?ie. Given a problem How do I start my thinking :P , Im not getting a clue t...
1.2k
views
asked
Jan 6, 2017
Algorithms
algorithms
dynamic-programming
+
–
2
votes
1
answer
48
Stars and bar problem
Can someone explain stars and bar problme using suitable example and images Problem : https://en.wikipedia.org/wiki/Stars_and_bars_%28combinatorics%29#Proofs_via_the_method_of_stars_and_bars
Can someone explain stars and bar problme using suitable example and imagesProblem : https://en.wikipedia.org/wiki/Stars_and_bars_%28combinatorics%29#Proofs_via_the_metho...
442
views
asked
Jan 5, 2017
Combinatory
combinatory
+
–
0
votes
0
answers
49
Queue Time Complexity
" Time Complexity of Dequeue will be $ \leq $Time complexity of Enqueue operations " Justify the above statement
" Time Complexity of Dequeue will be $ \leq $Time complexity of Enqueue operations "Justify the above statement
512
views
asked
Dec 31, 2016
DS
time-complexity
queue
+
–
3
votes
1
answer
50
Solve the Recurrence
Solve the Following Recurrence using Back Substitution Master Theorem $T(n)=T(\sqrt{n})+n+c$ Using Master Theorem Using Master Theorem, put n = $2^{m}$ $ T(n)=T(2^{m})= S(m)$ ie $T(\sqrt{n}) = S(\frac{m}{2})$ ... How to proceed further... ?
Solve the Following Recurrence usingBack SubstitutionMaster Theorem$T(n)=T(\sqrt{n})+n+c$ Using Master TheoremUsing Master Theorem,put n = $2^{m}$$ T(n)=T(2^{m})= S(m)$ i...
1.1k
views
asked
Dec 22, 2016
Algorithms
algorithms
recurrence-relation
+
–
Page:
« prev
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register