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
#made esay
amit166
asked
in
Algorithms
Nov 24, 2018
retagged
Jun 23, 2022
by
Lakshman Patel RJIT
163
views
1
vote
1
vote
time-complexity
descriptive
made-easy-booklet
amit166
asked
in
Algorithms
Nov 24, 2018
retagged
Jun 23, 2022
by
Lakshman Patel RJIT
by
amit166
163
views
answer
comment
Follow
share this
share
4 Comments
Show 3 previous comments
by
OneZero
commented
Nov 27, 2018
reply
Follow
share this
i got the answer to be n^2, but i am not sure.
0
0
by
Hira Thakur
commented
Nov 27, 2018
reply
Follow
share this
fourth for loop will run constant time?? so TC is $(n^2)$??
0
0
by
adarsh_1997
commented
Dec 3, 2018
reply
Follow
share this
yes.i think it will be 0(n^2)
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
0
votes
0
votes
1
answer
1
Shraddha dwevedi
asked
in
Algorithms
Nov 25, 2021
187
views
#made easy workbook questions
Q.which of the following data structure cannot be used for efficient implementation of Huffman encoding? a. Binary min heap b. Binary max heap c. AVL tree (height balanced bst)
Shraddha dwevedi
asked
in
Algorithms
Nov 25, 2021
by
Shraddha dwevedi
187
views
made-easy-booklet
data-structures
huffman-code
1
vote
1
vote
1
answer
2
Hira Thakur
asked
in
Algorithms
Aug 15, 2016
336
views
#made easy
suppose a problem A reduces to problem B & reduction is done at $O(n^2)$ time. if the problem is solved in $O(n^3)$ time then what about the time of problem A___?? $O(n^2)$ $O(n^3)$ $O(2^n)$ $O(n^5)$
Hira Thakur
asked
in
Algorithms
Aug 15, 2016
by
Hira Thakur
336
views
algorithms
asymptotic-notations
made-easy-booklet
2
votes
2
votes
1
answer
3
Hira Thakur
asked
in
Algorithms
Aug 15, 2016
143
views
#made easy
cosider following set of frequecies message frequencies a 50 million b 10 million c 24 milion d 36 million what will be the percentage improvement for total binary stram transmission using haffman coding over simple encoding
Hira Thakur
asked
in
Algorithms
Aug 15, 2016
by
Hira Thakur
143
views
algorithms
huffman-code
made-easy-booklet
0
votes
0
votes
1
answer
4
amit166
asked
in
Combinatory
Nov 24, 2018
130
views
#made esay
how many different trees possible with 5 nodes?
amit166
asked
in
Combinatory
Nov 24, 2018
by
amit166
130
views
combinatory
tree
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
DRDO Previous Year Papers
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
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
Can Someone guide me how to prepare for interview...
It's not a standard resource, don't follow them.
https://byjus.com/maths/diagonalization/
@amit166 can you share the reference of the...
Twist at every point Man
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy
