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
Test Series
nag.swarna
asked
in
Algorithms
Nov 6, 2018
388
views
0
votes
0
votes
Can anyone please explain
test-series
nag.swarna
asked
in
Algorithms
Nov 6, 2018
by
nag.swarna
388
views
answer
comment
Follow
share this
share
4 Comments
by
raahul
commented
Nov 6, 2018
reply
Follow
share this
Is answer is D) ??
0
0
by
nag.swarna
commented
Nov 6, 2018
reply
Follow
share this
A is the answer
0
0
by
Shamim Ahmed
commented
Nov 6, 2018
reply
Follow
share this
Average case is 'logn' whereas worst case would be O(n). So i think A can be the choice.
0
0
by
Subarna Das
commented
Nov 6, 2018
reply
Follow
share this
Please specify the test-series name
0
0
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Previous
Next →
← Previous in category
Next in category →
Related questions
1
vote
1
vote
2
answers
1
Nitesh_Yadav
asked
in
Algorithms
Apr 11, 2022
264
views
Test Series
What is the time complexity of the below mentioned recursive function. int f(n) { if(n!=1) { return f(n/2)+f(n/2); } else return 10; } O(n) O(n^2) O(log n) O(n logn)
Nitesh_Yadav
asked
in
Algorithms
Apr 11, 2022
by
Nitesh_Yadav
264
views
algorithms
time-complexity
recursion
test-series
0
votes
0
votes
1
answer
2
raja11sep
asked
in
Algorithms
Jan 15, 2022
828
views
Gateoverflow Test series
Can anyone explain each option, for every option if it is true then why? If false then why? (Please don’t comment like answer is A,B etc) Please help
raja11sep
asked
in
Algorithms
Jan 15, 2022
by
raja11sep
828
views
algorithms
sorting
time-complexity
multiple-selects
test-series
0
votes
0
votes
1
answer
3
LRU
asked
in
Algorithms
Dec 28, 2021
1,572
views
Applied Test Series
Consider the following items with their associated weights and values. If a knapsack of capacity 25 units of weight is available and we are allowed to take either the item completely or leave it the maximum possible profit if we follow the greedy approach by being greedy about profit is _____
LRU
asked
in
Algorithms
Dec 28, 2021
by
LRU
1.6k
views
test-series
knapsack-problem
algorithms
greedy-algorithm
2
votes
2
votes
2
answers
4
LRU
asked
in
Algorithms
Oct 15, 2021
617
views
Applied Test Series
Consider an array contains n integers, each integer belongs to {0, 1, 2}. What is the best case time complexity to sort an array?
LRU
asked
in
Algorithms
Oct 15, 2021
by
LRU
617
views
test-series
algorithms
time-complexity
array
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy