Recent questions and answers in Algorithms

0 votes

1 answer

Find number of Minimum cost spanning tree possible?

answered 1 day ago in Algorithms by pranay562 (77 points) | 25 views

0 votes

0 answers

TIme complexity Made easy
What is time complexity for this function?

asked 4 days ago in Algorithms by vupadhayayx86 (6 points) | 17 views

0 votes

0 answers

floor or ceil which to use in the given problem's time complexity #self-doubt (example of Narasimha Karumanchi)

asked 5 days ago in Algorithms by debasree88 (8 points) | 8 views

0 votes

1 answer

#Self Doubt Huffman Coding!
Hello all, I've this trivial doubt in Huffman coding algorithms questions - Mostly there's a question of type - What is the min expected length of the message? Now my doubt is in some questions - after finding expected length of message = no of bits ... t figure out in which case one has to divide and in which case not to divide with total number of characters? Thank you

answered Oct 14 in Algorithms by Rudr Pawan (577 points) | 24 views

0 votes

1 answer

Deletion of an element from Heap
The best time required to delete an element x,if present, in a min-heapof n elements is O(logn) O(n) O(n logn) None of these

answered Oct 13 in Algorithms by !KARAN (118 points) | 21 views

0 votes

1 answer

Algorithm ACE Test Series Test 29 on Recurrence relation

answered Oct 12 in Algorithms by Rudr Pawan (577 points) | 14 views

0 votes

1 answer

Difference between logarithmic notations
Can any one please tell what is difference between (log^2)n ,(logn)^2 and loglogn? Are these equal?

answered Oct 12 in Algorithms by Rudr Pawan (577 points) | 27 views

0 votes

0 answers

Self doubt Algorithms- Matrix chain multiplication

asked Oct 12 in Algorithms by Rudr Pawan (577 points) | 25 views

0 votes

1 answer

ACE Test Series Asymptotic notation

answered Oct 11 in Algorithms by Rudr Pawan (577 points) | 40 views

0 votes

1 answer

ACE Test Series time complexities
I am unable to solve Q, R, S. Please help me out. Thanks.

answered Oct 11 in Algorithms by Satbir (2.5k points) | 43 views

0 votes

0 answers

ACE Test Series asymptotic notation doubt
I am trying to understand how to solve this. Suppose I take an algorithm with best case $n^{2}$, average case $n^{3}$, worst case $n^{4}$ True since $n^{3}$ < c * $n^{4}$ False since $n^{2}$ >= c * $n^{4}$ is false False since $n^{4}$ < c* $n^{2}$ is false True since $n^{2}$ <= c * $n^{4}$ Where am I doing wrong?

asked Oct 11 in Algorithms by DukeThunders (197 points) | 17 views

0 votes

0 answers

Algorithm ACE Test Series Test 43 Q15 on Greedy merging

asked Oct 11 in Algorithms by DukeThunders (197 points) | 10 views

0 votes

0 answers

Algorithm ACE Test Series Test 29 Q28 on Binary Tree

asked Oct 10 in Algorithms by DukeThunders (197 points) | 12 views

0 votes

0 answers

Algorithm ACE Test Series Test 29 Q27 on Time Complexity

asked Oct 10 in Algorithms by DukeThunders (197 points) | 16 views

0 votes

0 answers

geekforgeeks
int a = 0; for (i = 0; i < N; i++) { for (j = N; j > i; j--) { a = a + i + j; } } my doubt is an inner loop (J) is depend on i variable which is run n times. now how to evaluate the inner loop. please explain in details how TC is calculated. [closed]

asked Oct 10 in Algorithms by Hira Thakur (8 points) | 7 views

0 votes

0 answers

Algorithm ACE Test Series Test 29 Q12 on Bitonic
The answer is 194. How to solve this.

asked Oct 10 in Algorithms by DukeThunders (197 points) | 7 views

0 votes

0 answers

Algorithm ACE Test Series Test 29 Q12 on Time complexity

asked Oct 10 in Algorithms by DukeThunders (197 points) | 13 views

0 votes

0 answers

Algorithm ACE Test Series Test 15 Q7 on MST
I tried to draw graphs with fewer number of vertices but couldn't find any pattern in the MST costs. What should be the correct approach for this type of question? I saw this type of questions in MCQs where they gave formulas as options ... But if absolute value is required then I am not sure how to handle the question. Any help is appreciated. Thank you.

asked Oct 10 in Algorithms by DukeThunders (197 points) | 5 views

0 votes

0 answers

Algorithm ACE Test Series Test 14 Q7 Sorting
Answer is given as C but I am unable to understand this… Any help is appreciated. Thank you.

asked Oct 10 in Algorithms by DukeThunders (197 points) | 6 views

0 votes

0 answers

Algorithm ACE Test Series Test 14 Q5 Inversions in array

asked Oct 10 in Algorithms by DukeThunders (197 points) | 16 views

0 votes

1 answer

MadeEasy Workbook, DRDO 2008
Consider a sequence A of length n which is sorted except for one item that appears out of order.Which of the following can sort the sequence in O(n) time? (a) Heap sort (b) Quick sort (c) Merge sort (d) Insertion sort

answered Oct 10 in Algorithms by GAITONDE (1.2k points) | 23 views

0 votes

1 answer

Algorithm-self doubt(recurrence)
How to solve recurrence relation $T(n)=O(n)+2T(4n/5)$ Thank-you

answered Oct 9 in Algorithms by Rudr Pawan (577 points) | 15 views

0 votes

0 answers

Self Doubt - Selection Sort Minimum Number of Swaps?

asked Oct 5 in Algorithms by iarnav (65 points) | 17 views

0 votes

2 answers

Time Complexity
We have an input array A with n(n>=2) numbers. What is the worst case complexity(tightest upper bound) of algorithm to find two elements x,y ϵ A such that |x-y| <= |u-v| for all u,v ϵ A. O(n) O(nlogn) O(n^2) none Please explain with clear explaination

answered Oct 3 in Algorithms by ck (10 points) | 34 views

0 votes

0 answers

#Algorithms Sorting TIFR 2010 Self Doubt
Please this question - https://gateoverflow.in/19036/tifr2010-b-27 Someone students are saying Answer D) is correct and that also makes sense as they provided the counter example to prove that, but best answer says C. So, does Insertion sort on ... sequence ordering can make n(n-1)/2 comparisons? Also, it's not coming up anywhere on Google. Kindly help!

asked Oct 1 in Algorithms by iarnav (65 points) | 13 views

0 votes

0 answers

Self Doubt - Minimum number of swaps to sort an array.

asked Sep 27 in Algorithms by iarnav (65 points) | 30 views

0 votes

0 answers

#Algortihms (GeeksforGeeks) Self Doubt - Search an element in an unsorted array using minimum number of comparisons?

asked Sep 27 in Algorithms by iarnav (65 points) | 16 views

+1 vote

1 answer

Algorithm-ACE Test
You are given a sequence of n elements to sort. The input sequence consists of n/k subsequences, each containing k elements.The elements in a given subsequence are all smaller than the elements in succeeding subsequences and larger than all elements in preceding subsequence.Thus all that ... varient of sorting problem is A)$\Omega(n \log k)$ B)$\Omega(k \log n)$ C)$\Omega(n)$

answered Sep 26 in Algorithms by Satbir (2.5k points) | 44 views

+1 vote

1 answer

Algo Made easy : GATE 2020
The Dimensions are A (5 x 10) , B(10 x 3) C(3 x12) D (12x3) My ans 303, ans given 405, which is right?

answered Sep 24 in Algorithms by DukeThunders (197 points) | 26 views

0 votes

1 answer

Algorithm: Made Easy
My ans is 14, but ME says 17.. Who is right?

answered Sep 20 in Algorithms by vizzard110 (41 points) | 32 views

0 votes

0 answers

Algorithm :Virtual Gate
In the knapsack problem, we are given a set of n item, where each item i is specified by a size si and a value vi. We are also given a size bound S(the size of our knapsack). The goal is to find the subset of items of maximum total value such that sum of ... XXXX in the algo? No statement needed, it is already a complete algo. a[S][n]=result a[n][S]=result a[n][n]=result

asked Sep 20 in Algorithms by srestha (318 points) | 11 views

0 votes

0 answers

Algo Measy 2020

asked Sep 20 in Algorithms by GAITONDE (1.2k points) | 21 views

0 votes

0 answers

Algorithm: MADE EASY 2020
While applying Dijkstra algorithm on given graph, it is already known that it is computing wrong path to some of the vertices. The number of wrong path computed are ________. My answer is 10 as all these paths→ C-A C-D C-F C-G E-A E-B E-C E-D E-F E-G are computer wrong due to negative edge weights encountered. Am i right?

asked Sep 20 in Algorithms by GAITONDE (1.2k points) | 17 views

0 votes

2 answers

made easy test series quick sort time complexity

answered Sep 20 in Algorithms by Bikram (1.2k points) | 15 views

0 votes

0 answers

Virtual Gate Test Series :Algorithm
Consider the following pseudocode, that computes kth power of x func(x,k){ IF k=0 return 1 ELSE IF k is even return(func(x,k/2))*(func(x,k/2)) } The time complexity $T(k)$ and space complexity $S(k)$ are $(A)T(k)=T(k/2)+c$, $S(k)=O(logk)$ $(A)T(k)=2T(k/2)+c$, $S(k)=O(k)$ $(A)T(k)=2T(k/2)+c$, $S(k)=O(logk)$ (D)None of these

asked Sep 19 in Algorithms by srestha (318 points) | 21 views

0 votes

2 answers

gatebook_test1
An array is said to be -ordered if for each such that . for example, the array 1 4 2 6 3 7 5 8 is 2-ordered. In a 2-ordered array of 2N elements, what is the maximum number of positions that an element can be from its position if the array were 1-ordered?

answered Sep 18 in Algorithms by Bikram (1.2k points) | 27 views

0 votes

2 answers

Nptel quiz 3 question 3
. Given is the BFS tree ,which of the following can not be the edge in original graph a)(C,G) b)(B,K) c)(B,F) d)(A,D)

answered Sep 18 in Algorithms by Bikram (1.2k points) | 10 views

0 votes

0 answers

Isro 2009 question no 55
[closed]

asked Sep 17 in Algorithms by CHITRANJANKUMAR (6 points) | 10 views

0 votes

0 answers

gatebook_test
Below is the implementation of mergesort. void sort(int a, int lo, int hi){ if(hi<=lo) return; int mid = lo + (hi-lo)/2; sort(a,lo,mid); sort(a,mid+1,hi); merge(a,lo,mid,hi); } Assume that merge function merges the elements a[lo] ... a[hi]. Suppose that the above algorithm is modified to skip the call on merge() whenever then the no of compares used to mergesort a sorted array is

asked Sep 16 in Algorithms by mohan123 (20 points) | 5 views

0 votes

0 answers

gatebook_test
A certain algorithm A has been shown to have running time , where is the size of the input. Which of the following is NOT true about algorithm ? (A) For all N, there may be some inputs for which the running time is less than seconds. (B) For all N, ... which the running time is more than seconds. (D) For all N, there may be some inputs for which the running time is more than seconds

asked Sep 16 in Algorithms by mohan123 (20 points) | 6 views