Dark Mode

Recent questions tagged made-easy-booklet

0 votes

1 answer

121

Made easy workbook

shweta sah asked in Algorithms Jun 21, 2018

261 views

0 votes

1 answer

122

Made easy workbook
We've been given an unordered list having n distinct elements,the no. Of comparison to find an element that is neither the 2nd minimum nor the 2nd maximum is?

Manoj Kumar Pandey asked in Algorithms Jun 20, 2018

by Manoj Kumar Pandey

318 views

0 votes

1 answer

123

me wk book
let T be a minimum cost spanning tree of G. suppose that ewe decreased the weight of one of the edge in T.then to check modified T is MST or not how much tym will take??? O(1) or O(n)?????

eyeamgj asked in Algorithms Jun 16, 2018

442 views

0 votes

1 answer

124

Made easy workbook
Assume that merge sort algorithm in the worst case takes 30 seconds for an input of size 64 which of The following most closely approximates the maximum input size of a problem that can be solved in 6 minutes

Shankar Jha asked in Algorithms Jun 15, 2018

582 views

0 votes

1 answer

125

madeesay work book
An algorithm processes an input of size n if n=4,096 and the run time=512 milliseconds. If n=16,384, run time is 8,192 MS. What is the efficiency in big O notation? O(n^1/2) O(n) O(n^2) O(nlogN)

eyeamgj asked in Algorithms Jun 14, 2018

2.1k views

0 votes

2 answers

126

MadeEasy Workbook: General Aptitude - Simple Interest
Below is the question - The answer given is - d What is the method to solve the question?

NithinBiliya asked in Quantitative Aptitude May 12, 2018

by NithinBiliya

837 views

0 votes

1 answer

127

MadeEasy Workbook: General Aptitude - Profit Loss
This was one of the formula given in the "profit and loss" chapter of made eady booklet - reasoning and aptitude. How do we derive this formula?

NithinBiliya asked in Quantitative Aptitude May 10, 2018

by NithinBiliya

844 views

0 votes

0 answers

128

MadeEasy Workbook: General Aptitude - Profit Loss
This was one of the formula given in the "profit and loss" chapter of made eady booklet - reasoning and aptitude. How do we derive this formula?

NithinBiliya asked in Quantitative Aptitude May 10, 2018

by NithinBiliya

686 views

2 votes

3 answers

129

Made Easy - Reasoning and Aptitude, GATE 2018 ESE 2018
What is the remainder of 5100/7? Answer is given as 2. What is the proper method to get it?

NithinBiliya asked in Quantitative Aptitude Apr 29, 2018

by NithinBiliya

876 views

0 votes

1 answer

130

MadeEasy Workbook: General Aptitude - Number Series
Let $T$ be the set of integers $\{3,11,19,27, ..... , 451, 459, 467\}$ and $S$ be a subset of $T$ such that the sum of no two elements of $S$ is $470$. The maximum possible number of elements in $S$ is ? $31$ $28$ $29$ $30$ Answer is given as c. 29. But as per my calculations the answer has to be d.30. Let me know if my answer is correct.

NithinBiliya asked in Quantitative Aptitude Apr 29, 2018

by NithinBiliya

2.0k views

1 vote

1 answer

131

MadeEasy Workbook: Digital Logic - Digital Counter
Caption

mitesh911 asked in Digital Logic Jan 28, 2018

274 views

1 vote

0 answers

132

mitesh911 asked in Digital Logic Jan 28, 2018

131 views

0 votes

1 answer

133

MadeEasy Workbook: Digital Logic - Flip Flop
Explain this question Plz

nikkey123 asked in Digital Logic Dec 16, 2017

1.1k views

0 votes

0 answers

134

MadeEasy Workbook: Digital Logic - Digital Counter
Plz someone provide the solution of this question

nikkey123 asked in Digital Logic Dec 16, 2017

1.7k views

0 votes

1 answer

135

MadeEasy Workbook: Algorithms - Graph Algorithms

aaru14 asked in Algorithms Dec 1, 2017

by aaru14

559 views

0 votes

0 answers

136

MadeEasy Workbook: Programming & DS - Programming In C
how it will be solve plz someone help?

aaru14 asked in Programming in C Nov 28, 2017

by aaru14

366 views

0 votes

1 answer

137

madeeasy work book
X-->Ya|f Y-->bY|d Z-->cZ|e FOLLOW(Z)???

aaru14 asked in Compiler Design Nov 22, 2017

by aaru14

354 views

0 votes

1 answer

138

MadeEasy WorkBook: Digital Logic - Adder

charul asked in Digital Logic Oct 27, 2017

by charul

619 views

0 votes

1 answer

139

MadeEasy WorkBook: Theory of Computation - Minimum State Automata
IF a number is divisible by say any integer X then what will be the minimum states required in DFA?

Pranav Madhani asked in Theory of Computation Oct 26, 2017

by Pranav Madhani

439 views

1 vote

1 answer

140

made easy
main() { int xyz; st1; st2(); f(); g(); h(); st3; ) how many stack entry required?? ans is 2 why??

Mukesh Yadav asked in Compiler Design Oct 25, 2017

by Mukesh Yadav

298 views

2 votes

2 answers

141

MadeEasy Workbook: Theory of Computation - Regular Expressions
find regular expression over {a,b} corresponding to "set of strings containing at most 2a's." a) b*+ b*ab* + b*ab*ab* b) b*(a+ε)b*(a+ε) c) none

charul asked in Theory of Computation Oct 7, 2017

by charul

857 views

2 votes

2 answers

142

MadeEasy Workbook: Theory of Computation - Regular Expressions
find the length of string of minimum length in {0,1}* not in the language corresponding to the given RE (0*+1*)* a) 0 b) 1 c) more than 1 d) can't be determined

charul asked in Theory of Computation Oct 7, 2017

by charul

2.1k views

1 vote

2 answers

143

MadeEasy Workbook: Theory of Computation - Finite Automata
Any given transition diagram has an equivalent a) regular expression b) NDFSM c) DFSM d) all of these

charul asked in Theory of Computation Oct 6, 2017

by charul

847 views

1 vote

1 answer

144

MadeEasy Workbook: Theory of Computation - Finite Automata
If an input string w has n symbols and can be recognized by a mealy machine M1 and equivalent Moore machine M2 then number of output symbols by M1 and M2 are respectively?

charul asked in Theory of Computation Sep 29, 2017

by charul

889 views

1 vote

2 answers

145

Evaluating SDT
Here a as well as c can be the answer based on the construction of the parse tree. So how to decide which one to choose?

Xylene asked in Compiler Design Sep 4, 2017

by Xylene

703 views

0 votes

0 answers

146

MadeEasy Workbook: Mathematical Logic - Propositional Logic
Show that each of the conditional statement is a tautology NOT using a truth table $r\vee (p\vee q)$ is the conclusion from the premises $(p \vee q) \wedge(q\rightarrow r)\wedge (p\rightarrow m) \wedge (m')$

Agnel A asked in Mathematical Logic Sep 3, 2017

328 views

0 votes

0 answers

147

MadeEasy Workbook: Digital Logic - Boolean Expressions
NOTE ____> suppose "+" is the symbol of EX-OR Y= A+A'+A'+A+A+A'+A'+A+A the Y is equvalent to : a> 1 OR E b> A EX OR 0 c> 1 NOR B d> A AND B

air1ankit asked in Digital Logic Aug 30, 2017

693 views

0 votes

0 answers

148

MadeEasy Workbook: Digital Logic - Number Representation
The once compliment of the given BCD excess -3 code is 9's compliment of the given BCD in the excess -3 form because of this Excess-3 code is named as self complimentry code.. Please elaborate and well explain above sentence

air1ankit asked in Digital Logic Aug 24, 2017

435 views

0 votes

2 answers

149

MadeEasy WorkBook: Digital Logic - Gray Code
x1= 10101010 x2=11111111 x1x2------>EX-OR------>GRAY CODE--------->(Output in decimal)????

air1ankit asked in Digital Logic Aug 24, 2017

1.6k views

1 vote

1 answer

150

MadeEasy Workbook: Mathematical Logic - Propositional Logic
<p>what is the negation of:</p> <p>x is prime iff x is not composite.</p> <p>a.x is prime and x is not composite or x is not prime and x is composite.</p> <p>b.x is prime and x is composite or x is not prime and x is not composite.</p>

eyeamgj asked in Mathematical Logic Jul 3, 2017

370 views

Page:

« prev
1
2
3
4
5
6
next »

Recent questions tagged made-easy-booklet