Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Kaushik.P.E
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Kaushik.P.E
1
answer
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
+
–
4
answers
2
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
answer selected
Feb 20, 2017
Computer Networks
ugcnetcse-jan2017-paper3
computer-networks
hamming-code
+
–
1
answer
3
Gate_2017_Set_1_9
436
views
answer selected
Feb 14, 2017
Operating System
operating-system
+
–
11
answers
4
GATE CSE 2017 Set 1 | Question: 43
Consider the following grammar: stmt $\rightarrow$ if expr then expr else expr; stmt | $Ò$ expr $\rightarrow$ term relop term | term term $\rightarrow$ id | number id $\rightarrow$ a | b | c number $\rightarrow [0-9]$ where relop is a relational ... program if $e_1$ then $e_2$ else $e_3$ has $2$ control flow paths. $e_1 \rightarrow e_2$ and $e_1 \rightarrow e_3$.
Consider the following grammar:stmt $\rightarrow$ if expr then expr else expr; stmt | $Ò$expr $\rightarrow$ term relop term | termterm $\rightarrow$ id | numberid $\righ...
20.2k
views
answer selected
Feb 14, 2017
Compiler Design
gatecse-2017-set1
compiler-design
parsing
normal
numerical-answers
+
–
2
answers
5
Gate ECE GA 2017
1.6k
views
answer selected
Feb 9, 2017
Quantitative Aptitude
speed-time-distance
+
–
1
answer
6
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...
718
views
answered
Feb 8, 2017
Probability
probability
engineering-mathematics
+
–
3
answers
7
Gatebook
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
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 i...
1.8k
views
commented
Feb 8, 2017
Theory of Computation
gatebook-toc
theory-of-computation
regular-language
+
–
4
answers
8
GATE CSE 2007 | Question: 17
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 ... be scheduled on different processors in a multi-processor system. Blocking one kernel level thread blocks all related threads.
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 kern...
21.0k
views
commented
Feb 7, 2017
Operating System
gatecse-2007
operating-system
threads
normal
+
–
4
answers
9
GATE2017 ME-1: GA-5
$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.
$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 knowl...
2.9k
views
comment reshown
Feb 7, 2017
Analytical Aptitude
gate2017-me-1
general-aptitude
logical-reasoning
+
–
2
answers
10
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
commented
Feb 7, 2017
DS
data-structures
binary-heap
time-complexity
+
–
2
answers
11
GATE 2017 EC Aptitude
$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 ?
$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 t...
3.8k
views
comment reshown
Feb 7, 2017
Quantitative Aptitude
numerical-answers
+
–
3
answers
12
gate ec
How C Iam getting D
How C Iam getting D
892
views
commented
Feb 7, 2017
1
answer
13
gate ece
4.4k
views
answered
Feb 7, 2017
2
answers
14
Self framed
Is the following schedule view serializable? T1 T2 T3 R(A) R(A) W(A) W(A) W(A)
Is the following schedule view serializable?T1T2T3R(A) R(A) W(A) W(A) W(A)
978
views
commented
Feb 5, 2017
Databases
view-serializability
+
–
3
answers
15
No. of DFA's Possible
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}
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}
1.1k
views
commented
Feb 4, 2017
Theory of Computation
finite-automata
counting
+
–
10
answers
16
GATE CSE 2000 | Question: 2.17
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))$
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...
22.6k
views
comment edited
Feb 3, 2017
Algorithms
gatecse-2000
algorithms
asymptotic-notation
normal
+
–
1
answer
17
Gate Practice Question
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.?
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...
591
views
commented
Feb 3, 2017
Databases
candidate-key
databases
+
–
11
answers
18
GATE CSE 2016 Set 1 | Question: 55
A sender uses the Stop-and-Wait $\text{ARQ}$ protocol for reliable transmission of frames. Frames are of size $1000$ ... $100$ milliseconds. Assuming no frame is lost, the sender throughput is ________ bytes/ second.
A sender uses the Stop-and-Wait $\text{ARQ}$ protocol for reliable transmission of frames. Frames are of size $1000$ bytes and the transmission rate at the sender is $80\...
26.1k
views
commented
Feb 3, 2017
Computer Networks
gatecse-2016-set1
computer-networks
stop-and-wait
normal
numerical-answers
+
–
4
answers
19
GATE IT 2006 | Question: 2
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
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...
9.4k
views
commented
Feb 3, 2017
Set Theory & Algebra
gateit-2006
set-theory&algebra
easy
binary-operation
+
–
1
answer
20
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 ...
869
views
answer edited
Feb 3, 2017
5
answers
21
number of schedules conflict equivalent schedule
Consider the following schedule: S : w1(A) w1(B) r2(A) w2(B) r3(A) w3(B) The number of schedules conflict equivalent are __________ .
Consider the following schedule:S : w1(A) w1(B) r2(A) w2(B) r3(A) w3(B)The number of schedules conflict equivalent are __________ .
7.1k
views
commented
Feb 3, 2017
Databases
databases
+
–
1
answer
22
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...
976
views
answered
Feb 3, 2017
Operating System
nptel-quiz
operating-system
+
–
1
answer
23
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
+
–
1
answer
24
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]) ); ...
420
views
answered
Feb 3, 2017
Programming in C
programming-in-c
+
–
1
answer
25
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
comment edited
Feb 2, 2017
1
answer
26
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."
728
views
answered
Feb 2, 2017
2
answers
27
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.1k
views
comment edited
Feb 1, 2017
Databases
databases
+
–
1
answer
28
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...
199
views
answered
Feb 1, 2017
Theory of Computation
theory-of-computation
+
–
1
answer
29
MadeEasy Workbook: CO & Architecture - Clock Frequency
426
views
answered
Feb 1, 2017
CO and Architecture
co-and-architecture
made-easy-booklet
clock-frequency
+
–
1
answer
30
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...
344
views
answered
Feb 1, 2017
Operating System
operating-system
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register