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

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Exams
Recent questions tagged algorithms
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)
asked
Mar 24
in
Algorithms
by
BHASHKAR
(
6
points)

10
views
algorithms
timecomplexity
0
votes
1
answer
Previous Year Made easy
int f1(int n) { if(n==0n==1) return n; else return (2*f1(n1)+3*f1(n2)); } Time complexity of above function
asked
Mar 24
in
Algorithms
by
Kindaichi
(
6
points)

15
views
algorithms
previous
year
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
timecomplexity
algorithms
iterativecomplexity
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
algorithms
0
votes
1
answer
CIL MT Exam Binay Tree
The following is the sequence of insertion in a binary tree. 45,65,35,40,33,70,60,75,69 How many numbers of nodes in Left Sub Tree (LST) and Right Sub Tree (RST) of Root node. Ans A. LST – 5, RST3 B. LST – 6, RST2 C. LST – 2, RST6 D. LST – 3, RST5 they have not mentioned BST then how we can get option D
asked
Mar 6
in
Programming
by
VIDYADHAR SHELKE 1
(
7
points)

37
views
algorithms
+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.
asked
Mar 5
in
Algorithms
by
Jyoti Kumari97
(
27
points)

35
views
cil
algorithms
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
aceacademytestseries
algorithms
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..
asked
Feb 22
in
Algorithms
by
chirudeepnamini
(
10
points)

20
views
algorithms
aceacademytestseries
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
timecomplexity
algorithms
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
algorithms
0
votes
0
answers
Self doubt finding complexity algorithms where study this topic
asked
Feb 9
in
Algorithms
by
Ram Swaroop
(
270
points)

39
views
timecomplexity
algorithms
#algorithms
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)

57
views
algorithms
timecomplexity
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)
asked
Feb 2
in
Algorithms
by
dhairya16
(
6
points)

36
views
algorithms
timecomplexity
madeeasytestseries
0
votes
0
answers
GATE FORUM: HUFFMAN CODING
asked
Jan 31
in
Programming
by
Debapaul
(
699
points)

17
views
algorithms
huffmancode
0
votes
2
answers
What is the Time complexity of Tiling Problem in Dynamic Programming?
asked
Jan 31
in
Algorithms
by
Pratyush Priyam Kuan
(
804
points)

38
views
algorithms
dynamicprogramming
0
votes
0
answers
GATE GURU: STRUCTURES
asked
Jan 30
in
Programming
by
Debapaul
(
699
points)

24
views
algorithms
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
madeeasytestseries
madeeasymock12020
algorithms
0
votes
0
answers
Self Doubt: Recurrence
asked
Jan 29
in
Programming
by
Debapaul
(
699
points)

40
views
algorithms
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
algorithms
0
votes
0
answers
Made Easy: FLT Basic 3
Consider a degree sequence for n vertices. What is the worst case T.C to determine is a simple graph is possible with this degree sequence? In other words what is the TC of HavelHakimi procedure? $O(n^{2}$) $O(n^{2} log n$) $O(n$) $O(n log n$)
asked
Jan 26
in
Graph Theory
by
Sambhrant Maurya
(
401
points)

29
views
algorithms
graphtheory
0
votes
0
answers
Made Easy FLT Basic 3
$\binom{n+m2}{m1}$ $\binom{n+m+1}{m2}$ $\binom{n+m+2}{m}$ $\binom{n+m}{m1}$
asked
Jan 26
in
Algorithms
by
Sambhrant Maurya
(
401
points)

32
views
dynamicprogramming
algorithms
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
(
270
points)

29
views
madeeasytestseries
timecomplexity
algorithms
#array
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
(
270
points)

20
views
madeeasytestseries
timecomplexity
algorithms
+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
madeeasytestseries
algorithms
dag
0
votes
1
answer
Algorithms timecomplexity
asked
Jan 22
in
Algorithms
by
Chirag Shilwant
(
180
points)

37
views
timecomplexity
aceacademytestseries
algorithms
+1
vote
1
answer
GATE GURU: SPANNING TREE
How to solve this question quickly? Is there any algorithm? I am able to solve it by trying out all the combinations and it has taken me nearly $5+$ $mins$ Any way to solve this quickly. A complete graph can have $n^{n2}$ spanning trees, and since this graph is nearly complete except one edge can we derive some $shortcut$ from this fact?
asked
Jan 22
in
Programming
by
Debapaul
(
699
points)

35
views
algorithms
0
votes
0
answers
Madeeasy test series  Retrieve address of element in matrix
asked
Jan 21
in
DS
by
luc_Bloodstone
(
36
points)

20
views
madeeasytestseries
data_structure
algorithms
0
votes
0
answers
Madeeasy test series  recurrence relation
asked
Jan 21
in
DS
by
luc_Bloodstone
(
36
points)

7
views
recurrencerelations
madeeasytestseries
timecomplexity
algorithms
0
votes
0
answers
MADE EASY MOCK
Isnt number of bits passed is $4$, say when $i=5$ we will pass $0101$ right? and in case of $2$ we will pass $0010$ right?
asked
Jan 21
in
Programming
by
Debapaul
(
699
points)

20
views
algorithms
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
algorithms
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 timecomplexity of best algorithm that solves this problem?
asked
Jan 21
in
Algorithms
by
Vimal Patel
(
916
points)

35
views
algorithms
2dmatrix
max
0
votes
1
answer
Algorithms Recurrence relation : Ace test series
asked
Jan 19
in
Algorithms
by
Chirag Shilwant
(
180
points)

44
views
algorithms
recurrencerelations
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
asked
Jan 17
in
Algorithms
by
haralk10
(
62
points)

18
views
algorithms
dag
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.
asked
Jan 16
in
Algorithms
by
Sambhrant Maurya
(
401
points)

50
views
timecomplexity
algorithms
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)

12
views
madeeasytestseries
algorithms
mergesort
0
votes
0
answers
Ace Academy test Series : Time Complexity
asked
Jan 14
in
Algorithms
by
Chirag Shilwant
(
180
points)

19
views
aceacademytestseries
timecomplexity
algorithms
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
Jan 14
in
Algorithms
by
vishal burnwal
(
135
points)

36
views
algorithms
0
votes
1
answer
Minimum Cost Spanning Tree
Anyone please clarify.
asked
Jan 9
in
Algorithms
by
Shivateja MST
(
113
points)

30
views
algorithms
mst
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
(
36
points)

21
views
madeeasytestseries
algorithms
graphtheory
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
(
36
points)

22
views
madeeasytestseries
algorithms
timecomplexity
Page:
1
2
3
4
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
Apr 2020
!KARAN
36 Points
lazygatestudent
5 Points
AngeloAlba89
5 Points
WillKnisley
5 Points
TamieMcvay4
5 Points
Satyaki Das
5 Points
akansha03
5 Points
srestha
3 Points
Shivateja MST
2 Points
souren
2 Points
Monthly Top User and those within 60% of his/her points will get a share of monthly revenue of GO subject to a minimum payout of Rs. 500. Current monthly budget for Top Users is Rs. 75.
3,511
questions
1,656
answers
10,449
comments
90,037
users