2 answers
1
Does any normal form impose the condition "every non-key should depend upon every key"?
2 answers
2
How to get solution of the following recurrence?$T(n) = \sqrt{n} .T(\sqrt{n}) + n$
2 answers
3
Let $h_n$ denote the number of non-negative integral solutions of the equation $3x_1 + 4x_2 + 2x_3 + 5x_4 = n$Find the generating function $g(x)$ for $h_0,h_1,h_2,h_3 ....
1 answer
4
Consider a graph where vertex having number 2 to 12 (including 2 and 12), there is an edge between two vertex x and y iff x divides yWhich vertex will have highest in deg...
1 answer
7
Gate score of 783 and rank 259What are the chances for old iits???Can i make it to kgp?
3 answers
8
1 answer
9
If Gate result is awaited, what should be filled in qualifying exam? The score field is mandatory
1 answer
10
1 answer
11
Is Quick Sort an in-place algorithm?I read somewhere that although its space complexity is O(logn) [best case], it is referred to as an in place algo by Wikipedia because...
1 answer
12
What is the formula for average access time using write-through and write-back policy?
0 answers
13
How to integrate: $\int e^{-x^{2}} dx$More specifically, how to integrate standard normal distribution function from 0 to a?
1 answer
14
L = {ai bj ck dm} | i+j+k+m is multiple of 13}L is ?(a) Regular (b) Context-free(c) Turing-decidable (d) Turing-Recognizable
2 answers
16
If a micro program supports 46 micro operations with parallelism of 2, how many and what size of field exits in micro operation field?How do we get the size of micro-oper...
2 answers
18
3 answers
19
A Hash table has space for 100 records. Then the probability of collision before the table is 10% full is?A 0.45B 0.5C 0.3D 0.34 (approximately)
1 answer
21
How do i prove that : : : In hashing n items into a hash table with k locations, the expected number of collisions is $n - k + k( 1-\frac{1}{k})^n$ ??
2 answers
22
$/* abc */Printf("what's \ up \ \%d",++ \&\& *a);$
1 answer
24
Please explain how the formula of frequency of clock obtained?Is the formula for time of clock not this - Time of clock >= no of flip flop* delay per flip-flop?Also, does...
1 answer
25
Let T be a B-tree of order m and height h. if n is the number of key elements in T then the maximum value of n is(m-1)h-1(m-1)h-1+1Mh-1Mh+1+1
2 answers
26
Consider the following scheduleS : r1(A) w2(A) r3(A) w4(A) r5(A) w6(A)The number of schedules equal to given schedule(s) which not conflict equal to schedule(s) are _____...
1 answer
27
1 answer
28
3 answers
29
Consider the set S = {a, b} and ‘L’ be a binary relation such that L = {all binary relations except reflexive relation set S}. The number of relation which are symmet...
9 answers
30
Let $P(x)$ and $Q(x)$ be arbitrary predicates. Which of the following statements is always TRUE?$\left(\left(\forall x \left(P\left(x\right) \vee Q\left(x\right)\right)\r...