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
What is the order
pC
asked
in
Algorithms
Dec 19, 2015
247
views
0
votes
0
votes
a) Order of finding k th Root ( express in terms of k and n where k represent 3 for cube root , n represent size of input )
algorithms
time-complexity
pC
asked
in
Algorithms
Dec 19, 2015
by
pC
247
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.
0
Answers
← Previous
Next →
← Previous in category
Next in category →
Related questions
1
vote
1
vote
1
answer
1
jagadeesha kanihal
asked
in
Algorithms
Jun 15, 2016
788
views
What is the ascending order of the following growth functions?
jagadeesha kanihal
asked
in
Algorithms
Jun 15, 2016
by
jagadeesha kanihal
788
views
algorithms
asymptotic-notation
0
votes
0
votes
1
answer
2
sonalrawat
asked
in
Algorithms
Aug 21, 2023
678
views
We are given a directed graph, represented as an adjacency list, in which each vertex has at least one incoming edge and one outgoing edge. We would like to print out for each vertex j the list of vertices pointing into j. What is the most accurate description of the complexity of computing these quantities in terms of n, the number of vertices, and m, the number of edges? O(n2) O(nm) O(m) O(n)
sonalrawat
asked
in
Algorithms
Aug 21, 2023
by
sonalrawat
678
views
algorithms
time-complexity
0
votes
0
votes
1
answer
3
soukL
asked
in
Algorithms
Jan 17, 2023
414
views
let T(n) a function of complexity satisfying T(0)=T(1)=Θ(1) and T(n)=Θ(n)+T(n−1)+T(n−2). what is the class of complexity of T(n) ?
soukL
asked
in
Algorithms
Jan 17, 2023
by
soukL
414
views
algorithms
time-complexity
0
votes
0
votes
0
answers
4
usdid
asked
in
Algorithms
Apr 16, 2022
235
views
what is the running time of the following iterative algorithm?
1 question: a) Calculate the running time of the following iterative algorithm. For this purpose, write the working time of each row in the corresponding column of the table in terms of ci coefficients. Write the number of reruns of each row in the ... of repetitions for i=1 to n do j=1; While (j<n) do j=j*2; Total: T(n)=
usdid
asked
in
Algorithms
Apr 16, 2022
by
usdid
235
views
algorithms
time-complexity
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