Algorithm MADE EASY TEST
closed

sandeep yadav asked Jan 27, 2018 • closed Jan 27, 2018 by sandeep yadav

232 views

See all

Related questions

2 votes

1 answer

srestha asked May 18, 2019

839 views

Made Easy Test Series:Algorithm-Dijkstra
Which of the following procedure results same output as Dijkstra’s Algo. on unweighted graph on $'n'$ verices? $A)$ BFS $B)$ DFS $C)$Kruskal $D)$ Prims As far I know Dijkstra and Prims both have $T.C.=O(E+VlogV)$ But ans given BFS. How this ans possible??

Which of the following procedure results same output as Dijkstra’s Algo. on unweighted graph on $'n'$ verices?$A)$ BFS $B)$ DFS $C)$Kruskal $D)$ PrimsAs far I know ...

srestha

839 views

srestha asked May 18, 2019

6 votes

1 answer

srestha asked May 18, 2019

2,074 views

Made Easy Test Series:Algorithm-Time Complexity
Consider a procedure $find()$ which take array of $n$ integers as input, and produce pair of element of array whose difference is not greater than the difference of any other pair of element of that array. Which of the following represent ... Here we need to sort first and then need to compare adjacent element right?? Then what will be complexity??

Consider a procedure $find()$ which take array of $n$ integers as input, and produce pair of element of array whose difference is not greater than the difference of any o...

srestha

2.1k views

srestha asked May 18, 2019

3 votes

3 answers

srestha asked May 12, 2019

1,919 views

Made Easy Test Series: Algorithm-Sorting
An array $A$ of size n is known to be sorted except for the first $k$ elements and the last $k$ elements, where $k$ is a constant. Which of the following algorithms will be the best choice for sorting the array $A?$ $a)$ ... sorts part by part using pivot. So, why not will it be answer?? How do we know it is asking for almost sorted array??

An array $A$ of size n is known to be sorted except for the first $k$ elements and the last $k$ elements, where $k$ is a constant. Which of the following algorithms will ...

srestha

1.9k views

srestha asked May 12, 2019

0 votes

1 answer

srestha asked May 10, 2019

459 views

Made Easy Test Series:Algorithm- Minimum Weight Path
Consider the following statement: $A)$ If all edge weight of a graph are positive then any subset of edges that connect all vertices and has minimum total weight is a tree. $B)$ ... minimum weight graph?? and what about B)?? Is it just saying each minimum path between $2$ vertices makes total shortest path??

Consider the following statement:$A)$ If all edge weight of a graph are positive then any subset of edges that connect all vertices and has minimum total weight is a tree...

srestha

459 views

srestha asked May 10, 2019

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

Algorithm MADE EASY TEST
closed

Please log in or register to add a comment.

0 Answers

Related questions

0 reply

Please log in or register to add a comment.

0 Answers

Related questions

0