menu
Recent questions and answers in Algorithms
Login
Register
My account
Edit my Profile
Private messages
My favorites
Register
Recent questions and answers in Algorithms
All Activity
Q&A
Questions
Unanswered
Tags
Categories
Users
Ask a Question
Blogs
Previous Year
Exams
Recent questions and answers in Algorithms
0
votes
2
answers
113
views
T(n)=T(n/2)+logn How to solve this without using masters theorem?
Onika
answered
in
Algorithms
Nov 14, 2021
by
Onika
71
points
113
views
self-doubt
algorithms
recurrence-relations
timecomplexity
0
votes
0
answers
32
views
#algorithms #timecomplexity
There a confusion about what should be the time complexity of the code... Involving modulo operator
Palash yadav
asked
in
Algorithms
Nov 12, 2021
by
Palash yadav
135
points
32
views
algorithms
time-complexity
0
votes
0
answers
47
views
automata theory & formal language
Instructions: Create an FA for the RE ((0+1) (0+1))* + ((0+1) 0
arce
asked
in
Algorithms
Aug 24, 2021
by
arce
5
points
47
views
finite-automata
0
votes
0
answers
54
views
automata theory & formal language
write a regular expressions for each of the following languages over the alphabet {0, 1}; the set of all strings containing 101 as a substring. Instructions: construct a finite automata equivalent to the following regular expressions: 10+ (0+11) 0*1 (11+0)* (00+1)* [ 00+11+(01+10) (00 + 11)* (01 + 10)*
arce
asked
in
Algorithms
Aug 24, 2021
by
arce
5
points
54
views
grammar
0
votes
0
answers
36
views
automata theory & formal language
A DFA for all sets that contains even 0's and even 1's. Instruction: Convert the following DFA into NFA. https://sg.docworkspace.com/d/sIMr0gbhniu7AhwY Instruction: Minimize the following DFA. https://sg.docworkspace.com/d/sIB_0gbhnq_TAhwY Instruction: Give the ... 00. the set of all strings with three consecutive 0's. the set of all string that contains odd 1's.
arce
asked
in
Algorithms
Aug 24, 2021
by
arce
5
points
36
views
dfas
0
votes
0
answers
41
views
automata theory & formal language
A DFA for all sets that contains even 0's and even 1's. Instruction: Convert the following DFA into NFA. https://sg.docworkspace.com/d/sIMr0gbhniu7AhwY Instruction: Minimize the following DFA. https://sg.docworkspace.com/d/sIB_0gbhnq_TAhwY Instruction: Give the ... 00. the set of all strings with three consecutive 0's. the set of all string that contains odd 1's.
arce
asked
in
Algorithms
Aug 24, 2021
by
arce
5
points
41
views
nfa-dfa
0
votes
0
answers
50
views
Design the algorithm that is known as the Shortest Job First
mihir12345
asked
in
Algorithms
Aug 24, 2021
by
mihir12345
5
points
50
views
algorithms
0
votes
0
answers
29
views
test series
@bikram @arjun sir please help with this question. I tried to sort the jobs according to their start time but was unable to find any time unit which was free . Please assist
rish1602
asked
in
Algorithms
Aug 19, 2021
by
rish1602
9
points
29
views
algorithms
greedy-algorithms
made-easy-test-series
0
votes
0
answers
30
views
#Kruskal's Algorithm
Time Complexity of Kruskal’s Algorithm is O(ElogE) E <= V² log(E) <= 2 log(V), so T(n) = O(ElogV) Why don’t we put E = V² for the worst case in outer E also ?, in that case complexity will be O(V²logV).
Captain Cold
asked
in
Algorithms
Aug 15, 2021
by
Captain Cold
5
points
30
views
self-doubt
algorithms
0
votes
0
answers
36
views
Made easy test 2021
Consider the following statements in reference to sort the array of numbers. S1 : Asymptotic running time of selection sort is Ο(n). S2 : Asymptotic running time of insertion sort is Ο(n) is best case. S3 : Asymptotic running time of merge sort is θ(n2) ... S4 : Asymptotic running time of quick sort is Ο(n logn) is worst case. The number of the correct statements is/are _____.
DKY123
asked
in
Algorithms
Aug 13, 2021
by
DKY123
15
points
36
views
made-easy-test-series
0
votes
0
answers
26
views
Made easy Test series 2021
Suppose three matrices A, B and C are given where the dimension of A is 10 × 100, B is 100 × 20 and C is 20 × 100. The minimum number of matrix multiplication required to find the product of A × B × C using basic matrix multiplication method is _______.
DKY123
asked
in
Algorithms
Aug 13, 2021
by
DKY123
15
points
26
views
made-easy-test-series
0
votes
0
answers
15
views
Made easy Test series 2021
Two list of size x and y are available .The time complexity in term of number of comrison for the merging of the two list to make sorted list will be A) O(x+y) B) O(log x^2 +y ) C) O(log x+log y) D) O(xlog x+ylog y)
DKY123
asked
in
Algorithms
Aug 13, 2021
by
DKY123
15
points
15
views
made-easy-test-series
0
votes
0
answers
84
views
Igate bhilai test series 2022
Which of the following options is true. A) P and R only B) Q and S only C) P, Q and R only D) R and S only
DKY123
asked
in
Algorithms
Aug 13, 2021
by
DKY123
15
points
84
views
test-series
0
votes
0
answers
34
views
Igate bhilai test series 2022
Find the difference of profit between Aamir and Salman of above problem .
DKY123
asked
in
Algorithms
Aug 13, 2021
by
DKY123
15
points
34
views
test-series
0
votes
0
answers
12
views
Igate bhilai test 2022
Correct sequence of options A) s1 only B) s1 & s2 C) s2 only D) All the these
DKY123
asked
in
Algorithms
Aug 13, 2021
by
DKY123
15
points
12
views
test-series
0
votes
0
answers
28
views
Igate bhilai test series 2022
What is the largest value of 'P 'of above problem using divide conquer methods together will take time.
DKY123
asked
in
Algorithms
Aug 13, 2021
by
DKY123
15
points
28
views
test-series
0
votes
0
answers
31
views
IGATE bhilai test series 2022
What is output of above problem using huffman coding is ____ (upto one decimal place )
DKY123
asked
in
Algorithms
Aug 13, 2021
by
DKY123
15
points
31
views
test-series
0
votes
0
answers
56
views
Ace Test Series 2022
How many minimum spanning trees can be formed from the following graph
DKY123
asked
in
Algorithms
Aug 13, 2021
by
DKY123
15
points
56
views
ace-academy-test-series
0
votes
0
answers
31
views
Ace Test Series 2022
Below Is The Implementation of The Merge Sort. A ) B ) C ) D )
DKY123
asked
in
Algorithms
Aug 13, 2021
by
DKY123
15
points
31
views
ace-academy-test-series
0
votes
0
answers
64
views
Ace Test Series 2022
Which of the following statement is incorrect. A) B ) C ) D )
DKY123
asked
in
Algorithms
Aug 13, 2021
by
DKY123
15
points
64
views
ace-academy-test-series
0
votes
1
answer
66
views
Gate at zeal youtube community post
What is the correct answer of this question. Please explain.
Anuj2000
answered
in
Algorithms
Aug 12, 2021
by
Anuj2000
5
points
66
views
algorithms
binary-search-tree
linked-list
0
votes
0
answers
51
views
Travelling salesman problem by dynamic approch
Can anyone explain me what are the several methods for solving the TSP problem by dynamic programs.?
Annapareddy
asked
in
Algorithms
Aug 12, 2021
by
Annapareddy
5
points
51
views
algorithms
dynamic-programming
operating-system
0
votes
0
answers
20
views
#self doubt #algorithm #asymptotic notation
Big O is fn=c.gn for some values of constant 'c>0' and for little o it is fn=c.gn for all values of constant 'c>0', now my question is what is the difference between this some c>0 and all values of c>0 mentioned here
arnab2022
asked
in
Algorithms
Aug 2, 2021
by
arnab2022
5
points
20
views
algorithms
asymptotic-notations
0
votes
0
answers
92
views
Zeal 2019 booklet
Worst case perform of insertion sort is when its input is reverse sorted . To improve performance we can make an intial check to see if input is reverse sorted and if so,simply reverse the list instead of sorting it. Otherwise ,insertion sort works as before. What is worst case runtime complexity of this modified version? O(1) O(Nlogn) O(N) O(N^2)
abhinav dongre
asked
in
Algorithms
Aug 1, 2021
by
abhinav dongre
5
points
92
views
sorting
0
votes
0
answers
38
views
Self doubt
void f(int n) { if(n<=1) return; f(n-1); f(n-1); } (1) What is total number of recursive calls in f(n) ? (2) What is total Number of calls f(n) ? (3) What is the complexity of this code ?
Enolx.21
asked
in
Algorithms
Jul 28, 2021
by
Enolx.21
53
points
38
views
recurrence-relations
recursion
trees
0
votes
0
answers
43
views
Asymptotic Notations: NIELIT 2016 MAR Scientist C
Two alternative package and are available for processing a database having records. Package requires time units and package requires time units to process records. What is the smallest value of for which package will be preferred over ? nielit2016mar-scientist algorithms asymptotic-notations.
Amit_k_Singh
asked
in
Algorithms
Jul 26, 2021
by
Amit_k_Singh
5
points
43
views
asymptotic-notations
0
votes
1
answer
71
views
Algorithms Self Doubt. Topic- Sorting and Max-Heap
Sudarshan Bandyopadh
answered
in
Algorithms
Jul 17, 2021
by
Sudarshan Bandyopadh
17
points
71
views
algorithms
0
votes
0
answers
44
views
I came across these three questions on internet on Master Theorem
Naman9495
asked
in
Algorithms
Jul 12, 2021
by
Naman9495
5
points
44
views
algorithms
timecomplexity
0
votes
0
answers
61
views
Time and space complexity
There is an algorithm that took array of strings, sorted each string and then sorted the entire array.What would be the runtime?
SaileeDas
asked
in
Algorithms
Jun 28, 2021
by
SaileeDas
5
points
61
views
time-complexity
algorithms
self-doubt
0
votes
0
answers
28
views
Made easy test series #algorithm #graph #DFS
Did not understand answer of this question plz help me to resolve problem.
taatya bichhu
asked
in
Algorithms
Jun 26, 2021
by
taatya bichhu
5
points
28
views
made-easy-test-series
algorithms
graph-algorithms
dfs
3
votes
2
answers
866
views
GATE CSE 2021 Set 1 | Question: 3 | Video Solution
amitkhurana512
answered
in
Algorithms
Jun 24, 2021
by
amitkhurana512
173
points
866
views
gate2021-cse-set1
algorithms
asymptotic-notations
0
votes
0
answers
24
views
#Algo_Coremen
In Master’s theorem T(n) = aT(n/b) + f(n), ‘a’ : Number of subproblems and ‘n/b’ : Size of the subproblem. Now, size of the subproblem can be expressed as ‘n/a’. Why do we need to use ‘b’?
Palash Nandi 1
asked
in
Algorithms
Jun 23, 2021
by
Palash Nandi 1
13
points
24
views
time-complexity
0
votes
0
answers
89
views
[SELF DOUBT] DSA BUBBLE SORT
is bubble sort an online algorithm? cause whenever new element is fed, it can be take to its place by swapping the adjacent numbers. is my thinking right?
rythmrana
asked
in
Algorithms
Jun 18, 2021
by
rythmrana
5
points
89
views
algorithms
self-doubt
0
votes
0
answers
35
views
[SELF DOUBT] DSA INSERTION SORT
for an almost sorted array, which algorithm is better, shell sort or insertion sort? and also for a fully sorted array?
rythmrana
asked
in
Algorithms
Jun 17, 2021
by
rythmrana
5
points
35
views
algorithms
self-doubt
0
votes
0
answers
31
views
Which problems in dynamic programming are the most important for GATE 2022?
ankit-saha
asked
in
Algorithms
Jun 17, 2021
by
ankit-saha
5
points
31
views
dynamic-programming
0
votes
0
answers
51
views
[SELF DOUBT] DSA , IN PLACE SORTING
if we require a large(more than size of array or 1000000mb) but constant( irrespective of size of input array) extra space for an algorithm, will the algorithm be in place or not? the extra space is not required to manipulate the elements of array but may be required for some other purpose.
rythmrana
asked
in
Algorithms
Jun 17, 2021
by
rythmrana
5
points
51
views
self-doubt
algorithms
0
votes
0
answers
28
views
Topic name : heapify and heapsort
We can reduce the space complexity of heapsort to o(1) by using heapify using loops, then why we dont reduce the space complexity of heapify from o(logn) to o(1) by using loops here also.?
Ayush1718
asked
in
Algorithms
Jun 9, 2021
by
Ayush1718
5
points
28
views
algorithms
0
votes
1
answer
43
views
self doubt regarding the full binary tree
This is in regards to Binary tree. The question is The image given below is full binary tree or not?
Subhajit Panday
answered
in
Algorithms
Jun 8, 2021
by
Subhajit Panday
11
points
43
views
binary-tree
self-doubt
algorithms
0
votes
0
answers
46
views
I have been practicing question using Master Theorem, I find one is hard so posted here for expert review
Irfan123
asked
in
Algorithms
Jun 1, 2021
by
Irfan123
5
points
46
views
algorithms
algorithm-design
1
vote
1
answer
47
views
Graph algorithms
Every graph having minimum one spanning tree 1. True 2.False Which is correct? My doubt is spanning tree is possible for any type of graph??
Deepak Poonia
answered
in
Algorithms
May 29, 2021
by
Deepak Poonia
1.7k
points
47
views
self-doubt
To see more, click for all the
questions in this category
.
Ask a Question
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
2022 May 23 - 29
Weekly Top User (excluding moderators) will get free access to
GATE Overflow Test Series for GATE 2021
Recent Posts
New GATEOverflow PDFs
Guidelines to users
No Recent Blog Comments
Recent questions and answers in Algorithms
Search GATE CSE Doubts