Recent activity by Kaushik.P.E

1
Did anyone received Call Letter for Written Test for IIT Madras MS ( for AIR > 800 - General Category) Program in Computer Science ?
2
Let C be a binary linear code with minimum distance 2t+1 then it can correct upto ___ bits of error t+1 t t-2 t/2
3
4
The question was like this ; if e1 then e2 else e3 is statement, and e1,e2,e3 correspond to expressions. This statement has 2 control paths What are the total number of control paths if there are 10 if statements?
5
6
An expert witness in a paternity suit testifies that the length (in days) of distributed with parameters μ=270 and σ^2=100. The defendant in the suit is able to prove that he was out of the country during a period that began 290 days before the birth of the ... the mother could have had the very long or very short pregnancy indicated by the testimony? 0.241 0.0241 how to solve such questions??
7
Consider languages L1 and L2 over {0,1) alphabet. L2= {w/w contains some x as a substring and x belongs to L1} Which of the following must be true? I. If L1 is regular, L2 is also regular II. If L1 is CFL, L2 is also CFL III. If L1 is recursive, L2 is also recursive (A). I and II only (B). I, II, III only (C). I and III only (D). II and III only
8
Consider the following statements about user level threads and kernel level threads. Which one of the following statements is FALSE? Context switch time is longer for kernel level threads than for user level threads. User level threads do not need any ... threads can be scheduled on different processors in a multi-processor system. Blocking one kernel level thread blocks all related threads.
9
$P$, $Q$ and $R$ talk about $S's$ car collection. $P$ states that $S$ has at least $3$ cars. $Q$ believes that $S$ has less than $3$ cars. $R$ indicates that to his knowledge, $S$ has at least one car. Only one of $P, Q$ and $R$ is right. The number of cars owned by $S$ is. $0$ $1$ $3$ Cannot be determined.
10
I. A heap is always nearly complete tree. II. Worst case complexity of heapify operation is O( log n) III. Worst case complexity of build heap operation is O( n log n) a. I only b. I and II only c. II and III only d. I, II and III
11
$900$ men and $500$ woman complete a task in $2$ weeks. $1200$ men and $250$ woman took $3$ weeks to complete the same task. Then, how many men are required to complete the same task in $1$ week ?
12
How C Iam getting D
13
14
Is the following schedule view serializable? T1 T2 T3 R(A) R(A) W(A) W(A) W(A)
15
The number of different DFA's with two states X and Y,where X is the initial state,over the alphabet $\sum$ = {0,1,2}
16
Consider the following functions $f(n) = 3n^{\sqrt{n}}$ $g(n) = 2^{\sqrt{n}{\log_{2}n}}$ $h(n) = n!$ Which of the following is true? $h(n)$ is $O(f(n))$ $h(n)$ is $O(g(n))$ $g(n)$ is not $O(f(n))$ $f(n)$ is $O(g(n))$
17
A relational schema R with attributes (ABCDEFG).It is known that D never appears on RHS of any FD.How many different possibilities are there for what a Candidate key of R can be.?
18
A sender uses the Stop-and-Wait ARQ protocol for reliable transmission of frames. Frames are of size $1000$ bytes and the transmission rate at the sender is $80$ Kbps (1 Kbps = 1000 bits/second). Size of an acknowledgment is $100$ bytes and the transmission ... $100$ milliseconds. Assuming no frame is lost, the sender throughput is ________ bytes/ second.
19
For the set $N$ of natural numbers and a binary operation $f : N \times N \to N,$ an element $z \in N$ is called an identity for $f,$ if $f (a, z) = a = f(z, a),$ for all $a \in N.$ Which of the following binary operations have an identity? $f (x, y) = x + y - 3$ $f (x, y) = \max(x, y)$ $f (x, y) = x^y$ I and II only II and III only I and III only None of these
20
Which of the following statements is true ? S1 : Source to destination delivery is the functionality that must be implemented by network layer above data­link layer. S2 : Packet delivery in correct order is the functionality that must be implemented by network layer above data­link layer. Which of the ... Only S1 is true b. Only S2 is true c. Both S1 and S2 are true d. Neither of S1 or S2 is true
21
Consider the following schedule: S : w1(A) w1(B) r2(A) w2(B) r3(A) w3(B) The number of schedules conflict equivalent are __________ .
22
In the Contiguous allocation for disk blocks, files cannot grow dynamically because _______ The next block could be occupied by another file The scheme does not allow files to grow (by design itself) (No answer is correct because files can grow) The disk does not have enough space I think both 1 and 2 are correct . What do you say ?
23
State true or false. When a user encounters a page fault, 1) The user application informs the OS, 2) User uses API calls to the hardware Memory Management unit, 3) Memory Management unit brings the page from hard disk to main memory. Is Statement 2 correct ?
24
What is the error in the following code . Please do correct them #include <stdio.h> int main () { char *x[5] = {"raju","ramu","tinu","ben","ali"}; printf("%s\n",(x[2][0]) ); return 0; }
25
Consider the following statements with respect to storage allocation: 1. Names local to a procedure are allocated space on a heap automatically. 2. Stack allocation is used for data that may live even after a procedure call returns. 3. Heap allocation is used for symbol table. Which one of the ... is false 1, 3 are true but 2 is false 2, 3 are true but 1 is false 1, 2 are false but 3 is true