Register
Filter

Recent questions without answers

363
views
0 answers
0 votes
Self Doubt
Is the dual of TOSET, a TOSET always?
User Avatar
629
views
0 answers
0 votes
Transmission time
My approach is :I calculated utilization first which is the time when link is active by total time U = transmission/ total timeTransmission = 1.048msecSince no ack sort ... 0.0205 1GBps = nearly 161MbpsWhat's wrong answer is B by the way
User Avatar
426
views
0 answers
0 votes
Transmission
My approach was :Transmission time = 0.214secPropagation time = 0.0008secSince transmission time > propagation time we can see that even if the packet reaches the destination ... = nearly 1.074 sec But answer is 2.78sec where i am wrong?
User Avatar
290
views
0 answers
0 votes
#virtualmemory
User Avatar
253
views
0 answers
0 votes
#Process Synchronization
In Interseted variable we found out that thereMutual Exclusion is guaranted .Deadlock is also guaranteedSo because of deadlock can we say there is no Bounded Waiting as well ... resource i.e CS but no one gets it , then no BOund on waiting
User Avatar
743
views
0 answers
1 votes
GATE-2006-IT-56: Doubt in Segmentation with Paging part.
https://gateoverflow.in/3600/gate2006-it-56Why is only 1 Page Table considered for 4 Segment Table entries in the selected best answer?
User Avatar
275
views
0 answers
0 votes
ACE TEST SERIES
ANS is given D but I think ANS is B please explain
User Avatar
308
views
0 answers
0 votes
ACE test series
Please explain the solution Ans iis given - C
User Avatar
313
views
0 answers
0 votes
Question regarding BCNF Normalization
I came across a statement that says that in BCNF, a prime attribute cannot be transitively dependent on a key.But consider a relation R (A, B, C) where ... ) is transitively dependent on A (a candidate key) !!Where am I making mistake?
User Avatar
548
views
0 answers
1 votes
techtud
In the knapsack problem we are given a set of n items, where each item i is specified by a size si and a value vi. We are also given a size bound S (the size of our knapsack). ... [S][n]= result;(C) arr[n][n]= result;(D) arr[n][S] = result;
User Avatar
591
views
0 answers
0 votes
MadeEasy Subject Test: Programming & DS - Binary Tree
Consider programint foo(struct node *tree){if(tree==0)return 0;int lh=ht(tree->left);int rh=ht(tree->right);int ld=foo(tree->left);int rd= ... ..it would be correct only when we consider nodes between leaf nodes including leaf nodes itself
User Avatar
417
views
0 answers
0 votes
#testbook test series
User Avatar
669
views
0 answers
0 votes
techtud
Let G is a graph with n vertices and m edges. Consider following statements : i. In DFS traversal, number of tree edges produced is independent of selection of starting ... correct(C) Statements (ii) and (iv) both are wrong(D) None of these
User Avatar
320
views
0 answers
1 votes
boolean expr
1)The boolean expression Y + (X+Y) + (X + Y') (X' +Y) can be minimised to ?2)Number of boolean expression with n variable is ?3)Number of boolean function with n variable is ? is boolean expreesion an function same?
User Avatar
192
views
0 answers
0 votes
Plz answer with Sol
User Avatar
513
views
0 answers
2 votes
binary search tree
In a binary search tree ,the key with value 5 was searched after traversing nodes with values 1,3,4,6,7,8,9 not necessarily in that order.Let P is the ... given nodes can be traversed before finding node with value 5 .Find (N/10)+P
User Avatar
162
views
0 answers
0 votes
Coreman
Show that the worst case running time of heap sort is Ω(nlogn).
User Avatar
120
views
0 answers
0 votes
self doubt
what is functionality and difference in get and post method in HTTP protocol?
User Avatar
383
views
0 answers
0 votes
COMPUTER NETWORK
1) A host with IP address 10.100.100.100 wants to use loop back testing then its source IP is 10.100.100.100 and destination IP is 127. ... ?3)which is closed loop solution for congestion controla)leaky bucketb)token bucketc)choke packet
User Avatar
100
views
0 answers
0 votes
self doubt
does tcp service provide timing , security , and throughput guaranteed?
User Avatar
287
views
0 answers
1 votes
Random
Please solve this without master's or extended master's theoremT(n) = 2T (n/2) + n/log n
User Avatar
486
views
0 answers
2 votes
Longest Common Sub sequence
We wish to find the longest common palindromic subsequence in a string. Read the above code snippet and choose the missing statements.a)S1: DP[i][j]=0; S2: DP[i][j] =1+DP[i+1][j-1] S3: ... ][j] =2+DP[i+1][j-1] S3: DP[i+1][j] ,DP[i+1][j-1]
User Avatar
339
views
0 answers
0 votes
test book test series
User Avatar
930
views
0 answers
0 votes
Maxima Minima
Find the maximum value of f(x). n is a constantf(x)= C(x,2) *$2^{n-x}$
User Avatar
149
views
0 answers
0 votes
syllabus
is target code generation and register allocation is in syllabus?
User Avatar
545
views
0 answers
0 votes
paging
in calculating emat with page fault service time givensome solutions use( page fault rate(p)*page faullt service) + memory timeand some use ( p*page faullt service) + ((1-p)* memory time)whats the difference?
User Avatar
290
views
0 answers
0 votes
Sliding Window
Please can anybody justify the given formulae Distinct Sequence number >= Sender WS + Receiver WSBy a Proper Example that why we need to consider both window sizes for distinct Sequence number.
User Avatar
528
views
0 answers
0 votes
process
1)Which is not a function of OSa)swap spaceb)free spacec)process creationd)effective device utilisation
User Avatar
Page: