Register
Filter

Recent questions without answers

976
views
0 answers
0 votes
Stanford(Quiz)
Network A consists of a hub with twenty ports, each connected to exactly one end host. Network B is identical, except the hub is replaced by a switch. Which of ... .The nodes in Network B can be further apart than the nodes in Network A.
User Avatar
445
views
0 answers
0 votes
Set Theory
User Avatar
220
views
0 answers
0 votes
virtualgate
User Avatar
321
views
0 answers
0 votes
virtualgate
User Avatar
198
views
0 answers
0 votes
PLEASE HELP
i find many theorems ON ABELIAN GROUPS CAN SOMEONE SUGGEST ME ONE PLACE WHERE I GET THEOREMS ON ABELIAN GROUPS
User Avatar
1.4k
views
0 answers
0 votes
Timothy Williams - Programming Output
static char hello[]='hello'; printf("%s",hello);The output will be same as-puts("hello");puts(hello);printf("%s", "hello");puts("hello\n");Answer is 1,2 and 3.Can anyone tell what's the problem with 4 option? It is also printing hello.
User Avatar
213
views
0 answers
0 votes
gatebook
Let L be any a language over input alphabet {0,1}, and T(L) can be formed by applying following 2 rules1. Adding odd number of in the beginning and odd ... regularC. T(L) can never be a regular languageD. Cant say anything about T(L)
User Avatar
268
views
0 answers
0 votes
gatebook
Time complexity to find a string of length k is accepted by a given deterministic finite automata on n states, over 2 symbol input alphabet isA. O(k)B. O(nk)C. O(klogn)D. None
User Avatar
448
views
0 answers
0 votes
Cache
State True of falseSTATEMENT : Conflict and Inference misses can be reduced by doubling the associativity of a cache design.what is Inference misses here ? I Know it is true for conflict misses.
User Avatar
369
views
0 answers
0 votes
Made easy test series
A simple network consist of two nodes X and Y. Each node has a single frame of F = 1500 bits (including all header and preambles) to send to each other. Both nodes ... X's packet (from t = 0) to be completely delivered to Y is ________ μs.
User Avatar
140
views
0 answers
0 votes
Suggestion
Please suggest me which test series is best. Made easy or Vani institute.
User Avatar
450
views
0 answers
2 votes
doubt
#include <stdio.h> int main(void) { static int a[10]; int x=0; a[x]=++x; printf("%d %d %d",a[0],a[1],a[2]); return 0; }my doubt here is [ ] has high ... a*=1 or a[0]=1so finally answer should be 1 0 0, but it is giving 0 1 0 as output.
User Avatar
678
views
0 answers
0 votes
TCP for virtual circuits
TCP can be implemented in virtual circuits. (TRUE /FALSE )Explain.
User Avatar
323
views
0 answers
0 votes
Number of Table in ER
Q1I think here number of tables required should be 2 right?Q2 Consider the following set of functional dependencies{(Eid, pno) --­­> hours,Eid ­­--> Ename,Pno ... All of the above.Here answer is 4. Any good reference to support answer?
User Avatar
377
views
0 answers
0 votes
TCP Congestion window
Consider Communication channel using the TCP over the channel. In this channel the congestion window varies from (W*MSS)/2 to W*MSS. If only one packet is lost over each period of time. Then what ... 8 * W*W + 3W/8)D) 1 / (3/4 * W*W + 3W/4)
User Avatar
731
views
0 answers
0 votes
Made easy test series
The best effort delivery services such as an IP does not include(a) error checking(b) datagram acknowledgment(c) error correction(d) All of these
User Avatar
519
views
0 answers
0 votes
Self doubt Kenneth Rosen Algebraic structures
In case of A having 4 elements {a,b,c,d} with A as Identity element.Number of groups possible is given to be 2. I want to know why this * ... formula that can give us number of groups possible when cardinality of set A is given?
User Avatar
312
views
0 answers
0 votes
cache
what is cache hit time and what is cache hit latency ? are they both same ?
User Avatar
156
views
0 answers
0 votes
Hashing
What is clustering effect in hashing How quadratic and pseudorandom method of hashing worksWhat is the difference between chaining and linklist method of hashing
User Avatar
322
views
0 answers
0 votes
What is page size
User Avatar
631
views
0 answers
4 votes
REALTION ALGEBRA
Consider the following relations:The number of records resulted by the following relational algebra expression are _________?
User Avatar
781
views
0 answers
1 votes
Number of Super keys
Q1) Consider the relation with n attributes if any 2 attribute is a candidate key, then the total number of candidate keys are___ ?Then what will be the ... Is the answer remains same if use every in place of any in above question?
User Avatar
369
views
0 answers
0 votes
Infinite set
If S is infinite set and S1 ...........Sn be sets such that S1U S2US3 ..................USn =S, thena. Atleast one of the set Si is a ... Atleast one of the sets Si is an infinite setd. Not more than one of the sets Si can be infinite
User Avatar
320
views
0 answers
0 votes
how to check linear dependencies
User Avatar
839
views
0 answers
4 votes
Computer Network: Network Congestion
For a host machine that uses the Token Bucket Algorithm for congestion control, the token bucket has a capacity of 1MB and the maximum output rate is 10MBPS, Tokens arrive at a rate ... time to send 10 MB = 1.6 + 2 = 1.8 Seconds ( correct?)
User Avatar
238
views
0 answers
0 votes
Countable Set or not
How to know whether a enumeration method exist or not for a given set to prove it countable?? For example how to know that set of irrational numbers is countable or not..
User Avatar
273
views
0 answers
0 votes
time complexity
https://gateoverflow.in/46212/cmi2011-b-06awhat will be the time complexity of this algois it O(n2) ?to find largest element = O(n)holding in hand and rotating..which is ... then for n elements O(n) * O(n) = O(n2)correct me if am wrong
User Avatar
353
views
0 answers
0 votes
Clocks in Synchronus Sequential circuits
Can someone illustrate with well defined procedure of finding the output timing diagram in the circuit involving various flip flops, some combinational circuit. This circuit ... .in/264/gate2005-62 , http://gateoverflow.in/726/gate2001-2-8
User Avatar
Page: