Recent questions in Algorithms

+1 vote

0 answers

1

Vani Qs Bank Algorithms
.Given an array of distinct integers A[1, 2,…n]. Find the tightest upper bound to check the existence of any index i for which A[i]=i. Ans should be O(log n) right by doing binary search ??

asked May 21 in Algorithms by Hirak Active (2k points) | 26 views

+1 vote

0 answers

2

GEEKSFORGEEKS ALGO
What does it mean when we say that an algorithm X is asymptotically more efficient than Y? (A) X will be a better choice for all inputs (B) X will be a better choice for all inputs except small inputs (C) X will be a better choice for all inputs except large ... is it always the case?? At some points it might be true but I do not think this is the case for each and every input..

asked May 20 in Algorithms by Hirak Active (2k points) | 21 views

0 votes

0 answers

3

Recurrence Relation-Self Doubt(Discrete Math+Algo)
Let $A(n)$ denotes the number of $n$ bit binary strings which have no pair of consecutive $1’s.$ what will be recurrence relation for it and what will be it’s Time Complexity??

asked May 19 in Algorithms by srestha Veteran (114k points) | 33 views

0 votes

0 answers

4

Made Easy Test Series:Algorithm-Dijkstra
Which of the following procedure results same output as Dijkstra’s Algo. on unweighted graph on $'n'$ verices? $A)$ BFS $B)$ DFS $C)$Kruskal $D)$ Prims As far I know Dijkstra and Prims both have $T.C.=O(E+VlogV)$ But ans given BFS. How this ans possible??

asked May 18 in Algorithms by srestha Veteran (114k points) | 26 views

0 votes

0 answers

5

Made Easy Test Series:Algorithm-Time Complexity
Consider a procedure $find()$ which take array of $n$ integers as input, and produce pair of element of array whose difference is not greater than the difference of any other pair of element of that array. Which of the following represent ... Here we need to sort first and then need to compare adjacent element right?? Then what will be complexity??

asked May 18 in Algorithms by srestha Veteran (114k points) | 33 views

0 votes

0 answers

6

Made Easy Test Series: Algorithm-Sorting
An array $A$ of size n is known to be sorted except for the first $k$ elements and the last $k$ elements, where $k$ is a constant. Which of the following algorithms will be the best choice for sorting the array $A?$ $a)$ ... sorts part by part using pivot. So, why not will it be answer?? How do we know it is asking for almost sorted array??

asked May 12 in Algorithms by srestha Veteran (114k points) | 32 views

0 votes

0 answers

7

ISI2018-PCB-B5
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.

asked May 12 in Algorithms by akash.dinkar12 Boss (40.5k points) | 9 views

0 votes

1 answer

8

ISI2018-PCB-B2
You can climb up a staircase of $n$ stairs by taking steps of one or two stairs at a time. Formulate a recurrence relation for counting $a_n$, the number of distinct ways in which you can climb up the staircase. Mention the boundary conditions for your recurrence relation. Find a closed form expression for $a_n$ by solving your recurrence.

asked May 12 in Algorithms by akash.dinkar12 Boss (40.5k points) | 18 views

0 votes

0 answers

9

ISI2018-PCB-B1
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.

asked May 12 in Algorithms by akash.dinkar12 Boss (40.5k points) | 9 views

0 votes

0 answers

10

#algorithms #recurrence-relation
T(n)=T(√n) + n I am finding it difficult to solve last step of this recurrence relation . Please help me with expansion of this recurrence relation.

asked May 11 in Algorithms by aniketpatil32 (23 points) | 20 views

0 votes

1 answer

11

Made Easy Test Series:Algorithm- Minimum Weight Path
Consider the following statement: $A)$ If all edge weight of a graph are positive then any subset of edges that connect all vertices and has minimum total weight is a tree. $B)$ ... minimum weight graph?? and what about B)?? Is it just saying each minimum path between $2$ vertices makes total shortest path??

asked May 10 in Algorithms by srestha Veteran (114k points) | 23 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??$

asked May 10 in Algorithms by srestha Veteran (114k points) | 20 views

0 votes

1 answer

13

Made Easy Test Series:Algorithm-Recurrence Relation
What is the solution of recurrence relation $T\left ( n \right )=T\left ( n-1 \right )+n$

asked May 10 in Algorithms by srestha Veteran (114k points) | 43 views

0 votes

0 answers

14

What would be the upper and lower bound for this decreasing function or invalid case? #Algorithm #Asymtotic-notations

asked May 10 in Algorithms by aniketpatil32 (23 points) | 21 views

+1 vote

0 answers

15

GO screening test
Which one of the following notations is most relevant for finding the best algorithm for a problem? (A) $o(f(n))$ (B) $O(f(n))$ (C) $\omega (f(n))$ (D) $ \Omega (f(n))$

asked May 9 in Algorithms by toxicdesire Junior (695 points) | 91 views

0 votes

1 answer

16

analysis of algorithm

asked May 9 in Algorithms by pradeepchaudhary Active (1.2k points) | 36 views

0 votes

1 answer

17

Made Easy Test Series:Algorithm-Mathematical Solution
Consider a hash table with $n$ slots that uses chaining for collision resolution, table is initially empty. What is the probability that after $4$ keys are inserted then atleast a chain of size $3$ is created, when the value of $n=9$___________ They have done ... $3??$ Plz chk it

asked May 8 in Algorithms by srestha Veteran (114k points) | 18 views

0 votes

0 answers

18

Made Easy Test Series: Binary Tree
The number of node in each left subtree is within a factor of $2.$ of the number of nodes in the corresponding right subtree. Also a node allowed to have only one child if that child has no children. This tree has worst case height $O(logn)$. $N$ is the number of nodes in the binary tree. Is this statement TRUE about Binary Tree?

asked May 7 in Algorithms by srestha Veteran (114k points) | 16 views

0 votes

1 answer

19

Made Easy Test Series:Time Complexity
Consider the following program: int Bar(int n){ if(n<2) return; } else{ int sum=0; int i,j; for(i=1;i<=4;i++) Bar(n/2); for(i=1;i<=n;i++){ for(j=1;j<=i;j++){ sum=sum+1; } } } Now consider the following ... $Bar\left ( n \right )$ is $O \left ( n^{3}logn^{2} \right )$ How many statements are correct________________

asked May 7 in Algorithms by srestha Veteran (114k points) | 40 views

0 votes

2 answers

20

Made Easy Test Series: Algo- Mathematical Solution
Through an experiment, it is found that selection sort performs $5000$ comparisons when sorting an array of size $k.$ If the size of array is doubled, what will be the number of comparisons? will it be $\left ( 5000 \right )^{2}$ or $\left ( 5000 \right )\times 4$. Someone check plz

asked May 6 in Algorithms by srestha Veteran (114k points) | 23 views

0 votes

2 answers

21

Made Easy Test Series:Algo- Asymptotic Complexity
$1)n^{2019}=O\left (n^{2020} \right )$ $2)O(n^{2019})=O\left (n^{2020} \right )$ Which one is correct?? If $1)$ is correct, why $2)$ not correct?

asked May 6 in Algorithms by srestha Veteran (114k points) | 65 views

0 votes

0 answers

22

Mimimum number of comparison to sort 13 elements/numbers for any comparison based sorting algorithm?

asked May 4 in Algorithms by iarnav Loyal (9.8k points) | 21 views

0 votes

0 answers

23

IIT Madras MS written test 2019 - Algorithms - 1
Let SP be the problem of finding the shortest path between 2 nodes, and LP be the problem of finding the longest path between 2 nodes, in an unweighted, undirected graph. Which of the following is true? SP is NP-hard, LP is not LP is NP-hard, SP is not Both are NP-hard Neither SP nor LP is NP-hard

asked May 2 in Algorithms by SPluto Junior (609 points) | 87 views

0 votes

1 answer

24

ISI 2018 PCB C5
Consider a max-heap of n distinct integers, n ≥ 4, stored in an array A[1 . . . n]. The second minimum of A is the integer that is less than all integers in A except the minimum of A. Find all possible array indices of A in which the second minimum can occur. Justify your answer.

asked May 2 in Algorithms by N (311 points) | 33 views

0 votes

0 answers

25

Made Easy Test Series:Algorithm
Given a sorted array of distinct integer $A\left [ 1,2,....n \right ]$, the tightest upper bound to check the existence of any index $i$, for which $A[i]=i$ ... index and then checking if $A[i]=i$, but answer given as $O(log n).$Please help me out, which will be correct answer?

asked Apr 28 in Algorithms by srestha Veteran (114k points) | 76 views

0 votes

0 answers

26

Ford-Fulkersons method:

asked Apr 28 in Algorithms by Nandkishor3939 Active (1.2k points) | 23 views

0 votes

0 answers

27

#self doubt
Is it required to focus on space complexity for "GATE"?

asked Apr 27 in Algorithms by Rishabh Baghel (51 points) | 14 views

0 votes

1 answer

28

#Algorithms Quicksort VS Mergesort? Which is a faster sorting algorithm
I did Google and found out that Quicksort is better then Mergesort, but my question is which is faster among both?

asked Apr 25 in Algorithms by iarnav Loyal (9.8k points) | 62 views

0 votes

0 answers

29

Total number of function calls in Merge sort Algorithm
In Merge sort Algorithm when I took input array of size 2 and I got 4 function calls as including original function call with which I call MS algorithm i.e. MS (1,2) and which in turn calls two recursive function calls to merge ... function calls. So, how can I analyze the total number of function calls when input array size is n? thank you!

asked Apr 25 in Algorithms by iarnav Loyal (9.8k points) | 30 views

0 votes

1 answer

30

Made Easy Test Series : Algorithm
for(k=1;k<(n+1);k++) { for(m=1;m<(n+1);m+=k){ x=x+1; } } What is the T.C. of the following code? Is it $n^{2}$ or $n\log n$??

asked Apr 20 in Algorithms by srestha Veteran (114k points) | 91 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