Virtual Test Series

Jhunjhunuwala asked Sep 25, 2016

215 views

1 votes

Jhunjhunuwala asked Sep 25, 2016

Jhunjhunuwala

215 views

See all

1 1 comment

papesh

commented Sep 25, 2016

moved

by papesh Oct 7, 2016

minimum spanning tree : n-1

here root 2 and "1" is cost of edge...

1 votes

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Voting & Accepting an answer helps improve the community

← Previous Next →

← Previous in category Next in category →

Related questions

0 votes

1 answer

SameekshaGupta asked Jan 13, 2019

490 views

Virtual Gate Test Series: Algorithms - Graphs

SameekshaGupta

490 views

SameekshaGupta asked Jan 13, 2019

Algorithms
algorithms
shortest-path
virtual-gate-test-series

+ –

0 votes

1 answer

Utsav09 asked Jan 31, 2018

382 views

Virtual Gate Test Series: Algorithms - Time Complexity
An array of $n$ distinct elements is said to be un-sorted if for every index $i$ such that $2 ≤ i ≤ n − 1,$ either $\{A[i] > max{A[i − 1], A[i + 1]}\},$ or $\{A[i] < min{A[i − 1], A[i + 1]}\}.$ What is the time-complexity of the fastest ... $O( \sqrt{n})$ $(C) O( \sqrt{n})$ but not $O(log n)$ $(D) O(log n)$ but not $O(1)$

An array of $n$ distinct elements is said to be un-sorted if for every index $i$ such that $2 ≤ i ≤ n − 1,$either $\{A[i] max{A[i − 1], A[i + 1]}\},$ or $\{A[i]...

Utsav09

382 views

Utsav09 asked Jan 31, 2018

Algorithms
algorithms
time-complexity
virtual-gate-test-series

+ –

1 votes

2 answers

Mk Utkarsh asked Nov 11, 2017

543 views

Virtual Gate Test Series: Algorithms - Hash Table(Linear Probing)

Mk Utkarsh

543 views

Mk Utkarsh asked Nov 11, 2017

Algorithms
algorithms
hashing
virtual-gate-test-series

+ –

1 votes

2 answers

Manoja Rajalakshmi A asked Nov 7, 2017

1,017 views

Virtual Gate Test Series: Algorithms - Job Scheduling
We are given 10 tasks. The execution of task requires 1 unit of time. Each task Ti has profit pi and deadline di. Profit pi is earned if task Ti is completed before dith unit of time. Task T1 T2 T3 T4 T5 T6 T7 T8 ... 6 1 5 Suppose maximum total profit earned by scheduling above task is 129, then profit x' assigned to T3 is __________________.

We are given 10 tasks. The execution of task requires 1 unit of time. Each task Ti has profit pi and deadline di. Profit pi is earned if task Ti is completed before dith ...

Manoja Rajalakshmi A

1.0k views

Manoja Rajalakshmi A asked Nov 7, 2017

Algorithms
algorithms
job-scheduling
virtual-gate-test-series
numerical-answers

+ –

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

1 1 comment reply

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Related questions

1 1 comment