The State Universtiy of New York, Korea Computer Science

Size: px
Start display at page:

Download "The State Universtiy of New York, Korea Computer Science"

Transcription

1 The State Universtiy of New York, Korea Computer Science CSE 101 Handout 4: PS 3 October 11, 2017 This problem set is due Saturday, October 21 at 11:59pm, KST. Note that that the due date that you see on Blackboard is not accurate since it shows the time in EST. You should go by the due date in this handout. Add your name and address as a comment at the top of each file you submit. What to submit Hand in your work on Blackboard. Your submission should include the following. Please do not submit other files that I did not ask for. ps3.py Multiple submissions are allowed before the due date and time. Late submissions will not be graded. Assignment objectives To become comfortable writing Python programs that feature Boolean operators and loops. Incomplete work Please read what I said about this in PS 2. Naming conventions in Python and programming style in general Please read what I said about this in PS 2. Introduction For the six parts of this problem set you will be working on six individual parts that together will contribute to a simple game program called Starman. The code to start and play this game will be provided for you in a file called starman driver.py. This file is just for you to play the game and test your work. You will be graded on the individual functions that contribute to the crucial functionalities to the game. Without these functions working properly, you will not be able to play the game. Starman is a simple game that is made up for this assignment. The game takes place on a 5x5 game board, which will be represented by a list called board. The list board consists of five sub-lists, where each sub-list represents a row of the game board. The top-left corner slot is represented by board[0][0], and the bottomright corner slot is represented by board[4][4]. Don t worry about it if this does not make sense now as an example will be given later. Starman terminology includes the following:

2 Starman: the character you will be controlling and moving around the board. It is represented by the symbol *. Wall: When you move Starman around, you can t move into a wall which can appear anywhere on the board. A wall is represented by the letter W. Pit: When you move Starman around, you can sometimes see a pit. Unlike a wall, you can actually move into a pit. When you fall into a pit, however, the game is over (Starman dies). A pit is represented by the letter O. Food: Your goal in the game is to collect all the food on the board without dying, at which point you win the game. A piece of food is represented by the letter F. An empty slot: If a slot is empty on the board, Starman can move into. An empty slot is represented by a period (. ). An Example Starman Board looks like the following. The edge doesn t actually exist. It is just to help you understand the boundary * W.. F 3... W W. 5 F. O Note: the numbers in the example board above are NOT the indices in the board list. Those numbers above are the real row and column numbers, which are what you will need to return from the functions that you will be writing. It will be explained more in detail below. board = [[ *,.,.,.,. ], [., W,.,., F ], [ F,., O,.,. ]] As mentioned earlier, the top-left corner slot is represented by board[0][0], and the bottom-right corner slot is represented by board[4][4]. Part 0. Warm Up (10 points) First, study grid print for and grid print while as described in ps3.py. After that, complete the functions find in grid1 and find in grid2 also given in ps3.py. Part I. find starman (15 points) Complete the function find starman given in ps3.py. This function takes one parameter (board), which is a list of five sub-lists representing a game board. This function should scan through the game board, then return the coordinates of Starman (indicated by * ) in the format of a list that looks like this: [row number, column number]. Please note that these are the real row and column numbers, not the indices in the board list. For example, if Starman is located at board[0][1] when represented by the indices in the list, this means that Starman is on row one and column two, thus your function should return [1, 2], not [0, 1]. If Starman cannot be found in the board, your function should return [-1, -1]. However, you may assume that there will always be at most one Starman on the board, meaning there will be no case with two or more Starmans on the board at the same time. 2

3 Here are some example calls: board1 = [[ *,.,.,.,. ], [., W,.,., F ], [ F,., O,.,. ]] board2 = [[., W, W, W, W ], [ F, W,.,., F ], [., O,., W,. ], [.,., *, W,. ], [ O,., O,.,. ]] board3 = [[ O,.,.,.,. ], [., *,.,., F ], [.,.,., O,. ], [.,.,., O,. ], [ F,.,.,.,. ]] find_starman(board1) # returns [1, 1] find_starman(board2) # returns [4, 3] find_starman(board3) # returns [2, 2] General Tasks for Parts II through V For the following four parts you will be working on four movement functions that move Starman around in four directions (Up/Down/Left/Right). Your functions should update your game board based on the the movement. This means that you should update Starman s location based on the direction it moved, then return Starman s new location in the format [row number, column number]. Special rules apply: Moving into a wall: Starman cannot move through a wall. If a move would cause Starman to hit a wall, do not update the board and just return [-1, -1] to indicate an error. Moving into a pit: This means Starman fell into a pit and the game has ended. Your function should update the board by replacing the O in the pit with the letter X indicating that Starman died there. Also, your function should return the location where Starman died. The * should disappear from the board. Moving towards food: This simply means Starman picked up the food at a location. Replace the food symbol ( F ) with Starman and return Starman s new location. Moving outside of the game board: Since Starman cannot leave the game board, your functions should check for this special case. In the case where a movement would take Starman outside of the game board, do not update the board and just return [-1, -1] to indicate an error. Before you panic: Don t freak out when you see that there are so many parts in this problem set. Parts II through V are basically asking you to write four very similar functions of the same logic. Once you write on of the functions, you should be able to write the rest with ease. Part II. Move Starman Up (15 points) Complete the function move up given in ps3.py. This function takes one parameter (board), which represents the current state of the game board. This function should move Starman up by one row, update the game board (if needed), and then return Starman s new location as [row number, column number]. Please note that these are the real row and column numbers, not the indices in the board list. Special rules apply: please check General Tasks for Parts II through V above. 3

4 Here are some example calls: [., F, *, F,. ], [.,., O,.,. ]] board2 = [[., *,., F,. ], [.,., W, F,. ], [ W,., F,.,. ], [ *, O,.,.,. ], move_up(board1) # returns [2, 3] move_up(board2) # returns [-1, -1] move_up(board3) # returns [-1, -1] [.,., *,.,. ], [., F,., F,. ], [.,., O,.,. ]] board2 = [[., *,., F,. ], [.,., W, F,. ], [ W,., F,.,. ], [ *, O,.,.,. ], Part III. Move Starman Down (15 points) Complete the function move down given in ps3.py. This function takes one parameter (board), which represents the current state of the game board. This function should move Starman down by one row, update the game board (if needed), and then return Starman s new location as [row number, column number]. Please note that these are the real row and column numbers, not the indices in the board list. Special rules apply: please check General Tasks for Parts II through V above. Here are some example calls: [., *,.,.,. ], 4

5 [.,., O,.,. ]] board2 = [[.,.,., F,. ], [.,., W, F,. ], [., *, F,.,. ], [ W, *, F,.,. ], move_down(board1) # returns [3, 2] move_down(board2) # returns [-1, -1] move_down(board3) # returns [4, 2] [., *, O, F,. ], [.,., O,.,. ]] board2 = [[.,.,., F,. ], [.,., W, F,. ], [., *, F,.,. ], [ W,., F,.,. ], [ W, X,.,.,. ], Part IV. Move Starman Left (15 points) Complete the function move left given in ps3.py. This function takes one parameter (board), which represents the current state of the game board. This function should move Starman left by one row, update the game board (if needed), and then return Starman s new location as [row number, column number]. Please note that these are the real row and column numbers, not the indices in the board list. Special rules apply: please check General Tasks for Parts II through V above. Here are some example calls: [ *,., O,.,. ]] board2 = [[., F,., F,. ], 5

6 [ W, W,., O, * ], [ W, *, F,.,. ], move_left(board1) # returns [-1, -1] move_left(board2) # returns [4, 4] move_left(board3) # returns [-1, -1] [ *,., O,.,. ]] board2 = [[., F,., F,. ], [ W, W,., X,. ], [ W, *, F,.,. ], Part V. Move Starman Right (15 points) Complete the function move right given in ps3.py. This function takes one parameter (board), which represents the current state of the game board. This function should move Starman right by one row, update the game board (if needed), and then return Starman s new location as [row number, column number]. Please note that these are the real row and column numbers, not the indices in the board list. Special rules apply: please check General Tasks for Parts II through V above. Here are some example calls: board1 = [[ F, F, F,., W ], [., *,.,.,. ], [., O, O,.,. ]] board2 = [[ F, W, F,., W ], [., *, O, F,. ], [ W,.,.,.,. ], [., W, O,.,. ]] 6

7 [ W, *, F,.,. ], move_right(board1) # returns [4, 3] move_right(board2) # returns [3, 3] move_right(board3) # returns [3, 3] board1 = [[ F, F, F,., W ], [.,., *,.,. ], [., O, O,.,. ]] board2 = [[ F, W, F,., W ], [.,., X, F,. ], [ W,.,.,.,. ], [., W, O,.,. ]] [ W,., *,.,. ], Part VI. Move Starman by Movement Commands (15 points) Complete the function move given in ps3.py. This function takes two parameters, in this order: 1. board: a game board. 2. movement: a string that represents what kind of movement Starman needs to perform. Four movement commands are as follows: U : go up one row. D : go down one row. L : to left one column. R : go right one column. Note: You may assume that the movement is always one of the four valid ones in this part. This function should call the four functions that you wrote for Parts II through V above. Your move function should check the value of movement and then perform the corresponding movement by calling the appropriate function you wrote in Parts II through V. Your move function must also return the value that is returned by one of the four functions that it calls. As an example, if the value of movement is U, then move will return whatever value is returned by move up. Hint: Don t over-think this problem. It is literally a conditional statement with four branches based on movement s value. Under each branch of the conditional statement you call one of the four move X functions and return the result from the function that was called. Here are some example calls: 7

8 board1 = [[., W, W,., W ], [ F, F,.,., F ], [., O,., W, * ], [ O,., O,.,. ]] board2 = [[., F,., F,. ], [.,., O, *,. ], [.,.,., W,. ]] board3 = [[ F, W, F,., W ], [ W, *, O, F,. ], [ W,.,.,.,. ], [., W, O,.,. ]] board4 = [[., O,.,.,. ], [., F, F,.,. ], [ W, *, F, F,. ], [ F, O,.,.,. ], move(board1, U ) # returns [2, 5] move(board2, D ) # returns [4, 4] move(board3, L ) # returns [-1, -1] move(board4, R ) # returns [3, 3] board1 = [[., W, W,., W ], [ F, F,.,., * ], [., O,., W,. ], [ O,., O,.,. ]] board2 = [[., F,., F,. ], [ W, W,., X,. ], [.,.,., W,. ]] board3 = [[ F, W, F,., W ], [ W, *, O, F,. ], [ W,.,.,.,. ], [., W, O,.,. ]] board4 = [[., O,.,.,. ], [., F, F,.,. ], [ W,., *, F,. ], [ F, O,.,.,. ], 8

The State Universtiy of New York, Korea Computer Science

The State Universtiy of New York, Korea Computer Science The State Universtiy of New York, Korea Computer Science CSE 101 Handout 10: PS 8 December7, 2017 This problem set is due Wednesday, December 13 at 2:00pm, KST. Note that that the due date that you see

More information

CS 134 Programming Exercise 9:

CS 134 Programming Exercise 9: CS 134 Programming Exercise 9: Nibbles Objective: To gain experience working with 2 dimensional arrays. The Problem Nibbles is a snake. Nibbles moves around a field, looking for food. Unfortunately, Nibbles

More information

Programming Exercise

Programming Exercise Programming Exercise Nibbles Objective: To gain experience working with 2 dimensional arrays. The Problem Nibbles is a snake. Nibbles moves around a field, looking for food. Unfortunately, Nibbles is not

More information

Lab 4: Super Sudoku Solver CSCI 2101 Fall 2017

Lab 4: Super Sudoku Solver CSCI 2101 Fall 2017 Due: Wednesday, October 18, 11:59 pm Collaboration Policy: Level 1 Group Policy: Pair-Optional Lab 4: Super Sudoku Solver CSCI 2101 Fall 2017 In this week s lab, you will write a program that can solve

More information

CSCI 204 Introduction to Computer Science II

CSCI 204 Introduction to Computer Science II CSCI 204 Project 2 Maze Assigned: Wednesday 09/27/2017 First Phase (Recursion) Due Friday, 10/06/2017 Second Phase (Stack) Due Monday, 10/16/2017 1 Objective The purpose of this assignment is to give you

More information

This homework has an opportunity for substantial extra credit, which is described at the end of this document.

This homework has an opportunity for substantial extra credit, which is described at the end of this document. CS 2316 Pair Homework Box Packer Due: Tuesday, June 17th, before 11:55 PM Out of 100 points Files to submit: 1. boxpacker.py For Help: - TA Helpdesk Schedule posted on class website. - Email TA's or use

More information

CPSC 217 Assignment 3

CPSC 217 Assignment 3 CPSC 217 Assignment 3 Due: Monday November 23, 2015 at 12:00 noon Weight: 7% Sample Solution Length: 135 lines, including some comments (not including the provided code) Individual Work: All assignments

More information

CMSC 201 Spring 2018 Project 2 Battleship

CMSC 201 Spring 2018 Project 2 Battleship CMSC 201 Spring 2018 Project 2 Battleship Assignment: Project 2 Battleship Due Date: Design Document: Friday, April 13th, 2018 by 8:59:59 PM Project: Friday, April 20th, 2018 by 8:59:59 PM Value: 80 points

More information

CSE 504: Compiler Design

CSE 504: Compiler Design http://xkcd.com/303/ Compiler Design Course Organization CSE 504 1 / 20 CSE 504: Compiler Design http://www.cs.stonybrook.edu/~cse504/ Mon., Wed. 2:30pm 3:50pm Harriman Hall 116 C. R. Ramakrishnan e-mail:

More information

Major Assignment: Pacman Game

Major Assignment: Pacman Game Major Assignment: Pacman Game 300580 Programming Fundamentals Week 10 Assignment The major assignment involves producing a Pacman style game with Clara using the Greenfoot files that are given to you.

More information

CMSC 201 Spring 2018 Project 3 Minesweeper

CMSC 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 information

While Loops A while loop executes a statement as long as a condition is true while condition: statement(s) Statement may be simple or compound Typical

While Loops A while loop executes a statement as long as a condition is true while condition: statement(s) Statement may be simple or compound Typical Recommended Readings Chapter 5 Topic 5: Repetition Are you saying that I am redundant? That I repeat myself? That I say the same thing over and over again? 1 2 Repetition So far, we have learned How to

More information

Excel Basics: Working with Spreadsheets

Excel Basics: Working with Spreadsheets Excel Basics: Working with Spreadsheets E 890 / 1 Unravel the Mysteries of Cells, Rows, Ranges, Formulas and More Spreadsheets are all about numbers: they help us keep track of figures and make calculations.

More information

To practice overall problem-solving skills, as well as general design of a program

To practice overall problem-solving skills, as well as general design of a program Programming Assignment 5 Due March 27, 2015 at 11:59 PM Objectives To gain experience with file input/output techniques To gain experience with formatting output To practice overall problem-solving skills,

More information

CS 142 Style Guide Grading and Details

CS 142 Style Guide Grading and Details CS 142 Style Guide Grading and Details In the English language, there are many different ways to convey a message or idea: some ways are acceptable, whereas others are not. Similarly, there are acceptable

More information

CS 210 Fundamentals of Programming I Spring 2015 Programming Assignment 4

CS 210 Fundamentals of Programming I Spring 2015 Programming Assignment 4 CS 210 Fundamentals of Programming I Spring 2015 Programming Assignment 4 20 points Out: February 18/19, 2015 Due: February 25/26, 2015 Reminder: This is a programming assignment, and work on this assignment

More information

Assignment #1: /Survey and Karel the Robot Karel problems due: 1:30pm on Friday, October 7th

Assignment #1:  /Survey and Karel the Robot Karel problems due: 1:30pm on Friday, October 7th Mehran Sahami Handout #7 CS 06A September 8, 06 Assignment #: Email/Survey and Karel the Robot Karel problems due: :0pm on Friday, October 7th Email and online survey due: :9pm on Sunday, October 9th Part

More information

Mehran Sahami Handout #7 CS 106A September 24, 2014

Mehran Sahami Handout #7 CS 106A September 24, 2014 Mehran Sahami Handout #7 CS 06A September, 0 Assignment #: Email/Survey and Karel the Robot Karel problems due: :pm on Friday, October rd Email and online survey due: :9pm on Sunday, October th Part I

More information

Com 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 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 information

CS201 - Assignment 3, Part 2 Due: Wednesday March 5, at the beginning of class

CS201 - Assignment 3, Part 2 Due: Wednesday March 5, at the beginning of class CS201 - Assignment 3, Part 2 Due: Wednesday March 5, at the beginning of class For this assignment we will be developing a text-based Tic Tac Toe game 1. The key to this assignment is that we re going

More information

Open Book Format.docx. Headers and Footers. Microsoft Word Part 3 Office 2016

Open Book Format.docx. Headers and Footers. Microsoft Word Part 3 Office 2016 Microsoft Word Part 3 Office 2016 Open Book Format.docx Headers and Footers If your document has a page number, you already have a header or footer (and can double click on it to open it). If you did not

More information

CMPSC 111 Introduction to Computer Science I Fall 2016 Lab 8 Assigned: October 26, 2016 Due: November 2, 2016 by 2:30pm

CMPSC 111 Introduction to Computer Science I Fall 2016 Lab 8 Assigned: October 26, 2016 Due: November 2, 2016 by 2:30pm 1 CMPSC 111 Introduction to Computer Science I Fall 2016 Lab 8 Assigned: October 26, 2016 Due: November 2, 2016 by 2:30pm Objectives To enhance your experience with designing and implementing your own

More information

PeopleSoft (version 9.1): Introduction to the Query Tool

PeopleSoft (version 9.1): Introduction to the Query Tool PeopleSoft (version 9.1): Introduction to the Query Tool Introduction This training material introduces you to some of the basic functions of the PeopleSoft (PS) Query tool as they are used at the University

More information

Assignment #1: and Karel the Robot Karel problems due: 3:15pm on Friday, October 4th due: 11:59pm on Sunday, October 6th

Assignment #1:  and Karel the Robot Karel problems due: 3:15pm on Friday, October 4th  due: 11:59pm on Sunday, October 6th Mehran Sahami Handout #7 CS 06A September, 0 Assignment #: Email and Karel the Robot Karel problems due: :pm on Friday, October th Email due: :9pm on Sunday, October 6th Part I Email Based on a handout

More information

Lab 1: Silver Dollar Game 1 CSCI 2101B Fall 2018

Lab 1: Silver Dollar Game 1 CSCI 2101B Fall 2018 Lab 1: Silver Dollar Game 1 CSCI 2101B Fall 2018 Due: Tuesday, September 18, 11:59 pm Collaboration Policy: Level 1 (review full policy for details) Group Policy: Individual This lab will give you experience

More information

CS 201 Advanced Object-Oriented Programming Lab 6 - Sudoku, Part 2 Due: March 10/11, 11:30 PM

CS 201 Advanced Object-Oriented Programming Lab 6 - Sudoku, Part 2 Due: March 10/11, 11:30 PM CS 201 Advanced Object-Oriented Programming Lab 6 - Sudoku, Part 2 Due: March 10/11, 11:30 PM Introduction to the Assignment In this lab, you will finish the program to allow a user to solve Sudoku puzzles.

More information

15-110: Principles of Computing, Spring 2018

15-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 information

Programming Project 1

Programming Project 1 Programming Project 1 Handout 6 CSCI 134: Fall, 2016 Guidelines A programming project is a laboratory that you complete on your own, without the help of others. It is a form of take-home exam. You may

More information

CSci 1113: Introduction to C/C++ Programming for Scientists and Engineers Homework 10 Spring 2018

CSci 1113: Introduction to C/C++ Programming for Scientists and Engineers Homework 10 Spring 2018 CSci 1113: Introduction to C/C++ Programming for Scientists and Engineers Homework 10 Spring 2018 Due Date: Thursday, May 3, 2018 before 11:55pm. Instructions: This is an individual homework assignment.

More information

ASSIGNMENT 2. COMP-202A, Fall 2013, All Sections. Due: October 20 th, 2013 (23:59)

ASSIGNMENT 2. COMP-202A, Fall 2013, All Sections. Due: October 20 th, 2013 (23:59) ASSIGNMENT 2 COMP-202A, Fall 2013, All Sections Due: October 20 th, 2013 (23:59) Please read the entire PDF before starting. You must do this assignment individually and, unless otherwise specified, you

More information

New York University Computer Science Department Courant Institute of Mathematical Sciences

New York University Computer Science Department Courant Institute of Mathematical Sciences New York University Computer Science Department Courant Institute of Mathematical Sciences Course Title: Data Communications & Networks Course Number: g22.2662-001 Instructor: Jean-Claude Franchitti Session:

More information

2D Array Practice. Lecture 26

2D Array Practice. Lecture 26 2D Array Practice Lecture 26 Announcements Worksheet 6 and Problem Set 6 Posted to COMP110.com Final Deliverables of the Semester! PS6 - Compstagram Demo Regular Review Session Schedule General - Wednesday

More information

CS108, Stanford Handout #3. HW1 CodeCamp

CS108, Stanford Handout #3. HW1 CodeCamp CS108, Stanford Handout #3 Fall, 2008-09 Osvaldo Jiménez HW1 CodeCamp Thanks to Nick Parlante for much of this handout For this first homework, you will run through a series of small coding problems to

More information

Physics 3620/6620 Test # 1-1 -

Physics 3620/6620 Test # 1-1 - Physics 3620/6620 Test # 1-1 - The test is worth 100 points, but a maximum of 120 points are available Problems 1-3 are worth a maximum of 20 points each, and problem #4, with the VI, is worth a maximum

More information

15-110: Principles of Computing, Spring 2018

15-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 information

Data Types primitive, arrays, objects Java overview Primitive data types in Java

Data Types primitive, arrays, objects Java overview Primitive data types in Java Data Types primitive, arrays, objects Java overview Primitive data types in Java 46 Recap Day 2! Lessons Learned:! Sample run vs. pseudocode! Java program structure: set-up, then real statements, decent

More information

Claremont McKenna College Computer Science

Claremont McKenna College Computer Science Claremont McKenna College Computer Science CS 51 Handout 4: Problem Set 4 February 10, 2011 This problem set is due 11:50pm on Wednesday, February 16. As usual, you may hand in yours until I make my solutions

More information

: Principles of Imperative Computation. Fall Assignment 5: Interfaces, Backtracking Search, Hash Tables

: Principles of Imperative Computation. Fall Assignment 5: Interfaces, Backtracking Search, Hash Tables 15-122 Assignment 3 Page 1 of 12 15-122 : Principles of Imperative Computation Fall 2012 Assignment 5: Interfaces, Backtracking Search, Hash Tables (Programming Part) Due: Monday, October 29, 2012 by 23:59

More information

HW2: MIPS ISA Profs. Daniel A. Menasce, Yutao Zhong, and Duane King Fall 2017 Department of Computer Science George Mason University

HW2: MIPS ISA Profs. Daniel A. Menasce, Yutao Zhong, and Duane King Fall 2017 Department of Computer Science George Mason University HW2: MIPS ISA Profs. Daniel A. Menasce, Yutao Zhong, and Duane King Fall 2017 Department of Computer Science George Mason University Task: Due October 13 th, 23:59pm No Late Submissions Accepted There

More information

Part 1. Creating an Array of Controls or Indicators

Part 1. Creating an Array of Controls or Indicators NAME EET 2259 Lab 9 Arrays OBJECTIVES -Write LabVIEW programs using arrays. Part 1. Creating an Array of Controls or Indicators Here are the steps you follow to create an array of indicators or controls

More information

CS 2110 Summer 2011: Assignment 2 Boggle

CS 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 information

Frequently Asked Questions Contents

Frequently Asked Questions Contents Frequently Asked Questions Contents How do I open a saved application?... 2 How do I print my application?... 3 Is there a time limit on how long my session lasts?... 5 Is it alright to use my Web browser

More information

Carnegie Mellon University Department of Computer Science /615 - Database Applications C. Faloutsos & A. Pavlo, Fall 2015

Carnegie Mellon University Department of Computer Science /615 - Database Applications C. Faloutsos & A. Pavlo, Fall 2015 Carnegie Mellon University Department of Computer Science 15-415/615 - Database Applications C. Faloutsos & A. Pavlo, Fall 2015 Homework 3 (by Anna Etzel) Due: hard and e-copy at 3:00pm, on Wednesday,

More information

CSCI 1301: Introduction to Computing and Programming Spring 2018 Project 3: Hangman 2.0 (A Word Guessing Game)

CSCI 1301: Introduction to Computing and Programming Spring 2018 Project 3: Hangman 2.0 (A Word Guessing Game) Introduction In this project, you are going to implement the word guessing game, Hangman 2.0. Your program is going to get a random word from an enumerated list (instructions below) and then let the user

More information

Lecture Notes for Chapter 2: Getting Started

Lecture Notes for Chapter 2: Getting Started Instant download and all chapters Instructor's Manual Introduction To Algorithms 2nd Edition Thomas H. Cormen, Clara Lee, Erica Lin https://testbankdata.com/download/instructors-manual-introduction-algorithms-2ndedition-thomas-h-cormen-clara-lee-erica-lin/

More information

Twelfth Annual Ohio Wesleyan University Programming Contest April 7, 2018 Rules: 1. There are six questions to be completed in four hours. 2.

Twelfth Annual Ohio Wesleyan University Programming Contest April 7, 2018 Rules: 1. There are six questions to be completed in four hours. 2. Twelfth Annual Ohio Wesleyan University Programming Contest April 7, 2018 Rules: 1. There are six questions to be completed in four hours. 2. All questions require you to read the test data from standard

More information

CS 1110, LAB 1: PYTHON EXPRESSIONS.

CS 1110, LAB 1: PYTHON EXPRESSIONS. CS 1110, LAB 1: PYTHON EXPRESSIONS Name: Net-ID: There is an online version of these instructions at http://www.cs.cornell.edu/courses/cs1110/2012fa/labs/lab1 You may wish to use that version of the instructions.

More information

Homework 3 - Dumb Notes

Homework 3 - Dumb Notes Homework 3 - Dumb Notes Due Date: 2/14/19 by 11:59pm For this homework you will use Fragments, Intent filters, and a custom ArrayAdapter to build a simple note-taking app. The app provides functionality

More information

CS Final Exam Review Suggestions - Spring 2018

CS Final Exam Review Suggestions - Spring 2018 CS 328 - Final Exam Review Suggestions p. 1 CS 328 - Final Exam Review Suggestions - Spring 2018 last modified: 2018-05-03 Based on suggestions from Prof. Deb Pires from UCLA: Because of the research-supported

More information

King Abdulaziz University Faculty of Computing and Information Technology Computer Science Department

King Abdulaziz University Faculty of Computing and Information Technology Computer Science Department King Abdulaziz University Faculty of Computing and Information Technology Computer Science Department CPCS202, 1 st Term 2016 (Fall 2015) Program 5: FCIT Grade Management System Assigned: Thursday, December

More information

Title and Modify Page Properties

Title and Modify Page Properties Dreamweaver After cropping out all of the pieces from Photoshop we are ready to begin putting the pieces back together in Dreamweaver. If we were to layout all of the pieces on a table we would have graphics

More information

Lab 9: Pointers and arrays

Lab 9: Pointers and arrays CMSC160 Intro to Algorithmic Design Blaheta Lab 9: Pointers and arrays 3 Nov 2011 As promised, we ll spend today working on using pointers and arrays, leading up to a game you ll write that heavily involves

More information

5.1. Examples: Going beyond Sequence

5.1. Examples: Going beyond Sequence Chapter 5. Selection In Chapter 1 we saw that algorithms deploy sequence, selection and repetition statements in combination to specify computations. Since that time, however, the computations that we

More information

Use lists. Use loops. Use conditionals. Define and use functions. Create and use code modules

Use lists. Use loops. Use conditionals. Define and use functions. Create and use code modules Hunt the Wumpus Objectives Use lists Use loops Use conditionals Define and use functions Create and use code modules Assignment Hunt the Wumpus is a game that has been around in computing for over 40 years.

More information

You might think of Windows XP as a set of cool accessories, such as

You might think of Windows XP as a set of cool accessories, such as Controlling Applications under Windows You might think of Windows XP as a set of cool accessories, such as games, a calculator, and an address book, but Windows is first and foremost an operating system.

More information

Homework Assignment #3

Homework Assignment #3 CS 540-2: Introduction to Artificial Intelligence Homework Assignment #3 Assigned: Monday, February 20 Due: Saturday, March 4 Hand-In Instructions This assignment includes written problems and programming

More information

Introduction to Computer Science with MakeCode for Minecraft

Introduction to Computer Science with MakeCode for Minecraft Introduction to Computer Science with MakeCode for Minecraft Lesson 4: Variables In this lesson, we ll explore the concept of a variable, an important way to store information and make your programs more

More information

Control Structures. Lecture 4 COP 3014 Fall September 18, 2017

Control Structures. Lecture 4 COP 3014 Fall September 18, 2017 Control Structures Lecture 4 COP 3014 Fall 2017 September 18, 2017 Control Flow Control flow refers to the specification of the order in which the individual statements, instructions or function calls

More information

CS 1510: Intro to Computing - Fall 2017 Assignment 8: Tracking the Greats of the NBA

CS 1510: Intro to Computing - Fall 2017 Assignment 8: Tracking the Greats of the NBA CS 1510: Intro to Computing - Fall 2017 Assignment 8: Tracking the Greats of the NBA Code Due: Tuesday, November 7, 2017, by 11:59 p.m. The Assignment The purpose of this assignment is to give you more

More information

CPSC 217 Assignment 4

CPSC 217 Assignment 4 CPSC 217 Assignment 4 Due: Friday December 8, 2017 at 11:55pm Weight: 7% Sample Solution Length: Approximately 130 lines (No comments and no code for the A+ part) Individual Work: All assignments in this

More information

Assignment 5: Part 1 (COMPLETE) Sprites on a Plane

Assignment 5: Part 1 (COMPLETE) Sprites on a Plane Assignment 5: Part 1 (COMPLETE) Sprites on a Plane COMP-202B, Winter 2011, All Sections Due: Wednesday, April 6, 2011 (13:00) This assignment comes in TWO parts. Part 2 of the assignment will be published

More information

Programming Standards: You must conform to good programming/documentation standards. Some specifics:

Programming Standards: You must conform to good programming/documentation standards. Some specifics: CS3114 (Spring 2011) PROGRAMMING ASSIGNMENT #3 Due Thursday, April 7 @ 11:00 PM for 100 points Early bonus date: Wednesday, April 6 @ 11:00 PM for a 10 point bonus Initial Schedule due Thursday, March

More information

CS 248 Assignment 2 Polygon Scan Converter. CS248 Presented by Abe Davis Stanford University October 17, 2008

CS 248 Assignment 2 Polygon Scan Converter. CS248 Presented by Abe Davis Stanford University October 17, 2008 CS 248 Assignment 2 Polygon Scan Converter CS248 Presented by Abe Davis Stanford University October 17, 2008 Announcements First thing: read README.animgui. It should tell you everything you need to know

More information

ENGR 40M Project 3c: Coding the raindrop pattern

ENGR 40M Project 3c: Coding the raindrop pattern ENGR 40M Project 3c: Coding the raindrop pattern For due dates, see the overview handout The raindrop pattern works like this: Once per time period (say, 150 ms), (a) move the pattern one plane down: the

More information

CS Problem Solving and Object-Oriented Programming

CS Problem Solving and Object-Oriented Programming CS 101 - Problem Solving and Object-Oriented Programming Lab 5 - Draw a Penguin Due: October 28/29 Pre-lab Preparation Before coming to lab, you are expected to have: Read Bruce chapters 1-3 Introduction

More information

CS 115 Lecture 8. Selection: the if statement. Neil Moore

CS 115 Lecture 8. Selection: the if statement. Neil Moore CS 115 Lecture 8 Selection: the if statement Neil Moore Department of Computer Science University of Kentucky Lexington, Kentucky 40506 neil@cs.uky.edu 24 September 2015 Selection Sometime we want to execute

More information

Flowcharts for Picaxe BASIC

Flowcharts for Picaxe BASIC Flowcharts for Picaxe BASIC Tech Studies Page 1 of 11 In the college you will use the PICAXE Programming Environment in order to carry out all of your program writing, simulating and downloading to the

More information

CS2 Practical 2 CS2Ah

CS2 Practical 2 CS2Ah CS2 Practical 2 Finite automata This practical is based on material in the language processing thread. The practical is made up of two parts. Part A consists of four paper and pencil exercises, designed

More information

Practice Midterm Examination #1

Practice Midterm Examination #1 Eric Roberts Handout #35 CS106A May 2, 2012 Practice Midterm Examination #1 Review session: Sunday, May 6, 7:00 9:00 P.M., Hewlett 200 Midterm exams: Tuesday, May 8, 9:00 11:00 A.M., CEMEX Auditorium Tuesday,

More information

a f b e c d Figure 1 Figure 2 Figure 3

a f b e c d Figure 1 Figure 2 Figure 3 CS2604 Fall 2001 PROGRAMMING ASSIGNMENT #4: Maze Generator Due Wednesday, December 5 @ 11:00 PM for 125 points Early bonus date: Tuesday, December 4 @ 11:00 PM for 13 point bonus Late date: Thursday, December

More information

CSE115 Lab 9 Fall 2016

CSE115 Lab 9 Fall 2016 DUE DATES: Monday recitations: 8:00 PM on 11/13 Wednesday recitations: 8:00 PM on 11/15 Thursday recitations: 8:00 PM on 11/16 Friday recitations: 8:00 PM on 11/17 Saturday recitations: 8:00 PM on 11/18

More information

Fall 2017 Discussion 7: October 25, 2017 Solutions. 1 Introduction. 2 Primitives

Fall 2017 Discussion 7: October 25, 2017 Solutions. 1 Introduction. 2 Primitives CS 6A Scheme Fall 207 Discussion 7: October 25, 207 Solutions Introduction In the next part of the course, we will be working with the Scheme programming language. In addition to learning how to write

More information

CMSC 201 Fall 2016 Lab 09 Advanced Debugging

CMSC 201 Fall 2016 Lab 09 Advanced Debugging CMSC 201 Fall 2016 Lab 09 Advanced Debugging Assignment: Lab 09 Advanced Debugging Due Date: During discussion Value: 10 points Part 1: Introduction to Errors Throughout this semester, we have been working

More information

The name of our class will be Yo. Type that in where it says Class Name. Don t hit the OK button yet.

The name of our class will be Yo. Type that in where it says Class Name. Don t hit the OK button yet. Mr G s Java Jive #2: Yo! Our First Program With this handout you ll write your first program, which we ll call Yo. Programs, Classes, and Objects, Oh My! People regularly refer to Java as a language that

More information

Faculty Guide to Blackboard

Faculty Guide to Blackboard Faculty Guide to Blackboard August 2012 1 Table of Contents Description of Blackboard... 3 Uses of Blackboard... 3 Hardware Configurations and Web Browsers... 3 Logging Into Blackboard... 3 Customizing

More information

CSCI544, Fall 2016: Assignment 2

CSCI544, Fall 2016: Assignment 2 CSCI544, Fall 2016: Assignment 2 Due Date: October 28 st, before 4pm. Introduction The goal of this assignment is to get some experience implementing the simple but effective machine learning model, the

More information

Programming Project 5: NYPD Motor Vehicle Collisions Analysis

Programming Project 5: NYPD Motor Vehicle Collisions Analysis : NYPD Motor Vehicle Collisions Analysis Due date: Dec. 7, 11:55PM EST. You may discuss any of the assignments with your classmates and tutors (or anyone else) but all work for all assignments must be

More information

How to program with Matlab (PART 1/3)

How to program with Matlab (PART 1/3) Programming course 1 09/12/2013 Martin SZINTE How to program with Matlab (PART 1/3) Plan 0. Setup of Matlab. 1. Matlab: the software interface. - Command window - Command history - Section help - Current

More information

EECS 183. Week 3 - Diana Gage. www-personal.umich.edu/ ~drgage

EECS 183. Week 3 - Diana Gage. www-personal.umich.edu/ ~drgage EECS 183 Week 3 - Diana Gage www-personal.umich.edu/ ~drgage Upcoming Deadlines Lab 3 and Assignment 3 due October 2 nd (this Friday) Project 2 will be due October 6 th (a week from Friday) Get started

More information

Lab 1 Introduction to R

Lab 1 Introduction to R Lab 1 Introduction to R Date: August 23, 2011 Assignment and Report Due Date: August 30, 2011 Goal: The purpose of this lab is to get R running on your machines and to get you familiar with the basics

More information

Banner XE Faculty Grading

Banner XE Faculty Grading Banner XE Faculty Grading Instructions Logging into the application: 1. Log into DrexelOne (http://one.drexel.edu) 2. Select Faculty at the top of the Welcome page 3. Select More BannerWeb Faculty Services

More information

ECE 449, Fall 2017 Computer Simulation for Digital Logic Project Instruction

ECE 449, Fall 2017 Computer Simulation for Digital Logic Project Instruction ECE 449, Fall 2017 Computer Simulation for Digital Logic Project Instruction 1 Summary We present in this document the project instruction for ECE 449 including the grading policy. Our goal is to build

More information

Working with Track Changes: A Guide

Working with Track Changes: A Guide Working with Track Changes: A Guide Prepared by Chris Cameron & Lesley-Anne Longo The Editing Company Working with Track Changes: A Guide While many people may think of editors hunched over their desks,

More information

CS211 Computers and Programming Matthew Harris and Alexa Sharp July 9, Boggle

CS211 Computers and Programming Matthew Harris and Alexa Sharp July 9, Boggle Boggle If you are not familiar with the game Boggle, the game is played with 16 dice that have letters on all faces. The dice are randomly deposited into a four-by-four grid so that the players see the

More information

APPM/MATH Problem Set 4 Solutions

APPM/MATH Problem Set 4 Solutions APPM/MATH 465 Problem Set 4 Solutions This assignment is due by 4pm on Wednesday, October 16th. You may either turn it in to me in class on Monday or in the box outside my office door (ECOT 35). Minimal

More information

CS2223: Algorithms D-Term, Assignment 5

CS2223: Algorithms D-Term, Assignment 5 CS2223: Algorithms D-Term, 2015 Assignment 5 Teams: To be done individually Due date: 05/01/2015 (1:50 PM) Note: no late submission of HW5 will be accepted; we will talk about the solution of HW5 during

More information

Practice Midterm Examination

Practice Midterm Examination Mehran Sahami Handout #28 CS106A October 23, 2013 Practice Midterm Examination Midterm Time: Tuesday, October 29th, 7:00P.M. 9:00P.M. Midterm Location (by last name): Last name starts with A-L: go to Dinkelspiel

More information

Lab Assignment. Lab 5: Dynamic Programming. Assignment Preparation. Is It a Text Problem. .. Fall 2017 CSC/CPE 349: Algorithms Alexander Dekhtyar..

Lab Assignment. Lab 5: Dynamic Programming. Assignment Preparation. Is It a Text Problem. .. Fall 2017 CSC/CPE 349: Algorithms Alexander Dekhtyar.. .. Fall 2017 CSC/CPE 349: Algorithms Alexander Dekhtyar.. Lab 5: Dynamic Programming Due date: Friday, December 1, 11:59pm. Lab Assignment Assignment Preparation This is an individual lab. The goal of

More information

Hands on Assignment 1

Hands on Assignment 1 Hands on Assignment 1 CSci 2021-10, Fall 2018. Released Sept 10, 2018. Due Sept 24, 2018 at 11:55 PM Introduction Your task for this assignment is to build a command-line spell-checking program. You may

More information

WORD BASICS: MICROSOFT OFFICE 2010

WORD BASICS: MICROSOFT OFFICE 2010 WORD BASICS: MICROSOFT OFFICE 2010 GETTING STARTED PAGE 02 Prerequisites What You Will Learn USING MICROSOFT WORD PAGE 03 Microsoft Word Components The Keyboard SIMPLE TASKS IN MICROSOFT WORD PAGE 08 Typing

More information

Homework /681: Artificial Intelligence (Fall 2017) Out: October 18, 2017 Due: October 29, 2017 at 11:59PM

Homework /681: Artificial Intelligence (Fall 2017) Out: October 18, 2017 Due: October 29, 2017 at 11:59PM Homework 2 15-381/681: Artificial Intelligence (Fall 2017) Out: October 18, 2017 Due: October 29, 2017 at 11:59PM Homework Policies Homework is due on Autolab by the posted deadline. Assignments submitted

More information

CMSC 201 Spring 2017 Homework 4 Lists (and Loops and Strings)

CMSC 201 Spring 2017 Homework 4 Lists (and Loops and Strings) CMSC 201 Spring 2017 Homework 4 Lists (and Loops and Strings) Assignment: Homework 4 Lists (and Loops and Strings) Due Date: Friday, March 3rd, 2017 by 8:59:59 PM Value: 40 points Collaboration: For Homework

More information

A simple problem that has a solution that is far deeper than expected!

A simple problem that has a solution that is far deeper than expected! The Water, Gas, Electricity Problem A simple problem that has a solution that is far deeper than expected! Consider the diagram below of three houses and three utilities: water, gas, and electricity. Each

More information

Using Flash Animation Basics

Using Flash Animation Basics Using Flash Contents Using Flash... 1 Animation Basics... 1 Exercise 1. Creating a Symbol... 2 Exercise 2. Working with Layers... 4 Exercise 3. Using the Timeline... 6 Exercise 4. Previewing an animation...

More information

15100 Fall 2005 Final Project

15100 Fall 2005 Final Project 15100 Fall 2005 Final Project Robby Findler & Jacob Matthews 1 Introduction to Sudoku Sudoku is a logic puzzle set on a nine by nine grid. The goal is to fill in the blank spaces in the puzzle with the

More information

CSE 143X: Accelerated Computer Programming I/II HW5: Critters (due Friday, October 30, :30pm)

CSE 143X: Accelerated Computer Programming I/II HW5: Critters (due Friday, October 30, :30pm) CSE 143X: Accelerated Computer Programming I/II HW5: Critters (due Friday, October 30, 2015 11:30pm) This assignment focuses on Objects and Classes. Turn in the following files using the link on the course

More information

CS446: Machine Learning Fall Problem Set 4. Handed Out: October 17, 2013 Due: October 31 th, w T x i w

CS446: Machine Learning Fall Problem Set 4. Handed Out: October 17, 2013 Due: October 31 th, w T x i w CS446: Machine Learning Fall 2013 Problem Set 4 Handed Out: October 17, 2013 Due: October 31 th, 2013 Feel free to talk to other members of the class in doing the homework. I am more concerned that you

More information

Overview and Instructions

Overview and Instructions AE Mobility Tracking Tool July 30, 2013 Overview and Instructions Sheet-specific Instructions Welcome Instructions Common Qs & As MobilityLog & Data Entry Reports: Graphs & Charts Data for Website Entry

More information

Recommended Design Techniques for ECE241 Project Franjo Plavec Department of Electrical and Computer Engineering University of Toronto

Recommended Design Techniques for ECE241 Project Franjo Plavec Department of Electrical and Computer Engineering University of Toronto Recommed Design Techniques for ECE241 Project Franjo Plavec Department of Electrical and Computer Engineering University of Toronto DISCLAIMER: The information contained in this document does NOT contain

More information

15-110: Principles of Computing, Spring 2018

15-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 information