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 2016 DEC Scientist B (IT) - Section B: 52
admin
asked
in
Algorithms
Mar 31, 2020
retagged
Jan 10
by
Hira Thakur
3,151
views
1
vote
1
vote
Find the odd one out
Merge Sort
TVSP Problem
Knapsack Problem
OBST Problem
nielit2016dec-scientistb-it
algorithms
easy
dynamic-programming
divide-and-conquer
admin
asked
in
Algorithms
Mar 31, 2020
retagged
Jan 10
by
Hira Thakur
by
admin
3.2k
views
answer
comment
Follow
share this
share
2 Comments
by
abhishek tiwary
commented
Apr 28, 2020
reply
Follow
share this
(A) merge short
0
0
by
HiteshVaish
commented
Jun 26, 2020
reply
Follow
share this
Merge sort
0
0
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
4
Answers
2
votes
2
votes
Option A
Merge Sort – Divide and Conquer
Travelling Salesman Problem – Dynamic Programming
Knapsack Problem – Dynamic Programming
Optimal Binary Search Tree Problem – Dynamic Programming
Mohit Kumar 6
answered
May 27, 2020
by
Mohit Kumar 6
comment
Follow
share this
0 Comments
Please
log in
or
register
to add a comment.
1
vote
1
vote
Marge Sort are Divide And Conquer method and the remaining are Dynamic programing approch.
Option A is Correct
Himanshu Kumar Gupta
answered
Sep 8, 2020
by
Himanshu Kumar Gupta
comment
Follow
share this
0 Comments
Please
log in
or
register
to add a comment.
1
vote
1
vote
option A )Merge Sort – Divide and Conquer approach , and all the rest are based on DP.
Sanandan
answered
Sep 11, 2020
by
Sanandan
comment
Follow
share this
0 Comments
Please
log in
or
register
to add a comment.
1
vote
1
vote
A – Megre Sort
Preet_0010
answered
Jul 29, 2021
by
Preet_0010
comment
Follow
share this
0 Comments
Please
log in
or
register
to add a comment.
Answer:
A
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
1
answer
1
admin
asked
in
Algorithms
Mar 31, 2020
1,829
views
NIELIT 2016 DEC Scientist B (IT) - Section B: 7
What is the type of the algorithm used in solving the $4$ Queens problem? Greedy Branch and Bound Dynamic Backtracking
admin
asked
in
Algorithms
Mar 31, 2020
by
admin
1.8k
views
nielit2016dec-scientistb-it
algorithms
1
vote
1
vote
4
answers
2
admin
asked
in
Algorithms
Mar 31, 2020
4,343
views
NIELIT 2016 DEC Scientist B (IT) - Section B: 8
Selection sort, quick sort is a stable sorting method True,True False,False True,False False,True
admin
asked
in
Algorithms
Mar 31, 2020
by
admin
4.3k
views
nielit2016dec-scientistb-it
algorithms
sorting
3
votes
3
votes
2
answers
3
admin
asked
in
Algorithms
Mar 31, 2020
3,867
views
NIELIT 2016 DEC Scientist B (IT) - Section B: 12
Which of the following sorting procedures is the slowest? Quick Sort Merge Sort Shell Sort Bubble Sort
admin
asked
in
Algorithms
Mar 31, 2020
by
admin
3.9k
views
nielit2016dec-scientistb-it
algorithms
sorting
5
votes
5
votes
2
answers
4
admin
asked
in
Algorithms
Mar 31, 2020
1,795
views
NIELIT 2016 DEC Scientist B (IT) - Section B: 27
Complexity of Kruskal's algorithm for finding minimum spanning tree of an undirected graph containing $n$ vertices and $m$ edges if the edges are sorted is: $O(mn)$ $O(m)$ $O(m+n)$ $O(n)$
admin
asked
in
Algorithms
Mar 31, 2020
by
admin
1.8k
views
nielit2016dec-scientistb-it
algorithms
spanning-tree
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