Recent questions and answers in Algorithms - GATE CSE Doubts

0 votes

0 answers

ace subject wise test algorithms question
Given answer is option c.can any one explain how??

asked 3 days ago in Algorithms by chirudeepnamini (10 points) | 9 views

0 votes

0 answers

ace test series algorithms
the answer is given as option d.But iam not satisfied with their explanation.. can anyone explain..

asked 3 days ago in Algorithms by chirudeepnamini (10 points) | 7 views

0 votes

0 answers

#Algorithm #Time complexity #Fibonacci series
What is the time complexity of computing Fibonacci series using recursive algorithm? Though there are several questions and answers related to this and in most of the answer says its O(2^n), but in stackexchange some answers are O(1.623^n).. Someone please clarify what should be the answer..

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

0 votes

0 answers

algorithum coal india 2017
a=24 b=16 c=12 d=20 e=8 f=4 using huffman coding which of the following is valid character for 'c'?

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

0 votes

0 answers

Gate 2020 cse
Answer to directed weighted graph should be for every vertex the paths will be same as because w'(u,v) will be w(u,v)+f(u)-f(v) means depednent on only source and destination and not on intermediate step as they will cancel out so paths will reamain same and values ... +w(4,3)+f(1)-f(3) so exteding similarly for any path ,the shortest path will not change but its value can be changed.

asked Feb 13 in Algorithms by hkshenoy (6 points) | 20 views

0 votes

0 answers

Self doubt finding complexity algorithms where study this topic

asked Feb 9 in Algorithms by Ram Swaroop (173 points) | 38 views

+1 vote

1 answer

Virtual GATE-Hashing
Sequentially means one after another,there may or maynot gap between two, right?? Then how $m^{2}$ should be in denominator ?? What will be ans here, B) or C)??

answered Feb 4 in Algorithms by shashin (1.9k points) | 29 views

0 votes

0 answers

Time Complexity Analysis - worst case
A() { int n = ((2)^2)^k; for(int i =1; i <= 2; i++) { j=2; while(j <= n){ j = j^2; printf(“pankaj”); } } } How many times pankaj will be printed and it’s time complexity?

asked Feb 4 in Algorithms by pppankajsaini (8 points) | 46 views

0 votes

0 answers

#algorithms#doubt
In a competition, four different functions are observed. All the functions use a single for loop and within the for loop, same set of statements are executed. Consider the following for loops: A) for(i = 0; i < n; i++) B) for(i = 0; i < n; i += 2 ... 1; i /= 2) If n is the size of input(positive), which function is most efficient(if the task to be performed is not an issue)?

asked Feb 2 in Algorithms by kalra05 (73 points) | 25 views

0 votes

1 answer

Algorithms, complexity
Assume we have n number of unsorted list is given. Each list containing m integers such that n>m. What will be the time to sort in a single list ? Ans given: O(m x nlogn)

answered Feb 2 in Algorithms by kalra05 (73 points) | 36 views

0 votes

1 answer

ACE-FLT Algorithm
Which one should be correct here B or C?

answered Feb 2 in Algorithms by shashin (1.9k points) | 30 views

0 votes

0 answers

asked Feb 1 in Algorithms by Shubhamkr_aryan (6 points) | 10 views

0 votes

2 answers

What is the Time complexity of Tiling Problem in Dynamic Programming?

answered Jan 31 in Algorithms by Debdeep1998 (104 points) | 36 views

0 votes

0 answers

made easytest series
can some give explain why option B is correct?

asked Jan 29 in Algorithms by v.singhal7040 (7 points) | 16 views

0 votes

0 answers

Sorting Mehods
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? Insertion Sort Quick Sort Bubble Sort Merge Sort Anyone please clarify.

asked Jan 27 in Algorithms by Shivateja MST (108 points) | 57 views

0 votes

0 answers

made easy mock test 1
Doubt: I thought it will take the implementation of Bellman-Ford, so Time complexity will be O(VE) i.e. O(Vm). Someone, please explain why I am wrong and also explain the correct solution for this question.

asked Jan 26 in Algorithms by Rudr Pawan (734 points) | 19 views

0 votes

0 answers

Made Easy FLT Basic 3
$\binom{n+m-2}{m-1}$ $\binom{n+m+1}{m-2}$ $\binom{n+m+2}{m}$ $\binom{n+m}{m-1}$

asked Jan 26 in Algorithms by Sambhrant Maurya (396 points) | 32 views

0 votes

0 answers

Made Easy test series algorithm complexity occurance of element more than 2n/3 times

asked Jan 26 in Algorithms by Ram Swaroop (173 points) | 29 views

0 votes

0 answers

ACE FLT:Doubt
Finding the number of inversions, in an array can be found using (A) Brute force and divide and conquer Ans given A) but I want to know , how inversion uses Brute force and divide and conquer? Because here we can take any unsorted array, then how that two technique could be used?

asked Jan 24 in Algorithms by srestha (679 points) | 12 views

0 votes

0 answers

Made Easy test series algorithm complexity
Given an array S containing n real numbers, and a real number We want to find any two elements p and q in the array such that their sum is greater than the real number What is the best possible time complexity to find p and q ? O(1) O(n) O(n log n) O(n^2logn)

asked Jan 24 in Algorithms by Ram Swaroop (173 points) | 20 views

+1 vote

0 answers

Made Easy Test series Algorithms
How to solve this question?

asked Jan 24 in Algorithms by Dheeraj Varma (22 points) | 30 views

0 votes

0 answers

madeeasy cbt 2 2020

asked Jan 24 in Algorithms by Akshay Nair (10 points) | 13 views

0 votes

0 answers

asked Jan 23 in Algorithms by Akshay Nair (10 points) | 31 views

0 votes

0 answers

Geeksforgeeks mock test 2 gate2020
Let functions f and g such that f(n) is O(g(n)) and following statements: I. log f(n) is O(log g(n)) II. 2f(n) is O(2g(n)) III. f(n)2 is O(g(n)2) Which options are false ?

asked Jan 23 in Algorithms by Ruchi Pandey (6 points) | 15 views

0 votes

1 answer

Algorithms time-complexity

answered Jan 22 in Algorithms by shashin (1.9k points) | 35 views

0 votes

0 answers

Ace test Series 2019: DAA Minimum Spanning Tree
according to the graph, minimum cost spanning tree is only <BC><CD><DA> (cost: 1+2+2=5). is my understanding correct? if not could you please explain?

asked Jan 21 in Algorithms by rjking7403 (11 points) | 17 views

0 votes

1 answer

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)).

answered Jan 21 in Algorithms by Debapaul (698 points) | 117 views

0 votes

0 answers

Self Doubt: Merge Sort
What is the minimum number of comparisons required to merge two sorted arrays with 'n' and 'm' elements respectively?

asked Jan 21 in Algorithms by Mellophi (7 points) | 28 views

0 votes

0 answers

Applied gate - mock 4
Given an $N×N$ matrix $M$ whose elements are integers, find the largest element that occurs in each row of the matrix. What is the time-complexity of best algorithm that solves this problem?

asked Jan 21 in Algorithms by Vimal Patel (911 points) | 32 views

+2 votes

0 answers

made easy CBT 2 2020
what is the time complexity of dijkstra algorithm if graph G with n vertices and e edges represented by adjacency matrix representation and sorted array is used to choose the vertices relaxation of greedy selection? O(n^2) O(n^2+logn) O(ne) O(e+n logn)

asked Jan 20 in Algorithms by Vignaneswarkrishna (14 points) | 42 views

0 votes

1 answer

Algorithms Recurrence relation : Ace test series

answered Jan 19 in Algorithms by tp21 (269 points) | 41 views

0 votes

0 answers

GATE FORUM FLT 5

asked Jan 17 in Algorithms by Debapaul (698 points) | 21 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 Jan 17 in Algorithms by haralk10 (54 points) | 17 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 Jan 17 in Algorithms by shashin (1.9k points) | 35 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 Jan 17 in Algorithms by nandani17 (33 points) | 12 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 Jan 17 in Algorithms by shashin (1.9k points) | 42 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 Jan 16 in Algorithms by Chirag Shilwant (180 points) | 10 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 Jan 15 in Algorithms by Rishav_Bhatt (16 points) | 43 views

0 votes

0 answers

#SelfDoubt#TimeComplexity
What should be the answer?

asked Jan 15 in Algorithms by nandani17 (33 points) | 53 views

0 votes

0 answers

Ace Academy test Series : Time Complexity

asked Jan 14 in Algorithms by Chirag Shilwant (180 points) | 18 views

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

Recent questions and answers in Algorithms

3,333 questions

1,581 answers

10,283 comments

89,926 users