Assignment 6 Gale Shapley Python implementation Submit zip file to Canvas by 11:59 Saturday, September 23.
|
|
- Marilyn Wood
- 6 years ago
- Views:
Transcription
1 Assignment 6 Gale Shapley Python implementation Submit zip file to Canvas by 11:59 Saturday, September 23. Goals Understand the Gale Shapley algorithm deeply Apply your knowledge about the target complexity of the parts of the algorithm o Write code that roughly meets these bounds Test and time your code to see if it meets the above goals Assignment: You must create an implementation of the Gale Shapley algorithm that runs in our test environment. You must also provide time tests of the sample input files provided for this assignment, along with a statement about why or why not your implementation met or did not roughly meet the expected time complexity with the different input sizes present in these input files. We will execute your program from a shell script as follows: python3 gs.py <json_input_file> <json_output_file> where gs.py is your implementation, <json_input_file> has our test problems in it, and <json_output_file> is where you will put your matchings. Canvas Submission: You must submit the following items in a zip file: gs.py (your python program file that implements the G S algorithm) any additional files it imports such as helper files we supply or other files you create a text file that shows the results of timing your program on different sized inputs and a brief discussion of how well you think your implementation meets the theoretical complexity bounds for the algorithm based on input size See the following sections on entry points and input and output specifications, and testing facilities you can use to check your work. Partial Rubric: We expect your program to produce correct matchings with a variety of problem sizes, so we will test correctness. We expect your program to perform at near expected complexity bounds, so we will test your program on both small and huge problem sizes. We expect you to use appropriate and efficient data structures and design in your implementation. We will be checking your source code. We cannot tell you more than this, other than to say that just using lists is not sufficient and won t achieve expected timing bounds. We expect you to use GitHub as a remote repository and push your code to it periodically, not just at the end of your development. We will be checking the commit logs of your private GitHub repository. We reserve the right to change this rubric as necessary.
2 Download Helper and Testing Files: Go to the Assignments tab on the CS320 webpage, and use the link described for this assignment to download a zip file containing 2 sample input files and 2 sample output files, and 2 python files, generate_problems.py and stable_matching_helpers.py. The file that generates problems is described below in the Sample testing & timing section. The generator functions imports the helpers file. You may use any of the functions in these two files in your implementation of the Gale Shapley algorithm, or none of them. However, you will need to create stable matching problems of various sizes for testing, and while you are free to write your own code to do this, you may find it convenient to use the code we have provided. See below for directions on using this code. Programmatic entry point: Your implementation must be in a file called gs.py. This file must contain a main block: if name == " main ": # do stuff Input specification: The first argument to your program (sys.argv[1]) is the name of a JSON text file containing a list of stable matching problem specifications. JSON is a mechanism to serialize data for easy transfer. In Python 3, it is used to serialize Python dictionaries. Therefore the JSON input file must be interpreted as a list of pairs of dictionaries that represent matching problems. Each problem specification consists of two dictionaries containing the preferences of the proposers and the preferences of the acceptors. For example an input file might contain: [[{"a0": ["b0", "b1"], "a1": ["b1", "b0"]}, {"b0": ["a0", "a1"], "b1": ["a0", "a1"]}], [{"j0": ["k0", "k1"], "j1": ["k0", "k1"]}, {"k0": ["j1", "j0"], "k1": ["j0", "j1"]}]] The above file is a list of two separate stable matching problems. The first problem matches "a"s and "b"s. The second matches "j"s and "k"s. For every problem, the people in the first dictionary must do the asking during the algorithm, and must be the first element of any matching. Thus, the a s and the j s are the people who will do the asking during the algorithm. The preferences are given as a mapping from the name of the person to that person s ordering of partners (by name), from most to least preferred. In the first problem contained in our example, we see that: "a0" prefers "b0" over "b1" "a1" prefers "b1" over "b0" "b0" prefers "a0" over "a1" "b1" has this same ordering of preferences.
3 Output specification: The second argument to your program (sys.argv[2]) is the name of the JSON file to write the output to. The contents of this file must be a list of dictionaries of matchings corresponding to the Gale Shapley matching for each problem. Since the a s are doing the asking, for this example, the dictionary form of a matching that might be computed for the "a" "b" example above is: {"a0": "b0", "a1": "b1"} A matching is represented by a mapping from each person in the original problem to their partner. The order of the key value pairs is not important. Similarly, for the j and k example, since the j s do the asking, a matching might be: {"j0": "k1", "j1": "k0"} The output matching file must then look like this: [{"a0": "b0", "a1": "b1"}, {"j0": "k1", "j1": "k0"}] Additional Resources: JSON: You can use functions like these to read and write JSON files. Remember that the objects you are reading and writing are dictionaries. The file generate_problems.py also has functions that read and write json files called parse_json_file and write_obj_to_json_file, respectively. def write_json(obj, filename): with open(filename, mode='w') as f: json.dump(obj, f) def read_json(filename): with open(filename) as f: return json.load(f)
4 Sample testing & timing: We have provided 2 sample input files along with their associated output files so you can see if your program generates the correct output: Input file name Associated output file name Number of problems & size small_prob_input.json small_prob_out.json 2 problems, one with 2 people, one with 3 people big_prob_input.json big_prob_out.json 2 problems, one with 40 people, one with 200 people You need to create your own problem files of different numbers of people in order to see if your implementation performs according to the expected complexity. You ll need some problems that are very big on the order of thousands to really see how your data structures and design affect performance. Try creating several problems of different sizes such as n=50, 200, 500, 800, 1000, 2000, and even bigger to test performance. Test your Gale Shapley implementation s performance separately from the JSON serialization/deserialization like so: if name == main : # read in input file import time start_time = time.process_time() # run Gale-Shapley calculations end_time = time.process_time() # write output file print( Ran in: {:.5f} secs.format(end_time - start_time)) Plot the timing results and analyze the growth behavior of your implementation relative to the bounds we proved in the abstract about the algorithm. We may be able to give you hints at reasonable expectations for growth behavior. If you find that your program does not perform as it should (is clearly worse than the big O bound for Gale Shapley), then you should re design your data structures and implementation and try again. Include your timing results and analysis in the text file included in the turn in zip, and we will evaluate this as part of your grade. Creating data sets of varying sizes: To help you generate problem files, we have included a source file generate_problems.py that contains a function that will generate random problems. This python file imports a set of helper functions from stable_matching_helpers.py, which is also included. def create_random_problems_json_file(filename, number_of_problems, sizes=(2, 3), specs=(none,), pretty_print=false): To use this function, call it with the file name that you want to create, the number of problems you want in the file, the sizes of those problems (by default either 2 or 3 people per problem, a specification of the keys to use for each group in a problem (by default none, but you should include them see examples below), and whether the file should be pretty printed (by default no).
5 Here is the call we used to create the small problem file (2 problems, one of each size 2 people and 3 people, first problem keys a and b, second problem keys j and k, file pretty printed): generate_problems.create_random_problems_json_file ('small_prob_input.json',2, sizes=[2,3], specs = [{'group1': 'a', 'group2': 'b'}, {'group1': 'j', 'group2': 'k'}], pretty_print=true) Here is the call we used to create the big problem file (2 problems, one of each size 40 and 200, first problem keys a and b, second problem keys j and k, file pretty printed): generate_problems.create_random_problems_json_file ('big_prob_input.json', 2, sizes=[40,200], specs=[{'group1': 'a', 'group2': 'b', 'verbose':true}, {'group1': 'j', 'group2': 'k', 'verbose':true}, pretty_print=true)
Arbitrage. CS 320, Fall Dr. Geri Georg, Instructor 320 Arbitrage 1
Arbitrage CS 320, Fall 2017 Dr. Geri Georg, Instructor georg@colostate.edu 320 Arbitrage 1 What s it all about? Given a graph representing currencies and the exchange rates between them, we want to find
More informationUsing GitHub for scientific research
Team 1 Reading in a CSV file Feel free to ask me questions if you get stuck! Specification Write a Python function that reads a two-columned CSV file and separates the two columns into two Python lists.
More informationProblem set 2. Problem 1. Problem 2. Problem 3. CS261, Winter Instructor: Ashish Goel.
CS261, Winter 2017. Instructor: Ashish Goel. Problem set 2 Electronic submission to Gradescope due 11:59pm Thursday 2/16. Form a group of 2-3 students that is, submit one homework with all of your names.
More informationProgramming Project #6: Password File Cracker
CSE231 Spring 2017 Programming Project #6: Password File Cracker (Edits: changed itertools permutations to product either works for these passwords, but product is the correct one. Removed lists and tuples
More informationProgramming Assignment 1
CS 276 / LING 286 Spring 2017 Programming Assignment 1 Due: Thursday, April 20, 2017 at 11:59pm Overview In this programming assignment, you will be applying knowledge that you have learned from lecture
More informationLab 4: Bash Scripting
Lab 4: Bash Scripting February 20, 2018 Introduction This lab will give you some experience writing bash scripts. You will need to sign in to https://git-classes. mst.edu and git clone the repository for
More informationLab 4: Shell Scripting
Lab 4: Shell Scripting Nathan Jarus June 12, 2017 Introduction This lab will give you some experience writing shell scripts. You will need to sign in to https://git.mst.edu and git clone the repository
More informationCIT 590 Homework 5 HTML Resumes
CIT 590 Homework 5 HTML Resumes Purposes of this assignment Reading from and writing to files Scraping information from a text file Basic HTML usage General problem specification A website is made up of
More informationby the evening of Tuesday, Feb 6
Homework 1 Due 14 February Handout 6 CSCI 334: Spring 2018 Notes This homework has three types of problems: Self Check: You are strongly encouraged to think about and work through these questions, and
More informationAssignment 5: Due Friday April 8 at 6pm Clarification and typo correction, Sunday Apr 3 3:45pm
CS1110 Spring 2016 Assignment 5: Due Friday April 8 at 6pm Clarification and typo correction, Sunday Apr 3 3:45pm You must work either on your own or with one partner. If you work with a partner, you and
More informationDue: 9 February 2017 at 1159pm (2359, Pacific Standard Time)
CSE 11 Winter 2017 Program Assignment #2 (100 points) START EARLY! Due: 9 February 2017 at 1159pm (2359, Pacific Standard Time) PROGRAM #2: DoubleArray11 READ THE ENTIRE ASSIGNMENT BEFORE STARTING In lecture,
More information15-110: Principles of Computing, Spring 2018
15-110: Principles of Computing, Spring 2018 Problem Set 5 (PS5) Due: Friday, February 23 by 2:30PM via Gradescope Hand-in HANDIN INSTRUCTIONS Download a copy of this PDF file. You have two ways to fill
More informationCS2223: Algorithms D- Term, Homework I. Teams: To be done individually. Due date: 03/27/2015 (1:50 PM) Submission: Electronic submission only
CS2223: Algorithms D- Term, 2015 Homework I Teams: To be done individually Due date: 03/27/2015 (1:50 PM) Submission: Electronic submission only 1 General Instructions Python Code vs. Pseudocode: Each
More informationDue: Fri, Sept 15 th, 5:00 p.m. Parallel and Sequential Data Structures and Algorithms (Fall 17)
Lab 2 - SkylineLab Due: Fri, Sept 15 th, 2017 @ 5:00 p.m. Parallel and Sequential Data Structures and Algorithms 15-210 (Fall 17) 1 Introduction This assignment is designed to give you more practice with
More informationCom S 227 Spring 2018 Assignment points Due Date: Thursday, September 27, 11:59 pm (midnight) "Late" deadline: Friday, September 28, 11:59 pm
Com S 227 Spring 2018 Assignment 2 200 points Due Date: Thursday, September 27, 11:59 pm (midnight) "Late" deadline: Friday, September 28, 11:59 pm (Remember that Exam 1 is MONDAY, October 1.) General
More informationHomework: Content extraction and search using Apache Tika Employment Postings Dataset contributed via DARPA XDATA Due: October 6, pm PT
Homework: Content extraction and search using Apache Tika Employment Postings Dataset contributed via DARPA XDATA Due: October 6, 2014 12pm PT 1. Overview Figure 1: Map of Jobs (Colored by Country) In
More informationIntroduction to Web Scraping with Python
Introduction to Web Scraping with Python NaLette Brodnax The Institute for Quantitative Social Science Harvard University January 26, 2018 workshop structure 1 2 3 4 intro get the review scrape tools Python
More informationComputer Science 385 Design and Analysis of Algorithms Siena College Spring Lab 8: Search Trees Due: Start of your next lab session
Computer Science 385 Design and Analysis of Algorithms Siena College Spring 2018 Lab 8: Search Trees Due: Start of your next lab session You will be assigned a partner to work with on this lab. Only one
More informationCS2304 Spring 2014 Project 3
Goal The Bureau of Labor Statistics maintains data sets on many different things, from work place injuries to consumer spending habits, but what you most frequently hear about is employment. Conveniently,
More informationVersion Control with Git ME 461 Fall 2018
Version Control with Git ME 461 Fall 2018 0. Contents Introduction Definitions Repository Remote Repository Local Repository Clone Commit Branch Pushing Pulling Create a Repository Clone a Repository Commit
More informationPlease make sure that when you submit your assignment, you submit a single HW6.py file that contains your entire assignment.
HW6: CS 110X C 2014 Note: This homework (and all remaining homework assignments) is a partner homework and must be completed by each partner pair. When you complete this assignment, you must not share
More informationCreating a Dropbox Folder & Category (6/2016)
Creating a Dropbox Folder & Category (6/2016) Categories are how you organize your Folders in the Dropbox, if you need a new Category you will create it while you are creating your New Folder. 1. Enter
More informationBook keeping. Will post HW5 tonight. OK to work in pairs. Midterm review next Wednesday
Garbage Collection Book keeping Will post HW5 tonight Will test file reading and writing Also parsing the stuff you reads and looking for some patterns On the long side But you ll have two weeks to do
More informationReading and Writing Files on Your Computer
Reading and Writing Files on Your Computer Code Snippets HW2-3, HW2-4 Function Recap #!/usr/bin/env python3 Though it s called sentence in main, in replace_hello() that value is called text def replace_hello(text):
More informationLab #2 Physics 91SI Spring 2013
Lab #2 Physics 91SI Spring 2013 Objective: Some more experience with advanced UNIX concepts, such as redirecting and piping. You will also explore the usefulness of Mercurial version control and how to
More informationLecture 02, Fall 2018 Friday September 7
Anatomy of a class Oliver W. Layton CS231: Data Structures and Algorithms Lecture 02, Fall 2018 Friday September 7 Follow-up Python is also cross-platform. What s the advantage of Java? It s true: Python
More informationComputer Graphics - Treasure Hunter
Computer Graphics - Treasure Hunter CS 4830 Dr. Mihail September 16, 2015 1 Introduction In this assignment you will implement an old technique to simulate 3D scenes called billboarding, sometimes referred
More informationProblem Set 6: Word Game II Handed out: Saturday, June 17th, DUE: 11:59pm Friday June 22th, 2016
Problem Set 6: Word Game II Handed out: Saturday, June 17th, 2016. DUE: 11:59pm Friday June 22th, 2016 Introduction In this problem set you will write a program that will play the word game all by itself.
More informationget set up for today s workshop
get set up for today s workshop Please open the following in Firefox: 1. Poll: bit.ly/iuwim25 Take a brief poll before we get started 2. Python: www.pythonanywhere.com Create a free account Click on Account
More informationCMSC 201 Spring 2018 Project 3 Minesweeper
CMSC 201 Spring 2018 Project 3 Minesweeper Assignment: Project 3 Minesweeper Due Date: Design Document: Friday, May 4th, 2018 by 8:59:59 PM Project: Friday, May 11th, 2018 by 8:59:59 PM Value: 80 points
More informationIn 1986 Donald Knuth was challenged with a programming task.
In 1986 Donald Knuth was challenged with a programming task. Knuth was at Stanford Univeristy; he is the author of the Art of Computer Programming which is a series of books with algorithms on how to carry
More informationCS164: Programming Assignment 2 Dlex Lexer Generator and Decaf Lexer
CS164: Programming Assignment 2 Dlex Lexer Generator and Decaf Lexer Assigned: Thursday, September 16, 2004 Due: Tuesday, September 28, 2004, at 11:59pm September 16, 2004 1 Introduction Overview In this
More informationCS 2110 Summer 2011: Assignment 2 Boggle
CS 2110 Summer 2011: Assignment 2 Boggle Due July 12 at 5pm This assignment is to be done in pairs. Information about partners will be provided separately. 1 Playing Boggle 1 In this assignment, we continue
More informationCS 112 Project Assignment: Visual Password
CS 112 Project Assignment: Visual Password Instructor: Dan Fleck Overview In this project you will use Python to implement a visual password system. In the industry today there is ongoing research about
More information61A Lecture 2. Wednesday, September 4, 2013
61A Lecture 2 Wednesday, September 4, 2013 Names, Assignment, and User-Defined Functions (Demo) Types of Expressions Primitive expressions: 2 add 'hello' Number or Numeral Name String Call expressions:
More informationCS 11 Project #6 Due THURSDAY, December 7 th, 11:59pm. Classes and Exceptions Background: Classes allow us to define new types for Python. We can first think of a class as defining a new container instead
More informationAssignment 7: Due Wednesday May 11 at 6pm UPDATES on Monday May 9
CS1110 Spring 2016 Assignment 7: Due Wednesday May 11 at 6pm UPDATES on Monday May 9 You must work either on your own or with one partner. If you work with a partner, you and your partner must first register
More informationDATABASE SYSTEMS. Introduction to MySQL. Database System Course, 2016
DATABASE SYSTEMS Introduction to MySQL Database System Course, 2016 AGENDA FOR TODAY Administration Database Architecture on the web Database history in a brief Databases today MySQL What is it How to
More informationLab 10: Markov Chains
CSE/IT 107 NMT Computer Science Holy shit, you geeks are badass. Pam (Archer) Simplicity is prerequisite for reliability. Edsger W. Dijkstra Simplicity is the final achievement. After one has played a
More informationCourse Project 2 Regular Expressions
Course Project 2 Regular Expressions CSE 30151 Spring 2017 Version of February 16, 2017 In this project, you ll write a regular expression matcher similar to grep, called mere (for match and echo using
More informationFinal Project. This assignment demonstrates your understanding of the concepts from the CMIS 141 class.
Final Project This assignment demonstrates your understanding of the concepts from the CMIS 141 class. Before attempting this project, be sure you have completed all of the reading assignments, hands-on
More informationBlack Problem 2: Scrabble Scoring [35 points; individual only]
Black Problem 2: Scrabble Scoring [35 points; individual only] Copied from: https://www.cs.hmc.edu/twiki/bin/view/cs5/scra bblescoringblack2010 on 3/22/2017 This is the only "individual only" problem this
More informationTips from the experts: How to waste a lot of time on this assignment
Com S 227 Spring 2018 Assignment 1 100 points Due Date: Friday, September 14, 11:59 pm (midnight) Late deadline (25% penalty): Monday, September 17, 11:59 pm General information This assignment is to be
More informationCS2304: Python for Java Programmers. CS2304: Advanced Function Topics
CS2304: Advanced Function Topics Functions With An Arbitrary Number of Parameters Let s say you wanted to create a function where you don t know the exact number of parameters. Python gives you a few ways
More informationIntroduction to Programming with JES
Introduction to Programming with JES Titus Winters & Josef Spjut October 6, 2005 1 Introduction First off, welcome to UCR, and congratulations on becoming a Computer Engineering major. Excellent choice.
More informationNote: This is a miniassignment and the grading is automated. If you do not submit it correctly, you will receive at most half credit.
Com S 227 Fall 2018 Miniassignment 1 40 points Due Date: Friday, October 12, 11:59 pm (midnight) Late deadline (25% penalty): Monday, October 15, 11:59 pm General information This assignment is to be done
More informationA bit more on Testing
A bit more on Testing Admin Some thoughts on the project You are reading data from the web. If you know knowing about http 1.x read at least about get and put Maybe here: https://code.tutsplus.com/tutorials/a-beginners-guide
More informationCS4120/4121/5120/5121 Spring /6 Programming Assignment 4
CS4120/4121/5120/5121 Spring 2016 Programming Assignment 4 Intermediate Code Generation Due: Friday March 18, 11:59pm This programming assignment requires you to implement an IR generator for the Xi programming
More informationHMC CS 158, Fall 2017 Problem Set 3 Programming: Regularized Polynomial Regression
HMC CS 158, Fall 2017 Problem Set 3 Programming: Regularized Polynomial Regression Goals: To open up the black-box of scikit-learn and implement regression models. To investigate how adding polynomial
More informationUNIVERSITY OF CALIFORNIA Department of Electrical Engineering and Computer Sciences Computer Science Division. P. N. Hilfinger
UNIVERSITY OF CALIFORNIA Department of Electrical Engineering and Computer Sciences Computer Science Division CS 164 Spring 2005 P. N. Hilfinger Project #2: Static Analyzer for Pyth Due: Wednesday, 6 April
More informationCS 1110, LAB 3: MODULES AND TESTING First Name: Last Name: NetID:
CS 1110, LAB 3: MODULES AND TESTING http://www.cs.cornell.edu/courses/cs11102013fa/labs/lab03.pdf First Name: Last Name: NetID: The purpose of this lab is to help you better understand functions, and to
More information15-110: Principles of Computing, Spring 2018
15-110: Principles of Computing, Spring 2018 Programming Assignment 11 (PA11) Due: Tuesday, May 1 by 9PM IMPORTANT ANNOUNCEMENT You cant drop this assignment even if it is your lowest PA score. Failure
More informationAlgorithm Analysis. College of Computing & Information Technology King Abdulaziz University. CPCS-204 Data Structures I
Algorithm Analysis College of Computing & Information Technology King Abdulaziz University CPCS-204 Data Structures I Order Analysis Judging the Efficiency/Speed of an Algorithm Thus far, we ve looked
More informationCS150 Sample Final Solution
CS150 Sample Final Solution Name: Section: A / B Date: Start time: End time: Honor Code: Signature: This exam is closed book, closed notes, closed computer, closed calculator, etc. You may only use (1)
More informationCS 301: Recursion. The Art of Self Reference. Tyler Caraza-Harter
CS 301: Recursion The Art of Self Reference Tyler Caraza-Harter Goal: use self-reference is a meaningful way Hofstadter's Law: It always takes longer than you expect, even when you take into account Hofstadter's
More informationCS61A Notes Week 13: Interpreters
CS61A Notes Week 13: Interpreters Read-Eval Loop Unlike Python, the result of evaluating an expression is not automatically printed. Instead, Logo complains if the value of any top-level expression is
More informationQUICK EXCEL TUTORIAL. The Very Basics
QUICK EXCEL TUTORIAL The Very Basics You Are Here. Titles & Column Headers Merging Cells Text Alignment When we work on spread sheets we often need to have a title and/or header clearly visible. Merge
More informationSECTION 2: Loop Reasoning & HW3 Setup
SECTION 2: Loop Reasoning & HW3 Setup cse331-staff@cs.washington.edu Review: Reasoning about loops What is a loop invariant? An assertion that always holds at the top of a loop Why do we need invariants?
More information(b) If a heap has n elements, what s the height of the tree?
CISC 5835 Algorithms for Big Data Fall, 2018 Homework Assignment #4 1 Answer the following questions about binary tree and heap: (a) For a complete binary tree of height 4 (we consider a tree with just
More informationCS 161 Problem Set 4
CS 161 Problem Set 4 Spring 2017 Due: May 8, 2017, 3pm Please answer each of the following problems. Refer to the course webpage for the collaboration policy, as well as for helpful advice for how to write
More informationSVN_Eclipse_at_home. 1. Download Eclipse. a. Go to: and select Eclipse IDE for Java Developers
1. Download Eclipse SVN_Eclipse_at_home a. Go to: http://www.eclipse.org/downloads/ and select Eclipse IDE for Java Developers b. Select a mirror (which just means select which identical copy you should
More informationSECTION 2: Loop Reasoning & HW3 Setup
SECTION 2: Loop Reasoning & HW3 Setup cse331-staff@cs.washington.edu slides borrowed and adapted from CSE 331 Winter 2018, CSE 391, and many more Review: Reasoning about loops What is a loop invariant?
More informationMoodle Destroyer Tools Documentation
Moodle Destroyer Tools Documentation Release 0.0.1 Manly Man Dec 22, 2017 With Web Services 1 Features and Screenshots 3 2 Grading with Webservices 7 2.1 Prerequisites...............................................
More informationReversing. Time to get with the program
Reversing Time to get with the program This guide is a brief introduction to C, Assembly Language, and Python that will be helpful for solving Reversing challenges. Writing a C Program C is one of the
More informationAssignment Manager. Change Edit Mode to On if it is not already by clicking on the option at the top right of the window.
Assignment Manager Blackboard has a tool called the Assignment Manager that facilitates file submissions from students. The Assignment Manager feature can be used in any content area (e.g. Course Information,
More informationENGR 3410: MP #1 MIPS 32-bit Register File
ENGR 3410: MP #1 MIPS 32-bit Register File Due: Before class, September 23rd, 2008 1 Introduction The purpose of this machine problem is to create the first large component of our MIPS-style microprocessor
More informationThe print queue was too long. The print queue is always too long shortly before assignments are due. Print your documentation
Chapter 1 CS488/688 F17 Assignment Format I take off marks for anything... A CS488 TA Assignments are due at the beginning of lecture on the due date specified. More precisely, all the files in your assignment
More informationExam 2. Name: UVa ID:
University of Virginia Out: 28 November 2011 cs1120: Introduction of Computing Due: 11:01 am, Wednesday, 30 November Explorations in Language, Logic, and Machines Exam 2 Name: UVa Email ID: Directions
More informationUsing GitHub to Share with SparkFun a
Using GitHub to Share with SparkFun a learn.sparkfun.com tutorial Available online at: http://sfe.io/t52 Contents Introduction Gitting Started Forking a Repository Committing, Pushing and Pulling Syncing
More informationCSE 331 Software Design & Implementation
CSE 331 Software Design & Implementation Spring 2019 Section 2 Development Tools UW CSE 331 Spring 2019 1 Administrivia HW1 done! HW2 due next Tuesday. HW3 out today, deadline upcoming. Everyone should
More informationMEMOIZATION, RECURSIVE DATA, AND SETS
MEMOIZATION, RECURSIVE DATA, AND SETS 4b COMPUTER SCIENCE 61A July 18, 2013 1 Memoization Later in this class, you ll learn about orders of growth and how to analyze exactly how efficient (or inefficient)
More informationTECH 4272 Operating Systems
TECH 4272 Lecture 3 2 Todd S. Canaday Adjunct Professor Herff College of Engineering sudo sudo is a program for Unix like computer operating systems that allows users to run programs with the security
More informationIntro to Algorithms. Professor Kevin Gold
Intro to Algorithms Professor Kevin Gold What is an Algorithm? An algorithm is a procedure for producing outputs from inputs. A chocolate chip cookie recipe technically qualifies. An algorithm taught in
More information100 points total. CSE 3353 Homework 1 Fall 2014
Name: 100 points total CSE 3353 Homework 1 Fall 2014 Assignment is due at 11am on September 11. Submit a scanned copy of the assignment, including a copy of your code and outputs as requested in the assignment,
More informationBlack Problem 2: Huffman Compression [75 points] Next, the Millisoft back story! Starter files
Black Problem 2: Huffman Compression [75 points] Copied from: https://www.cs.hmc.edu/twiki/bin/view/cs5/huff manblack on 3/15/2017 Due: 11:59 PM on November 14, 2016 Starter files First, here is a set
More information: Intro Programming for Scientists and Engineers Assignment 1: Turtle Graphics
Assignment 1: Turtle Graphics Page 1 600.112: Intro Programming for Scientists and Engineers Assignment 1: Turtle Graphics Peter H. Fröhlich phf@cs.jhu.edu Joanne Selinski joanne@cs.jhu.edu Due Date: Wednesdays
More information6.00 Introduction to Computer Science and Programming Fall 2008
MIT OpenCourseWare http://ocw.mit.edu 6.00 Introduction to Computer Science and Programming Fall 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.
More information15-780: Problem Set #2
15-780: Problem Set #2 February 19, 2014 1. Constraint satisfaction problem (CSP) [20pts] A common problem at universities is to schedule rooms for exams. The basic structure of this problem is to divide
More informationMath 408R: UT Fall 2016
Mini-Project 2: SIR using Matlab, Due October 7 In this assignment, you will be asked to run, modify, discuss, and print output from the SIREulers program you have on Matlab (which may be found on our
More informationCS240 Fall Mike Lam, Professor. Algorithm Analysis
CS240 Fall 2014 Mike Lam, Professor Algorithm Analysis HW1 Grades are Posted Grades were generally good Check my comments! Come talk to me if you have any questions PA1 is Due 9/17 @ noon Web-CAT submission
More informationBanzaiDB Documentation
BanzaiDB Documentation Release 0.3.0 Mitchell Stanton-Cook Jul 19, 2017 Contents 1 BanzaiDB documentation contents 3 2 Indices and tables 11 i ii BanzaiDB is a tool for pairing Microbial Genomics Next
More informationCS150 Sample Final. Name: Section: A / B
CS150 Sample Final Name: Section: A / B Date: Start time: End time: Honor Code: Signature: This exam is closed book, closed notes, closed computer, closed calculator, etc. You may only use (1) the final
More informationHomework 1. Notes. What To Turn In. Unix Accounts. Reading. Handout 3 CSCI 334: Spring, 2017
Homework 1 Due 14 February Handout 3 CSCI 334: Spring, 2017 Notes This homework has three types of problems: Self Check: You are strongly encouraged to think about and work through these questions, but
More informationCS112 Spring 2012 Dr. Kinga Dobolyi. Exam 2. Do not open this exam until you are told. Read these instructions:
CS112 Spring 2012 Dr. Kinga Dobolyi Exam 2 Do not open this exam until you are told. Read these instructions: 1. This is a closed book exam. No calculators, notes, or other aids are allowed. If you have
More informationContinuous Integration and Deployment (CI/CD)
WHITEPAPER OCT 2015 Table of contents Chapter 1. Introduction... 3 Chapter 2. Continuous Integration... 4 Chapter 3. Continuous Deployment... 6 2 Chapter 1: Introduction Apcera Support Team October 2015
More informationMARKING CANVAS ASSIGNMENTS OFFLINE (INCLUDING MARKING ANONYMOUSLY)
LEARNING TECHNOLOGY AT LJMU MARKING CANVAS ASSIGNMENTS OFFLINE (INCLUDING MARKING ANONYMOUSLY) Information about Downloading Student Submissions If you want to download all student submissions for an assignment,
More informationHomework # 7 DUE: 11:59pm November 15, 2002 NO EXTENSIONS WILL BE GIVEN
Homework #6 CS 450 - Operating Systems October 21, 2002 Homework # 7 DUE: 11:59pm November 15, 2002 NO EXTENSIONS WILL BE GIVEN 1. Overview In this assignment you will implement that FILES module of OSP.
More informationCS246-Assign01 V1.1: Winter 2013
CS246-Assign01 V1.1: Winter 2013 http://plg.uwaterloo.ca/~holt/cs/246/2013/asgn01/asgn01.htm Submit. Instructions to submit assignments (using Marmoset): https://marmoset.student.cs.uwaterloo.ca/ Instructions
More informationHOW DOES A SEARCH ENGINE WORK?
HOW DOES A SEARCH ENGINE WORK? Hector says... Hi there! Did you know that the World Wide Web is made up of over a trillion web pages? That s more information than you d find in a really big library and
More informationCSSE 304 Assignment #13 (interpreter milestone #1) Updated for Fall, 2018
CSSE 304 Assignment #13 (interpreter milestone #1) Updated for Fall, 2018 Deliverables: Your code (submit to PLC server). A13 participation survey (on Moodle, by the day after the A13 due date). This is
More informationSECTION 2: HW3 Setup.
SECTION 2: HW3 Setup cse331-staff@cs.washington.edu slides borrowed and adapted from Alex Mariakis,CSE 390a,Justin Bare, Deric Pang, Erin Peach, Vinod Rathnam LINKS TO DETAILED SETUP AND USAGE INSTRUCTIONS
More informationCMSC 201 Fall 2016 Homework 6 Functions
CMSC 201 Fall 2016 Homework 6 Functions Assignment: Homework 6 Functions Due Date: Wednesday, October 26th, 2016 by 8:59:59 PM Value: 40 points Collaboration: For Homework 6, collaboration is not allowed
More informationAssignment 5: Priority Queue
Assignment 5: Priority Queue Topic(s): Priority Queues, Code Reusability, More Advanced Makefiles, Debugging, Testing Date assigned: Wednesday, October 18, 2017 Date due: Wednesday, November 1, 2017, 9:15
More informationCS106 Lab 1: Getting started with Python, Linux, and Canopy. A. Using the interpreter as a fancy calculator
CS106 Lab 1: Getting started with Python, Linux, and Canopy Dr. Victor Norman Goals: To learn How python can be used interactively for simple computational tasks. How to run Canopy Start playing with Turtle
More informationComputer Science 252 Problem Solving with Java The College of Saint Rose Spring Topic Notes: Searching and Sorting
Computer Science 5 Problem Solving with Java The College of Saint Rose Spring 016 Topic Notes: Searching and Sorting Searching We all know what searching is looking for something. In a computer program,
More informationCS1 Lecture 5 Jan. 25, 2019
CS1 Lecture 5 Jan. 25, 2019 HW1 due Monday, 9:00am. Notes: Do not write all the code at once before starting to test. Take tiny steps. Write a few lines test... add a line or two test... add another line
More informationENCM 339 Fall 2017: Cygwin Setup Help
page 1 of 6 ENCM 339 Fall 2017: Cygwin Setup Help Steve Norman Department of Electrical & Computer Engineering University of Calgary September 2017 Introduction This document is designed to help students
More informationNote: This is a miniassignment and the grading is automated. If you do not submit it correctly, you will receive at most half credit.
Com S 227 Spring 2018 Miniassignment 1 40 points Due Date: Thursday, March 8, 11:59 pm (midnight) Late deadline (25% penalty): Friday, March 9, 11:59 pm General information This assignment is to be done
More information15-110: Principles of Computing, Spring 2018
5-: Principles of Computing, Spring 28 Problem Set 8 (PS8) Due: Friday, March 3 by 2:3PM via Gradescope Hand-in HANDIN INSTRUCTIONS Download a copy of this PDF file. You have two ways to fill in your answers:.
More informationCS 31 Discussion 1A, Week 1. Zengwen Yuan (zyuan [at] cs.ucla.edu) Humanities A65, Friday 10:00 11:50
CS 31 Discussion 1A, Week 1 Zengwen Yuan (zyuan [at] cs.ucla.edu) Humanities A65, Friday 10:00 11:50 TA Zengwen Yuan ( zyuan [at] cs.ucla.edu ) Discussion session (1A): Humanities A65 Friday 10:00 11:50
More information