Dark Mode

Recent questions tagged algorithm-design

0 votes

1 answer

1

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

207 views

0 votes

2 answers

2

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

86 views

0 votes

0 answers

3

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 18, 2022

by makhdoom ghaya

52 views

0 votes

1 answer

4

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

158 views

7 votes

2 answers

5

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

4.7k views

1 vote

2 answers

6

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

429 views

2 votes

2 answers

7

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

352 views

1 vote

2 answers

8

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

358 views

0 votes

1 answer

9

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

471 views

1 vote

2 answers

10

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

886 views

0 votes

1 answer

11

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

381 views

0 votes

2 answers

12

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

281 views

0 votes

1 answer

13

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

220 views

21 votes

9 answers

14

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

14.4k views

1 vote

1 answer

15

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

824 views

10 votes

6 answers

16

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

3.2k views

2 votes

0 answers

17

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

403 views

0 votes

1 answer

18

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

258 views

1 vote

1 answer

19

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

210 views

0 votes

0 answers

20

MADEEASY TESTT SERIES

eyeamgj asked in Algorithms Nov 19, 2018

156 views

0 votes

0 answers

21

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

257 views

3 votes

3 answers

22

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 Patel RJIT asked in Algorithms Nov 10, 2018

by Lakshman Patel RJIT

9.8k views

1 vote

1 answer

23

write efficient algorithm
Let S be a set of n positive integers, where n is even. Give an efficient algorithm to partition S into two subsets S1 and S2 of n/2 elements each with the property that the difference between the sum of the elements in S1 and the sum of the elements in S2 is maximum. What is the time complexity of your algorithm?

Ojamajo Conan asked in Algorithms Oct 3, 2018

by Ojamajo Conan

488 views

0 votes

1 answer

24

Self Doubt
What is adaptive algorithm and is merge sort and quick sort is adaptive?

iamdeepakji asked in Algorithms Oct 2, 2018

194 views

0 votes

1 answer

25

ISI2016-PCB-CS-7
Let $A$ be a sorted array of $n$ positive integers, such that $A[1] \leq A[2] \leq \dots \leq A[n]$. Given an integer $x$ as input, the goal is to find two array indices $k$ and $l$ such that $A[k]+A[l] =x$, if such indices exist; otherwise, the goal is to report 'Failure". Design an algorithm for this problem, that works in $O(n)$ time.

go_editor asked in Algorithms Sep 18, 2018

250 views

0 votes

0 answers

26

Time complexity

Deepalitrapti asked in Algorithms Sep 2, 2018

by Deepalitrapti

513 views

0 votes

1 answer

27

NPTEL Assignment
10 rooms, numbered 1 to 10, need to be rewired, but there are constraints on the order in which this can get done. Rooms 5 and 8 must be rewired before starting on 6 Room 1 must be rewired rewired before starting on 7 and 9 Rooms 4 and 5 must be rewired before starting ... and 3-1-7-10-8-5-2 each of length 7." <--quoted from answer How is it done?How is it connected to DAG?

amitqy asked in Algorithms Aug 24, 2018

by amitqy

635 views

0 votes

1 answer

28

algorithm corman
Insertion sort uses an incremental approach for designing algorithm can someone please explain?

saurabh12345 asked in Algorithms Jul 24, 2018

by saurabh12345

250 views

Page:

1
2
3
next »

Recent questions tagged algorithm-design