Recent questions and answers in Algorithms - GATE CSE Doubts

0 votes

1 answer

#gate2017 #algorithms
In question given below plz explain how we know that which searching algorithms is fit in Let A be an array of 31 numbers consisting of a sequence of 0’s followed by a sequence of 1’s. The problem is to find the smallest index i such that A[i] is 1 by probing the minimum number of locations in A. The worst case number of probes performed by an optimal algorithm is________.

answered 13 hours ago in Algorithms by Abhisheksmile94 (193 points) | 17 views

0 votes

1 answer

#algoritm#heap
What is the difference between max heap and max heapify..?

answered 13 hours ago in Algorithms by Abhisheksmile94 (193 points) | 11 views

0 votes

0 answers

#algorithm #kruskal's algo
What is minimum separator lemma?

asked 21 hours ago in Algorithms by Allica (13 points) | 5 views

+1 vote

1 answer

Made easy Test series-Quicksort
How much time it will take to sort n numbers by quicksort if some arbitrary algorithm takes (n2) time to choose pivot?

answered 1 day ago in Algorithms by bthebestSelf (5 points) | 275 views

0 votes

0 answers

Made Easy Test Series
How to Differentiate Option A and B?

asked 1 day ago in Algorithms by Parth27 (9 points) | 16 views

0 votes

1 answer

Made Easy Workbook- Algorithms Chapter-2 Q-2
Solve the following with Substitution method only. $T(n) = 8T(n/2) + n^{2}logn$) n>0 T(1)=1 Note: The original question doesn’t say to solve with substitution only but i don’t like Master’s method.

answered 2 days ago in Algorithms by zxy123 (2.9k points) | 18 views

0 votes

1 answer

Self doubt :Time Complexity -Iterative
Can Someone help me understand the time-complexity of dependent loops? for example, Q1> int i,j; for(i=1;i<n;i=i++) { for(j=1;j<=i;j=j*2) } Q2> int i,j; for(i=1;i<=n/2;i=i++) { for(j=1;j<=i;j++) }

answered 3 days ago in Algorithms by zxy123 (2.9k points) | 14 views

0 votes

1 answer

Made Easy Test Series
$A. O(n (logn)^2) $ $B. O(n^2 logn) $ $C. O(n^2) $ $D. O(n log(log(n)))$

answered 4 days ago in Algorithms by zxy123 (2.9k points) | 16 views

0 votes

0 answers

Need of cycle checking algorithm in minimum spanning tree algorithms

asked 5 days ago in Algorithms by ashutoshbsathe (5 points) | 12 views

0 votes

0 answers

Applied Test Series
Given a complete undirected graph (with all edges having positive and non negative weights) of $7$ vertices the cost of the MST is known to be $32$, the maximum weight one edge can take is ___. Ans. given is $27$ but shouldn’t it be $32$ because a graph can be constructed with $w \in \{0,32\}$?

asked Jan 8 in Algorithms by toxicdesire (543 points) | 20 views

0 votes

0 answers

Madeeasy Testseries Algo Q1
Which of the following statements are true ? Negating all the edge weights in a weighted undirected graph G and finding the minimum spanning tree gives us the maximum weight spanning tree of the original graph G In a graph with unique edge weights ... probability p1 and p2. In a connected weighted graph, every lowest weight edge is always in some minimum spanning tree.

asked Jan 2 in Algorithms by Shivateja MST (45 points) | 32 views

0 votes

0 answers

Unacademy Test
“Rerunning Dijkstra’s algorithm on a graph V times will result in the correct shortest-path tree, even if there are negative weight edges (No -ve weight cycles” I am thinking the answer is False because even though you run at all the vertices we will have the wrong value computed at each vertex. The answer is True as provided by them (No explanation) [closed]

asked Dec 31, 2020 in Algorithms by badman (9 points) | 20 views

0 votes

2 answers

Made easy algorithms SW test
I didnt understand the solution. can any one explain more clearly with example?

answered Dec 31, 2020 in Algorithms by kalin (153 points) | 31 views

0 votes

0 answers

Algorithm:Doubt
Which of the following sorting algorithm gives the same number of swaps as that of the total inversion count in the array? Quick sort Selection sort Merge Sort Bubble Sort

asked Dec 28, 2020 in Algorithms by val_pro20 (2 points) | 18 views

+2 votes

0 answers

GateBook Full Length Test
Which of the following statements is/are true/correct ? A) Professor Ram gives a comparison-based sorting algorithm that runs in T(n) = 2T(n-1)+ 1. There is not enough information to know whether Ram's algorithm is correct. B) Professor ... base 6) so this also should not be the time complexity of a comparison based sorting algorithm. Can anyone confirm?.Thanks in advance

asked Dec 28, 2020 in Algorithms by Deterministic (31 points) | 40 views

0 votes

1 answer

UGC NET CS 2015 Jun - II
Which of the following algorithms sort n integers, having the range 0 to (n2 - 1), in ascending order in O(n) time ? A Selection sort B Bubble sort C Radix sort D Insertion sort

answered Dec 24, 2020 in Algorithms by eobard (5 points) | 18 views

0 votes

0 answers

GATE 2014, QuickSort Comparisons
Let P be a QuickSort Program to sort numbers in ascending order using the first element as pivot. Let t1 and t2 be the number of comparisons made by P for the inputs {1, 2, 3, 4, 5} and {4, 1, 5, 3, 2} respectively. Which one of the following holds? t1 = 5 t1 < t2 t1 > t2 t1 = t2

asked Dec 22, 2020 in Algorithms by susmit600 (5 points) | 25 views

0 votes

1 answer

Applied Ai test series
What is worst case time complexity of Comparison based sorting? O(n) O(nlogn) O(n^2) none of the above

answered Dec 22, 2020 in Algorithms by Deepakk Poonia (Dee) (1.5k points) | 22 views

0 votes

0 answers

Single Source Shortest Paths
Can the DFS algorithm be used to solve the single source shortest paths problem?

asked Dec 7, 2020 in Algorithms by thisusernametaken (5 points) | 8 views

0 votes

1 answer

MADE EASY TEST doubt
What is the complexity of this loop

answered Dec 4, 2020 in Algorithms by anshik1998 (5 points) | 41 views

0 votes

2 answers

max-heap test
what is the level order traversal for an array of elements 20,15,21,31,16,18,19,40 .These elements are inserted into an empty max heap.

answered Dec 3, 2020 in Algorithms by _sajalrai_ (563 points) | 54 views

+1 vote

1 answer

Applied Course
i am getting two different ans for this ques

answered Dec 2, 2020 in Algorithms by zxy123 (2.9k points) | 47 views

0 votes

1 answer

sorting -algorithms
Best and worst Time complexity for number of inversion using merge sort VS number of inversion using insertion sort

answered Dec 2, 2020 in Algorithms by zxy123 (2.9k points) | 17 views

0 votes

0 answers

TIFR 2018 From System Science
Let G=(V,E)G=(V,E) be a DIRECTED graph, where each edge ee has a positive weight ω(e),ω(e), and all vertices can be reached from vertex s.s. For each vertex v,v, let ϕ(v)ϕ(v) be the length of the shortest path from ss to v.v. Let G′=(V,E)G′=(V, ... If PP is NOT a shortest path in G,G, then ω′(P)<2 ω(P).ω′(P)<2 ω(P). All of the above options are necessarily TRUE.

asked Dec 1, 2020 in Algorithms by Rishabh Mondal (5 points) | 12 views

0 votes

0 answers

Made Easy SubjectWise
why are they not considering ‘6’ as one of the possible values for a.If operations are non-atomic we can get value as a’s value as 6 also.

asked Nov 28, 2020 in Algorithms by Ashutosh777 (-219 points) | 9 views

+1 vote

1 answer

https://www.csd.uwo.ca/~mmorenom/CS433-CS9624/Resources/master.pdf

answered Nov 27, 2020 in Algorithms by zxy123 (2.9k points) | 27 views

0 votes

1 answer

#algorithms #made-easy
What is the time complexity to find kruskal’s algorithm [ MSQ ] 1. O(ElogE) 2. O(ElogV) 3. O(E+V) 4.O(E2 logV)2 i am getting 1 and 3 1-(when edges are not sorted) by using disjoint set 3-(when edges are sorted) by using disjoint set but answer given is 1,2

answered Nov 27, 2020 in Algorithms by Ashutosh777 (-219 points) | 28 views

0 votes

0 answers

Self Doubt : Bubble Sort
If a question is asked in GATE regarding bubble sort,should i take normal bubble sort or improved version of bubble sort? In some test series question, they are giving best case time complexity as O(n) instead of O(n^2) for bubble sort. So, which one should i take?

asked Nov 26, 2020 in Algorithms by phaneendrababu (23 points) | 19 views

0 votes

1 answer

NIELIT NIC scientist-B 2020 set-C ques 56
Consider the algorithm that solves problems of size n by recursively solving two subproblems of size n-1 and then combining the solutions in constant time.Then the running time of the algorithm would be:- O(n) O(logn) O(nlogn) O($n^{2}$)

answered Nov 26, 2020 in Algorithms by zxy123 (2.9k points) | 16 views

0 votes

0 answers

Mergesort - Number of compares between keys
How i can prove that the number of collisions between two keys remain the same and it is independent with the runs(count of sub-divides) that algorithm do ?

asked Nov 24, 2020 in Algorithms by AlgoHuman (5 points) | 13 views

0 votes

0 answers

2 Dimensional array and Kth Smallest Element ?
We are given a 2D array [1..M] [1..N] where each row of this matrix is sorted and all elements are distinct. we need to find k-th smallest element on this array. what is the time complexity? O( log n + log m) O(log n log m) O( m ... C is correct and equal to O( m (log m + log n)). but what is the algorithms? is here any details on this time complexity?

asked Nov 21, 2020 in Algorithms by DrMhmd (5 points) | 29 views

+1 vote

1 answer

NIELIT STA 2018
Given an random unsorted array ‘A’ in which every element is at most ‘d’ distance from is position in sorted array where d<Size(A). If we applied the insertion sort over this array, then the time complexity of algorithm is: O($n\log d$) O($n^2\log d$) O($nd$) O($n^2d$)

answered Nov 18, 2020 in Algorithms by kalin (153 points) | 37 views

0 votes

1 answer

#MadeEasy #Algorithms #AsymptoticAnalysisOfAlgorithms

answered Nov 17, 2020 in Algorithms by zxy123 (2.9k points) | 19 views

+1 vote

1 answer

Testbook Test series
What is the best case time complexity to find the smallest element in Max-heap implemented using array with n^3 * logn elements? Ω(logn) Ω(n) Ω(n^3logn) Ω(1)

answered Nov 16, 2020 in Algorithms by zxy123 (2.9k points) | 36 views

+1 vote

1 answer

Made Easy Test Series
The minimum number of comparisons to find the biggest number in an unsorted list of size 15 is __________

answered Nov 16, 2020 in Algorithms by StoneHeart (735 points) | 23 views

0 votes

0 answers

Made Easy Test Series
How much time will it take to sort n numbers by quicksort if some arbitrary algorithm takes O(n^2) to choose pivot?

asked Nov 16, 2020 in Algorithms by Vishal_kumar98 (37 points) | 21 views

+1 vote

1 answer

MADE EASY TEST ON ALGORITHMS
$\text{A graph G with n vertices is said to be a void graph if and only if there's no edge between any pair of vertices belonging to G. }$ $\text{Let X be a void graph on $ ... $\text{ What is the value of}$ $k^{\frac{1}{2}}$ $?$

answered Nov 12, 2020 in Algorithms by zxy123 (2.9k points) | 20 views

+1 vote

1 answer

Algorithms by Jeff Erickson

answered Nov 10, 2020 in Algorithms by zxy123 (2.9k points) | 22 views

+1 vote

1 answer

GATE1988-6 Time Complexity Algorithms
Can someone please explain what this function do with a diagram and what does it mean by payoff and INF and negate INF? https://gateoverflow.in/94363/gate1988-6i

answered Nov 6, 2020 in Algorithms by zxy123 (2.9k points) | 16 views

+1 vote

0 answers

Madeeasy test
What is your approach to solving this problem?

asked Nov 6, 2020 in Algorithms by Raj_81 (11 points) | 27 views

To see more, click for all the questions in this category.

Recent questions and answers in Algorithms

8,957 questions

3,118 answers

14,337 comments

95,787 users