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 shreyansh jain
531
views
0
answers
0
votes
Permutation
The number of ways can 5 letter be put into 3 letter boxes A, B, C if letter box A must contain atleast 2 letters ________. Please tell what are the extra cases in this: Choose 2 letters and put in box A – $^5C_2$ Now remaining 3 letters have $3^3$ choices So, $^5C_2 \times 3^3 = 270$
The number of ways can 5 letter be put into 3 letter boxes A, B, C if letter box A must contain atleast 2 letters ________. Please tell what are the extra cases in this:C...
asked
Jan 27, 2019
Quantitative Aptitude
combinatory
engineering-mathematics
discrete-mathematics
+
–
1.4k
views
0
answers
0
votes
gate-2015 Arden's theorem Doubt
https://gateoverflow.in/8159/gate2015-2-35 What are these equations? $X_0 = 1 X_1$ $X_1 = 0 X_1 + 1 X_2$ $X_2 = 0 X_1 + \{ \lambda \}$ Can we treat them as RIGHT LINEAR GRAMMAR? If yes, then this is the FA for it.Now ... and swapping initial and final states. I know that when a LEFT LINEAR GRAMMAR is changed to RIGHT LINEAR then language is reversed. But why here?
https://gateoverflow.in/8159/gate2015-2-35What are these equations?$X_0 = 1 X_1$$X_1 = 0 X_1 + 1 X_2$$X_2 = 0 X_1 + \{ \lambda \}$Can we treat them as RIGHT LINEAR GRAMMA...
asked
Jan 9, 2019
973
views
1
answers
1
votes
Time complexity (Advance Level)
The difference of time Complexity between given functions can be represented by: void fun1(int n) { for(int i=1;i<=n;i++) for(int j=1;j<=i*i;j++) if(j%i==0) for(int k=1;k<=j;k++) s++; return 0; } void fun2(int n) { for(int i=1;i<=n;i++) for(int j=1;j<=i*i;j++) for(int k=1;k<=j;k++) s++; return 0; } $i. O(n^2)$ $ii. O(n)$ $iii.O(1)$ $iv. O(n^{1.5})$
The difference of time Complexity between given functions can be represented by:void fun1(int n){ for(int i=1;i<=n;i++) for(int j=1;j<=i*i;j++) if(j%i==0) ...
asked
Jan 4, 2019
Algorithms
time-complexity
asymptotic-notation
algorithms
+
–
258
views
0
answers
0
votes
Madeeasy_OS
S1: User-level threads switching does not require context switching. TRUE S2 : Virtual memory increases the context switching overhead. TRUE Doubt: How S1 is TRUE when Context switching between user level threads is faster than context switching between kernel level threads. GATE2014
S1: User-level threads switching does not require context switching. TRUES2 : Virtual memory increases the context switching overhead. TRUEDoubt: How S1 is TRUE when Cont...
asked
Jan 1, 2019
2.3k
views
1
answers
1
votes
MadeEasy Test Series: Digital Logic - Decoder
A $3 \times 8$ decoder with two enables inputs is to be used to address 8 blocks of memory. What will be the size of each memory block when addressed from a sixteen-bit bus with two MSBs used to enable the decoder? $i)2k$ $ii)4k$ $iii)16k$ $iv) 64k$ What does “two enable inputs is to be used” mean? I am not able to visualize the circuit.
A $3 \times 8$ decoder with two enables inputs is to be used to address 8 blocks of memory. What will be the size of each memory block when addressed from a sixteen-bit ...
asked
Dec 28, 2018
Digital Logic
made-easy-test-series
decoder
digital-logic
+
–
1.3k
views
0
answers
3
votes
MadeEasy Test Series: Compiler Design - Static Single Assignment
Consider the following code segment: $c=b+a$ $e=c-a$ $f=c*e$ $h=c+a$ $i=h+f$ The minimum number of temporary variable required to convert the above code segment to static single assignment form is ________. Doubt : Are we ... do minimizations in SSA? if YES then is it always the case, if NO when do we have to do it. Please clarify.
Consider the following code segment:$c=b+a$$e=c-a$$f=c*e$$h=c+a$$i=h+f$The minimum number of temporary variable required to convert the above code segment to static singl...
asked
Dec 26, 2018
Compiler Design
static-single-assignment
compiler-design
made-easy-test-series
+
–
647
views
0
answers
0
votes
Binomial distribution
Is there any relation between MEAN, VARIANCE and MODE for binomial distribution? Let, Mean = 8, variance = 6 for any binomial distribution. np = 8 and npq = 6 => q=$3/4$, p=$1/4$ Now is there any relation to find value of MODE ?
Is there any relation between MEAN, VARIANCE and MODE for binomial distribution?Let, Mean = 8, variance = 6 for any binomial distribution.np = 8 and npq = 6 = q=$3/4$, p=...
asked
Dec 18, 2018
Mathematical Logic
binomial-distribution
+
–
335
views
0
answers
0
votes
Testbook Test Series: Calculus - Differentiability
If $y = f(x)$ is a solution of $ d^2y/dx^2 = 0$ , with boundary conditions $y=8$ at $x=0$ and $dy/dx =4$ at $x=16$, Find the value of $f(-2)$ When they say, $y = f(x)$ is a solution of $ d^2y/dx^2 = 0$ What does that mean?
If $y = f(x)$ is a solution of $ d^2y/dx^2 = 0$ , with boundary conditions $y=8$ at $x=0$and $dy/dx =4$ at $x=16$, Find the value of $f(-2)$When they say, $y = f(x)$ is ...
asked
Dec 18, 2018
Mathematical Logic
testbook-test-series
differentiation
calculus
+
–
854
views
0
answers
0
votes
Testbook Test Series: Databases - Relational Algebra
The number of rows returned by sql query on given relation: SELECT * from emp where eno NOT IN (SELECT manager from emp) Query intends to find the number of employees who are not MANAGER so emp 2,3,4 are ruled out. But since it ... return false. So NOT IN will give true and number of rows returned will be 1. Answer given is 0. Please clarify.
The number of rows returned by sql query on given relation:SELECT * from emp where eno NOT IN (SELECT manager from emp)Query intends to find the number of employees who a...
asked
Dec 17, 2018
Databases
testbook-test-series
databases
relational-algebra
+
–
703
views
0
answers
0
votes
Testbook Test Series: Combinatory - Permutations And Combinations
In how many ways we can wear 4 distinct rings in 3 particular fingers?
In how many ways we can wear 4 distinct rings in 3 particular fingers?
asked
Nov 30, 2018
Combinatory
testbook-test-series
discrete-mathematics
combinatory
+
–
349
views
2
answers
1
votes
made easy
what will be the resulting lang? I am thinking it as regular although it may clearly seem to be CFL using closure properties, but inclusion of an in the union already take into consideration all strings derived from the CFL part i.e. anbn Hence we can short-circuit that part? P.S: Answer given is NOT REGULAR
what will be the resulting lang?I am thinking it as regular although it may clearly seem to be CFL using closure properties, but inclusion of an in the union already take...
asked
Jan 27, 2018
293
views
1
answers
2
votes
made easy
how many lines from (i),(ii),(iii),(iv) can be removed so that code still works fine? PLEASE TELL HOW TO APPROACH SUCH QUESTION
how many lines from (i),(ii),(iii),(iv) can be removed so that code still works fine?PLEASE TELL HOW TO APPROACH SUCH QUESTION
asked
Jan 12, 2018
258
views
0
answers
1
votes
testbook
how to do these questions? what do they mean by static single assignment?
how to do these questions?what do they mean by static single assignment?
asked
Jan 7, 2018
126
views
0
answers
1
votes
test book
Please explain?
Please explain?
asked
Jan 5, 2018
305
views
1
answers
2
votes
Testbook
Please explain?
Please explain?
asked
Jan 5, 2018
187
views
0
answers
1
votes
Made easy test series
I am arguing like this : 0p12p is CFL => Recursive => Decidable And decidability goes backwards i.e. if A->B where A is polynomially reducible to B and B is decidable then A is decidable They have given L(M) as undecidable.please explain?
I am arguing like this :0p12p is CFL = Recursive = DecidableAnd decidability goes backwards i.e.if A->Bwhere A is polynomially reducible to B and B is decidable then A i...
asked
Jan 3, 2018
248
views
0
answers
0
votes
made easy
While calculating the total transfer delay do we need to consider the reception time( which, in general, is equal to transmission time) also? Please clarify , consider this question
While calculating the total transfer delay do we need to consider the reception time( which, in general, is equal to transmission time) also?Please clarify , consider thi...
asked
Dec 12, 2017
534
views
1
answers
0
votes
TestSeries
Can Bfs be applied for topological sort?
Can Bfs be applied for topological sort?
asked
Nov 16, 2017
Algorithms
algorithms
graph-algorithms
breadth-first-search
test-series
+
–
809
views
3
answers
1
votes
Made Easy test series
"A" sort a particular dataset of size n using merge sort in 640 msec, "B" uses the same algorithm on dataset of size 16, it takes 256 msec to sort them. what is size of data set used by "A" A. 32 B. 64 C. 128 D. None of above
"A" sort a particular dataset of size n using merge sort in 640 msec, "B" uses the same algorithm on dataset of size 16, it takes 256 msec to sort them. what is size of d...
asked
Apr 24, 2017
Algorithms
algorithms
merge-sort
made-easy-test-series
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register