Dark Mode

Recent questions tagged made-easy-booklet

1 vote

1 answer

1

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 case time complexity for the most efficient algorithm which solves the given problem? Is not it work like subset sum problem in dynamic programming? Then complexity should be O(n^2). How O(n logn)?

Sajal Mallick asked in Algorithms Nov 28, 2023

by Sajal Mallick

467 views

0 votes

0 answers

2

algorithm time complexity madeeasy ots
What will be the complexity?

Sajal Mallick asked in Algorithms Nov 28, 2023

by Sajal Mallick

178 views

0 votes

0 answers

3

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.

Sajal Mallick asked in Algorithms Nov 27, 2023

by Sajal Mallick

176 views

0 votes

1 answer

4

madeeasy booklet
How to solve this?

Sajal Mallick asked in Digital Logic Nov 20, 2023

by Sajal Mallick

248 views

0 votes

0 answers

5

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.

Sajal Mallick asked in Digital Logic Nov 20, 2023

by Sajal Mallick

119 views

0 votes

0 answers

6

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.

Sajal Mallick asked in Databases Nov 20, 2023

by Sajal Mallick

171 views

0 votes

0 answers

7

Counter Question
How many decade counters are necessary to implement a divide by 100 counter and divide by 10000 counter?

mudasirkhan asked in Digital Logic Nov 15, 2023

78 views

0 votes

0 answers

8

Made Easy Test Series 2024
please anyone explain this question .?

Ray Tomlinson asked in Calculus Oct 12, 2023

by Ray Tomlinson

365 views

0 votes

1 answer

9

yahba asked in Theory of Computation Sep 27, 2023

by yahba

172 views

0 votes

2 answers

10

Made Easy Aptitude Booklet
In a certain base 137 + 254 = 402 then What is the sum of 342 + 562 in that base?

Vashishtha asked in Verbal Aptitude Sep 9, 2023

274 views

0 votes

1 answer

11

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) 2 b) 3 d) 4

Vashishtha asked in Quantitative Aptitude Sep 9, 2023

420 views

0 votes

1 answer

12

Made Easy Booklet
How many factors of N=12^12×14^14×15^15 are multiple of K=12^10×14^10×15^10 ?

Vashishtha asked in Quantitative Aptitude Sep 7, 2023

169 views

0 votes

1 answer

13

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?

Vashishtha asked in Quantitative Aptitude Sep 6, 2023

246 views

0 votes

0 answers

14

Made Easy Booklet
If 1/n + 1 < 1/n+1 + 1 / n + 2 + 1/ n + 3 < ; then n ? a) 9 c) 11 b) 10 d) 12

Vashishtha asked in Quantitative Aptitude Sep 4, 2023

161 views

0 votes

0 answers

15

Made Easy Workbook

Huzaifa0111 asked in Algorithms Aug 27, 2023

161 views

1 vote

1 answer

16

Made Easy Book 2024
Find the remainder of (5)^100/7 ?

Vashishtha asked in Quantitative Aptitude Aug 22, 2023

259 views

0 votes

1 answer

17

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?

Vashishtha asked in Quantitative Aptitude Aug 20, 2023

379 views

1 vote

1 answer

18

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 question A 12 bit hamming code whose hexadecimal value is 0xE4F arrives at a receiver. What could be ... not more than 1 bits in error. if we take parity bits in LHS AND RHS we get different result please anyone clarify it

Ray Tomlinson asked in Computer Networks Aug 16, 2023

by Ray Tomlinson

725 views

0 votes

0 answers

19

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). For each u in V, we wish to compute a corresponding list in(u) =such that in E ... take to construct the lists in(u), u in V, from the lists out(u), u in V? T(n) =O(n+m) B. T(n)= O(n(m+n))

Ray Tomlinson asked in Algorithms Aug 9, 2023

by Ray Tomlinson

509 views

0 votes

0 answers

20

Made easy test series
what they want to tell and it is true or false?

Ray Tomlinson asked in Algorithms Aug 9, 2023

by Ray Tomlinson

269 views

2 votes

1 answer

21

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, consider the following array: {1, 3, 5, 8, 9, 2, 6, 7, 6). What is the minimum number of jumps required to reach the end of the array?

Ray Tomlinson asked in Algorithms Aug 9, 2023

by Ray Tomlinson

846 views

1 vote

1 answer

22

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 element each time, quicksort will always terminate in time $O(n log n).$ (c) For every fixed ... in time $O(1)$, quicksort would have worst case complexity $O(n log n)$. plese give answer and explain it why ?

Ray Tomlinson asked in Algorithms Aug 9, 2023

by Ray Tomlinson

858 views

0 votes

1 answer

23

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 )

Ray Tomlinson asked in Algorithms Aug 9, 2023

by Ray Tomlinson

509 views

0 votes

1 answer

24

Made Easy Test Series 2024
pls give all possible sequences possible for prims algo

Ray Tomlinson asked in Algorithms Aug 8, 2023

by Ray Tomlinson

360 views

0 votes

0 answers

25

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 an instruction requires access to the main memory, which also contains the next instruction that ... the next instruction that should be fetched at the same time (d) All of the above (e) None of these

Praful jha asked in CO and Architecture Jul 22, 2023

178 views

0 votes

0 answers

26

Made easy booklet

Çșȇ ʛấẗẻ asked in Algorithms Jul 19, 2023

by Çșȇ ʛấẗẻ

175 views

1 vote

1 answer

27

made easy workbook

Anmol pratap singh asked in DS Jul 8, 2023

by Anmol pratap singh

586 views

0 votes

0 answers

28

Made Easy Workbook

Uttiya asked in Digital Logic Jun 20, 2023

by Uttiya

247 views

0 votes

0 answers

29

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 ___?

Uttiya asked in Digital Logic Jun 20, 2023

by Uttiya

302 views

0 votes

1 answer

30

Made easy workbook

rishabh-441 asked in Digital Logic Jun 1, 2023

258 views

Page:

1
2
3
4
5
6
next »

Recent questions tagged made-easy-booklet