Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
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.
Sajal Mallick
asked
in
Algorithms
Nov 27, 2023
by
Sajal Mallick
176
views
made-easy-booklet
algorithms
time-complexity
greedy-algorithm
algorithm-design
0
votes
0
answers
2
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
made-easy-test-series
algorithms
made-easy-booklet
algorithm-design
time-complexity
linked-list
graph-theory
graph-algorithm
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 } }
Ray Tomlinson
asked
in
Algorithms
Aug 9, 2023
by
Ray Tomlinson
432
views
algorithms
algorithm-design
loop-invariants
loop
time-complexity
2
votes
1
answer
4
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
847
views
made-easy-test-series
made-easy-booklet
algorithms
data-structures
array
algorithm-design
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 )
Ray Tomlinson
asked
in
Algorithms
Aug 9, 2023
by
Ray Tomlinson
513
views
made-easy-test-series
made-easy-booklet
algorithms
hashing
linear-probing
algorithm-design
0
votes
1
answer
6
Which one is right ? what will be the right answer assigning 0 to the left edges or right?
Nisha Bharti
asked
in
Algorithms
Nov 26, 2022
by
Nisha Bharti
594
views
huffman-code
greedy-algorithm
algorithm-design
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
admin
asked
in
Others
Oct 23, 2022
by
admin
336
views
ugcnetcse-oct2022-paper1
algorithm-design
quick-sort
0
votes
0
answers
8
Best Open Video Playlist for Algorithm design techniques: Greedy Topic | Algorithm
Please list out the best free available video playlist for Algorithm design techniques: Greedy from Algorithm as an answer here (only one playlist per answer). We'll then select the best playlist and add to GO ... ones are more likely to be selected as best. For the full list of selected videos please see here
makhdoom ghaya
asked
in
Study Resources
Aug 17, 2022
by
makhdoom ghaya
112
views
go-classroom
video-links
missing-videos
free-videos
algorithm-design
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 ?
ykrishnay
asked
in
Algorithms
May 22, 2022
by
ykrishnay
511
views
preparation
algorithms
algorithm-design
15
votes
3
answers
10
GATE CSE 2021 Set 1 | Question: 40
Define $R_n$ to be the maximum amount earned by cutting a rod of length $n$ meters into one or more pieces of integer length and selling them. For $i>0$, let $p[i]$ denote the selling price of a rod whose length is $i$ meters. ... $R_7=18$ $R_7=19$ $R_7$ is achieved by three different solutions $R_7$ cannot be achieved by a solution consisting of three pieces
Arjun
asked
in
Algorithms
Feb 18, 2021
by
Arjun
8.2k
views
gatecse-2021-set1
multiple-selects
algorithms
algorithm-design
2-marks
1
vote
2
answers
11
CMI2019-B-6
Let $A$ be an $n\times n $ matrix of integers such that each row and each column is arranged in ascending order. We want to check whether a number $k$ appears in $A.$ If $k$ is present, we should report its position - that is, the row $i$ and ... $A.$ Justify the complexity of your algorithm. For both algorithms, describe a worst-case input where $k$ is present in $A.$
gatecse
asked
in
Algorithms
Sep 13, 2019
by
gatecse
675
views
cmi2019
algorithms
algorithm-design
descriptive
2
votes
2
answers
12
CMI2018-B-4
You are given a sorted array of $n$ elements which has been circularly shifted. For example, $\{35,42,5,12,23,26\}$ is a sorted array that has been circularly shifted by $2$ positions. Give an $O(\log n)$ time algorithm to find the largest element in a circularly shifted array. (The number of positions through which it has been shifted is unknown to you.)
gatecse
asked
in
Algorithms
Sep 13, 2019
by
gatecse
587
views
cmi2018
algorithm-design
descriptive
1
vote
2
answers
13
CMI2018-B-6
You are playing an old-style video game in which you have to shoot down alien spaceships as they fly across the screen from left to right. Each spaceship flies across the screen at a specified height. You have an antiaircraft gun set to shoot down all ... space ships. Each gun can be initialized separately to a firing height and each gun can be separately reset to a lower value.
gatecse
asked
in
Algorithms
Sep 13, 2019
by
gatecse
613
views
cmi2018
descriptive
algorithm-design
0
votes
1
answer
14
ISI2018-PCB-CS6
The following function computes an array $SPF$, where, for any integer $1 < i < 1000$, $SPF[i]$ is the smallest prime factor of $i$. For example, $SPF[6]$ is $2$, and $SPF[11]$ is $11$. There are five missing parts in the following code, commented as $/* Blank */$. For each of them ... < 1000; j+= i) { /* Blank 4 */ if (SPF[j] == j) { SPF[j] = _____; /* Blank 5 */ } } } } }
akash.dinkar12
asked
in
Algorithms
May 12, 2019
by
akash.dinkar12
642
views
isi2018-pcb-cs
algorithm-design
descriptive
1
vote
2
answers
15
ISI2018-PCB-CS5
Consider a max-heap of $n$ distinct integers, $n ≥ 4$, stored in an array $\mathcal{A}[1 . . . n]$. The second minimum of $\mathcal{A}$ is the integer that is less than all integers in $\mathcal{A}$ except the minimum of $\mathcal{A}$. Find all possible array indices of $\mathcal{A}$ in which the second minimum can occur. Justify your answer.
akash.dinkar12
asked
in
Algorithms
May 12, 2019
by
akash.dinkar12
1.1k
views
isi2018-pcb-cs
algorithms
algorithm-design
binary-heap
descriptive
0
votes
1
answer
16
ISI2018-PCB-CS1
Consider an array of length n consisting only of positive and negative integers. Design an algorithm to rearrange the array so that all the negative integers appear before all the positive integers, using $O(n)$ time and only a constant amount of extra space.
akash.dinkar12
asked
in
Algorithms
May 12, 2019
by
akash.dinkar12
566
views
isi2018-pcb-cs
algorithms
algorithm-design
descriptive
0
votes
2
answers
17
Made Easy Test Series:Algorithm-Inversion
Consider an array $A=\left \{ 30,15,48,34,26,29 \right \}$ Let $X$ be the number of inversion of array $A,$ Now another array $B$ is constructed by making all the numbers in $A$ negative and keeping the order between each numbers same. Let the ... array so obtained be $Y.$ Then $X+2Y=$_______________ $\left ( 30,26 \right )$ number of inversion $4$ or $1??$
srestha
asked
in
Algorithms
May 10, 2019
by
srestha
375
views
made-easy-test-series
algorithm-design
numerical-answers
0
votes
1
answer
18
MOCK TEST
Consider an array consisting of –ve and +ve numbers. What would be the worst time comparisons an algorithm can take in order to segregate the numbers having same sign altogether i.e all +ve on one side and then all -ve on the other? a)N-1 b)N c)N+1 d) (N*(N-1))/2 answer given is a)
Dipanshu Rana
asked
in
Algorithms
Mar 22, 2019
by
Dipanshu Rana
379
views
time-complexity
algorithm-design
test-series
23
votes
9
answers
19
GATE CSE 2019 | Question: 25
Consider a sequence of $14$ elements: $A=[-5, -10, 6, 3, -1, -2, 13, 4, -9, -1, 4, 12, -3, 0]$. The sequence sum $S(i,j) = \Sigma_{k=i}^j A[k]$. Determine the maximum of $S(i,j)$, where $0 \leq i \leq j <14$. (Divide and conquer approach may be used.) Answer: ___________
Arjun
asked
in
Algorithms
Feb 7, 2019
by
Arjun
19.1k
views
gatecse-2019
numerical-answers
algorithms
algorithm-design
1-mark
1
vote
1
answer
20
Time complexity
What is the worst case time complexity to count pairs of numbers with difference ‘k’ from an input array of ‘n’ numbers O(log n) O(n log n) O(n)^2 O(n^2 log n) The answer given was B but since worst case time is stated shouldn't the answer be C? I mean we can check all possible pairs in the worst case. Correct me if I am wrong?
Anilava Kundu
asked
in
Algorithms
Jan 17, 2019
by
Anilava Kundu
1.3k
views
algorithms
time-complexity
algorithm-design
10
votes
6
answers
21
TIFR CSE 2019 | Part A | Question: 5
Asha and Lata play a game in which Lata first thinks of a natural number between $1$ and $1000$. Asha must find out that number by asking Lata questions, but Lata can only reply by saying Yes or no . Assume that Lata always tells the truth. What is ... she can always find out the number Lata has thought of? $10$ $32$ $100$ $999$ $\text{None of the above}$
Arjun
asked
in
Algorithms
Dec 18, 2018
by
Arjun
4.3k
views
tifr2019
algorithm-design
binary-search
2
votes
0
answers
22
MadeEasy
An array is said to be random if for every index i such that 1<=i<=n-2 (array start with 0) every 2nd element from start is greater than from its left and right adjacent elements.if input is almost sorted what is time complexity to get random Array. A.O(n) B.O(logn) C.O(nlogn) D.O(n2) What is mean by “Almost sorted“ what is its significance here.
Abhisek Tiwari 4
asked
in
Algorithms
Dec 1, 2018
by
Abhisek Tiwari 4
629
views
algorithm-design
0
votes
1
answer
23
Interview Question
Given an Unsorted array, Find maximum in less than O(n) time? How can we do this?
Learner_jai
asked
in
Algorithms
Nov 27, 2018
by
Learner_jai
479
views
interview
array
algorithm-design
1
vote
1
answer
24
made easy
Assume an array A[1,……..,n] has n elements, and every element of an array is less than or equal to n.An element is said to be “majority element”,if it is occured in more than n/2 positions of an array.What is the time complexity to check whether the majority element exist or not in the given array?[Best answer] a)O(logn) b)O(n) c)O(nlogn) d)O(n^2)
Piyush mishra
asked
in
Algorithms
Nov 25, 2018
by
Piyush mishra
389
views
time-complexity
algorithm-design
made-easy-test-series
0
votes
0
answers
25
MADEEASY TESTT SERIES
eyeamgj
asked
in
Algorithms
Nov 19, 2018
by
eyeamgj
277
views
time-complexity
algorithm-design
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 .
radha gogia
asked
in
Algorithms
Nov 16, 2018
by
radha gogia
509
views
gatebook
test-series
algorithm-design
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$
Lakshman Bhaiya
asked
in
Algorithms
Nov 10, 2018
by
Lakshman Bhaiya
12.4k
views
algorithms
greedy-algorithm
algorithm-design
job-scheduling
Page:
1
2
3
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged algorithm-design
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...