title AND OR Scheduler implementation class AND OR Scheduler ( object ) def init ( self ) It is up to you to implement the initialization YOUR SOLUTION HERE def add and task ( self , t , dependencies ) Adds an AND task t with given dependencies YOUR SOLUTION HERE def add or task ( self , t , dependencies ) Adds an OR task t with given dependencies YOUR SOLUTION HERE property def done ( self ) YOUR SOLUTION HERE property def available tasks ( self ) Returns the set of tasks that can be done in parallel A task can be done if It is an AND task, and all its predecessors have been completed, or It is an OR task, and at least one of its predecessors has been completed And of course, we don't return any task that has already been completed YOUR SOLUTION HERE def mark completed ( self , t ) Marks the task t as completed, and returns the additional set of tasks that can be done ( and that could not be previously done ) once t is completed YOUR SOLUTION HERE def show ( self ) You can use the nx graph to display the graph You may want to ensure that you display AND and OR nodes differently YOUR SOLUTION HERE Tests 1 0 points Simple tests for AND nodes s AND OR Scheduler ( ) s add and task ( ' a ' , ' b ' , ' c ' ) assert s available tasks ' b ' , ' c ' r s mark completed ( ' b ' ) assert r set ( ) assert s available tasks ' c ' r s mark completed ( ' c ' ) assert r ' a ' assert s available tasks ' a ' r s mark completed ( ' a ' ) assert r set ( ) assert s available tasks set ( ) Tests 1 0 points Simple tests for OR nodes s AND OR Scheduler ( ) s add or task ( ' a ' , ' b ' , ' c ' ) assert s available tasks ' b ' , ' c ' r s mark completed ( ' b ' ) Now ' a ' becomes available assert r ' a ' But note that ' c ' is also available, even if useless assert s available tasks ' a ' , ' c ' r s mark completed ( ' a ' ) assert r set ( ) assert s available tasks ' c ' r s mark completed ( ' c ' ) assert r set ( ) assert s available tasks set ( ) Tests 1 0 points Tests with both AND and OR nodes s AND OR Scheduler ( ) s add and task ( ' a ' , ' b ' , ' c ' ) s add or task ( ' b ' , ' b 1 ' , ' b 2 ' ) s add or task ( ' c ' , ' c 1 ' , ' c 2 ' ) r s mark completed ( ' b 1 ' ) assert s available tasks ' b ' , ' b 2 ' , ' c 1 ' , ' c 2 ' r s mark completed ( ' b ' ) assert ' a ' not in s available tasks r s mark completed ( ' c 1 ' ) assert ' a ' not in s available tasks r s mark completed ( ' c ' ) assert ' a ' in s available tasks s AND OR Scheduler ( ) s add or task ( ' a ' , ' b ' , ' c ' ) s add and task ( ' b ' , ' b 1 ' , ' b 2 ' ) s add and task ( ' c ' , ' c 1 ' , ' c 2 ' ) r s mark completed ( ' b 1 ' ) assert s available tasks ' b 2 ' , ' c 1 ' , ' c 2 ' r s mark completed ( ' c 1 ' ) assert s available tasks ' b 2 ' , ' c 2 ' r s mark completed ( ' c 2 ' ) assert s available tasks ' b 2 ' , ' c ' r s mark completed ( ' c ' ) assert ' a ' in s available tasks can someone help me with this code What do I even input at the parts where it says YOUR SOLUTION HERE to get through all of the tests This is driving me nuts

The Answer is in the image, click to view ...

Question: #@title ` AND _ OR _ Scheduler ` implementation class AND _ OR _ Scheduler ( object ) : def _ _ init _ _

#@title

`

AND

_

_

Scheduler

`

implementation

class AND

_

_

Scheduler

(

object

)

def

__

init

__(

self

)

# It is up to you to implement the initialization.

### YOUR SOLUTION HERE

def add

_

and

_

task

(

self

,

,

dependencies

)

" " "

Adds an AND task t with given dependencies."""

### YOUR SOLUTION HERE

def add

_

_

task

(

self

,

,

dependencies

)

" " "

Adds an OR task t with given dependencies."""

### YOUR SOLUTION HERE

@property

def done

(

self

)

### YOUR SOLUTION HERE

@property

def available

_

tasks

(

self

)

" " "

Returns the set of tasks that can be done in parallel.

A task can be done if:

-

It is an AND task, and all its predecessors have been completed, or

-

It is an OR task, and at least one of its predecessors has been completed.

And of course, we don't return any task that has already been

completed."""

### YOUR SOLUTION HERE

def mark

_

completed

(

self

,

)

" " "

Marks the task t as completed, and returns the additional

set of tasks that can be done

(

and that could not be

previously done

)

once t is completed."""

### YOUR SOLUTION HERE

def show

(

self

)

" " "

You can use the nx graph to display the graph. You may want to ensure

that you display AND and OR nodes differently."""

### YOUR SOLUTION HERE

# Tests

10

points: Simple tests for AND nodes.

=

AND

_

_

Scheduler

()

.

add

_

and

_

task

('

', ['

','

'])

assert s

.

available

_

tasks

= = {'

','

'}

=

.

mark

_

completed

('

')

assert r

= =

set

()

assert s

.

available

_

tasks

= = {'

'}

=

.

mark

_

completed

('

')

assert r

= = {'

'}

assert s

.

available

_

tasks

= = {'

'}

=

.

mark

_

completed

('

')

assert r

= =

set

()

assert s

.

available

_

tasks

= =

set

()

# Tests

10

points: Simple tests for OR nodes.

=

AND

_

_

Scheduler

()

.

add

_

_

task

('

', ['

','

'])

assert s

.

available

_

tasks

= = {'

','

'}

=

.

mark

_

completed

('

')

# Now

'

'

becomes available.

assert r

= = {'

'}

# But note that

'

'

is also available, even if useless.

assert s

.

available

_

tasks

= = {'

','

'}

=

.

mark

_

completed

('

')

assert r

= =

set

()

assert s

.

available

_

tasks

= = {'

'}

=

.

mark

_

completed

('

')

assert r

= =

set

()

assert s

.

available

_

tasks

= =

set

()

# Tests

10

points: Tests with both AND and OR nodes.

=

AND

_

_

Scheduler

()

.

add

_

and

_

task

('

', ['

','

'])

.

add

_

_

task

('

', ['

1','

2'])

.

add

_

_

task

('

', ['

1','

2'])

=

.

mark

_

completed

('

1')

assert s

.

available

_

tasks

= = {'

','

2','

1','

2'}

=

.

mark

_

completed

('

')

assert

'

'

not in s

.

available

_

tasks

=

.

mark

_

completed

('

1')

assert

'

'

not in s

.

available

_

tasks

=

.

mark

_

completed

('

')

assert

'

'

in s

.

available

_

tasks

=

AND

_

_

Scheduler

()

.

add

_

_

task

('

', ['

','

'])

.

add

_

and

_

task

('

', ['

1','

2'])

.

add

_

and

_

task

('

', ['

1','

2'])

=

.

mark

_

completed

('

1')

assert s

.

available

_

tasks

= = {'

2','

1','

2'}

=

.

mark

_

completed

('

1')

assert s

.

available

_

tasks

= = {'

2','

2'}

=

.

mark

_

completed

('

2')

assert s

.

available

_

tasks

= = {'

2','

'}

=

.

mark

_

completed

('

')

assert

'

'

in s

.

available

_

tasks

can someone help me with this code. What do I even input at the parts where it says ###YOUR SOLUTION HERE to get through all of the tests? This is driving me nuts.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock blur-text-image

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!

Hash Table ADT with chaining implementation: How do I update the the following Python code to use open addressing with linear probing? Yes, Python. What extra information do you need? # HashTable ADT...

Please write your answers with your explanations. Thank you! Code Tracing class Course (object): def init (self, coursename = "', credit hrs 3, section =''): self.name cou r sename self.credit...

Need help with Intro to Comp Sci 2 (Python) problem: Add a Hand(object) class to the Card and Deck classes in the template. The __init__ has been written for you. Write a class program getHand()...

Plz help me with implementing a max heap class of integer in python3 Plz define inside function as following. a. Implement a class MaxHeap (a max heap) that contains integers that represent both the...

Download four .wav sound files from some site like this (http://www.findsounds.com/types.html). Make an application that plays a different one of these four sounds when the user presses one of the...

Find an image from google and modify the sample code so that the image sits in the middle of the screen and rotates at a rate of 1 revolution every 2 seconds. (See pygame.transform.rotate()...

Using python write the code l class Employee (object): A salaried employee Using Inheritance Consider the following (base) class. class Employee (object) def init (self, name, salary): Initialise a...

IN PYTHON PLEASE :) class Stream (object): def init (self, first, compute rest, empty- False): self. first = first self-compute-rest = compute-rest self.empty -empty self. rest None self....

Python 3 implement the binary search tree Partially Implement Binary Search Tree (BST) . Implement the following operations for a Binary Search Tree class starting from the template provided. Use the...

python lecture notes: import random # die.py class to represent a single die class Die: Constructor sets the initial values of the data members (attributes of) the object. def __init__( self, sides...

Set up the Three Profit Areas: without any The first is a fast lube area that you can set up additional tools or equipment. The Oil change time is 3/10 of an hour. The competitive price to beat is...

Intervision is a manufacturing company which produces and sells a single product, 'Street light'. The following is the standard cost per unit of the product: Cost Variable manufacturing Fixed...

ans Consider a converging lens with a focal point F . Without changing the shape and size of the lens, what could you do to move the focus closer to the lens? There is nothing you can do: the shape...

Chemical Kinetics: Steady State Approximation (mimetex) Tieg 1.t+041+t+c+0 2x3c I hase of the above Tres 2 en presuse Ton Chemical Kinetics: Steady State Approximation (mimetex) Tieg 1.t+041+t+c+0...

Are Pay Policies typically the same for all Occupation Groups in an organization?

Why are Medians sometimes more indicative of Central Tendency than are Averages?

What types of data are Dimensional Relational Databases in both RDMSs and OLAP Databases primarily designed to hold?