Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Kaushik.P.E
1
votes
1
IIT Madras MS Interview Call Letter
Did anyone received Call Letter for Written Test for IIT Madras MS ( for AIR > 800 - General Category) Program in Computer Science ?
Did anyone received Call Letter for Written Test for IIT Madras MS ( for AIR 800 - General Category) Program in Computer Science ?
2.0k
views
answered
Apr 20, 2017
Written Exam
iit-madras
ms
admissions
+
–
0
votes
2
what is the probability that the mother could have had the very long or very short pregnancy
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 ... very long or very short pregnancy indicated by the testimony? 0.241 0.0241 how to solve such questions??
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 t...
789
views
answered
Feb 8, 2017
Probability
probability
engineering-mathematics
+
–
2
votes
3
Choose the correct statement about HEAP
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
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 ...
4.1k
views
answered
Feb 7, 2017
DS
data-structures
binary-heap
time-complexity
+
–
0
votes
4
gate ec
How C Iam getting D
How C Iam getting D
915
views
answered
Feb 7, 2017
0
votes
5
gate ece
4.4k
views
answered
Feb 7, 2017
0
votes
6
NPTEL-Operating System,-Week2-Quiz-2-Q5
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 ?
In the Contiguous allocation for disk blocks, files cannot grow dynamically because _______The next block could be occupied by another fileThe scheme does not allow files...
1.0k
views
answered
Feb 3, 2017
Operating System
nptel-quiz
operating-system
+
–
1
votes
7
NPTEL-Design and Analysis of Algorithms-Week1-Quiz-2-Q12
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 ?
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...
1.1k
views
answered
Feb 3, 2017
Operating System
nptel-quiz
operating-system
+
–
3
votes
8
C program
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; }
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 [0]) ); ...
436
views
answered
Feb 3, 2017
Programming in C
programming-in-c
+
–
0
votes
9
risc vs cisc
State True/False: "CISC architectures may perform better than RISC architectures in network centric applications."
State True/False: "CISC architectures may perform better than RISC architectures in network centric applications."
737
views
answered
Feb 2, 2017
1
votes
10
Choose the regular langauge
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
L1:{wwR∣w,x∈{a,b}∗ and |w|>0},wR is the reverse of string wL2:{wxwR∣w,x∈{a,b}∗ and |w|,|x|>0},wR is the reverse of string wL1 is regular but not L2L2 is regul...
205
views
answered
Feb 1, 2017
Theory of Computation
theory-of-computation
+
–
0
votes
11
MadeEasy Workbook: CO & Architecture - Clock Frequency
448
views
answered
Feb 1, 2017
CO and Architecture
co-and-architecture
made-easy-booklet
clock-frequency
+
–
2
votes
12
OS conceptual problem
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
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.T...
354
views
answered
Feb 1, 2017
Operating System
operating-system
+
–
1
votes
13
Compiler design
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
G : GrammarS1 : 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
318
views
answered
Feb 1, 2017
Compiler Design
compiler-design
parsing
lr-parser
+
–
1
votes
14
DBMS normalization concept problem
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
R(ABCDEF)FD set{AB->CDE. CD->E, E->C}False statement?A. 2 NF decomposition possibleB.3 NF decomposition possibleC.BCNF decomposition possibleD. ALL
1.2k
views
answered
Feb 1, 2017
Databases
databases
+
–
0
votes
15
Programming problem : Test Series
321
views
answered
Feb 1, 2017
0
votes
16
TOC Test Series
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
L1 and L2 Are Decidable. then L1 union L2 is (a)______and L1 - L2 is(b) _________.a. Regular, cfl ,csl, rel. recb. decidable, undecidable
241
views
answered
Feb 1, 2017
Theory of Computation
theory-of-computation
+
–
1
votes
17
Intersection and concatenation in CFG
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
Given that L1 is regular and L2 context free.i) L3 = L1 ∩ L2ii) L4= L1.L2Selct the most appropriate statement:a. L3 , L4 are regularb. L3 is regular L4 is CFG not regul...
830
views
answered
Feb 1, 2017
Theory of Computation
theory-of-computation
regular-language
context-free-grammar
+
–
1
votes
18
UGC NET CSE | January 2017 | Part 3 | Question: 63
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
Which of the following statements is false?Every context-sensitive language is recursiveThe set of all languages that are not recursively enumerable is countableThe famil...
3.7k
views
answered
Feb 1, 2017
Theory of Computation
ugcnetcse-jan2017-paper3
theory-of-computation
recursive-and-recursively-enumerable-languages
+
–
3
votes
19
UGC NET CSE | January 2017 | Part 3 | Question: 64
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$
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.0k
views
answered
Feb 1, 2017
Computer Networks
ugcnetcse-jan2017-paper3
computer-networks
hamming-code
+
–
0
votes
20
UGC NET CSE | January 2017 | Part 3 | Question: 62
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
Which of the following pairs have different expressive power?Single-tape-turing machine and multi-dimensional turing machineMulti-tape-turing machine and multi-dimensiona...
984
views
answered
Feb 1, 2017
Theory of Computation
ugcnetcse-jan2017-paper3
theory-of-computation
turing-machine
+
–
1
votes
21
BFS traversal
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??
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??
229
views
answered
Feb 1, 2017
Algorithms
breadth-first-search
test-series
+
–
2
votes
22
True/false
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 ... 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
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...
2.2k
views
answered
Feb 1, 2017
6
votes
23
Determine the highest possible normal form of the given relation?
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 ?
Consider the relation R(Name,courseNO,rolNO,grade)name,courseno ->graderollno,courseno->gradename->rollnorollno->name Given answer as it is 3NF . But Im getting 1NF. is ...
973
views
answered
Feb 1, 2017
Computer Networks
database-normalization
databases
+
–
0
votes
24
madeeasy
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).
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 ...
295
views
answered
Jan 31, 2017
0
votes
25
Self doubt
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.
If the productions were:S- AC | BDA - aB - aC- c D- d For considering whethr this grmmar is LL(k) where, k>=2 , is left factoring essential?I think no because based on ...
422
views
answered
Jan 31, 2017
Compiler Design
left-factoring
+
–
1
votes
26
madeeasy
Which of the following statements is true ? S1 : Source to destination delivery is the functionality that must be implemented by network layer above datalink layer. S2 : Packet delivery in correct order is the functionality that must be implemented by network layer above datalink layer. Which of ... S1 is true b. Only S2 is true c. Both S1 and S2 are true d. Neither of S1 or S2 is true
Which of the following statements is true ? S1 : Source to destination delivery is the functionality that must be implemented by network layer above datalink layer. S2 ...
903
views
answered
Jan 31, 2017
0
votes
27
ER Diagram to RDMS Model
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??
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...
1.1k
views
answered
Jan 31, 2017
Databases
databases
er-diagram
er-to-relational
relational
+
–
1
votes
28
concurrency control
IS CONSERVATIVE 2PL ALSO RIGOROUS?? WHEN WE SAY THAT A TRANSACTION FOLLOWS CONSERVATIVE TWO PHASE LOCKING, DOES IT AUTOMATICALLY ALSO IMPLY RIGOROUS 2PL??
IS CONSERVATIVE 2PL ALSO RIGOROUS?? WHEN WE SAY THAT A TRANSACTION FOLLOWS CONSERVATIVE TWO PHASE LOCKING, DOES IT AUTOMATICALLY ALSO IMPLY RIGOROUS 2PL??
482
views
answered
Jan 31, 2017
Databases
databases
transaction-and-concurrency
+
–
3
votes
29
UGC NET CSE | January 2017 | Part 3 | Question: 31
The asymptotic upper bound solution of the recurrence relation given by $T(n) = 2T \left( \frac{n}{2} \right) +\frac{n}{\lg \: n}$ is $O(n^2)$ $O(n \:\lg \: n )$ $O(n \:\lg \:\lg \: n)$ $O(\lg \:\lg \: n)$
The asymptotic upper bound solution of the recurrence relation given by $T(n) = 2T \left( \frac{n}{2} \right) +\frac{n}{\lg \: n}$ is$O(n^2)$$O(n \:\lg \: n )$$O(n \:\lg ...
5.2k
views
answered
Jan 31, 2017
Algorithms
ugcnetcse-jan2017-paper3
algorithms
asymptotic-notation
recurrence-relation
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register