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
Questions by worst_engineer
0
votes
0
answers
1
Let X be the number of times you and your friend get the same outcome. Then X is distributed as
You and your friend have a fair coin each. Both of you toss the coins simultaneously, record the outcomes, and repeat the process, for a total of $n$ times. Let $X$ ... $Geom(1/2)$ (c) $Binom(n,3/4)$ (d) $Binom(n,1/4)$
You and your friend have a fair coin each. Both of you toss the coins simultaneously, record the outcomes, and repeat the process, for a total of $n$ times. Let $X$ be th...
182
views
asked
Aug 11, 2018
Probability
probability
engineering-mathematics
+
–
2
votes
0
answers
2
Max Non Negative SubArray problem solution
Here is the question : Find out the maximum sub-array of non negative numbers from an array. The sub-array should be continuous. That is, a sub-array created by choosing the second and fourth element and skipping the third element is invalid. Maximum ... ()) is wrong , as it is never getting satisfied. Should it be (newArray.size() == maxArray.size()) ?
Here is the question :Find out the maximum sub-array of non negative numbers from an array.The sub-array should be continuous. That is, a sub-array created by choosing th...
4.4k
views
asked
Jul 18, 2016
Algorithms
algorithms
data-structures
+
–
1
votes
1
answer
3
If word MAJORITY is encoded as PKBNXSHQ , then how is DAUGHTER encoded ?
If word MAJORITY is encoded as PKBNXSHQ , then how is DAUGHTER encoded ?
If word MAJORITY is encoded as PKBNXSHQ , then how is DAUGHTER encoded ?
780
views
asked
Apr 11, 2016
0
votes
2
answers
4
Is the function differentiable at x=1
The question is f(x) = | x-1 | + | x+1 | is differentiable at x=1 or not . Now , when x<1 , the first part becomes : -(x-1) , i.e 1-x and why should we not change the sign of second part ,i.e (x+1) ?
The question is f(x) = | x-1 | + | x+1 | is differentiable at x=1 or not . Now , when x<1 , the first part becomes : -(x-1) , i.e 1-x and why should we not change the sig...
524
views
asked
Jan 30, 2016
Calculus
calculus
+
–
1
votes
1
answer
5
Consider the following instance of knapsack problem with capacity W = 6.
Where did I make mistake ? plz help me :(
Where did I make mistake ? plz help me :(
1.8k
views
asked
Jan 25, 2016
Algorithms
algorithms
knapsack-problem
test-series
+
–
0
votes
2
answers
6
Consider the following function f.
now , the question says , worst case time complexity. So, in the worst case , the inner loop condition is not satisfied , so , won't it be O(n2) ?
now , the question says , worst case time complexity. So, in the worst case , the inner loop condition is not satisfied , so , won't it be O(n2) ?
1.5k
views
asked
Jan 25, 2016
Algorithms
algorithms
time-complexity
made-easy-test-series
+
–
1
votes
2
answers
7
The following machine is designed with PDA acceptence by final state to accept odd length palindromes
my question is as it is odd length palindrome , so it can be ababa , right ?Now , in the given diagram , they have not mentioned the scenario :1) when a is the stack to...
2.2k
views
asked
Jan 21, 2016
Theory of Computation
theory-of-computation
+
–
0
votes
1
answer
8
Consider 1 Ghz clock frequency processor , uses different operand accessing models shown below
My question is : in the last indexed instruction , will it not be this way : 1 Memory Access + 1 Arithmetic computation + 1 Memory access = 2 + 3 + 2 = 7 clock cycles ?
My question is : in the last indexed instruction , will it not be this way :1 Memory Access + 1 Arithmetic computation + 1 Memory access = 2 + 3 + 2 = 7 clock cycles ?
1.0k
views
asked
Jan 19, 2016
CO and Architecture
co-and-architecture
+
–
0
votes
1
answer
9
Consider the two hosts A and B are connected via a Router as shown below
My doubt is , should we not take RTT in calculation ?
My doubt is , should we not take RTT in calculation ?
607
views
asked
Jan 18, 2016
Computer Networks
computer-networks
+
–
4
votes
5
answers
10
For a class C network if IP address of a computer is 200.99.39.112 and subnet mask is 255.255.255.224
For a class C network if IP address of a computer is 200.99.39.112 and subnet mask is 255.255.255.224 the first host of first subnet (represent last octet) is ________. M...
4.2k
views
asked
Jan 18, 2016
Computer Networks
computer-networks
+
–
0
votes
3
answers
11
Let f(x), g(x) and h(x) be function which of following statement is false?
Let $f(x),g(x)$ and $h(x)$ be functions which of the following statement is false? a). if $f(x)$ is $O(g(x))$ and $g(x)$ is $O(h(x))$ then $f(x)$ is $O(h(x))$. b). if $f(x)$ ... $(b)$ I mean according to me , option (a) is correct , right ? by the rule of transitivity . Please correct me , if I am wrong.
Let $f(x),g(x)$ and $h(x)$ be functions which of the following statement is false?a). if $f(x)$ is $O(g(x))$ and $g(x)$ is $O(h(x))$ then $f(x)$ is $O(h(x))$.b). if $f...
808
views
asked
Jan 17, 2016
Algorithms
asymptotic-notation
algorithms
test-series
+
–
2
votes
4
answers
12
A hard disk with transfer rate of 20 kbps is constantly transferring data to memory using DMA cycle stealing mode
A hard disk with transfer rate of 20 kbps is constantly transferring data to memory using DMA cycle stealing mode. The size of data transfer is 32 bytes. The processor ru...
2.9k
views
asked
Jan 14, 2016
CO and Architecture
co-and-architecture
dma
+
–
2
votes
2
answers
13
Which of the following represent the minimum no. of states in DFA which accept all string of length atmost 5 ‘a’?
Which of the following represent the minimum no. of states in DFA which accept all string of length atmost 5 ‘a’?6457Answer given in 5 , how possible ?atmost ...
562
views
asked
Jan 14, 2016
Theory of Computation
theory-of-computation
+
–
0
votes
4
answers
14
Grammar Type?
The grammar $E \to T + E \mid T$ is? $\text{LR}(0)$ and $\text{LL}(1)$ Not an operator grammar Ambiguous $\text{SLR}(1)$ but not $\text{LL}(1)$ As the question did not seem to be complete , I am trying to guess the question from the answer ( shame on these test series guys , can't even proof-read question ).
The grammar $E \to T + E \mid T$ is?$\text{LR}(0)$ and $\text{LL}(1)$Not an operator grammarAmbiguous$\text{SLR}(1)$ but not $\text{LL}(1)$As the question did not seem to...
648
views
asked
Jan 13, 2016
Compiler Design
compiler-design
parsing
lr-parser
test-series
+
–
1
votes
3
answers
15
Please clear some doubt in channel sensing part of computer networks
I am giving two questions along with answers Q1 ) Suppose ‘A’ and ‘B’ are on same 10Mbps Ethernet segment and the propagation delay between two nodes is 275 bit times. Suppose A and B are ... in order to sense the channel idle , we need send one bit , so , one propagation delay is needed ?
I am giving two questions along with answersQ1 )Suppose ‘A’ and ‘B’ are on same 10Mbps Ethernet segment and the propagation delaybetween two nodes...
1.1k
views
asked
Jan 11, 2016
Computer Networks
computer-networks
+
–
1
votes
1
answer
16
What is the time complexity of this problem ?
Given an array S containing n real numbers, and a real number x. We want to find any two elements p and q in the array such that their sum is greater than the real number x. What is the best possible time complexity to find p and q ? ... and second element's sum is greater than x , then it can be done in O(1) time , right ? Please correct me.
Given an array S containing n real numbers, and a real number x. We want to find any two elements p and q in the array such that their sum is greater than the real number...
418
views
asked
Jan 10, 2016
Algorithms
algorithms
time-complexity
+
–
1
votes
1
answer
17
Which of the following language is decidable
Consider the following languages L1 = {< M, q > | M is a turing machine that visits state q on some input within 10 steps} L2 = {< M > | M is a turing machine, |M| < 100 where |M| is number of states in machine ... not tell whether it will not visit q on some input within 10 steps. But , L2 is trivial property , right ? Please correct me.
Consider the following languagesL1 = {< M, q | M is a turing machine that visits state q on some input within 10 steps}L2 = {< M | M is a turing machine, |M| < 100 wher...
906
views
asked
Jan 10, 2016
Theory of Computation
theory-of-computation
+
–
0
votes
1
answer
18
Compiler question
I did in this way : There is conflict , right ? As A -> g. and B -> g. both going to $ and g
I did in this way :There is conflict , right ? As A - g. and B - g. both going to $ and g
348
views
asked
Jan 9, 2016
Compiler Design
compiler-design
context-free-grammar
parsing
lr-parser
test-series
+
–
0
votes
1
answer
19
Is there three SR conflict in the CLR(1) grammar
Will not there be 3 SR conflicts in CLR(1) reduction ? In fact their ans also says this : In the state I1 , will it not be SR conflict ?
Will not there be 3 SR conflicts in CLR(1) reduction ?In fact their ans also says this :In the state I1 , will it not be SR conflict ?
1.4k
views
asked
Jan 9, 2016
Compiler Design
compiler-design
parsing
lr-parser
test-series
+
–
0
votes
0
answers
20
Can you please explain the second query
543
views
asked
Jan 7, 2016
Databases
sql
databases
+
–
Page:
1
2
3
4
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register