Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User Daniyal89
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Daniyal89
0
answers
1
fractional knapsack
What is the time complexity of fractional knapsack if implemented using max-heap?
commented
in
Algorithms
Oct 9, 2018
179
views
1
answer
2
ace test 4
ans given is option A
asked
in
Algorithms
Oct 8, 2018
579
views
ace-test-series
algorithms
time-complexity
1
answer
3
ACE algo test series
Ans given is option-B
commented
in
Algorithms
Sep 30, 2018
367
views
sorting
space-complexity
algorithms
ace-test-series
0
answers
4
made easy test series
Is there is any good method or procedure to solve this question? or else I have to try by brute force ,,,like try 1st 0,1,2,3... length string
commented
in
Theory of Computation
Sep 19, 2018
168
views
2
answers
5
made easy test series
Can someone Explain these statements?
answer selected
in
Theory of Computation
Sep 18, 2018
488
views
0
answers
6
made easy booklet
Find time complexity? a) T(n) = T(n/2) + pow(2,n) b) T(n) = T(pow(n,1/2)) + n c) T(n) = 16T(n/4) + n! d) T(n) = pow(2,1/2)*T(n/2) + log n can we apply master theorem on the above problem?
commented
in
Algorithms
Sep 18, 2018
2.2k
views
1
answer
7
ace test series
commented
in
Theory of Computation
Sep 18, 2018
328
views
0
answers
8
made easy test series
Is there is any good method or procedure to solve this question? or else I have to try by brute force...
asked
in
Theory of Computation
Sep 18, 2018
78
views
1
answer
9
Extended Master's Theorem $T(n)=n^{1/2}T(n^{1/2})+n$
Can Extended Masters theorem be applied to the following recursive equation ? $T(n)=n^{1/2}T(n^{1/2})+n$ I solved this using back substitution and the time complexity came out to be $O(n*(loglogn))$ I was wondering if this ... masters theorem, like the way Tauhin Gangwar has solved here - https://gateoverflow.in/60532/find-tc-t-n-2t-n-1-2-1
commented
in
Algorithms
Sep 17, 2018
2.7k
views
time-complexity
algorithms
master-theorem
asymptotic-notations
recurrence-relation
0
answers
10
ace question
commented
in
Theory of Computation
Sep 17, 2018
180
views
0
answers
11
ace testseries
commented
in
Theory of Computation
Sep 17, 2018
108
views
0
answers
12
ace test series
asked
in
Theory of Computation
Sep 16, 2018
138
views
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
Recent Posts
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
What are the key things to focus on during the final 10-15 days before the GATE exam to improve performance?
All India GO Classes Mock test
NTA UGC NET JRF December 2022 Apply Online Form 2023
Life happens, just chill and do hardwork
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.8k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(842)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
This was very nice blog man!!😂😂
@abhi_3_0_12 bro revise now, Gate is on upcoming...
I want to buy the test series today but I want to...
@mahendrapatel The more you give those (some...
@ChatGPT bhai muze vo test bhi dena tha...