menu
search
Log In
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

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 ?
answered Apr 20, 2017 in Written Exam 1.6k views
2 answers
2
UGCNET-DEC2016-III: 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
answer selected Feb 20, 2017 in Others 1.9k views
1 answer
4
GATE 2017 - 1 (Control flow)
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?
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?
answer selected Feb 14, 2017 in Compiler Design 940 views
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 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 247 views
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 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
commented Feb 8, 2017 in Theory of Computation 550 views
2 answers
8
GATE2007-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 not need any ... can 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 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.
commented Feb 7, 2017 in Operating System 7.5k views
3 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 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.
comment reshown Feb 7, 2017 in Quantitative Aptitude 853 views
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 only b. I and II only c. II and III only d. I, II and III
commented Feb 7, 2017 in Algorithms 658 views
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 the same task in $1$ week ?
comment reshown Feb 7, 2017 in Quantitative Aptitude 2.9k views
3 answers
12
gate ec
How C Iam getting D
How C Iam getting D
commented Feb 7, 2017 in Verbal Aptitude 629 views
1 answer
13
gate ece
answered Feb 7, 2017 in Quantitative Aptitude 3.3k views
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? T1 T2 T3 R(A) R(A) W(A) W(A) W(A)
commented Feb 5, 2017 in Databases 222 views
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}
commented Feb 5, 2017 in Theory of Computation 647 views
10 answers
16
GATE2000-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)$ is not $O(f(n))$ $f(n)$ is $O(g(n))$
comment edited Feb 4, 2017 in Algorithms 11.8k views
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 can be.?
commented Feb 3, 2017 in Databases 237 views
8 answers
18
GATE2016-1-55
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 ... $100$ milliseconds. Assuming no frame is lost, the sender throughput is ________ bytes/ second.
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.
commented Feb 3, 2017 in Computer Networks 13.1k views
3 answers
19
GATE2006-IT-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 $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
commented Feb 3, 2017 in Set Theory & Algebra 4k views
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 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 ... 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 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
answer edited Feb 3, 2017 in Computer Networks 352 views
2 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 __________ .
commented Feb 3, 2017 in Databases 3.2k views
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 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 468 views
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 Management unit brings the page from hard disk to main memory. Is Statement 2 correct ?
answered Feb 3, 2017 in Operating System 747 views
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[2][0]) ); return 0; }
answered Feb 3, 2017 in Programming 138 views
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 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
comment edited Feb 3, 2017 in Programming 1k views
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."
answered Feb 2, 2017 in CO and Architecture 391 views
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 possible B.3 NF decomposition possible C.BCNF decomposition possible D. ALL
comment edited Feb 2, 2017 in Databases 676 views
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 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 58 views
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.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 94 views
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...