Register
This Combine all questions from Made Easy booklet

Recent questions tagged made-easy-booklet

61
views
1 answers
0 votes
made easy practice book
How can we solve this recurrance relation using master's theorem? T(n)=2 * T (n/2) + nlogn
User Avatar
618
views
1 answers
1 votes
algorithm time complexity madeeasy
Consider the problem that given a set Sof n integers and another integer x, whether or not there exist two elements in S whose sum is exactly x. What is the worst ... in dynamic programming? Then complexity should be O(n^2).How O(n logn)?
User Avatar
220
views
0 answers
0 votes
algorithm time complexity madeeasy ots
What will be the complexity?
User Avatar
237
views
0 answers
0 votes
Algorithm Madeeasy Workbook
As we have to select maximal set of “non overlapping” activities. So like job scheduling algo of greedy we can solve it. So according to that complexity must be O(n logn). But ans is (b). Anyone please explain.
User Avatar
302
views
1 answers
0 votes
madeeasy booklet
How to solve this?
User Avatar
154
views
0 answers
0 votes
madeeasy booklet
Here clr is active low that means 0 then it will clear to 0. Then (Q2.Q0)' =0 or Q2=1 and Q0=1 then clr works. Then it will contain only 1 state. Right?? But answer is different.
User Avatar
199
views
0 answers
0 votes
madeeasy workbook
According to me answer is 2.Is it right? Suggestion is needed how to approach this if it is given in more complexity.
User Avatar
94
views
0 answers
0 votes
Counter Question
How many decade counters are necessary to implement a divide by 100 counter and divide by 10000 counter?
User Avatar
399
views
0 answers
0 votes
Made Easy Test Series 2024
please anyone explain this question .?
User Avatar
202
views
1 answers
0 votes
made easy
User Avatar
346
views
2 answers
0 votes
Made Easy Aptitude Booklet
In a certain base 137 + 254 = 402 then What is the sum of 342 + 562 in that base?
User Avatar
485
views
1 answers
0 votes
Made Easy Aptitude
A man wrote all the natural numbers starting from 1 in a series. What will be the 50th digit of the number?a) 1 c) 2b) 3 d) 4
User Avatar
209
views
1 answers
0 votes
Made Easy Booklet
How many factors ofN=12^12×14^14×15^15are multiple ofK=12^10×14^10×15^10 ?
User Avatar
323
views
1 answers
0 votes
Made Easy Book
Set A is formed by selecting some of the numbers from the first 100 natural numbers such that the HCF of any two numbers in the set A is 5 , what is the maximum number elements that set A can have?
User Avatar
170
views
0 answers
0 votes
Made Easy Booklet
If 1/n + 1 < 1/n+1 + 1 / n + 2 + 1/ n + 3 < ; then n ?a) 9 c) 11b) 10 d) 12
User Avatar
189
views
0 answers
0 votes
Made Easy Workbook
User Avatar
286
views
1 answers
1 votes
Made Easy Book 2024
Find the remainder of (5)^100/7 ?
User Avatar
424
views
1 answers
0 votes
Made Easy Book Aptitude 2024 Booklet
I have to spend 1/10 of my income on house rent, 1/10 of remainder on conveyance 1/3 of further remainder on children's education after which I have ₹ 648 left over. What is my income?
User Avatar
898
views
1 answers
1 votes
Made Easy Test Series 2024
Given data 10111100 Then P1, P2, P4, Pg parity bits that are attached to data to form codeword are Why they are taking parity bits from LHS in below ... we take parity bits in LHS AND RHS we get different result please anyone clarify it
User Avatar
633
views
1 answers
0 votes
Made Easy Test Series 2024
Suppose we have a directed graph G = (V,E) with V= {1, 2, ..., n} and Eis presented as an adjacency list. For each vertex u in V, out(u) is a list such that (u, v) in {1, 2, ... k) ... (u), u in V?T(n) =O(n+m) B. T(n)= O(n(m+n))
User Avatar
293
views
0 answers
0 votes
Made easy test series
what they want to tell and it is true or false?
User Avatar
971
views
1 answers
2 votes
Made Easy Test Series
You are given an array of elements where each array element represents the MAXIMUM number of jumps that can be made in the forward direction from that element. Now, ... is the minimum number of jumps required to reach the end of the array?
User Avatar
992
views
1 answers
1 votes
Made Easy Test Series 2024
Which of the following statement(s) is/are true?(a) Quicksort and merge sort are both examples of divide and conquer algorithms.(b) If we randomly choose a pivot ... worst case complexity $O(n log n)$.plese give answer and explain it why ?
User Avatar
604
views
1 answers
0 votes
Made Easy Test Series 2024
Numerical Answer Type Que?(please Try to give some ahortcut trick also or important concept is there to solve that question )
User Avatar
451
views
1 answers
0 votes
Made Easy Test Series 2024
pls give all possible sequences possible for prims algo
User Avatar
201
views
0 answers
0 votes
Made easy workbook
Pipelined operation is interrupted whenever two operations, being attempted in parallel need same hardware component. Such a conflict can occur if _____. (a)The execution phase of ... at the same time (d)All of the above (e)None of these
User Avatar
667
views
1 answers
1 votes
made easy workbook
User Avatar
256
views
0 answers
0 votes
Made Easy Workbook
User Avatar
342
views
0 answers
0 votes
Made Easy Digital Logic
The function f(A,B,C,D)=Ʃ(3,4,5,7,9,13,14,15) is realized with the following digital logic block circuit. Each digital logic block is implemented with minimum number of 2 input NAND gates. The number of NAND gates required are ___?
User Avatar
Page: