Register

Recent questions tagged algorithm-design

0 votes
0 answers
1
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.
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 l...
User Avatar
0 votes
1 answer
3
Made Easy Test Series 2024
How many times is the comparison $i >= n$ performed in the following program? int i = 200 n = 80; main() { while (i >= n) { i = i - 2 n = n + 1 } }
How many times is the comparison $i >= n$ performed in the following program?int i = 200 n = 80; main() { while (i >= n) { i = i - 2 n = n + 1 } }
User Avatar
0 votes
1 answer
5
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 )
Numerical Answer Type Que?(please Try to give some ahortcut trick also or important concept is there to solve that question )
User Avatar
0 votes
2 answers
7
UGC NET CSE | October 2022 | Part 1 | Question: 74
Which of the following algorithm design approach is used in Quick sort algorithm? Dynamic programming Back Tracking Divide and conquer Greedy approach
Which of the following algorithm design approach is used in Quick sort algorithm?Dynamic programmingBack TrackingDivide and conquerGreedy approach
User Avatar
0 votes
1 answer
9
BEGINNER FRIENDLY BOOK FOR ALGORITHMS ?
I wanted to read ALgorithms by cormen but is it to complex to read for beginners ? or i read from other book ? please tell about the cormen is it easy to read for gate and PSU interviews ?
I wanted to read ALgorithms by cormen but is it to complex to read for beginners ? or i read from other book ?please tell about the cormen is it easy to read for gate and...
User Avatar
0 votes
1 answer
23
Interview Question
Given an Unsorted array, Find maximum in less than O(n) time? How can we do this?
Given an Unsorted array, Find maximum in less than O(n) time?How can we do this?
User Avatar
0 votes
0 answers
25
MADEEASY TESTT SERIES
User Avatar
0 votes
0 answers
26
Gatebook Test series ques
Answer given is Option A , but here we wil first sort the jobs in order of profit , for each value of deadline scan linearly in the array depending on the value of deadline , so it should take O(n^2) in worst case .
Answer given is Option A , but here we wil first sort the jobs in order of profit , for each value of deadline scan linearly in the array depending on the value of deadli...
User Avatar
4 votes
3 answers
27
Job Sequencing Problem (Greedy Algorithm)
If job $J=(J_{1},J_{2},J_{3},J_{4})$ are given their processing time $T_{i}=(1,1,2,3)$ and deadline are $D_{i}=(3,4,2,3)$ maximum how many job can be done$?$ $A)1$ $B)2$ $C)3$ $D)All$
If job $J=(J_{1},J_{2},J_{3},J_{4})$ are given their processing time $T_{i}=(1,1,2,3)$ and deadline are $D_{i}=(3,4,2,3)$ maximum how many job can be done$?$$A)1$ ...
User Avatar
Page: