Recent questions without answers

248
views
0 answers
1 votes
Consider inserting the key 10,22,31,4,15,28,17,88,59 using open addressing technique into hash table of length m=11 with hash function h(k)= k mod 11 what is no of ... 7 B) 10 C)12 D) none of these given ans is d is it right?
1.2k
views
0 answers
0 votes
The complement of the language {wwwww|w in (0+1+@+#+$+%)*} isa)Finite set b)Regular set c)CFL d)CSL but not CFL
288
views
0 answers
0 votes
I read that latch are level triggered and flip flop are egde triggered .Doubts1. can a latch be synchronous? Is gated latch synchronous??2. Is flip flop always synchronous??
2.5k
views
0 answers
0 votes
Consider a computer with 4 floating point processors suppose that each processor uses a cycle time of 40 nsec .how long will tit take perform 400 floating ... operations are carried out on a single processor with cycle time of 10nsec??
264
views
0 answers
0 votes
Can tsl and swap support bounded waitingIf yes can someone give me code for both please kindly help me..
673
views
0 answers
0 votes
Consider the two independent random variable X and Y having probability density functions uniform in the interval [0,1] The probability that X+Y>1.5 :$a)\frac{1}{4}$ ... c)\frac{1}{3}$ $d)\frac{3}{8}$e)None \ of \ these$
594
views
0 answers
0 votes
270
views
0 answers
0 votes
The _______ has the responsibility to start up the processing of operating system.1) ROM BIOS2) Bootstrap program3) Boost sector4) All options are correct
226
views
0 answers
0 votes
The program in the operating system that dose processor management is called _________.1) traffic controller2) dispatcher3) processor scheduler4) job scheduler
173
views
0 answers
0 votes
In order to use a DBMS, it is important to understandA.the physical schemaB.all sub-schemas that the system supportsC.one subschemaD.both (a) and (b)E.None of the above
611
views
0 answers
0 votes
Self-contained sequence of instructions that performs a given computational task is called?1) Function2) Procedure3) Subroutine4) Routine
173
views
0 answers
0 votes
Assume that a lower traingular matrix A[0.....n-1,0...n-1] is stored in a linear array B [0....1/2 n (n+1)-1] in row by row order for n=100 if A[0,0] is stored inB[0] where is A[90,80] stored in B array??
347
views
0 answers
1 votes
395
views
0 answers
0 votes
46. A client-server system uses a satellite network, with the satellite at a height of 40,000 kms. What is the best-case delay in responses to a request? (Note that the speed of ... m sec(C) 400.00 m sec(D) 533.33 m secWhy Ans is D not B ?
956
views
0 answers
0 votes
Let G be a non-abelian group, order of G can be ?(A) 24 (B) 44 (C) 54 (D) 34
140
views
0 answers
0 votes
Whats the role of not exists here...
168
views
0 answers
0 votes
Database file consist 1250 records. Block can hold either 3 records or (10 keys, 11 pointers). The maximum number of levels of index required for sparse B+ tree index for database file are ______.
803
views
0 answers
1 votes
Consider the following schedules:S1: w2(a) w1(a) w3(c) r1(a) r3(b) w2(b) r3(c)S2: r3(a) r1(b) r3(a) w2(b) r1(a) r2(a) w2(c) ... number of swaps required so that schedule S2 has conflict serializability as in the same order as that of S1?
889
views
0 answers
2 votes
Which of the following statement false is relation R is in 3NF but not BCNF?A) Relation R must consist atleast two over-lapped candidate keys.B) Relation R must ... explain what does Option A refers here.......i.e overlapped candidate keys
410
views
0 answers
0 votes
637
views
0 answers
0 votes
I'm getting 4 nodes and 5 edges. But the answer given is : 6 nodes and 7 edges
609
views
0 answers
1 votes
Does inverted page table takes less memory to store a processes as compared to single/multilevel paging?Please explain reason also
780
views
0 answers
1 votes
in TCP connection establishment phase(S1) The server moves LISTEN → SYN_RCVD → SYN_SENT → ESTABLISHED in the state machine on no packet loss =>False .( ... state machine on no packet loss. => Truewhat does these statements actually mean ?
269
views
0 answers
1 votes
Consider a CFG that describes a language L(G) . G may have € productions. If a non empty string w of length n can be derived in m steps, what is the maximum number of nodes in the parse tree for w?
636
views
0 answers
0 votes
585
views
0 answers
0 votes
The exponent of 11 in the prime factorization of 300! is27282930the answer is 29.....but what if the question was just factorisation and not prime factorisationis there any difference ?
151
views
0 answers
0 votes
https://gateoverflow.in/3316/gate2008-it-26is this still in syllabus?