Register
Filter

Recent activity by worst_engineer

0 answers
1
Doubt in permutation
what is number of permutation of NADEEAKY Edit : I forgot to add condition : all vowel should not be together is it 9360 or 10050
what is number of permutation of NADEEAKYEdit : I forgot to add condition : all vowel should not be togetheris it 9360 or 10050
0 answers
5
Discrete_poset
It took me a while to solve, any hack on this?
It took me a while to solve, any hack on this?
1 answer
6
Regarding MS from iit kgp or madras
What are the prospects of MS from IIT KGP andIITM?What score is needed? Branch CS.which is better Mtech or MS?
What are the prospects of MS from IIT KGP andIITM?What score is needed? Branch CS.which is better Mtech or MS?
2 answers
7
PGEE 2017
Consider a graph where vertex having number 2 to 12 (including 2 and 12), there is an edge between two vertex x and y iff x divides y What would be maximum path length between any two vertices of graph ?
Consider a graph where vertex having number 2 to 12 (including 2 and 12), there is an edge between two vertex x and y iff x divides yWhat would be maximum path length bet...
1 answer
10
The number of positive integers n for which n2+96 is a perfect square is
The number of positive integers n for which n2+96 is a perfect square is (A) 0 (B) 1 (C) 2 (D) 4
The number of positive integers n for which n2+96 is a perfect squareis(A) 0 (B) 1 (C) 2 (D) 4
3 answers
11
Integration
Solve the following $\int_{0}^{\infty}e^{-x^2}x^4dx$
Solve the following $\int_{0}^{\infty}e^{-x^2}x^4dx$
1 answer
14
programming and DS
1 answer
15
#uppcl
Q. The expressions are evaluated ____________ according to the precedence of set operators. A. from left to right B.from right to left C.as per user defined specification D.from bottom to up
Q. The expressions are evaluated ____________ according to the precedence of set operators.A. from left to rightB.from right to leftC.as per user defined specificationD.f...
2 answers
16
Lookahead aader
Which of the following statements is/are true? S1: Carry lookahead adder is faster compared to a ripple carry adder. S2: The cost is higher for a carry lookahead adder compared to a ripple carry adder. (A) S1 only (B) S2 only (C) Both (D) None of these
Which of the following statements is/are true?S1: Carry lookahead adder is faster compared to a ripple carry adder.S2: The cost is higher for a carry lookahead adder comp...
2 answers
17
counting
How many team of six with a captain can be selected from 12 person?
How many team of six with a captain can be selected from 12 person?
1 answer
19
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 ?
2 answers
20
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...
2 answers
21
probability
A fair coin is tossed until one of 2 sides occurs twice in a row . Probability that the number of toses required is even is
A fair coin is tossed until one of 2 sides occurs twice in a row . Probability that the number of toses required is even is
2 answers
22
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) ?
2 answers
25
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...
1 answer
26
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 ?
2 answers
27
DBMS
1 answer
28
DBMS