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
NIELIT 2017 July Scientist B (CS) - Section B: 39
Lakshman Patel RJIT
asked
in
Algorithms
Mar 30, 2020
retagged
Oct 20, 2020
by
Krithiga2101
3,364
views
0
votes
0
votes
Which of the following standard algorithms is not Dynamic Programming based?
Bellman-Ford Algorithm for single source shortest path
Floyd Warshall Algorithm for all pairs shortest paths
$0-1$ Knapsack problem
Prim’s Minimum Spanning Tree
nielit2017july-scientistb-cs
algorithms
dynamic-programming
Lakshman Patel RJIT
asked
in
Algorithms
Mar 30, 2020
retagged
Oct 20, 2020
by
Krithiga2101
by
Lakshman Patel RJIT
3.4k
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.
3
Answers
0
votes
0
votes
Prim's MST is greedy algorithm. Rest are standard dynamic programming algorithm.
So D is correct.
smsubham
answered
Apr 3, 2020
by
smsubham
comment
Follow
share this
0 Comments
Please
log in
or
register
to add a comment.
0
votes
0
votes
Option D) Prims Algorithm , which is a greedy algorithm.
Sanandan
answered
Sep 11, 2020
by
Sanandan
comment
Follow
share this
0 Comments
Please
log in
or
register
to add a comment.
0
votes
0
votes
D IS GREEDY APPROACH PRIMS ALGO
lovegate
answered
Mar 9, 2021
by
lovegate
comment
Follow
share this
0 Comments
Please
log in
or
register
to add a comment.
Answer:
D
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
0
answers
1
Lakshman Patel RJIT
asked
in
Algorithms
Mar 30, 2020
484
views
NIELIT 2017 July Scientist B (CS) - Section B: 41
Four Matrices $M_1, M_2, M_3$ and $M_4$ of dimensions $ p \times q$, $q \times r$, $r \times s$ and $s \times t$ respectively can be multiplied in several ways with different number of total scalar multiplications. For example, when ... $t=80$, then the number of scalar multiplications needed is $248000$ $44000$ $19000$ $25000$
Lakshman Patel RJIT
asked
in
Algorithms
Mar 30, 2020
by
Lakshman Patel RJIT
484
views
nielit2017july-scientistb-cs
algorithms
dynamic-programming
2
votes
2
votes
1
answer
2
Lakshman Patel RJIT
asked
in
Algorithms
Mar 30, 2020
552
views
NIELIT 2017 July Scientist B (CS) - Section B: 9
The worst case running times of Insertion sort, Merge sort and Quick sort, respectively, are $\Theta(n \log n),\Theta(n \log n) \text{ and } \Theta(n^2)$ $\Theta(n^2),\Theta(n^2)\text{ and } \Theta(n \log n)$ $\Theta(n^2), \Theta(n \log n)\text{ and } \Theta(n \log n)$ $\Theta(n^2),\Theta(n\log n) \text{ and } \Theta(n^2)$
Lakshman Patel RJIT
asked
in
Algorithms
Mar 30, 2020
by
Lakshman Patel RJIT
552
views
nielit2017july-scientistb-cs
algorithms
time-complexity
0
votes
0
votes
2
answers
3
Lakshman Patel RJIT
asked
in
Algorithms
Mar 30, 2020
620
views
NIELIT 2017 July Scientist B (CS) - Section B: 42
Let $G$ be a graph with $n$ vertices and $m$ edges.What is the tightest upper bound on the running time of Depth First Search of $G$, when $G$ is represented using adjacency matrix? $O(n)$ $O(m+n)$ $O(n^2)$ $O(mn)$
Lakshman Patel RJIT
asked
in
Algorithms
Mar 30, 2020
by
Lakshman Patel RJIT
620
views
nielit2017july-scientistb-cs
algorithms
graph-algorithms
0
votes
0
votes
1
answer
4
Lakshman Patel RJIT
asked
in
Algorithms
Mar 30, 2020
480
views
NIELIT 2017 July Scientist B (CS) - Section B: 55
Suppose $T(n)=2T(n/2)+n$, $T(0)=T(1)=1$ which one of the following is false? $T(n)=O(n^2)$ $T(n)=\Theta(n\log n)$ $T(n)=\Omega(n^2)$ $T(n)=O(n\log n)$
Lakshman Patel RJIT
asked
in
Algorithms
Mar 30, 2020
by
Lakshman Patel RJIT
480
views
nielit2017july-scientistb-cs
algorithms
recurrence-relation
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
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
RECRUITMENT IN OIL AND GAS CORPORATION LIMITED
Aptitude Overflow Book
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(9.1k)
Digital Logic
(3.2k)
Programming and DS
(5.8k)
Algorithms
(4.5k)
Theory of Computation
(6.6k)
Compiler Design
(2.3k)
Operating System
(4.9k)
Databases
(4.5k)
CO and Architecture
(3.7k)
Computer Networks
(4.5k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(647)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(854)
Recent Blog Comments
@abir_banerjee Thanks Abir. I'm third year...
@nolan_keats Currently I am in third year...
@abir_banerjee thank you Abir.Supposing you...
@nolan_keats just a suggestion as I also...
@abir_banerjee Hope I can do this in span of one...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy