You are given the independent jobs A(5), B(7), C(10), D(12),
E(6), F(4), G(3).
(a) Using the...
You are given the independent jobs A(5), B(7), C(10), D(12),
E(6), F(4), G(3).
(a) Using the alphabetical order priority list above, if the
jobs are scheduled on 3 processors, what is the completion
time?
(b) If the decreasing time algorithm is used to schedule the
jobs on 3 processors, what is the completion time? 21 Incorrect:
Your answer is incorrect.
(c) If the decreasing time algorithm is used to schedule the
jobs on 3 processors, which is the second job...
[Note: The order of jobs in a schedule is
1st,2nd,3rd,4th,5th,
for A,B,C,D,E, respectively.]
The jobs A,B,C,D,E,...
[Note: The order of jobs in a schedule is
1st,2nd,3rd,4th,5th,
for A,B,C,D,E, respectively.]
The jobs A,B,C,D,E, arrived in that order to be processed on two
machines.
Job
A
B
C
D
E
Time on Machine 1
40
48
58
26
70
Time on Machine 2
37
60
56
48
72
Question 6. Which is the Johnson’s Rule schedule?
(A) ‘DBECA’ (B)
‘ACEBD’ (C) ‘DCABE’
(D) ‘DABEC’ (E) none of the above
Question 7. Consider the FIFO schedule of (A,B,C,D,E)....
Part 4. Questions 6,7. [ Use
Video-1 under Scheduling heading. ]
[Note: The order of jobs...
Part 4. Questions 6,7. [ Use
Video-1 under Scheduling heading. ]
[Note: The order of jobs in a schedule is
1st,2nd,3rd,4th,5th,
for A,B,C,D,E, respectively.]
The jobs A,B,C,D,E, arrived in that order to be processed on two
machines.
Job
A
B
C
D
E
Time on Machine 1
45
53
63
31
75
Time on Machine 2
42
65
61
53
77
Question 6. Which is the Johnson’s Rule schedule?
(A) ‘ACEBD’ (B)
‘DCABE’ (C) ‘DBECA’
(D) ‘DABEC’ (E) none...
let
A = { a, b, c, d , e, f, g} B = { d,...
let
A = { a, b, c, d , e, f, g} B = { d, e , f , g}
and C ={ a, b, c, d}
find :
(B n C)’
B’
B n C
(B U C) ‘
5 -letter "words" are formed using the letters A, B, C, D, E, F,
G. How...
5 -letter "words" are formed using the letters A, B, C, D, E, F,
G. How many such words are possible for each of the following
conditions?
a) No condition is imposed.
b) No letter can be repeated in a word.
c) Each word must begin with the letter A.
d) The letter C must be at the end.
e) The second letter must be a vowel.
Let the population have N=7 units, with {(unit,value)} =
{(A,-1),(B,+1),(C,-2),(D,+3),(E,-4),(F,+5),(G,-6)}. The design is
as follows: first...
Let the population have N=7 units, with {(unit,value)} =
{(A,-1),(B,+1),(C,-2),(D,+3),(E,-4),(F,+5),(G,-6)}. The design is
as follows: first choose A or B at random; if A then choose from
{C,D} at random, if B then choose from {E,F,G} at random. 1) Find
the first-order inclusion probabilities (note that the sample size
n is fixed at 2).
Verify (show numerically for this example) that the
Horvitz-Thompson estimator is unbiased for the population total.
(Hint: find the probability of each sample and the value...
Let Let A = {a, e, g} and B = {c, d, e, f, g}. Let...
Let Let A = {a, e, g} and B = {c, d, e, f, g}. Let f : A → B and
g : B → A be defined as follows: f = {(a, c), (e, e), (g, d)} g =
{(c, a), (d, e), (e, e), (f, a), (g, g)}
(a) Consider the composed function g ◦ f.
(i) What is the domain of g ◦ f? What is its codomain?
(ii) Find the function g ◦ f. (Find...
Part 3. Questions 3,4,5. [ Use Video-2 under
Scheduling heading. ]
[Note: The order of jobs...
Part 3. Questions 3,4,5. [ Use Video-2 under
Scheduling heading. ]
[Note: The order of jobs in a schedule ABCDE is
1st,2nd,3rd,4th,5th,
respectively.]
Five jobs arrived to be processed with the processing times and
due dates.
Present Date=
300
Work Order
A
B
C
D
E
Processing Times (Days)
14
5
40
12
7
Due Date
167
163
195
191
161
. . .
Question 3. The FIFO schedule is “ABCDE” (where job “A” is the
first job) and the...
Given that, for some a, b, c, d, e, f, g, h, i ∈ R, [a...
Given that, for some a, b, c, d, e, f, g, h, i ∈ R, [a b c d e f
g h i ] = 5, evaluate the following determinants:
(c) [ka ld mg
kb le mh
kc lf mi] Here, k, l, and m are non-negative constants.
Below is a list of edges in a directed graph with nodes
A,B,C,D,E,F:
B → E,...
Below is a list of edges in a directed graph with nodes
A,B,C,D,E,F:
B → E, B → F, C → D, D → A, E → F
a) Find 5 topological sortings of the graph.
b) Which edge must be removed in order to make ABCDEF to be a
topological ordering?