search
Log In

Answers by Kaushik.P.E

1 vote
1
Did anyone received Call Letter for Written Test for IIT Madras MS ( for AIR > 800 - General Category) Program in Computer Science ?
answered Apr 20, 2017 in Written Exam 1.6k views
0 votes
2
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??
answered Feb 8, 2017 in Probability 227 views
2 votes
3
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
answered Feb 7, 2017 in Algorithms 399 views
0 votes
4
How C Iam getting D
answered Feb 7, 2017 in Verbal Ability 580 views
0 votes
5
answered Feb 7, 2017 in Numerical Ability 3.1k views
0 votes
6
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 ?
answered Feb 3, 2017 in Operating System 420 views
1 vote
7
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 ?
answered Feb 3, 2017 in Operating System 706 views
3 votes
8
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; }
answered Feb 3, 2017 in Programming 120 views
0 votes
9
State True/False: "CISC architectures may perform better than RISC architectures in network centric applications."
answered Feb 2, 2017 in CO and Architecture 354 views
1 vote
10
L1:{wwR∣w,x∈{a,b}∗ and |w|>0},wR is the reverse of string w L2:{wxwR∣w,x∈{a,b}∗ and |w|,|x|>0},wR is the reverse of string w L1 is regular but not L2 L2 is regular but not L1 Both L1 and L2 are regular Neither L1 nor L2 is regular
answered Feb 1, 2017 in Theory of Computation 53 views
2 votes
12
In a system, there are 2 process and Round robin policy is employed. After some time one process gets completed, but another process is remaining with 6 unit burst time.Time Quantam is 2 unit. So, how many context switch occurs to complete this remaining process?(Ignore previous and last context switch.) A. 0 B. 2 C. 3 D. 4
answered Feb 1, 2017 in Operating System 82 views
1 vote
13
G : Grammar S1 : Every LALR(1) G is LR(1). S2 : Every LR(1) G is LALR(1). S3: Some LL(1) is Regular. A. TFF B.TFT C. TTF D. FTT E. NONE
answered Feb 1, 2017 in Compiler Design 117 views
1 vote
14
R(ABCDEF) FD set{ AB->CDE. CD->E, E->C } False statement? A. 2 NF decomposition possible B.3 NF decomposition possible C.BCNF decomposition possible D. ALL
answered Feb 1, 2017 in Databases 578 views
0 votes
15
0 votes
16
L1 and L2 Are Decidable. then L1 union L2 is (a)______ and L1 - L2 is(b) _________. a. Regular, cfl ,csl, rel. rec b. decidable, undecidable
answered Feb 1, 2017 in Theory of Computation 90 views
1 vote
17
Given that L1 is regular and L2 context free. i) L3 = L1 ∩ L2 ii) L4= L1.L2 Selct the most appropriate statement: a. L3 , L4 are regular b. L3 is regular L4 is CFG not regular c. L3 is CFG, not regular L4 is regular d. L3,L4 are CFG not regular
answered Feb 1, 2017 in Compiler Design 419 views
0 votes
18
Which of the following statements is false? Every context-sensitive language is recursive The set of all languages that are not recursively enumerable is countable The family of recursively enumerable language is closed under union The families of recursively enumerable and recursive languages are closed under reversal
answered Feb 1, 2017 in Others 819 views
3 votes
19
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
answered Feb 1, 2017 in Others 1.6k views
0 votes
20
Which of the following pairs have different expressive power? Single-tape-turing machine and multi-dimensional turing machine Multi-tape-turing machine and multi-dimensional turing machine Deterministic push down automata and non-deterministic push down automata Deterministic finite automata and non-deterministic finite automata
answered Feb 1, 2017 in Others 386 views
1 vote
21
here S1 ans S2 seems confusing for me can someone help me to varify this answer i think given 3 are true in some case??
answered Feb 1, 2017 in Algorithms 83 views
2 votes
22
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
answered Feb 1, 2017 in Programming 805 views
5 votes
23
Consider the relation R(Name,courseNO,rolNO,grade) name,courseno ->grade rollno,courseno->grade name->rollno rollno->name Given answer as it is 3NF . But Im getting 1NF. is it correct ?
answered Feb 1, 2017 in Computer Networks 290 views
0 votes
24
Consider the two hosts A and B are connected Via a Router R which is having a queuing delay of 7 μsec . The Router R has two links Link1 and Link2, connected to A and B respectively. Each link is 250 meters long and has a bandwidth of 10 9 bps. The propagation speed is 500,000 km/sec. The total transfer delay for 2 KB packet from A to B is __________ μsec. (ignore the processing delay).
answered Feb 1, 2017 in Computer Networks 115 views
0 votes
25
If the productions were: S-> AC | BD A -> a B -> a C-> c D-> d For considering whethr this grmmar is LL(k) where, k>=2 , is left factoring essential? I think no because based on atleast 2 lookaheads, it would decide which production to take. In above example, only 1 lookahead is same.
answered Feb 1, 2017 in Compiler Design 138 views
1 vote
26
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
answered Feb 1, 2017 in Computer Networks 227 views
0 votes
27
while converting one to one relationship from ER diagram to RDMS, without total participation on either side, we can represent the relationship using primary- foreign key contraint without making a new table?? Am i right??
answered Feb 1, 2017 in Databases 284 views
1 vote
28
IS CONSERVATIVE 2PL ALSO RIGOROUS?? WHEN WE SAY THAT A TRANSACTION FOLLOWS CONSERVATIVE TWO PHASE LOCKING, DOES IT AUTOMATICALLY ALSO IMPLY RIGOROUS 2PL??
answered Feb 1, 2017 in Databases 162 views
3 votes
29
The asymptotic upper bound solution of the recurrence relation given by $T(n) = 2T \bigr( \frac{n}{2} \bigl) +\frac{n}{lg \: n}$ is $O(n^2)$ $O(n \: lg \: n )$ $O(n \: lg \: lg \: n)$ $O(lg \: lg \: n)$
answered Jan 31, 2017 in Others 2.1k views
...