Recent questions and answers in Algorithms - GATE CSE Doubts

0 votes

0 answers

Made Easy-CBT2
Which of the following is incorrect a. f(n) + Ω(f(n)) = Ω(f(n)). b. f(n) + Ο(f(n)) = Θ(f(n)). c. f(n) + Ο(f(n)) = Ο(f(n)). d. f(n) + Ω(f(n)) = Θ(f(n)).

asked 6 hours ago in Algorithms by Dheeraj Varma (8 points) | 26 views

0 votes

1 answer

Algorithms Recurrence relation : Ace test series

answered 9 hours ago in Algorithms by tp21 (258 points) | 27 views

0 votes

0 answers

GATE FORUM FLT 5

asked 2 days ago in Algorithms by Debapaul (619 points) | 20 views

0 votes

0 answers

Algorithms Directed Acyclic Graph
What is the value after evaluating given DAG when a=3? 56 b. 168 c. 504 d. 1512 [closed]

asked 2 days ago in Algorithms by haralk10 (54 points) | 13 views

0 votes

1 answer

Self Doubt sorting
Which of the following sorting methods sorts a given set of item that is already in sorted order or in reverse sorted order with equal speed? A) - Insertion Sort B) - Quick Sort C) - Bubble Sort D) - Merge Sort

answered 2 days ago in Algorithms by shashin (1.2k points) | 27 views

0 votes

0 answers

MadeEasyTest
cant we use bellman ford in vm time, if we know u and v vertex? or else cant we use floyd warshell algo in (v^2)*m time?

asked 2 days ago in Algorithms by nandani17 (29 points) | 10 views

0 votes

1 answer

Made Easy Mock 2
int s=0; for(int b=1;b<=n;b*=2) { for(int i=0;i<b;i++) { for(int j=0;j<n;j+=2) { s=s+j; } for(int j=1;j<n;j*=2) { s=s+j; } } } What is the TC of above code? Please illustrate the sigma summation method.

answered 2 days ago in Algorithms by shashin (1.2k points) | 36 views

0 votes

0 answers

Made easy test series :Algorithms
What is the time complexity of Merge sort if no extra array is available while combining ?

asked 3 days ago in Algorithms by Chirag Shilwant (153 points) | 8 views

+1 vote

0 answers

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?

asked 4 days ago in Algorithms by Rishav_Bhatt (13 points) | 38 views

0 votes

0 answers

#SelfDoubt#TimeComplexity
What should be the answer?

asked 4 days ago in Algorithms by nandani17 (29 points) | 50 views

0 votes

0 answers

Ace Academy test Series : Time Complexity

asked 5 days ago in Algorithms by Chirag Shilwant (153 points) | 15 views

0 votes

1 answer

Merging of two sorted array
while merging two sorted array of size m,n respectively why total number of comparision is m+n-1?. suppose 1st list contain 2,3 2nd list containn 4,5,6 insert infinity in first list at end and infinity in second list at end. 1st comparison of (2,4) - ... ----->6 will come in Final Array so according to above procedure there will be total of m+n comparision i.e here 5.

answered 5 days ago in Algorithms by shashin (1.2k points) | 15 views

0 votes

0 answers

Self Doubt : Shortest path algorithm
1.) Dijkstras shortest path algorithm works on disconnected graph. 2.) Bellman ford algorithm works on disconnected graph. Which of the above statements is/are true?

asked 5 days ago in Algorithms by vishal burnwal (117 points) | 31 views

0 votes

0 answers

Gate 2019 question and question no is 24.
Consider a sequence of 14 elements: A = [-5, -10, 6, 3, -1, -2, 13, 4, -9, -1, 4, 12, -3, 0]. The subsequence sum . Determine the maximum of S(i,j), where 0 ≤ i ≤ j < 14. (Divide and conquer approach may be used). Options are :- a) 19 b) 30 c) 29 d) 9

asked 5 days ago in Algorithms by Aakashkumarvishwa (6 points) | 11 views

0 votes

0 answers

algorithms previous year
https://gateoverflow.in/664/gate2000-2-17?show=331123#a331123 f(n)=theta(g(n)). h(n)=n! g(n)=n^root n. apply log both sides. log(n!) and rootn *log(n); but since log(n!)=theta (nlogn) and nlogn >rootn *logn. so we can say n!>n^rootn. is my approach correct?

asked Jan 11 in Algorithms by Harshitkmr (9 points) | 5 views

0 votes

1 answer

Minimum Cost Spanning Tree
Anyone please clarify.

answered Jan 9 in Algorithms by Priyansh Singh (219 points) | 24 views

0 votes

0 answers

ME Test Series(Sorting)
Which of the following sorting methods sorts a given set of items that is already in sorted order or in reverse sorted order with equal speed? A. Heap sort B. Quick sort C. Insertion sort D. Selection sort Why not Merge Sort?

asked Jan 8 in Algorithms by DimpleMotwani (7 points) | 24 views

0 votes

0 answers

Madeeasy test series - find order of relaxed vertices in a graph using dijkstra algo

asked Jan 8 in Algorithms by luc_Bloodstone (33 points) | 17 views

0 votes

0 answers

Madeeasy test series - Increase order of function
I tried this by taking some bigger values of n and then comparing the results but getting the different answer then the one they have given. Please help.

asked Jan 8 in Algorithms by luc_Bloodstone (33 points) | 12 views

0 votes

0 answers

GATEFORUM ALGORITHM TEST

asked Jan 7 in Algorithms by Debapaul (619 points) | 29 views

0 votes

0 answers

made easy advance test
suppose a new graph that is different only in weight of D-H weight is created.find the number of values of D-H that ensures dijkstra's will provide correct shortest path tree where value of edge D-H [-20,20] and A is source vertex.

asked Jan 6 in Algorithms by abhinav649 (50 points) | 4 views

0 votes

0 answers

Made Easy test Series 2020 Algoritms
Let A,B,C,D,E are sorted sequences having length 70, 74, 80, 85, 102 respectively. They are merged into a single sequence by merging together two sequences at a time. The maximum number of comparisons that will be needed by best algorithm for doing merging is_____ .

asked Jan 5 in Algorithms by rohit090893 (7 points) | 6 views

0 votes

0 answers

Made Easy Online Test Series_Algorithms_Sorting
Consider two arrays A[] and B[], if A[1...n] is in increasing order , and B[1 ...n] is in decreasing order is input to a join algorithm. The output is an array C[1 .2n] which has alll the values of the arrays A[] and B[] and is ... order. What is the worst case time complexity for the join algorithm to join the two array? O(n^2) O(n) O(n logn) O(1)

asked Jan 4 in Algorithms by rohit090893 (7 points) | 24 views

0 votes

0 answers

Made easy basic test series

asked Jan 2 in Algorithms by SHARMISTHA CHOUDHURY (7 points) | 10 views

0 votes

0 answers

Time Complexity Of Algorithm, GATE 1999
Consider the following algorithms. Assume, procedure $A$ and procedure $B$ take $O (1)$ and $O(1/n)$ unit of time respectively. Derive the time complexity of the algorithm in $O$-notation. algorithm what (n) begin if n = 1 then call A else ... ? We usually don't count the number of function calls that are being made in a recursive function.

asked Jan 2 in Algorithms by goxul (363 points) | 21 views

0 votes

0 answers

DAA_ace_test_series.

asked Dec 30, 2019 in Algorithms by Rajesh Panwar (49 points) | 15 views

0 votes

0 answers

Made Easy Demo test full length Q31
Please help me with the approach to solve this question

asked Dec 30, 2019 in Algorithms by ssap09 (42 points) | 13 views

0 votes

0 answers

Gate 2004(previous year question)
https://gateoverflow.in/1075/gate2004-81#27987 ,if we consider tree for example A-B-C-D-E-F .let G1= ABC and G2=CDEF then option B will be wrong .where is my mistake.

asked Dec 30, 2019 in Algorithms by BASANT KUMAR (12 points) | 15 views

0 votes

1 answer

Time complexity Ace test series

answered Dec 29, 2019 in Algorithms by goxul (363 points) | 37 views

0 votes

0 answers

Dynamic Algorithms self doubt
Dynamic programming runs slower than an equivalent memoization approach, if every sub problem is solved. True or False?

asked Dec 29, 2019 in Algorithms by Chirag Shilwant (153 points) | 11 views

+1 vote

1 answer

Made Easy FLT 5 Adavance 2020 Graph theory
Consider graph G has 10 vertices. Minimum number of edges required to guarantee that the graph is connected? I think answer would be n-1 edges. But in solution they user 1+(n-1)C2 edges. Can you plz help me out? Thanks in advance for your suggestions.

answered Dec 27, 2019 in Algorithms by Debapaul (619 points) | 39 views

0 votes

0 answers

Big omega self doubt
I want to know that here in above question it is given that time complexity as O(n) and it can be find in O(logn) and big oh shows upper bound so the answer can also be O(n) if it would be omega(n) than it would be wrong becouse we can do it in logn time so please clear what should we do in exam if this type of thing come.

asked Dec 27, 2019 in Algorithms by vijay kumar 2 (29 points) | 23 views

+3 votes

1 answer

Made Easy test series algorithm binary Max heaps
Total number of ordering possible with elements 12, 10, 8, 5, 3, 2, 1, 13, 7, 9, 18 such that it satisfied max heap property ________.

answered Dec 27, 2019 in Algorithms by goxul (363 points) | 65 views

0 votes

1 answer

Madeeasy Test Series - Number of comparisons
ans :- 94

answered Dec 26, 2019 in Algorithms by Debapaul (619 points) | 27 views

0 votes

2 answers

Ace Mock 1 2019 Q47
I am not able to understand the question properly.. someone plz explain

answered Dec 26, 2019 in Algorithms by Pratyush Priyam Kuan (740 points) | 67 views

0 votes

0 answers

made easy test dijkasra algo
shouldnt the answer should be 41. i am saying becouse there is not any negative edge weight cycle [closed]

asked Dec 25, 2019 in Algorithms by vijay kumar 2 (29 points) | 9 views

0 votes

0 answers

AlgorithmsBFS
I think and should be V^2.??Ans given O(V+E)

asked Dec 25, 2019 in Algorithms by nandani17 (29 points) | 19 views

0 votes

0 answers

DAA_ACE_TEST_SERIES

asked Dec 25, 2019 in Algorithms by Rajesh Panwar (49 points) | 31 views

0 votes

0 answers

Made Easy topic wise -2 algorithm bst
Consider the post order traversal of a binary search tree 1, 4, 3, 9, 13,7,6, 17, 20, 24, 18,15. The expected number of comparison when a randomly record is requested.(Upto 2 decimal place) Answer 3.16

asked Dec 22, 2019 in Algorithms by Ram Swaroop (155 points) | 12 views

0 votes

0 answers

Doubt in min number of edges to connect
Can someone please verify the above statemen? whether it is right or not?

asked Dec 21, 2019 in Algorithms by vijay kumar 2 (29 points) | 24 views

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

Recent questions and answers in Algorithms

3,014 questions

1,520 answers

9,036 comments

89,817 users