Register

Algorithm Madeeasy Workbook

243 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

13.2k
views
3 answers
4 votes
Lakshman Bhaiya asked Nov 10, 2018
13,157 views
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$?$ ... $C)3$ $D)All$
User Avatar
640
views
1 answers
0 votes
Ray Tomlinson asked Aug 9, 2023
640 views
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
462
views
1 answers
0 votes
Sachdev aprajita asked May 23, 2019
462 views
Madeeasy workbook algorithm time complexity
Finding the running time of the following algorithm.$Procedure$ $A(n)$ $\textrm{ if (n}<=\textrm{2) then return 1 ;}$ $else$ $Return(A(\left \lceil \sqrt{n} \right \rceil))$
User Avatar
1.0k
views
1 answers
2 votes
Ray Tomlinson asked Aug 9, 2023
1,004 views
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
Link Copied!