Recent questions in Algorithms

–2 votes

0 answers

1

ace book
how to find value in this type of question???

asked 1 day ago in Algorithms by CHïntän ÞäTël (143 points) | 110 views

0 votes

1 answer

2

madeeasy
how to apply masters theorem in this type of cases!????!

asked 1 day ago in Algorithms by CHïntän ÞäTël (143 points) | 24 views

0 votes

0 answers

3

SELF DOUBT MADEESY TEST
WHAT IS RECURRENCE RELATION ? I M GETTING T(n-2)+1

asked 1 day ago in Algorithms by eyeamgj Loyal (5.9k points) | 32 views

+1 vote

0 answers

4

Gradeup
Why 2n is added as n-1 & n-2 functions has been called

asked 1 day ago in Algorithms by twin_123 (37 points) | 25 views

0 votes

0 answers

5

MADEEASY TESTT SERIES

asked 1 day ago in Algorithms by eyeamgj Loyal (5.9k points) | 24 views

0 votes

0 answers

6

MADEEASY

asked 1 day ago in Algorithms by eyeamgj Loyal (5.9k points) | 34 views

0 votes

0 answers

7

Algorithm

asked 1 day ago in Algorithms by Vaishnavi01 (199 points) | 21 views

0 votes

0 answers

8

Coreman- Chapter3
Is the function (log n)! polynomially bounded? and Is (log log n)! polynomially bounded?? [closed]

asked 1 day ago in Algorithms by anjali007 Active (1.2k points) | 16 views

0 votes

0 answers

9

SELF DOUBT
https://gateoverflow.in/2503/gate1994-7 HOW TO DO THESE KIND OF QUESTION IN EXAM IN LESS TYM IF OPTIONS ARE ALSO GIVEN BECZ CHECKING INDIVIDUAL OPTION IS VERY LENGTHY

asked 1 day ago in Algorithms by eyeamgj Loyal (5.9k points) | 10 views

0 votes

0 answers

10

recurrence relation
T(n)=5 T ($\frac{n}{2}$+16) + n2 please tell the solution as i m getting confused

asked 2 days ago in Algorithms by LavTheRawkstar Active (5.2k points) | 25 views

0 votes

0 answers

11

ACE Test Series

asked 2 days ago in Algorithms by ben10 (357 points) | 35 views

0 votes

2 answers

12

METest_Algo
I think the past cost to G from A as computed by Dijkstra should be 2 instead of 8. Please help me verify it.

asked 2 days ago in Algorithms by Ayush Upadhyaya Boss (16.2k points) | 24 views

0 votes

1 answer

13

selfas
f(n) + O(f(n)) = Θ(f(n)) True or not? Explain please

asked 2 days ago in Algorithms by Vegeta (455 points) | 20 views

0 votes

0 answers

14

ME test series
Which of the following statement is correct reason for “Balanced binary tree is better than a complete binary tree for sorting a set S of n elements”? S1 : A balanced binary tree is more space efficient. S2 : Insertion and deletion can be preferred faster. S3 : Implementation of balanced binary tree require less RAM space. Which of the following is always true?

asked 2 days ago in Algorithms by newdreamz a1-z0 (355 points) | 15 views

0 votes

0 answers

15

Made Easy Algorithms Test - 2
https://gateoverflow.in/?qa=blob&qa_blobid=8164680937983732221 I don't understand the solution at all. I thought 91,33,44,and 77 can come in any possible ways but that has been said wrong.

asked 3 days ago in Algorithms by Anurag Aizen Mukherj (7 points) | 21 views

0 votes

0 answers

16

Algorithm-METest-MST
A Spanning tree T(V,E) has bottleneck edge, means all edges present in T with the greatest cost would be bottleneck edges. Now they have said, A spanning tree T of G is a minimum bottleneck spanning tree if no spanning tree T' existed with cheaper ... I think if in (A) it was minimum bottleneck spanning tree, then (B) would not have been possible to produce. Please guide.

asked 3 days ago in Algorithms by Ayush Upadhyaya Boss (16.2k points) | 18 views

0 votes

1 answer

17

self doubt about dijkistra algorithm negative cycle

asked 3 days ago in Algorithms by adeemajain (65 points) | 10 views

0 votes

0 answers

18

Time Complexity
How to solve the following recurrence relation? T(n) = T(n-6) + n2 , n>7 T(n) = 1 , n<= 7

asked 3 days ago in Algorithms by garvit_vijai (123 points) | 18 views

0 votes

0 answers

19

TIME COMPLEXITY
n is prime ,find value of x and find time complexity. main() { x=0; for(i=1;i<=n;i++) { if(n%i) { for(j=1;j<=n;j=j*10) { x=x+1; } } } } what i am getting is x=(n-2)logn tym complexity =n+(n-2)log n. is correct ?

asked 3 days ago in Algorithms by eyeamgj Loyal (5.9k points) | 7 views

0 votes

0 answers

20

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 .

asked 4 days ago in Algorithms by radha gogia Loyal (7.7k points) | 46 views

0 votes

0 answers

21

Self Doubt - Quick Sort
Consider the following inputs: 1) 2 2 2 2 2 2 2 2) 1 2 3 4 5 6 7 3) 7 6 5 4 3 2 1 In all three cases, the worst-case time complexity of quicksort is O(n2) My doubt is if I am taking the middle element as a pivot, ... ), right? Can someone explain how we are saying worst-case time complexity for these three cases is O(n2) irrespective of the selection of the pivot element?

asked 4 days ago in Algorithms by garvit_vijai (123 points) | 19 views

0 votes

0 answers

22

test series
Through an experiment ,it is found that selection sort performs 5000 comparisons when sorting an array of size k.if the size of the array is doubled, what will be the number of comparisons ? A)5000 B)10000 C)20000 D)none of these.

asked 4 days ago in Algorithms by talha hashim Active (4k points) | 30 views

0 votes

0 answers

23

test series
What is the time complexity to find the maximum number of edges to be added to a tree so that it stay a bipartite graph? A)O(V+E) B)O(VE) C)O(V) D)O(V^2)

asked 4 days ago in Algorithms by talha hashim Active (4k points) | 21 views

0 votes

0 answers

24

self doubt
Given the following table of data what are the minimum expected no.of comparisons required for an Optimal i 0 1 2 3 4 Pi 3/16 3/16 1/16 1/16 Qi 2/16 3/16 1/16 1/16 1/16 BST that can be constructed with the given data P(I) PROBABILITY OF ACCESSING INTERNAL NODE Q(i) PROBABILITY OF ACCESSING EXTERNAL NODE i am not getting the meaning of question ???????

asked 4 days ago in Algorithms by Deepanshu Active (4.4k points) | 10 views

0 votes

0 answers

25

ACE testseries
"ANSWER GIVEN IS 32" i am getting answer as 40.

asked 4 days ago in Algorithms by newdreamz a1-z0 (355 points) | 38 views

0 votes

0 answers

26

merge sort
suppose there are 4 sorted list of 16 elements each if we merge there lists into single sorted list of 64 elements.the key comparisons needed in the worst case using an efficient algorithm i have solve using formula (nlogn-2^logn+1)???

asked 5 days ago in Algorithms by altamash (247 points) | 22 views

0 votes

0 answers

27

ACE Test Series
why TC is nlogn?

asked 5 days ago in Algorithms by VJ2793 (25 points) | 31 views

+1 vote

1 answer

28

ACE test series
why Q is false?

asked 5 days ago in Algorithms by VJ2793 (25 points) | 30 views

0 votes

0 answers

29

ACE topicwise
can anyone explain the question?

asked 5 days ago in Algorithms by newdreamz a1-z0 (355 points) | 31 views

0 votes

1 answer

30

What is the value of T(n) for the given recurrence relation

asked 6 days ago in Algorithms by sripo Junior (755 points) | 51 views

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 questions in Algorithms

Recent Posts

Recent Blog Comments