@

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

admin asked in Algorithms Mar 30, 2020 retagged Jan 10 by Hira Thakur

6,162 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
easy
dynamic-programming

admin asked in Algorithms Mar 30, 2020 retagged Jan 10 by Hira Thakur

by admin

6.2k views

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

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

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

0 Comments

Please log in or register to add a comment.

Answer:

← Previous Next →

← Previous in category Next in category →

Related questions

0 votes

0 votes

0 answers

1

admin asked in Algorithms Mar 30, 2020

959 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$

admin asked in Algorithms Mar 30, 2020

by admin

959 views

nielit2017july-scientistb-cs
algorithms
dynamic-programming
matrix-chain-ordering

3 votes

3 votes

2 answers

2

admin asked in DS Mar 30, 2020

6,488 views

NIELIT 2017 July Scientist B (CS) - Section B: 7
A balance factor in AVL tree is used to check what rotation to make if all child nodes are at same level when the last rotation occurred if the tree is unbalanced

admin asked in DS Mar 30, 2020

by admin

6.5k views

nielit2017july-scientistb-cs
data-structures
avl-tree
easy

2 votes

2 votes

1 answer

3

admin asked in Algorithms Mar 30, 2020

841 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)$

admin asked in Algorithms Mar 30, 2020

by admin

841 views

nielit2017july-scientistb-cs
algorithms
time-complexity

0 votes

0 votes

2 answers

4

admin asked in Algorithms Mar 30, 2020

1,468 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)$

admin asked in Algorithms Mar 30, 2020

by admin

1.5k views

nielit2017july-scientistb-cs
algorithms
graph-algorithm

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:...

Send feedback
Rank Predictor
College Prediction
Useful Links
FAQ
Corrections
Discuss
Copyright
Request
Testimonials
Chat Logs
Chat
Badges
Search tips
Exam Category
Blog Category
Blog Tags
Privacy
Test Series
GATER
Refund Policy
Terms and Conditions
Contact Us

Developed by Chun

Twitter WhatsApp Facebook Reddit LinkedIn Email

Link Copied!