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
GATEBOOK
pps121
asked
in
Algorithms
Dec 7, 2018
597
views
0
votes
0
votes
Please mention proper approach to solve similar questions
time-complexity
algorithms
pps121
asked
in
Algorithms
Dec 7, 2018
by
pps121
597
views
answer
comment
Follow
share this
share
4 Comments
by
Navneet Kalra
commented
Dec 12, 2018
reply
Follow
share this
s2 is true s1 is false....am i correct
0
0
by
Naveen Kumar 3
commented
Dec 12, 2018
reply
Follow
share this
Is S2 true for f(n)=$e^n$ ??
0
0
by
Navneet Kalra
commented
Dec 12, 2018
reply
Follow
share this
yes naveen....I am wrong here both statements will be false for e^n it is not correct ......even for any exponential function like 2^n and any other it will be false
both statements are false
1
1
by
kirtipurohit
commented
Jan 9, 2022
reply
Follow
share this
Atleast provide the answer key. Sahi direction me to soch skte hai
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
2
votes
2
votes
1
answer
1
Purple
asked
in
Algorithms
Feb 7, 2017
336
views
gatebook mt2 qn 42
The intended purpose of this code is to precompute all the primes less than N. When it is finished executing, for r ∈ [2, N), bits[r] is supposed to equal 1 if and only if N is composite. Assume that the bits array is initialized to all zeroes. for ... composite." so why cant we just do a direct search? If it is 0 its prime, otherwise composite? What is the problem in this?
Purple
asked
in
Algorithms
Feb 7, 2017
by
Purple
336
views
algorithms
time-complexity
gatebook-test-series
0
votes
0
votes
0
answers
2
smartmeet
asked
in
Algorithms
Feb 7, 2017
459
views
GateBook Mock Test_2(Algorithms)
The intended purpose of this code is to precompute all the primes less than N. When it is finished executing, for r ∈ [2, N), bits[r] is supposed to equal 1 if and only if N is composite. Assume that the bits array is initialized to all zeroes. for ( int x = 2; x ... number n < N is prime. (A) I only (B) I and II only (C) II and III only (D) I, II, and III
smartmeet
asked
in
Algorithms
Feb 7, 2017
by
smartmeet
459
views
gatebook-mt2
data-structures
algorithms
space-complexity
time-complexity
0
votes
0
votes
1
answer
3
amit166
asked
in
Algorithms
Sep 11, 2018
203
views
gatebook
Q2. int A(int) { if(n<=2) return 1; else return (A(√n)+n); } time complexity
amit166
asked
in
Algorithms
Sep 11, 2018
by
amit166
203
views
time-complexity
recurrence-relation
gatebook-test-series
0
votes
0
votes
2
answers
4
amit166
asked
in
Algorithms
Sep 11, 2018
332
views
gatebook
Q.1 int A(int n){ if(n==2) return 1; else{ for(int j=1;j<=n;j++) printf(" * "); return(A(√n)); } } Time complexity
amit166
asked
in
Algorithms
Sep 11, 2018
by
amit166
332
views
time-complexity
gatebook-test-series
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
