 Create Quiz

# Job Sequencing Problem Quiz Question

## In job sequencing problem, the objective is to find a sequence of jobs, which is completed within their deadlines and gives maximum profit Quiz

You can mute/unmute sounds from here

## The following is a weighted binary tree, then what is the weighted array for the TVS problem?

[9, 2, 7, 0, 0, 0, 0, 0, 0, 0, 0, 0, 6, 4]
[9, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 7, 4, 6]
[9, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 6, 7, 4]
None

O(n)
O(n log n)
O(1)
None

O(n log n)
O(n log n
Both
None

## The time complexity of the normal quick sort, randomized quick sort algorithms in the worst case is

O(n2), O(n log n)
O(n2), O(n2)
O(n log n), O(n2)
All

N log N times
log N times
N2 times
All

Bubble sor
Quick sort
Both
None

## In analysis of algorithm, approximate relationship between the size of the job and the amount of work required to do is expressed by using _________

Central tendency
Differential equation
Order of magnitude
Order of execution

## P, Q and R are pointer variables. The statements below are intended to swap the contents of the nodes pointed to by P and Q. rewrite it so that it will work as intended.

R=Q; P=R; Q=R;
R=Q; P=R; P=R;
Both
None

Currently, we have no comments. Be first to comment on this quiz.

SIMILAR QUIZZES
Dick Wolf Quiz | Test, Bio, Birthday, Net Worth, Height Family
Dick Wolf Quiz How well do you know about Dick Wolf Quiz? Test Bio, Birthday, Net Worth, Height Answer these questions and find out"
El Demente Quiz | Test, Bio, Birthday, Net Worth, Height Family
El Demente Quiz How well do you know about El Demente Quiz? Test Bio, Birthday, Net Worth, Height Answer these questions and find out"
NP-Completeness Introduction - Quiz Question
NP Quiz Question is set of decision problems that can be solved by a Non-deterministic Turing Machine in Polynomial time
G.k quiz question
G. K quiz question

## Job Sequencing Problem Quiz Question : Test Trivia

Ultimate impossible quiz game

Embed This Quiz
Copy the code below to embed this quiz