Awesome q2a theme
Ask us anything
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Year
Exams
Recent questions tagged #algorithms
0
votes
0
answers
Algorithms Master Theorem
T(n) = 2T(n/4) + 2^n How to solve these kind of questions?
asked
5 days
ago
in
Algorithms
by
Vishal_Malo
(
6
points)

8
views
#algorithms
#timecomplexity
0
votes
1
answer
Time complexity
#include <stdio.h> int main(void){ // Your code here! for(int i=1;i<=4;i++) { // printf("%d\n",i); for(int j=1; j<=i;j++) { printf("%s\n", "pankaj"); } printf("\n"); } } i think time complexity is n^2 ...is it right?
asked
Jun 19
in
Programming
by
pppankajsaini
(
12
points)

24
views
#timecomplexity
#algorithms
0
votes
0
answers
Time Complexity  Self Doubt Question
asked
Jun 13
in
Algorithms
by
2207akash
(
6
points)

8
views
#timecomplexity
#algorithms
#iterativecomplexity
0
votes
0
answers
SelfDoubt CLRS
How does the partition algorithm has O(1) space complexity instead of O(N) if it modifies the input array itself even if it doesn't use any extra space?
asked
Jun 10
in
Algorithms
by
nvs16
(
6
points)

4
views
#timecomplexity
#algorithms
#clrsbook
0
votes
0
answers
can anyone explain travelling salesman problem implementation using Java in simpler way?
asked
May 9
in
Algorithms
by
suhit
(
6
points)

6
views
#algorithms
0
votes
0
answers
Clrs book,mit Assignment
$T(n) =2^{n}T(n/2) +n^{n}$
asked
May 6
in
Algorithms
by
Palash yadav
(
16
points)

11
views
#timecomplexity
#clrsbook
#algorithms
0
votes
0
answers
Which disk scheduling algorithm provides minimum seek time?
asked
Apr 22
in
Operating System
by
Dheeraj Sohan P
(
6
points)

10
views
disks
scheduling
#algorithms
0
votes
0
answers
gate 1989 # Algorithm
how to do quicksort i am not gettng ? can you explain pass by pass in simple diagrammatical way having i j and p ? https://gateoverflow.in/89083/gate19899
asked
Apr 21
in
Algorithms
by
Çșȇ ʛấẗẻ
(
6
points)

6
views
#help
#gatepreparation
#algorithms
0
votes
0
answers
T(n) = 2^n T (n/2) + n^n. what is time complexity?
asked
Apr 18
in
Algorithms
by
Mohit Kumar 6
(
12
points)

4
views
#recurrencerelations
#timecomplexity
#algorithms
0
votes
0
answers
T(n)=16T(n/4)+O(n^2)
How can I achieve the result using my master theorem? Can you help me please?Thank you!
asked
Apr 18
in
Algorithms
by
april_10
(
8
points)

5
views
#timecomplexity
#recurrencerelations
#algorithms
#assymtotic
0
votes
0
answers
T(n)=3T(√(2n))+2
T(n)=3T(√(2n))+2 I came across questions on this topic, but I could not.Would you mind to elaborate how this can be proven? I am first year student of computer sciences. Thank you!
asked
Apr 18
in
Algorithms
by
april_10
(
8
points)

2
views
#timecomplexity
#algorithms
0
votes
0
answers
T(n) = sqrt(n) * T(sqrt(n)) + 100n
T(n) = sqrt(n) * T(sqrt(n)) + 100n Master method does not apply here. Recursion tree goes a long way. Iteration method would be preferable. The answer is Θ(nloglogn). Would you mind to elaborate how this can be proven? I am first year student of computer sciences. Thank you!
asked
Apr 18
in
Algorithms
by
april_10
(
8
points)

12
views
#recurrencerelations
#timecomplexity
#algorithms
#asymptoticanalysis
0
votes
0
answers
#self doubts #Insertion Sort
In Comparison Based Sorting Algo, the best case Time complexity is Ω(nlogn), then how the best case time complexity of insertion will be Ω(n)
asked
Apr 17
in
Algorithms
by
Ram_81
(
7
points)

36
views
#algorithms
#insertion
sort
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
asked
Mar 18
in
Algorithms
by
manish kumar banarsi
(
6
points)

17
views
#algorithms
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
(
16
points)

16
views
#algorithms
#assymtotic
complxity
0
votes
0
answers
Self doubt finding complexity algorithms where study this topic
asked
Feb 9
in
Algorithms
by
Ram Swaroop
(
309
points)

44
views
timecomplexity
algorithms
#algorithms
0
votes
1
answer
Made EasyCBT2
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
Jan 20
in
Algorithms
by
Dheeraj Varma
(
22
points)

128
views
#madeeasycbt2
#algorithms
0
votes
0
answers
Made Easy Demo test full length Q31
Please help me with the approach to solve this question
asked
Dec 31, 2019
in
Algorithms
by
ssap09
(
43
points)

14
views
madeeasytestseries
#gatepreparation
#algorithms
#algorithms#timecomplexity
0
votes
2
answers
Ace Mock 1 2019 Q47
I am not able to understand the question properly.. someone plz explain
asked
Dec 26, 2019
in
Algorithms
by
ssap09
(
43
points)

72
views
#gatepreparation
#sorting
#linearsearch
#algorithms
0
votes
0
answers
Made Easy Test Algorithms
True or False The running time of radix sort is effectively independent of input given.
asked
Dec 20, 2019
in
Algorithms
by
tp21
(
269
points)

25
views
#algorithms
#sorting
#radixsort
0
votes
0
answers
Made Easy Test Algorithms
The Maximum number of comparison needed in iteration to sort 18 numbers of 6 digit using radix sort base of number is 5 _____? My Approach was: Since radix sort is not comparison based sorting I answered it as zero. But Ans given says540.
asked
Dec 20, 2019
in
Algorithms
by
tp21
(
269
points)

16
views
#algorithms
#madeeasytestseries
#radixsort
#sorting
0
votes
0
answers
GATE Matrixmultiplication
Is there any shortcut way to find minimum number of matrix multiplications needed given the order of some N matrices?? Because the actual table procedure is very lengthy & consumes more than 5 minutes if large values are given then & there are ... very less chances of getting positive marks. So If someone have any method pls. share, It will be really helpful:)
asked
Dec 17, 2019
in
Algorithms
by
pass_i0n
(
15
points)

11
views
#algorithms
#matrixmultiplication
0
votes
0
answers
Extended Master Theorem
In Extended Master Theorem, What is the meaning of (logn)^p: Is it logn * logn * … *logn or loglog...logn (p times)?
asked
Dec 14, 2019
in
Algorithms
by
Vinit Gore
(
7
points)

22
views
#algorithms
#timecomplexity
0
votes
0
answers
self doubt in algorithms time complexity
What is the answer for this?
asked
Dec 6, 2019
in
Algorithms
by
Abhipsa
(
27
points)

8
views
algorithms
timecomplexity
#algorithms
0
votes
1
answer
testbook MST doubt
In the above question what does the line "edges are uniformly distributed over the half open interval [0,1)" means and whats the significance of this in constructing MST?
asked
Nov 20, 2019
in
Algorithms
by
Alka Kasotia
(
11
points)

25
views
#algorithms
mst
0
votes
0
answers
testbook algo doubt
Consider an algorithm that receives as input the n – element arrays ‘a’ & ‘b’ of real numbers and a value ‘val’ (the arrays are not necessarily sorted). The algorithm returns true if there are indexes ‘i’ & ‘j’ such that a[i] + b[j] = val and false otherwise.
asked
Sep 15, 2019
in
Algorithms
by
manisha11
(
26
points)

51
views
#algorithms
0
votes
0
answers
[GATEBOOK TS] what is value of yx?
what will be value of y?
asked
Sep 8, 2019
in
Algorithms
by
ummokkate
(
64
points)

22
views
#testseries
#algorithms
0
votes
3
answers
Algorithms  Time Complexity analysis
1 .Let P be the problem. Suppose that the worst case asymptotic running time complexity of P is in O($n^2$lgn) and is also in Ω(n). Now let A be an algorithm that solves P. Which of the following is correct about A: A has worstcase time ... time case complexity of an algorithm is θ(n). The Algorithm executes in time T(n) = Ω($n^2$) for every input data.
asked
Aug 22, 2019
in
Algorithms
by
sagar2405
(
149
points)

100
views
algorithms
timecomplexity
#algorithms
0
votes
0
answers
Algorithms  Time complexity
1 .Solve the recurrence: $T(n) = 2T(\sqrt n) + log\ n$ $T(n) = T(\frac{n}{2}) + 2T(\frac{n}{4}) +n$ 2 .$f(n) = n^{1.01}$ and $g(n) = n(log\ n)^2$ then which one is true $f(n) = O(g(n))$ $f(n) = \Omega(g(n))$ $f(n) = \Theta(g(n))$ 3 . $f(n) = n^{\frac{1}{2}}, g(n) = 1$, then is it correct $g(n) = o(fn)$ {$o$ = small o Not big $O$} Please solve the above questions.
asked
Aug 22, 2019
in
Algorithms
by
sagar2405
(
149
points)

24
views
algorithms
#algorithms
timecomplexity
0
votes
0
answers
Sorting algorithm
An unsorted array of n elements is given to you and you have to print largest 10% of them. This can be done on time O(1) O(n) O(logn) O(nlogn)
asked
Aug 22, 2019
in
Algorithms
by
sagar2405
(
149
points)

33
views
algorithms
programming
#algorithms
algorithum
0
votes
1
answer
Made easy Algorithm
Which of the following procedure is suitable for finding the longest path from given vertex to any other vertex in a directed acyclic graph(weighted) with few negative weight edge. Divide and conquer Greedy algorithm Dynamic programming All of the above
asked
Aug 20, 2019
in
Algorithms
by
sagar2405
(
149
points)

23
views
programming
#testseries
#algorithms
algorithum
0
votes
0
answers
Made easy test series  Algorithm
How to do find 0/1 knapsack in minimum time?
asked
Aug 20, 2019
in
Algorithms
by
sagar2405
(
149
points)

25
views
programming
#testseries
#algorithms
0
votes
1
answer
MST of that graph always contains edges with first minimum and second minimum weight. State true/false.
asked
Aug 10, 2019
in
Algorithms
by
commenter commenter
(
31
points)

26
views
mst
#algorithms
0
votes
2
answers
GATEBOOK TESTSERIES
Consider the below statements S1: Selection sort runs faster than Insertion sort for an array with all keys identical. S2: Selection sort runs faster than Insertion sort for an array in reverse order. Which of the following statements is true? (A) Only S1 (B) Only S2 (C) Both S1 and S2 (D) Neither S1 or S2
asked
Aug 7, 2019
in
Algorithms
by
ummokkate
(
64
points)

44
views
#algorithms
algorithmstestseries
0
votes
1
answer
Made easssy test series
The number of distinct BFS and DFS traversal possible on complete graph of n vertices is?
asked
Aug 6, 2019
in
Algorithms
by
dheerwani
(
7
points)

26
views
#testseries
#algorithms
#gatepreparation
#gate
0
votes
1
answer
Recurrence Relation
Solve it using substitution method pls give the solution??
asked
Aug 5, 2019
in
Algorithms
by
Rajeevkr
(
13
points)

22
views
#algorithms
0
votes
1
answer
Narsimha Karunamachi
What will be the time complexity and how?
asked
Jul 31, 2019
in
Algorithms
by
Rajeevkr
(
13
points)

33
views
#algorithms
0
votes
0
answers
ALGORITHM MST
An undirected graph G(V,E) contains n (n>2) nodes of name V1,V2…..Vn. 2 nodes Vi and Vj are connected iff 0<ij<=2. Each edge (Vi ,Vj) is assigned a weight i+j. The cost of minimum spanning tree of such graph with 10 nodes is_____
asked
Jul 24, 2019
in
Algorithms
by
Ritabrata Dey
(
119
points)

14
views
#algorithms
0
votes
0
answers
OPTIMIZATION ALGORITHM
Suppose there are 6 files F1,F2,F3,F4,F5,F6 with sizes 150 , 225, 75, 60, 275 and 65 KB respectively. The files are to be stored on a sequential device in such a way that optimizes access time. In what order must the files be stored_____
asked
Jul 24, 2019
in
Algorithms
by
Ritabrata Dey
(
119
points)

49
views
#algorithms
0
votes
1
answer
ALGORITHM QUESTION 10
Consider the following matrices with given dimensions: A(4x6) B(6x8) C(8x4) D(4x5) which is the optimal solution: ((A(BC))D) ((AB) (CD))
asked
Jul 24, 2019
in
Algorithms
by
Ritabrata Dey
(
119
points)

18
views
#algorithms
Page:
1
2
next »
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users
Jul 2020
bittujash
6 Points
RavGopal
4 Points
ankeshsingh
2 Points
prakhar123
1 Points
arpit_18
1 Points
pravincesingh
1 Points
Shaik Masthan
1 Points
srestha
1 Points
sameer2009
1 Points
7,525
questions
1,776
answers
10,835
comments
90,464
users