Recent questions and answers in Algorithms - GATE CSE Doubts

+1 vote

2 answers

Self Doubt Algorithms
I was having a doubt that should we consider = or I am finding different answers on the internet.

answered 5 days ago in Algorithms by Ashutosh777 (67 points) | 41 views

0 votes

0 answers

Unacademy Free Test Algo Quesn
Assume that the enqueuing and dequeuing of elements in BFS takes O(V) time. then what will be the time complexity of the BFS algorithm? (Assume adjacency list representation) O(V^3) O(V^2) O(V^2 . E) O(V + E) Anyone please clarify.

asked Oct 17 in Algorithms by Shivateja MST (39 points) | 37 views

0 votes

1 answer

ALGO doubt : Made easy test series
https://gateoverflow.in/167339/madeeasy-subject-test-programming-%26-ds-heap The number of min heap trees are possible with 15 elements such that every leaf node must be greater than all non-leaf nodes of the tree are

answered Oct 15 in Algorithms by mayureshpatle (855 points) | 40 views

+3 votes

3 answers

Applied GATE Test series
Given the following code segment, the value in the variable sum is best given by: sum=0; for(i=0 ; i< n ;i++) { for(j=1 ; j<n ; j*=2) { sum + = i ; } } O(nlogn) O(n^3) O(n^2logn) None

answered Oct 14 in Algorithms by spike500 (17 points) | 50 views

0 votes

1 answer

How to solve this recurrence relation using back substitution?

answered Oct 13 in Algorithms by mayureshpatle (855 points) | 55 views

0 votes

1 answer

Deletion in heap
How to delete the last node in a max-heap or min-heap? Do we delete it directly or like in normal case- replace it with itself then call max heapify on it and then finally decrease heap size?

answered Oct 12 in Algorithms by mayureshpatle (855 points) | 34 views

+1 vote

1 answer

Time complexity algorithm
How to find the complexity of this using masters theorem or induction T(n) = 3T(n/12) +T (n/4) +n

answered Oct 12 in Algorithms by mayureshpatle (855 points) | 79 views

0 votes

0 answers

Question on heap from MIT quiz
Link: https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-to-algorithms-spring-2008/exams/quiz1.pdf

asked Oct 10 in Algorithms by RasMalai (27 points) | 16 views

0 votes

0 answers

Self Doubt in Sorting Algorithm
If there is a question on bubble sort and nothing about the type (with a boolean flag which terminates if there is no swap in a pass or without flag) of bubble sort is mentioned. which one should we use?

asked Oct 9 in Algorithms by badman (5 points) | 11 views

0 votes

1 answer

MADE EASAY - Test series
How to reduce to n^(n-1) ? [closed]

answered Oct 8 in Algorithms by spike500 (17 points) | 48 views

0 votes

1 answer

Unacademy Free Test Question
Consider the following and choose the correct answer by order of growth 1. n! 2. a^n , a is constant 3. e^n 4. n^n 5. n^k , where k is constant Anyone please clarify. 5<2<3<1<4 b.2<5<3<1<4 c.5<3<2<1<4 d.5<2<3<4<1

answered Oct 8 in Algorithms by RAVIKANT MAURYA (5 points) | 23 views

0 votes

0 answers

Cormen Page 44 , Para 2
Statement : It is not contradictory, however, to say that the worst-case running time of insertion sort is Ω(n^2 ), since there exists an input that causes the algorithm to take Ω(n^2 ) time . What does this statement mean as they are talking about worst case but are using Big Omega notation?

asked Sep 25 in Algorithms by Ankit Raina 7 (5 points) | 22 views

0 votes

0 answers

PREVIOUS YEAR ALGORITHM DOUBT
https://gateoverflow.in/549/gate1992-01-ix E1 E2 E3 .En are sorted edges step1;pick E1 put it in MST ..O(1) step 2: then check for cycle detection ..O(n+m) using dfs,O(n+m) using union finding,O(logn) using some improved version ... repeat step 1 and 2 similary n*[O(1)+logn] when using (log n) for cycle detection =O(nlog n) is this the corrrect approach ?

asked Sep 25 in Algorithms by eyeamgj (21 points) | 12 views

0 votes

0 answers

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

asked Sep 24 in Algorithms by Musa (5 points) | 13 views

0 votes

0 answers

PREVIOUS YEAR GATE ALGORITHM
https://gateoverflow.in/457/gate2008-45 IN THIS QUESTION AFTER APPLYING THE Dijkstra's algorithm ..how we can conclude that cost is computed is correct or not ? do we need manual cross check for grahs having negative edges?

asked Sep 23 in Algorithms by eyeamgj (21 points) | 14 views

0 votes

1 answer

Self Doubt (PYQ)
https://gateoverflow.in/549/gate1992-01-ix In this question the time complexity is given as O((n+m)$\alpha$(n)). In Horowitz it is said that on average it is O(1) for find, then shouldn’t it be O(n+m).

answered Sep 22 in Algorithms by Arkaprava (711 points) | 17 views

0 votes

0 answers

ISI-2020-ALGORITHMS-C2
An $n*n$ binary matrix M is called a NICE matrix, if each row of M has exactly one non-zero element and each column also has exactly one non-zero element. (i) Suggest a method of storing a NICE matrix in an $O(n)$ size array. (ii) Design an $O(n)$ ... (in pseudocode) for computing R=PQ, where P and Q are both NICE matrices each stored in an array of size $O(n)$ as in (i).

asked Sep 21 in Algorithms by souveekp (5 points) | 29 views

0 votes

1 answer

GATE Applied course test series
Suppose that the probabilities of searching for certain words in a document were: BAT (18 %) , CAT (22 %) , DOG (18 %) , EGG (20 %) , HAT (22 %) . Compute the average search cost if we use Greedy approach to insert these words in an Optimal Binary Search Tree ?

answered Sep 20 in Algorithms by Ehraz Hasan (366 points) | 26 views

0 votes

0 answers

Made Easy Workbook for Algorithm
Find the running time for Dijkstra's algorithm on the complete graph of n-vertices.

asked Sep 19 in Algorithms by Vishal_kumar98 (7 points) | 25 views

0 votes

1 answer

made easy test series
Consider the functions – logn! , (logn)! , (logn)^logn , log(logn)! , and (loglogn)!. What should be the increasing order of the functions?

answered Sep 19 in Algorithms by ankitgupta.1729 (211 points) | 56 views

0 votes

0 answers

Algo Book doubt-Goodrich
Given an unordered sequences S of n compatible elements. Describe an efficient method for finding the $\left \lceil \sqrt{n} \right \rceil$ items whose rank in an ordered version of closest to that of median. What is running time of your method?

asked Sep 18 in Algorithms by srestha (1k points) | 10 views

0 votes

0 answers

Self Doubt- Algo book-Goodrich
To implement deterministic and randomized version of quick sort algorithm, which one will be faster? [Your test should include sequences that are very random looking as well as that one which is almost sorted.]

asked Sep 18 in Algorithms by srestha (1k points) | 9 views

0 votes

1 answer

Self doubt:Algorithm Book-Tardos
Can we measure , number of inversion in $O\left ( nlogn \right )$ time?Give some hint.

answered Sep 18 in Algorithms by Ehraz Hasan (366 points) | 21 views

0 votes

0 answers

Algorithm :Tardos
Suppose you are consulting for a bank, that is concerned about fraud detection and they came to you with the following problem. They have the collection of n bank cards they have confiscated, suspecting them of being used in fraud. Each bank card is a ... are to pick two of them and plug them into the equivalent tester. What is Time Complexity to find answer of this question?

asked Sep 18 in Algorithms by srestha (1k points) | 22 views

0 votes

0 answers

GeeksforGeeks
Select the correct asymptotic complexity of an algorithm with runtime T(n, n) where T(x, c) = Θ(x) for c <= 2, T(c, y) = Θ(y) for c <= 2, and T(x, y) = Θ(x+y) + T(x/2, y/2) (A) Θ(nLogn) (B) Θ(n$^2$) (C) Θ(n) (D) Θ(n$^2$Logn)

asked Sep 18 in Algorithms by Musa (5 points) | 9 views

0 votes

0 answers

Made easy test series
we are given two strings: String S of length n and string T of length m for the LCS problem, we have produced the following exponential time recursive program. LCM (S, n, T, m) { if (n == 0||m == 0) return 0 if (S[n] == T[m]) result t = 1 + LCS (S, ... , LCS (S, n, T, m - 1)); return result; } then the number of times that LCS (S, 1, T, 1) is recursively called equals ________

asked Sep 18 in Algorithms by nehamawa (9 points) | 12 views

0 votes

1 answer

made easy test series
Consider the array after one pass of quick sort algorithm: 9 7 17 21 18 24 29 the sum of all possible values that could have been used as a pivot is __ ?

answered Sep 17 in Algorithms by Ehraz Hasan (366 points) | 46 views

0 votes

0 answers

AVL tree help
The vertex of a binary tree is called an single child if it has a father's vertex but does not have a neighbor. The root is not considered an single child. numOnly indicate the number of vertices in binary tree that hold the attribute "single son ", and ... in the binary tree i need to prove that every non-empty AVL tree has inequality $\frac{numOnly}{n}\leq \frac{1}{2}$

asked Sep 17 in Algorithms by eden (5 points) | 36 views

0 votes

1 answer

Made easy test series
An 2-dimensional array having n row and m column which contain positive integer is called cross sum array satisfying above property The minimum sum of a, b, c, d and e, such that it follow the above properties of cross sum array is ____.

answered Sep 16 in Algorithms by Ehraz Hasan (366 points) | 38 views

0 votes

0 answers

ACE PRACTISE BOOK
Single source shortest path problems can be implemented by the Greedy Method using (a) Red-Black trees (b) Min Heap (c ) AVL Trees (d) None of these

asked Sep 16 in Algorithms by Vishal_kumar98 (7 points) | 9 views

0 votes

1 answer

Self Doubt - Gate 2021 syllabus
Avl trees, B, B+ trees, Red-Black trees are in gate cs 2021 syllabus?

answered Sep 10 in Algorithms by raju6 (11 points) | 35 views

0 votes

0 answers

Self Doubt (PYQs)
https://gateoverflow.in/978/gate2006-17 If this question was MSQ type then will C and D be possible solutions also?

asked Sep 9 in Algorithms by Mellophi (333 points) | 45 views

0 votes

0 answers

Self Doubt (PYQs)
https://gateoverflow.in/2503/gate1994-7 In this question can someone explain how the condition j!= n+i-K is obtained?

asked Sep 9 in Algorithms by Mellophi (333 points) | 13 views

0 votes

1 answer

Self doubt - Kruskal's Algorithm for MST
One approach for Kruskal's algorithm is to make use of a Disjoint-set data structure. With this the running time of Kruskal's algorithm as $O(ElgV)$ My doubt is whether I can implement Kruskal's this way too: Creating Min heap using edge ... to check for cycles$\Rightarrow O(V+E)$ Time complexity worst case: $E+ElgE\Rightarrow O(ElgE)\Rightarrow O(ElgV)$

answered Sep 8 in Algorithms by jayeshasawa001 (2.5k points) | 40 views

0 votes

0 answers

Made easy online test series, Algorithms
I think that the Emax’s last addition will be +6 instead of +5. Am I correct please let me know. If I am wrong then please correct me. Below is the question.

asked Sep 7 in Algorithms by sarthakdarji (9 points) | 67 views

0 votes

0 answers

#MadeEasy #Algorithms #AsymptoticAnalysisOfAlgorithms

asked Sep 7 in Algorithms by Lata Patwal (9 points) | 25 views

0 votes

1 answer

Made easy Workbook, Self doubt in Minimum Spanning Tree

answered Sep 5 in Algorithms by KUSHAGRA गुप्ता (1.4k points) | 53 views

0 votes

1 answer

Madeeasy books
Consider a following graph. Assume that node 'S' is the starting vertex for prim's algorithm. Which of the following can be the correct order of edges in which they are added to construct the minimal spanning tree?

answered Sep 5 in Algorithms by Ehraz Hasan (366 points) | 25 views

0 votes

1 answer

Made easy workbook, Graph Based Algorithms
Which of the following is not a cross edge during given BFS traversal on G? a) d,c b) d,b c) e,b d) e,f

answered Sep 3 in Algorithms by Shashank Rustagi (513 points) | 24 views

0 votes

0 answers

Made easy Work book, Self doubt in Graph Based Algorithms

asked Sep 3 in Algorithms by sarthakdarji (9 points) | 8 views

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

Recent questions and answers in Algorithms

8,430 questions

2,707 answers

13,232 comments

95,451 users