grader

School

San Jose State University *

*We aren’t endorsed by this school

Course

256

Subject

Computer Science

Date

Dec 6, 2023

Type

Pages

Uploaded by MagistrateProtonKookabura32

#!/usr/bin/env python3 import collections import graderUtil import random grader = graderUtil.Grader() submission = grader.load('submission') ############################################################ # Problems 1, 2, 3 # Problem 1 grader.add_manual_part('1a', max_points=2, description='optimize weighted average') grader.add_manual_part('1b', max_points=3, description='swap sum and max') grader.add_manual_part('1c', max_points=3, description='expected value of iterated game') grader.add_manual_part('1d', max_points=3, description='derive maximum likelihood') grader.add_manual_part('1e', max_points=3, description='manipulate conditional probabilities') grader.add_manual_part('1f', max_points=4, description='take gradient') # Problem 2 grader.add_manual_part('2a', max_points=2, description='counting faces') grader.add_manual_part('2b', max_points=3, description='dynamic program') # Problem 3 grader.add_manual_part('3a', max_points=2, description='ethics in ai scenario a negative impacts statement') grader.add_manual_part('3b', max_points=2, description='ethics in ai scenario b negative impacts statement') grader.add_manual_part('3c', max_points=2, description='ethics in ai scenario c negative impacts statement') grader.add_manual_part('3d', max_points=2, description='ethics in ai scenario d negative impacts statement') ############################################################ # Problem 4a: findAlphabeticallyFirstWord grader.add_basic_part('4a-0-basic', lambda: grader.require_is_equal('alphabetically', submission.find_alphabetically_first_word( 'which is the first word alphabetically')), description='simple test case') grader.add_basic_part('4a-1-basic', lambda: grader.require_is_equal('cat', submission.find_alphabetically_first_word('cat sun dog')), description='simple test case') grader.add_basic_part('4a-2-basic', lambda: grader.require_is_equal('0', submission.find_alphabetically_first_word( ' '.join(str(x) for x in range(100000)))), description='big test case') ############################################################ # Problem 4b: euclideanDistance grader.add_basic_part('4b-0-basic', lambda: grader.require_is_equal(5, submission.euclidean_distance((1, 5), (4, 1))),

description='simple test case') def test4b1(): random.seed(42) for _ in range(100): x1 = random.randint(0, 10) y1 = random.randint(0, 10) x2 = random.randint(0, 10) y2 = random.randint(0, 10) ans2 = submission.euclidean_distance((x1, y1), (x2, y2)) grader.add_hidden_part('4b-1-hidden', test4b1, max_points=2, description='100 random trials') ############################################################ # Problem 4c: dotProduct def test4c0(): grader.require_is_equal(15, submission.sparse_vector_dot_product(collections.defaultdict(float, {'a': 5}), collections.defaultdict(float, {'b': 2, 'a': 3}))) grader.add_basic_part('4c-0-basic', test4c0, max_points=1, description='simple test') def randvec(): v = collections.defaultdict(float) for _ in range(10): v[random.randint(0, 10)] = random.randint(0, 10) - 5 return v def test4c1(): random.seed(42) for _ in range(10): v1 = randvec() v2 = randvec() ans2 = submission.sparse_vector_dot_product(v1, v2) grader.add_hidden_part('4c-1-hidden', test4c1, max_points=3, description='random trials') ############################################################ # Problem 4d: incrementSparseVector def test4d0(): v = collections.defaultdict(float, {'a': 5}) submission.increment_sparse_vector(v, 2, collections.defaultdict(float, {'b': 2, 'a': 3})) grader.require_is_equal(collections.defaultdict(float, {'a': 11, 'b': 4}), v)

grader.add_basic_part('4d-0-basic', test4d0, description='simple test') def test4d1(): random.seed(42) for _ in range(10): v1a = randvec() v1b = v1a.copy() v2 = randvec() submission.increment_sparse_vector(v1b, 4, v2) for key in list(v1b): if v1b[key] == 0: del v1b[key] grader.add_hidden_part('4d-1-hidden', test4d1, max_points=3, description='random trials') ############################################################ # Problem 4e: findNonsingletonWords def test4e0(): grader.require_is_equal({'the', 'fox'}, submission.find_nonsingleton_words('the quick brown fox jumps over the lazy fox')) grader.add_basic_part('4e-0-basic', test4e0, description='simple test') def test4e12(num_tokens, num_types): import random random.seed(42) text = ' '.join(str(random.randint(0, num_types)) for _ in range(num_tokens)) ans2 = submission.find_nonsingleton_words(text) grader.add_hidden_part('4e-1-hidden', lambda: test4e12(1000, 10), max_points=1, description='random trials') grader.add_hidden_part('4e-2-hidden', lambda: test4e12(10000, 100), max_points=2, description='random trials (bigger)') ############################################################ grader.grade()

Your preview ends here

Eager to read complete document? Join bartleby learn and gain access to the full version

Access to all documents
Unlimited textbook solutions
24/7 expert homework help

Related Documents

13.2.7-packet-tracer---use-ping-and-traceroute-to-test-network-connectivity.pdf.docx

Lab 10.pdf

problem4.pdf

problem17.pdf

13.2.6-packet-tracer---verify-ipv4-and-ipv6-addressing completed.docx

submission.py

EECS189 Dis10 Solution.pdf

36220490.pdf

DAD 220 Database Documentation Template.docx

INT 220 Final Project Milestone 3.docx

Chapter 4 SI (1).docx

INT 220 Final Project .docx

Recommended textbooks for you

C++ for Engineers and Scientists

Computer Science

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Course Technology Ptr

Programming Logic & Design Comprehensive

Computer Science

ISBN:9781337669405

Author:FARRELL

Publisher:Cengage

C++ Programming: From Problem Analysis to Program...

Computer Science

ISBN:9781337102087

Author:D. S. Malik

Publisher:Cengage Learning

EBK JAVA PROGRAMMING

Computer Science

ISBN:9781337671385

Author:FARRELL

Publisher:CENGAGE LEARNING - CONSIGNMENT

Programming with Microsoft Visual Basic 2017

Computer Science

ISBN:9781337102124

Author:Diane Zak

Publisher:Cengage Learning

Systems Architecture

Computer Science

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Cengage Learning

SEE MORE TEXTBOOKS

Recommended textbooks for you

C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781337671385
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT
Programming with Microsoft Visual Basic 2017
Computer Science
ISBN:9781337102124
Author:Diane Zak
Publisher:Cengage Learning
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning