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
IISC-CSA-Research-Test-7
go_editor
asked
in
Algorithms
Jun 8, 2016
retagged
Jan 10
by
Hira Thakur
418
views
0
votes
0
votes
If we arrange the following according to increasing asymptotic complexity, which quantity comes in the second position; which one comes in the fourth position?
$(\sqrt{2}^{\log n}, n^2, 2^{\sqrt{2 \log n} }, e^n, (\log n)!, n!$
algorithms
asymptotic-notation
iisc-interview
go_editor
asked
in
Algorithms
Jun 8, 2016
retagged
Jan 10
by
Hira Thakur
by
go_editor
418
views
answer
comment
Follow
share this
share
0 Comments
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
2
Answers
1
vote
1
vote
TAKE LOG ON EACH TERMS AND EVALUATE...
asu
answered
Jun 8, 2016
by
asu
comment
Follow
share this
0 Comments
Please
log in
or
register
to add a comment.
0
votes
0
votes
i think n^2 comes in second position and e^n comes in fourth [position because we know the growth of functions are like that-
2^2^n > n! >4^n >2^n >n^2 >nlogn >logn! >n >2^logn >logn^2 >underoot logn> loglogn>1
anshul namdeo
answered
Jun 8, 2016
by
anshul namdeo
comment
Follow
share this
0 Comments
Please
log in
or
register
to add a comment.
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
3
answers
1
go_editor
asked
in
Algorithms
Jun 8, 2016
644
views
IISC-CSA-Research-Test-6
Someone claims that Kruskal's algorithm for finding minimum spanning tree can return different spanning trees for the same input graph $G$. Do you agree with the claim? If so, why? If not, argue briefly why the claim is incorrect.
go_editor
asked
in
Algorithms
Jun 8, 2016
by
go_editor
644
views
iisccsaresearch2016
descriptive
algorithms
graph-algorithms
minimum-spanning-tree
iisc-interview
0
votes
0
votes
1
answer
2
go_editor
asked
in
Algorithms
Jun 8, 2016
403
views
IISC-CSA-Research-Test-4
What is the output of the following program? int main() { int i=0; do { if (i >=5) { i+=2; printf("%d \n", i); break; } else { printf("%d \n", ++i); continue; } } while (i<7); }
go_editor
asked
in
Algorithms
Jun 8, 2016
by
go_editor
403
views
iisccsaresearch2016
descriptive
algorithms
identify-function
iisc-interview
1
vote
1
vote
4
answers
3
go_editor
asked
in
Graph Theory
Jun 8, 2016
764
views
IISC-CSA-Research-Test-10
A proper vertex colouring of a graph $G$ is a colouring of the vertices in $G$ in such a way that two vertices get different colours if they are adjacent. The minimum number of colours required for proper vertex colouring of $G$ is called the chromatic number of $G$. Then what is the chromatic number of the cycle graph on 149 vertices?
go_editor
asked
in
Graph Theory
Jun 8, 2016
by
go_editor
764
views
iisccsaresearch2016
descriptive
graph-theory
graph-coloring
iisc-interview
0
votes
0
votes
2
answers
4
go_editor
asked
in
Quantitative Aptitude
Jun 8, 2016
439
views
IISC-CSA-Research-Test-9
Which of the following statement(s) is(are) true? If $n$ is odd prime number then $2^{n-1} \text{ mod } n =1$ If $2^{n-1} \text{ mod } n =1$ for a number $n$ then $n$ is prime
go_editor
asked
in
Quantitative Aptitude
Jun 8, 2016
by
go_editor
439
views
iisccsaresearch2016
descriptive
quantitative-aptitude
iisc-interview
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
(683)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
243k
comments
79.7k
users
Recent Blog Comments
Hlo I'm Rupesh I got AIR 3485 in gate CS and AIR...
@Ajay Sasank here is the direct link...
Thank you for the post didi My GATE 2023 & 2024...
I Hope it helps 😊
Today's best post I seen thank you for motivation
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy