COSC 1030 Introduction to Computer Science II Assignment 3: Tournaments (Due: March 26 at Noon)

Size: px
Start display at page:

Download "COSC 1030 Introduction to Computer Science II Assignment 3: Tournaments (Due: March 26 at Noon)"

Transcription

1 Main Points COSC 1030 Introduction to Computer Science II Assignment 3: Tournaments (ue: March 26 at Noon) Learning objectives Review Java programming with arrays and singly linked lists Review classes and objects Specification of exception handling ocumentation Testing Assignment Overview Congratulations! You have been hired by the Tournament Scheduling Committee (TSC) to develop and test several Java classes used for scheduling matches in a tournament. The TSC is interested in scheduling matches between a number of players. ach match is played between two players. Matches are scheduled in a number of rounds and on several courts. No two matches in the same round will use the same court. The following table shows a schedule for a round robin tournament with 8 players, 7 rounds, and 7 courts. The players are denoted by letters A-H. In Round 0 the following matches are scheduled: A plays against B in Court 0 C plays against G in Court 3 plays against H in Court 5, and plays against in Court 6 Court 3 Court 4 Court 5 Court 6 Round 0 A,B C,G,H, Round 1, A,C,H G,B Round 2 H,C,G A,,B Round 3 B, G,H A,,C Round 4 G, C, H,B A, Round 5 H,, B,C A, G Round 6 B,,G C, A, H This schedule has number of nice properties, including a) very player plays against every other player exactly once during the tournament, b) very player plays exactly once in every round, and c) very player plays exactly once in each court. Not all tournaments can be scheduled having such nice properties. In this assignment we will not be concerned with how to schedule balanced tournaments. The TSC has asked you to develop a Java class, called Tournament, which could be used to maintain a tournament. The TSC has also mentioned the possibility that some courts may not be used at all and that all matches in a given round may be cancelled. Hence it is possible to have an empty rounds and empty courts

2 After consultation with our senior designers, we decided to encapsulate information about each match in a Java class named Match. This class has already been written for you. In order to save memory space, we decided to use singly linked lists for keeping track of matches in each round and for each court. Hence, for each round, a linked list holds the matches for that round. Also for every court a linked list keeps track of the matches played on that court. These two sets of linked lists, however, share all the matches in the schedule as their nodes. Two arrays, representing rounds and courts hold references to the beginning of the list of matches for rounds and courts respectively. Note that you, yourself, are responsible for implementing the linked list using the Match class. Aside from the two arrays provided in the Tournament class, you may NOT use a linked list from the Java library. As an example, the internal organization of the data for the following tournament is depicted here. Court 3 Court 4 Court 5 Court 6 Round 0 Round 1,,H Round 2 A,,B Round 3 Round 4 G, C, A, Round 5 A, G Round 6 B,,G roundlist CourtList A 3 H B 4 G C A 5 A G 6 B G In the above figure a filled bullet at the end of a link represents a null reference

3 ach node of the linked lists, Match, (see table below) contains the name of player1, the name of player2, the round and court numbers, and link references to the next match in round and the next match in court. These references are required to link matches in the same round and in the same court so they can be conveniently found. The following table describes these fields. round an int in the range of 0 to (number of rounds -1) court an int in the range of 0 to (number of courts -1) player1 a string referencing the name of player 1 player2 a string referencing the name of player 2 nextinround a reference to the next match in this round nextincourt a reference to the next match in this court The code for this class is already written for you. Tasks Complete/develop the following methods and calsses InvalidRoundOrCourtxception Create and document the class InvalidRoundOrCourtxception. This class should extend the Runtimexception class. xceptions of this type are thrown if the specified round or court is not valid in the given tournament. No code is provided for this class. The bodies of incomplete methods in the Tournament class The signatures of these methods and a small description are provided. complete the following methods: You need to public void addmatch(match amatch) throws InvalidRoundOrCourtxception, NullPointerxception - This method adds a new match to the tournament using the two methods: addtoround and addtocourt. If a match with the given coordinates (round, court) has already been scheduled, the method simply replaces the name of the old players with the new ones. private Match findmatch(int round, int court) throws InvalidRoundOrCourtxception - Given coordinates (round, court), the method simply returns a reference to the match node in that position. If no match has been scheduled for (round, court), then this method returns null. It throws an exception if one of round/court is invalid. private void addtoround(match amatch, int round, int court) - Add the given match to the linked list for the given round private void addtocourt(match amatch, int round, int court) - Add the given match to the linked list for the given court public Match removematch(int round, int court) throws InvalidRoundOrCourtxception - Remove the match scheduled in "round" and "court". This method uses the two methods: removeromround and removeromcourt, to remove the match from two singly linked lists. private Match removeromround(int r, int c) - Remove the given match from the singly linked list of the given row - 3 -

4 private Match removeromcourt(int r, int c) - Remove the match from the singly linked list of the given court. IMPORTANT: You should NOT modify the following methods in Tournament: tostring getmatchesinround getmatchesincourt You are NOT allowed to modify the class Match. Note that if the sum of the length of the player's name in a match is longer than "WITH -2", defined in tostring method of Tournamnet, then output will not be properly formatted. Grading A total of 5 marks will be allocated for this assignment, as follows: 1 mark for attending the assignment presentation lab in the week of March 8. 1 mark for showing a partial solution to the assignment to your TA (in person) during the week of March 15, either in the tutorial or during your TAs office hour. 2 marks for correctness as evaluated by testing conducted on the files you submit using the submit command (Noon March 26) 1 mark for discussing solutions with your TA during the tutorial in the week of March 29. Testing and ebugging You may use the provided methods for testing and debugging your code. In particular, the methods: getmatchesinround and getmatchesincourt, can be used to examine whether the nodes are inserted correctly within the structure. You should conduct sufficient number of tests to verify that your program works for all possible cases. A simple test harness has been provided. The test program and its output are as follows: import type.lang.io; public class TestTournament{ public static void main(string[] args){ Tournament m = new Tournament(3, 3); m.addmatch(new Match("Kim", "Tom", 0, 0)); m.addmatch(new Match("Kim", "Liz", 2, 2)); m.addmatch(new Match("Tim", "Bob", 1, 2)); m.addmatch(new Match("Bob", "Hop", 2, 0)); m.addmatch(new Match("Sue", "Sam", 2, 0)); m.removematch(0, 0); for(int i = 0; i < 3; i++) IO.println(m.getMatchesInRound(i)); for(int i =0; i < 3; i++) IO.println(m.getMatchesInCourt(i)); m.addmatch(new Match("Ron", "Kate", 0, 4)); } } - 4 -

5 java TestTournament Round 0: -,- -,- -,- Round 2: -,- -,- -,- Round 2: -,- -,- -,- Round 2: -,- -,- Kim,Liz Round 2: -,- -,- Kim,Liz Round 2: Bob,Hop -,- Kim,Liz Round 2: Sue,Sam -,- Kim,Liz Round 0: -,- -,- -,- Round 2: Sue,Sam -,- Kim,Liz Round 0: Round 1: -> Tim,Bob (1, 2) Round 2: -> Sue,Sam (2, 0) -> Kim,Liz (2, 2) Court 0: -> Sue,Sam (2, 0) Court 1: Court 2: -> Tim,Bob (1, 2) -> Kim,Liz (2, 2) InvalidRoundOrCourtxception: Invald round or court. at Tournament.findMatch(Tournament.java:65) at Tournament.addMatch(Tournament.java:38) at TestTournament.main(TestTournament.java:25) "java TestTournament" completed. > - 5 -

Arrays Classes & Methods, Inheritance

Arrays Classes & Methods, Inheritance Course Name: Advanced Java Lecture 4 Topics to be covered Arrays Classes & Methods, Inheritance INTRODUCTION TO ARRAYS The following variable declarations each allocate enough storage to hold one value

More information

Note: This is a miniassignment and the grading is automated. If you do not submit it correctly, you will receive at most half credit.

Note: 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 information

Lecture 17. For Array Class Shenanigans

Lecture 17. For Array Class Shenanigans Lecture 17 For Array Class Shenanigans For or While? class WhileDemo { public static void main(string[] args){ int count = 1; while (count < 11) { System.out.println("Count is: " + count); count++; Note:

More information

CS/ENGRD 2110 FALL Lecture 2: Objects and classes in Java

CS/ENGRD 2110 FALL Lecture 2: Objects and classes in Java 1 CS/ENGRD 2110 FALL 2017 Lecture 2: Objects and classes in Java http://courses.cs.cornell.edu/cs2110 CMS VideoNote.com, PPT slides, DrJava 2 CMS. Visit course webpage, click Links, then CMS for 2110.

More information

Programming Languages and Techniques (CIS120)

Programming Languages and Techniques (CIS120) Programming Languages and Techniques (CIS120) Lecture 24 March 18, 2016 The Java ASM What is the value of ans at the end of this program? Counter[] a = { new Counter(), new Counter() ; Counter[] b = {

More information

COSC 243. Data Representation 3. Lecture 3 - Data Representation 3 1. COSC 243 (Computer Architecture)

COSC 243. Data Representation 3. Lecture 3 - Data Representation 3 1. COSC 243 (Computer Architecture) COSC 243 Data Representation 3 Lecture 3 - Data Representation 3 1 Data Representation Test Material Lectures 1, 2, and 3 Tutorials 1b, 2a, and 2b During Tutorial a Next Week 12 th and 13 th March If you

More information

CPSC 233: Assignment 4 (Due March 26 at 4 PM)

CPSC 233: Assignment 4 (Due March 26 at 4 PM) CPSC 233: Assignment 4 (Due March 26 at 4 PM) New learning concepts: Problem solving using object-oriented programming. Aside from main() you cannot implement other static methods. Also you should not

More information

COMP 250: Java Programming I. Carlos G. Oliver, Jérôme Waldispühl January 17-18, 2018 Slides adapted from M. Blanchette

COMP 250: Java Programming I. Carlos G. Oliver, Jérôme Waldispühl January 17-18, 2018 Slides adapted from M. Blanchette COMP 250: Java Programming I Carlos G. Oliver, Jérôme Waldispühl January 17-18, 2018 Slides adapted from M. Blanchette Variables and types [Downey Ch 2] Variable: temporary storage location in memory.

More information

What does this print?

What does this print? public class Test { int data; public Test(int x ) { data=x; } public void assign(test b, Test c, int d) { data= 2; b= new Test(2); c.data= 2; d=2; } public static void main(string [] args) { Test a, b,

More information

Summer Session 2004 Prelim I July 12, CUID: NetID:

Summer Session 2004 Prelim I July 12, CUID: NetID: COM S / ENGRD 211 Computers and Programming Summer Session 2004 Prelim I July 12, 2004 Name: CUID: NetID: You have one hour and fifteen minutes to do this exam. All programs must be written in Java. Where

More information

Homework 2: Imperative Due: 5:00 PM, Feb 15, 2019

Homework 2: Imperative Due: 5:00 PM, Feb 15, 2019 CS18 Integrated Introduction to Computer Science Fisler Homework 2: Imperative Due: 5:00 PM, Feb 15, 2019 Contents 1 Overview of Generic/Parameterized Types 2 2 Double the Fun with Doubly-Linked Lists

More information

CSCI 136 Data Structures & Advanced Programming. Lecture 3 Fall 2017 Instructors: Bill & Bill

CSCI 136 Data Structures & Advanced Programming. Lecture 3 Fall 2017 Instructors: Bill & Bill CSCI 136 Data Structures & Advanced Programming Lecture 3 Fall 2017 Instructors: Bill & Bill Administrative Details Lab today in TCL 216 (217a is available, too) Lab is due by 11pm Sunday Copy your folder

More information

Classes and Objects 3/28/2017. How can multiple methods within a Java class read and write the same variable?

Classes and Objects 3/28/2017. How can multiple methods within a Java class read and write the same variable? Peer Instruction 8 Classes and Objects How can multiple methods within a Java class read and write the same variable? A. Allow one method to reference a local variable of the other B. Declare a variable

More information

In this lab we will practice creating, throwing and handling exceptions.

In this lab we will practice creating, throwing and handling exceptions. Lab 5 Exceptions Exceptions indicate that a program has encountered an unforeseen problem. While some problems place programmers at fault (for example, using an index that is outside the boundaries of

More information

CSE 143: Computer Programming II Summer 2015 HW6: 20 Questions (due Thursday, August 13, :30pm)

CSE 143: Computer Programming II Summer 2015 HW6: 20 Questions (due Thursday, August 13, :30pm) CSE 143: Computer Programming II Summer 2015 HW6: 20 Questions (due Thursday, August 13, 2015 11:30pm) This assignment focuses on binary trees and recursion. Turn in the following files using the link

More information

Lecture 5: Methods CS2301

Lecture 5: Methods CS2301 Lecture 5: Methods NADA ALZAHRANI CS2301 1 Opening Problem Find the sum of integers from 1 to 10, from 20 to 30, and from 35 to 45, respectively. 2 Solution public static int sum(int i1, int i2) { int

More information

Lecture 3. COMP1006/1406 (the Java course) Summer M. Jason Hinek Carleton University

Lecture 3. COMP1006/1406 (the Java course) Summer M. Jason Hinek Carleton University Lecture 3 COMP1006/1406 (the Java course) Summer 2014 M. Jason Hinek Carleton University today s agenda assignments 1 (graded) & 2 3 (available now) & 4 (tomorrow) a quick look back primitive data types

More information

ASSIGNMENT 5 Objects, Files, and a Music Player

ASSIGNMENT 5 Objects, Files, and a Music Player ASSIGNMENT 5 Objects, Files, and a Music Player COMP-202A, Fall 2009, All Sections Due: Thursday, December 3, 2009 (23:55) You MUST do this assignment individually and, unless otherwise specified, you

More information

EECS2030 Fall 2016 Preparation Exercise for Lab Test 2: A Birthday Book

EECS2030 Fall 2016 Preparation Exercise for Lab Test 2: A Birthday Book EECS2030 Fall 2016 Preparation Exercise for Lab Test 2: A Birthday Book Chen-Wei Wang Contents 1 Before Getting Started 2 2 Task: Implementing Classes for Birthdays, Entries, and Books 3 2.1 Requirements

More information

CS61B, Fall 2011 Final Examination (corrected) P. N. Hilfinger

CS61B, Fall 2011 Final Examination (corrected) P. N. Hilfinger CS61B, Fall 2011 Final Examination (corrected) P. N. Hilfinger READ THIS PAGE FIRST. Your exam should contain 16 problems on 16 pages. Officially, it is worth 50 points. This is an open-book test. You

More information

CSCI 135 Exam #2 Fundamentals of Computer Science I Fall 2013

CSCI 135 Exam #2 Fundamentals of Computer Science I Fall 2013 CSCI 135 Exam #2 Fundamentals of Computer Science I Fall 2013 Name: This exam consists of 6 problems on the following 6 pages. You may use your two-sided hand-written 8 ½ x 11 note sheet during the exam.

More information

Faculty of Science COMP-202A - Introduction to Computing I (Fall 2008) Midterm Examination

Faculty of Science COMP-202A - Introduction to Computing I (Fall 2008) Midterm Examination First Name: Last Name: McGill ID: Section: Faculty of Science COMP-202A - Introduction to Computing I (Fall 2008) Midterm Examination Tuesday, November 4, 2008 Examiners: Mathieu Petitpas [Section 1] 18:30

More information

Vendor: Oracle. Exam Code: 1Z Exam Name: Java Certified Programmer. Version: Demo

Vendor: Oracle. Exam Code: 1Z Exam Name: Java Certified Programmer. Version: Demo Vendor: Oracle Exam Code: 1Z0-501 Exam Name: Java Certified Programmer Version: Demo QUESTION NO: 1 Which statement is true? A. An anonymous inner class may be declared as final. B. An anonymous inner

More information

1.00 Introduction to Computers and Engineering Problem Solving. Final Examination - May 19, 2004

1.00 Introduction to Computers and Engineering Problem Solving. Final Examination - May 19, 2004 1.00 Introduction to Computers and Engineering Problem Solving Final Examination - May 19, 2004 Name: E-mail Address: TA: Section: You have 3 hours to complete this exam. For coding questions, you do not

More information

Programming Languages and Techniques (CIS120)

Programming Languages and Techniques (CIS120) Programming Languages and Techniques (CIS120) Lecture 23 March 16, 2018 Arrays, Java ASM What is the value of ans at the end of this program? int[] a = {1, 2, 3, 4; int[] b = a; b[0] = 0; int ans = a[0];

More information

New Concepts. Lab 7 Using Arrays, an Introduction

New Concepts. Lab 7 Using Arrays, an Introduction Lab 7 Using Arrays, an Introduction New Concepts Grading: This lab requires the use of the grading sheet for responses that must be checked by your instructor (marked as Question) AND the submission of

More information

COMP 1006/1406: Assignment # 3 Due Monday July 27, 2015, 12:00 Noon Total Marks: 60

COMP 1006/1406: Assignment # 3 Due Monday July 27, 2015, 12:00 Noon Total Marks: 60 COMP 1006/1406: Assignment # 3 Due Monday July 27, 2015, 12:00 Noon Total Marks: 60 Submission Instructions Put all of your written answers in a PDF. Here are some options for how to create a PDF: You

More information

Object Oriented Programming. Java-Lecture 6 - Arrays

Object Oriented Programming. Java-Lecture 6 - Arrays Object Oriented Programming Java-Lecture 6 - Arrays Arrays Arrays are data structures consisting of related data items of the same type In Java arrays are objects -> they are considered reference types

More information

Birkbeck (University of London) Software and Programming 1 In-class Test Mar 2018

Birkbeck (University of London) Software and Programming 1 In-class Test Mar 2018 Birkbeck (University of London) Software and Programming 1 In-class Test 2.1 22 Mar 2018 Student Name Student Number Answer ALL Questions 1. What output is produced when the following Java program fragment

More information

9/19/2018 Programming Data Structures. Polymorphism And Abstract

9/19/2018 Programming Data Structures. Polymorphism And Abstract 9/19/2018 Programming Data Structures Polymorphism And Abstract 1 In-class assignment: deadline noon!! 2 Overview: 4 main concepts in Object-Oriented Encapsulation in Java is a mechanism of wrapping the

More information

University of Cape Town ~ Department of Computer Science. Computer Science 1015F ~ 2007

University of Cape Town ~ Department of Computer Science. Computer Science 1015F ~ 2007 Name: Please fill in your Student Number and Name. Student Number : Student Number: University of Cape Town ~ Department of Computer Science Computer Science 1015F ~ 2007 Final Examination Question Max

More information

1. Introduction. 2. Deliverables

1. Introduction. 2. Deliverables 16.216: ECE Application Programming Summer 2014 Programming Assignment #10: Doubly-Linked Lists Due Friday, 6/27/14, 12:00 PM (noon) NO LATE ASSIGNMENTS 1. Introduction This assignment deals with the combination

More information

CHAPTER 7 OBJECTS AND CLASSES

CHAPTER 7 OBJECTS AND CLASSES CHAPTER 7 OBJECTS AND CLASSES OBJECTIVES After completing Objects and Classes, you will be able to: Explain the use of classes in Java for representing structured data. Distinguish between objects and

More information

CSCI 135 Exam #1 Fundamentals of Computer Science I Fall 2013

CSCI 135 Exam #1 Fundamentals of Computer Science I Fall 2013 CSCI 135 Exam #1 Fundamentals of Computer Science I Fall 2013 Name: This exam consists of 5 problems on the following 7 pages. You may use your two- sided hand- written 8 ½ x 11 note sheet during the exam.

More information

Soda Machine Laboratory

Soda Machine Laboratory Soda Machine Laboratory Introduction This laboratory is intended to give you experience working with multiple queue structures in a familiar real-world setting. The given application models a soda machine

More information

Week 14 Lab A Linked List of Integers Maximum Points = 10

Week 14 Lab A Linked List of Integers Maximum Points = 10 Week 14 Lab A Linked List of Integers Maximum Points = 10 File IntList.java contains definitions for a linked list of integers. The class contains an inner class IntNode that holds information for a single

More information

Arrays. Outline 1/7/2011. Arrays. Arrays are objects that help us organize large amounts of information. Chapter 7 focuses on:

Arrays. Outline 1/7/2011. Arrays. Arrays are objects that help us organize large amounts of information. Chapter 7 focuses on: Arrays Arrays Arrays are objects that help us organize large amounts of information Chapter 7 focuses on: array declaration and use bounds checking and capacity arrays that store object references variable

More information

Student Name: University of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Science

Student Name: University of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Science University of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Science CS 162 Spring 2011 I. Stoica FIRST MIDTERM EXAMINATION Wednesday, March 9, 2011 INSTRUCTIONS

More information

EE 422C HW 6 Multithreaded Programming

EE 422C HW 6 Multithreaded Programming EE 422C HW 6 Multithreaded Programming 100 Points Due: Monday 4/16/18 at 11:59pm Problem A certain theater plays one show each night. The theater has multiple box office outlets to sell tickets, and the

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

Method OverLoading printf method Arrays Declaring and Using Arrays Arrays of Objects Array as Parameters

Method OverLoading printf method Arrays Declaring and Using Arrays Arrays of Objects Array as Parameters Outline Method OverLoading printf method Arrays Declaring and Using Arrays Arrays of Objects Array as Parameters Variable Length Parameter Lists split() Method from String Class Integer & Double Wrapper

More information

Linked Lists. private int num; // payload for the node private Node next; // pointer to the next node in the list }

Linked Lists. private int num; // payload for the node private Node next; // pointer to the next node in the list } Linked Lists Since a variable referencing an object just holds the address of the object in memory, we can link multiple objects together to form dynamic lists or other structures. In our case we will

More information

Object- Oriented Analysis, Design and Programming

Object- Oriented Analysis, Design and Programming Object- Oriented Analysis, Design and Programming Re- examination Medialogy Semester 4 Monday 16 August 2010 09:00 11:00 Instructions You have 2 hours to complete this examination. Neither written material

More information

ASSIGNMENT 5 Objects, Files, and More Garage Management

ASSIGNMENT 5 Objects, Files, and More Garage Management ASSIGNMENT 5 Objects, Files, and More Garage Management COMP-202B, Winter 2010, All Sections Due: Wednesday, April 14, 2009 (23:55) You MUST do this assignment individually and, unless otherwise specified,

More information

INSTRUCTIONS TO CANDIDATES

INSTRUCTIONS TO CANDIDATES NATIONAL UNIVERSITY OF SINGAPORE SCHOOL OF COMPUTING MIDTERM ASSESSMENT FOR Semester 2 AY2017/2018 CS2030 Programming Methodology II March 2018 Time Allowed 90 Minutes INSTRUCTIONS TO CANDIDATES 1. This

More information

COMP Assignment #4 (Due: Mon. Mar 12 noon)

COMP Assignment #4 (Due: Mon. Mar 12 noon) COMP1406 - Assignment #4 (Due: Mon. Mar 5th @ 12 noon) This assignment builds a very simple insurance company system. You will gain practice with inheritance, overriding methods, an abstract class and

More information

The design of an ADT should evolve naturally during the problem-solving process Questions to ask when designing an ADT

The design of an ADT should evolve naturally during the problem-solving process Questions to ask when designing an ADT Designing an ADT The design of an ADT should evolve naturally during the problem-solving process Questions to ask when designing an ADT What data does a problem require? What operations does a problem

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

TA office hours are over after this week, but Dan and Maja will still be around for the next month

TA office hours are over after this week, but Dan and Maja will still be around for the next month TA office hours are over after this week, but Dan and Maja will still be around for the next month Feel free to e-mail me to request an appointment. My schedule is flexible. We will have more office hours

More information

CSCI 136 Written Exam #0 Fundamentals of Computer Science II Spring 2015

CSCI 136 Written Exam #0 Fundamentals of Computer Science II Spring 2015 CSCI 136 Written Exam #0 Fundamentals of Computer Science II Spring 2015 Name: This exam consists of 6 problems on the following 7 pages. You may use your single-sided handwritten 8 ½ x 11 note sheet during

More information

Variables and Java vs C++

Variables and Java vs C++ Variables and Java vs C++ 1 What can be improved? (variables) public void godirection(string directionname) { boolean wenttoroom = false; for (Direction direction : currentroom.getdirections()) { if (direction.getdirectionname().equalsignorecase(directionname))

More information

CS61BL. Lecture 1: Welcome to CS61BL! Intro to Java and OOP Testing Error-handling

CS61BL. Lecture 1: Welcome to CS61BL! Intro to Java and OOP Testing Error-handling CS61BL Lecture 1: Welcome to CS61BL! Intro to Java and OOP Testing Error-handling About me Name: Edwin Liao Email: edliao@berkeley.edu Office hours: Thursday 3pm - 5pm Friday 11am - 1pm 611 Soda Or by

More information

Design Patterns: State, Bridge, Visitor

Design Patterns: State, Bridge, Visitor Design Patterns: State, Bridge, Visitor State We ve been talking about bad uses of case statements in programs. What is one example? Another way in which case statements are sometimes used is to implement

More information

Object Oriented Programming 2015/16. Final Exam June 17, 2016

Object Oriented Programming 2015/16. Final Exam June 17, 2016 Object Oriented Programming 2015/16 Final Exam June 17, 2016 Directions (read carefully): CLEARLY print your name and ID on every page. The exam contains 8 pages divided into 4 parts. Make sure you have

More information

1.00 Introduction to Computers and Engineering Problem Solving Quiz 1 March 4, 2005

1.00 Introduction to Computers and Engineering Problem Solving Quiz 1 March 4, 2005 1.00 Introduction to Computers and Engineering Problem Solving Quiz 1 March 4, 2005 Name: E-mail Address: TA: Section: You have 80 minutes to complete this exam. For coding questions, you do not need to

More information

Tutorial 8 Date: 15/04/2014

Tutorial 8 Date: 15/04/2014 Tutorial 8 Date: 15/04/2014 1. What is wrong with the following interface? public interface SomethingIsWrong void amethod(int avalue) System.out.println("Hi Mom"); 2. Fix the interface in Question 2. 3.

More information

Proctors are unable to respond to queries about the interpretation of exam questions. Do your best to answer exam questions as written.

Proctors are unable to respond to queries about the interpretation of exam questions. Do your best to answer exam questions as written. QUEEN'S UNIVERSITY SCHOOL OF COMPUTING HAND IN Answers Are Recorded on Question Paper CISC124, WINTER TERM, 2012 FINAL EXAMINATION 9am to 12pm, 26 APRIL 2012 Instructor: Alan McLeod If the instructor is

More information

Stacks. Common data structures - useful for organizing data for specific tasks Lists Stacks - an Abstract Data Type

Stacks. Common data structures - useful for organizing data for specific tasks Lists Stacks - an Abstract Data Type Stacks Common data structures - useful for organizing data for specific tasks Lists Stacks - an Abstract Data Type Class interface Polymorphism Use of List as representation of Stacks Pop versus Peek 1

More information

this keyword (1). this with constructor (2). cisc3120 design and implementation of software applications I spring 2015 lecture # I.

this keyword (1). this with constructor (2). cisc3120 design and implementation of software applications I spring 2015 lecture # I. topics: introduction to java, part 4 this references exception handling comparing objects vectors utility classes cisc3120 design and implementation of software applications I spring 2015 lecture # I.4

More information

Note: This is a miniassignment and the grading is automated. If you do not submit it correctly, you will receive at most half credit.

Note: 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 information

Software and Programming 1

Software and Programming 1 Software and Programming 1 Lab 1: Introduction, HelloWorld Program and use of the Debugger 17 January 2019 SP1-Lab1-2018-19.pptx Tobi Brodie (tobi@dcs.bbk.ac.uk) 1 Module Information Lectures: Afternoon

More information

COE318 Lecture Notes Week 10 (Nov 7, 2011)

COE318 Lecture Notes Week 10 (Nov 7, 2011) COE318 Software Systems Lecture Notes: Week 10 1 of 5 COE318 Lecture Notes Week 10 (Nov 7, 2011) Topics More about exceptions References Head First Java: Chapter 11 (Risky Behavior) The Java Tutorial:

More information

More on Classes. 1 tostring

More on Classes. 1 tostring More on Classes 1 tostring Java allows us to supply an object wherever a string is expected. The run-time system will automatically apply a conversion function to create a string representation of the

More information

CIS 110 Introduction to Computer Programming Summer 2017 Final. Recitation # (e.g., 201):

CIS 110 Introduction to Computer Programming Summer 2017 Final. Recitation # (e.g., 201): CIS 110 Introduction to Computer Programming Summer 2017 Final Name: Recitation # (e.g., 201): Pennkey (e.g., paulmcb): My signature below certifies that I have complied with the University of Pennsylvania

More information

Our second exam is Monday, April 3. Note that it will not be possible to get all the homework submissions graded before the exam.

Our second exam is Monday, April 3. Note that it will not be possible to get all the homework submissions graded before the exam. Com S 227 Spring 2017 Assignment 3 300 points Due Date:, Wednesday, March 29 11:59 pm (midnight) Late deadline (25% penalty): Thursday, March 30, 11:59 pm General information This assignment is to be done

More information

Tutorials. Tutorial every Friday at 11:30 AM in Toldo 204 * discuss the next lab assignment

Tutorials. Tutorial every Friday at 11:30 AM in Toldo 204 * discuss the next lab assignment 60-212 subir@cs.uwindsor.ca Phone # 253-3000 Ext. 2999 web site for course www.cs.uwindsor.ca/60-212 Dr. Subir Bandyopadhayay Website has detailed rules and regulations All assignments and labs will be

More information

CSCI 135 Exam #2 Fundamentals of Computer Science I Fall 2013

CSCI 135 Exam #2 Fundamentals of Computer Science I Fall 2013 CSCI 135 Exam #2 Fundamentals of Computer Science I Fall 2013 Name: This exam consists of 6 problems on the following 6 pages. You may use your two-sided hand-written 8 ½ x 11 note sheet during the exam.

More information

Lecture 16. Lecture

Lecture 16. Lecture Recursive lists D0010E Variants of lists Doubly linked lists Binary trees Circular lists - Håkan Jonsson 1 - Håkan Jonsson 2 - Håkan Jonsson 3 1 1. Circular lists A singly linked list has a beginning and

More information

There are three questions on this exam. You have 2 hours to complete it. Please indent your program so that it is easy for the grader to read.

There are three questions on this exam. You have 2 hours to complete it. Please indent your program so that it is easy for the grader to read. There are three questions on this exam. You have 2 hours to complete it. Please indent your program so that it is easy for the grader to read. 1. Write a function named largestadjacentsum that iterates

More information

CompSci 125 Lecture 02

CompSci 125 Lecture 02 Assignments CompSci 125 Lecture 02 Java and Java Programming with Eclipse! Homework:! http://coen.boisestate.edu/jconrad/compsci-125-homework! hw1 due Jan 28 (MW), 29 (TuTh)! Programming:! http://coen.boisestate.edu/jconrad/cs125-programming-assignments!

More information

Exercise 4: Loops, Arrays and Files

Exercise 4: Loops, Arrays and Files Exercise 4: Loops, Arrays and Files worth 24% of the final mark November 4, 2004 Instructions Submit your programs in a floppy disk. Deliver the disk to Michele Zito at the 12noon lecture on Tuesday November

More information

CS 315 Software Design Homework 3 Preconditions, Postconditions, Invariants Due: Sept. 29, 11:30 PM

CS 315 Software Design Homework 3 Preconditions, Postconditions, Invariants Due: Sept. 29, 11:30 PM CS 315 Software Design Homework 3 Preconditions, Postconditions, Invariants Due: Sept. 29, 11:30 PM Objectives Defining a wellformed method to check class invariants Using assert statements to check preconditions,

More information

Concurrent Computing CSCI 201 Principles of Software Development

Concurrent Computing CSCI 201 Principles of Software Development Concurrent Computing CSCI 201 Principles of Software Development Jeffrey Miller, Ph.D. jeffrey.miller@usc.edu Outline Threads Multi-Threaded Code CPU Scheduling Program USC CSCI 201L Thread Overview Looking

More information

Data Structures Lecture 2

Data Structures Lecture 2 Fall 2017 Fang Yu Software Security Lab. Dept. Management Information Systems, National Chengchi University Data Structures Lecture 2 Object-oriented Design Abstraction, Modularity, and Encapsulation Abstraction

More information

CIS 110 Fall 2014 Introduction to Computer Programming 8 Oct 2014 Midterm Exam Name:

CIS 110 Fall 2014 Introduction to Computer Programming 8 Oct 2014 Midterm Exam Name: CIS 110 Fall 2014 Introduction to Computer Programming 8 Oct 2014 Midterm Exam Name: Recitation # (e.g., 201): Pennkey (e.g., eeaton): My signature below certifies that I have complied with the University

More information

Software Practice 1 Basic Grammar

Software Practice 1 Basic Grammar Software Practice 1 Basic Grammar Basic Syntax Data Type Loop Control Making Decision Prof. Joonwon Lee T.A. Jaehyun Song Jongseok Kim (42) T.A. Sujin Oh Junseong Lee (43) 1 2 Java Program //package details

More information

Programming Assignment #4 Arrays and Pointers

Programming Assignment #4 Arrays and Pointers CS-2301, System Programming for Non-majors, B-term 2013 Project 4 (30 points) Assigned: Tuesday, November 19, 2013 Due: Tuesday, November 26, Noon Abstract Programming Assignment #4 Arrays and Pointers

More information

CENTRAL UNIVERSITY OF RAJASTHAN

CENTRAL UNIVERSITY OF RAJASTHAN CLASS : M.TECH SEMESTER: II BRANCH : CSE SESSION: 2011-12 SUBJECT CODE & NAME : CSIS-304 TOPICS IN OPERATING SYSTEM 1. The question paper contains five questions. 4.Before attempting the question paper,

More information

COMP-202: Foundations of Programming. Lecture 26: Review; Wrap-Up Jackie Cheung, Winter 2016

COMP-202: Foundations of Programming. Lecture 26: Review; Wrap-Up Jackie Cheung, Winter 2016 COMP-202: Foundations of Programming Lecture 26: Review; Wrap-Up Jackie Cheung, Winter 2016 Announcements Final is scheduled for Apr 21, 2pm 5pm GYM FIELD HOUSE Rows 1-21 Please submit course evaluations!

More information

Midterm Examination # 2 Wednesday, March 18, Duration of examination: 75 minutes STUDENT NAME: STUDENT ID NUMBER:

Midterm Examination # 2 Wednesday, March 18, Duration of examination: 75 minutes STUDENT NAME: STUDENT ID NUMBER: Page 1 of 8 School of Computer Science 60-141-01 Introduction to Algorithms and Programming Winter 2015 Midterm Examination # 2 Wednesday, March 18, 2015 ANSWERS Duration of examination: 75 minutes STUDENT

More information

For example, here is a code snippet that supplies a legal data set to the constructor:

For example, here is a code snippet that supplies a legal data set to the constructor: Problem 1) [This problem is longer than what you will see on the quiz. You would not be asked to write as many methods, just one or two of them. This is still good practice, however!] For this problem

More information

Queens College, CUNY Department of Computer Science. CS 212 Object-Oriented Programming in Java Practice Exam 2. CS 212 Exam 2 Study Guide

Queens College, CUNY Department of Computer Science. CS 212 Object-Oriented Programming in Java Practice Exam 2. CS 212 Exam 2 Study Guide Topics for Exam 2: Queens College, CUNY Department of Computer Science CS 212 Object-Oriented Programming in Java Practice Exam 2 CS 212 Exam 2 Study Guide Linked Lists define a list node define a singly-linked

More information

Spring 2016 Programming Languages Qualifying Exam

Spring 2016 Programming Languages Qualifying Exam This is a closed book test. Clear, correct and concise responses will receive the best mark. Correct, clear and precise answers receive full marks Please start a new page for each question. 1 P a g e 1.

More information

CSCI 1301: Introduction to Computing and Programming Spring 2019 Lab 10 Classes and Methods

CSCI 1301: Introduction to Computing and Programming Spring 2019 Lab 10 Classes and Methods Note: No Brainstorm this week. This lab gives fairly detailed instructions on how to complete the assignment. The purpose is to get more practice with OOP. Introduction This lab introduces you to additional

More information

P2: Advanced Java & Exam Preparation

P2: Advanced Java & Exam Preparation P2: Advanced Java & Exam Preparation Claudio Corrodi May 18 2018 1 Java 8: Default Methods public interface Addressable { public String getstreet(); public String getcity(); public String getfulladdress();

More information

About this exam review

About this exam review Final Exam Review About this exam review I ve prepared an outline of the material covered in class May not be totally complete! Exam may ask about things that were covered in class but not in this review

More information

Chapter 9 Lab Text Processing and Wrapper Classes

Chapter 9 Lab Text Processing and Wrapper Classes Lab Objectives Chapter 9 Lab Text Processing and Wrapper Classes Use methods of the Character class and String class to process text Be able to use the StringTokenizer and StringBuffer classes Introduction

More information

Birkbeck (University of London) Software and Programming 1 In-class Test Mar Answer ALL Questions

Birkbeck (University of London) Software and Programming 1 In-class Test Mar Answer ALL Questions Birkbeck (University of London) Software and Programming 1 In-class Test 2.1 16 Mar 2017 Student Name Student Number Answer ALL Questions 1. What output is produced when the following Java program fragment

More information

Lesson 10B Class Design. By John B. Owen All rights reserved 2011, revised 2014

Lesson 10B Class Design. By John B. Owen All rights reserved 2011, revised 2014 Lesson 10B Class Design By John B. Owen All rights reserved 2011, revised 2014 Table of Contents Objectives Encapsulation Inheritance and Composition is a vs has a Polymorphism Information Hiding Public

More information

CmpSci 187: Programming with Data Structures Spring 2015

CmpSci 187: Programming with Data Structures Spring 2015 CmpSci 187: Programming with Data Structures Spring 2015 Lecture #13, Concurrency, Interference, and Synchronization John Ridgway March 12, 2015 Concurrency and Threads Computers are capable of doing more

More information

CPS109 Lab 7. Source: Big Java, Chapter 7 Preparation: read Chapter 7 and the lecture notes for this week.

CPS109 Lab 7. Source: Big Java, Chapter 7 Preparation: read Chapter 7 and the lecture notes for this week. 1 CPS109 Lab 7 Source: Big Java, Chapter 7 Preparation: read Chapter 7 and the lecture notes for this week. Objectives: 1. To practice using one- and two-dimensional arrays 2. To practice using partially

More information

Last time s big ideas

Last time s big ideas Last time s big ideas 1. When we want an array of objects, we store their references in the array 2. It is important to distinguish between the specification and implementation of a class 3. public and

More information

Computer Science II Data Structures

Computer Science II Data Structures Computer Science II Data Structures Instructor Sukumar Ghosh 201P Maclean Hall Office hours: 10:30 AM 12:00 PM Mondays and Fridays Course Webpage homepage.cs.uiowa.edu/~ghosh/2116.html Course Syllabus

More information

1.00/ Introduction to Computers and Engineering Problem Solving. Final / December 13, 2004

1.00/ Introduction to Computers and Engineering Problem Solving. Final / December 13, 2004 1.00/1.001 Introduction to Computers and Engineering Problem Solving Final / December 13, 2004 Name: Email Address: TA: Solution Section: You have 180 minutes to complete this exam. For coding questions,

More information

CS 536 Spring Programming Assignment 1 Symbol Table Classes. Due: Friday, February 4, 2005 Not accepted after Friday, February 4, 2005

CS 536 Spring Programming Assignment 1 Symbol Table Classes. Due: Friday, February 4, 2005 Not accepted after Friday, February 4, 2005 CS 536 Spring 2005 Programming Assignment 1 Symbol Table Classes Due: Friday, February 4, 2005 Not accepted after Friday, February 4, 2005 Introduction You are to write a set of Java classes that implement

More information

CS100M November 30, 2000

CS100M November 30, 2000 CS00M November 30, 2000 Makeup Solutions 7:30 PM 9:30 PM (Print last name, first name, middle initial/name) (Student ID) Statement of integrity: I did not, and will not, break the rules of academic integrity

More information

public static boolean isoutside(int min, int max, int value)

public static boolean isoutside(int min, int max, int value) See the 2 APIs attached at the end of this worksheet. 1. Methods: Javadoc Complete the Javadoc comments for the following two methods from the API: (a) / @param @param @param @return @pre. / public static

More information

CHAPTER 7 OBJECTS AND CLASSES

CHAPTER 7 OBJECTS AND CLASSES CHAPTER 7 OBJECTS AND CLASSES OBJECTIVES After completing Objects and Classes, you will be able to: Explain the use of classes in Java for representing structured data. Distinguish between objects and

More information

Submit: Your group source code to mooshak

Submit: Your group source code to mooshak Tutorial 2 (Optional) Genetic Algorithms This is an optional tutorial. Should you decide to answer it please Submit: Your group source code to mooshak http://mooshak.deei.fct.ualg.pt/ up to May 28, 2018.

More information

CS171:Introduction to Computer Science II

CS171:Introduction to Computer Science II CS171:Introduction to Computer Science II Department of Mathematics and Computer Science Li Xiong 9/7/2012 1 Announcement Introductory/Eclipse Lab, Friday, Sep 7, 2-3pm (today) Hw1 to be assigned Monday,

More information