1
2
What is the sum to infinity of the series, $3+6x^{2}+9x^{4}+12x^{6}+ \dots$ given $\left | x \right |<1$ $\frac{3}{(1+x^{2})}$ $\frac{3}{(1+x^{2})^{2}}$ $\frac{3}{(1-x^{2})^{2}}$ $\frac{3}{(1-x^{2})}$
1 vote
3
A class is composed of 2 brothers and 6 other boys. In how many ways can all the boys be seated at a round table so that the two brothers are not seated together?
1 vote
4
Assume that a fair six-sided die is rolled once. If the value on the die is 1, 2, or 3, the die is rolled a second time.So find the probability that the aggregate of total of values that turn up is at least 6?
1 vote
5
1 vote
6
Which of the following relation can decompose into BCNF with dependency preserving and lossless join decomposition. (i) R(ABCDE) {AB → C, C → AB, C → D, D → E} (ii) R(ABCDE) {AB → C, C → A, C → D, D → E} A) only i B) Only II C) Both D) Neither
7
In a class of 45 students, the mean mark of 25 girls is 32 and the mean mark of 20 boys is 27.5. What is the class mean? (a) 32 (b) 27.5 (c) 29.75 (d) 30
1 vote
8
If the memory chip size is 256 x 1 bits, then the number of chips required to make up 1K bytes of memory is a) 32 b) 24 c) 12 d) 8
9
US portal Denominations are 1,10,21,34,70 , 100 and 350 . A) Make 140 Cents . Verify whether Greedy choice fails or not B) Make 182 Cents. Verify whether greedy choice fails or not. 1)Greedy fails in A 2) Greedy fails in B 3)Greedy does not fails in A 4)Greedy does not fails in B
1 vote
10
You know that a certain letter is equally likely to be in any one of three different folders. Let αi be the probability that you will find your letter upon making a quick examination of folder i if the letter is, in fact, in folder i, i = 1, 2, 3. (We may have αi < 1.) Suppose you look in folder 1 and do not find the letter. What is the probability that the letter is in folder 1?
1 vote
11
For all following questions we assume that: - Pipeline contains 5 stages: IF, ID, EX, M and W; - Each stage requires one clock cycle; - All memory references hit in cache; - Following program segment should be processed: LD R1, 0(R2) DADDI R1, R1, ... , R3, R2 BNEZ R4, Loop Calculate how many clock cycles will take execution of this segment on the simple pipeline without forwarding or bypassing ?
1 vote
12
13
Consider the partial implementation of a 2-bit counter using T flip-flops following the sequence 0-2-3-1-0, as shown below.
14
The number of min heap trees are possible with 15 elements such that every leaf node must be greater than all non-leaf nodes of the tree are ________.
1 vote
15
double foo(int n) { int i; double sum; if(n == 0) { return 1.0; } else { sum = 0.0; for(i = 0; i < n; i++) { sum += foo(i); } return sum; } } Q1] What is the running time complexity of the algorithm ? Q2] What is the change in running ... the values of foo(i) 0<i<n as and when they are computed . Please tell how the code will look like in first place Please explain in detail how to analyse it
1 vote
16
can anyone define the procedure to find the common ancestor of any two given nodes in balanced BST..??
1 vote
17
18
If two cards are selected randomly from a pack of 52 cards then find the probability of first card being club and second card not being a queen?
19
How the processes are removed from the Semaphore suspended queue?Is it implementation dependent or is it FIFO always?If not FIFO then how starvation will be handled.I got this doubt while reading following paragraph from williams stallings Chapter -5[Concurrency] The question ... ?Says if I use Priority based/SJf..etc ,then it will neither be strong semaphore nor weak semaphore?# Please clarify