Recent questions and answers in Algorithms - GATE CSE Doubts

0 votes

0 answers

SELF DOUBT PREVIOUS YEAR ALGORITHM
https://gateoverflow.in/8501/gate2015-3-42 CAN WE say f(n)=Θ(g(n))…..becz for n=0 both are equal.

asked 1 day ago in Algorithms by eyeamgj (41 points) | 6 views

0 votes

0 answers

InterviewBit
In the following C function, let $n >= m$. int gcd(int n, int m) { if (n%m ==0) return m; if (n < m) swap(n, m); while (m > 0) { n = n%m; swap(n, m); } return n; } What is the time complexity of the above function assuming n > m?

asked 6 days ago in Algorithms by Sambhrant Maurya (401 points) | 8 views

0 votes

1 answer

Geeks Algo Quiz
Need help with this

answered Mar 28 in Algorithms by toxicdesire (293 points) | 18 views

0 votes

0 answers

GeeksForGeeks quiz
Can anyone help me with this ?

asked Mar 27 in Algorithms by Ananya2000 (16 points) | 5 views

0 votes

1 answer

Find time complexity of this python function
Find Time Complexity of the following function?? def function3(n): if n <= 0: return for i in range(0, 3): function3(0.8 * n)

answered Mar 25 in Algorithms by toxicdesire (293 points) | 10 views

0 votes

1 answer

Previous Year Made easy
int f1(int n) { if(n==0||n==1) return n; else return (2*f1(n-1)+3*f1(n-2)); } Time complexity of above function

answered Mar 25 in Algorithms by !KARAN (351 points) | 15 views

0 votes

1 answer

Nielit STA [02-12-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: A O(nlogd) B O(n2 logd) C O(nd) D O(n2d) Algorithms

answered Mar 20 in Algorithms by Vimal Patel (916 points) | 15 views

0 votes

0 answers

f(n) =log (n!) and g(n) = (log n)! What is relationship between f(n) and g(n)

asked Mar 18 in Algorithms by Golden preet Kaur (6 points) | 10 views

0 votes

1 answer

#self doubts #mergesort
the time complexity of merge sort and randomised quick sort is nlogn if we have merge sort then why we make quick sort

answered Mar 18 in Algorithms by smsubham (64 points) | 16 views

0 votes

0 answers

time complexity self doubt
FIND THE TIME COMPLEXITY OF THE FOLLOWING CODE. int p=2^n for(i=1;p>=n;i++) { p=p/i; }

asked Mar 11 in Algorithms by NIKHIL GOBHIL (6 points) | 13 views

0 votes

0 answers

COAL INDIA MT 2020 finding time complexity
Q.59 Solve the following recurrence relation T(n) = 4T(n/2) + n Ans A. O(n /2) B. Ο(n) C. O(log n) D. O(v^2) Answer given as option D. Answer given interms of ‘v’, it will be constant right if the term is not in recurrence relation? Solving using Master theorem, T(n) = O(n^2) None of the options matches with O(n^2). can i challenge this?

asked Mar 9 in Algorithms by rjking7403 (27 points) | 8 views

+2 votes

1 answer

CIL MT EXAM 2020 Systems
Which of the following statement is false about Prim's algorithm? A. The time complexity is O(E + V log V)using Fibonacci Heap. B. Initially the roots key and nodes are initialized to zero. C. The complexity is O(E log V) using binary heap. D ... the priority queue. Given answer is D but how B is correct as initially root is initialized to 0 and all other nodes as infinity.

answered Mar 6 in Algorithms by rjking7403 (27 points) | 37 views

0 votes

0 answers

Gate workbook,algorithm,Assymtotic notation
Let f(n)=O(n),g(n)=O(n) and h(n)=theta(n). Then [f(n).g(n)]+h(n) is 1.omega(n) 2.O(n) 3.theta(n) 4.None of these

asked Mar 6 in Algorithms by Palash yadav (13 points) | 11 views

0 votes

1 answer

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

answered Feb 29 in Algorithms by haralk10 (62 points) | 20 views

0 votes

0 answers

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

asked Feb 22 in Algorithms by chirudeepnamini (10 points) | 16 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 Feb 20 in Algorithms by souren (28 points) | 27 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 Feb 19 in Algorithms by aaru14 (6 points) | 11 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) | 25 views

0 votes

0 answers

Self doubt finding complexity algorithms where study this topic

asked Feb 9 in Algorithms by Ram Swaroop (305 points) | 39 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) | 60 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) | 26 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) | 31 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) | 38 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 (113 points) | 62 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) | 20 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 (401 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 (305 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 (683 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 (305 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) | 31 views

0 votes

0 answers

madeeasy cbt 2 2020

asked Jan 24 in Algorithms by Akshay Nair (10 points) | 15 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) | 37 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 (27 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 (699 points) | 120 views

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

Recent questions and answers in Algorithms

3,522 questions

1,658 answers

10,465 comments

90,046 users