ASSIGNMENT 4. COMP-202C, Summer Due: Monday June 29th, 2015 (23:30)
|
|
- Britton Blake
- 6 years ago
- Views:
Transcription
1 ASSIGNMENT 4 COMP-202C, Summer 2015 Due: Monday June 29th, 2015 (23:30) Please read the entire pdf before starting. You must do this assignment individually and, unless otherwise specified, you must follow all the general instructions and regulations for assignments. Graders have the discretion to deduct up to 10% of the value of this assignment for deviations from the general instructions and regulations. These regulations are posted on the course website. Be sure to read them before starting. Part 1: Part 2, Question 1: Part 2, Question 2: Part 2, Question 3: 0 points 50 points 30 points 20 points 100 points total Before starting on the assignment, you should download from the course website the following files. Make sure to save them in the same working folder. For Question1 : Vector2D.java City.java Country.java MakeCountry.java CountryMap.java For Question2 : DoublyLinkedList.java Node.java For Question3 : names.txt This imgsupport.java file will both be used for loading, displaying, and saving the image files. This will be needed throughout the assignment. The.jpg files are used to test your implementations. It is very important that you follow the directions as closely as possible. The directions, while perhaps tedious, are designed to make it as easy as possible for the TAs to mark the assignments by letting them run your assignment through automated tests. While these tests will not determine your entire grade, it will speed up the process significantly, which will allow the TAs to provide better feedback and not waste time on administrative details. Plus, if the TA is in a good mood while he or she is grading, then that increases the chance of them giving out partial marks :) 1
2 Part 1 (0 points): Warm-up Do NOT submit this part, as it will not be graded. However, doing these exercises might help you to do the second part of the assignment, which will be graded. If you have difficulties with the questions of Part 1, then we suggest that you consult the TAs during their office hours; they can help you and work with you through the warm-up questions. Warm-up Question 1 (0 points) Write a class describing a Cat object. A cat has the following attributes: a name (String), a breed (String), an age (int) and a mood (String). The cat constructor takes as input a String and sets that value to be the breed. The mood of a cat can be one of the following: sleepy, hungry, angry, happy, crazy. Your Cat object contains a method called talk(). This method takes no input and returns nothing. Depending on the mood of the cat, it prints something different. If the cat s mood is sleepy, it prints meow. If the mood is hungry, it prints RAWR!. If the cat is angry, it prints hsssss. If the cat is happy it prints purrrr. If the cat is crazy, it prints a random String of between 10 and 25 characters (letters). The cat attributes are all private. Each one has a corresponding public method called getattributename() (ie: getname(), getmood(), etc.) which returns the value of the attribute. All but the breed also have a public method called setattributename() which takes as input a value of the type of the attribute and sets the attribute to that value. Be sure that only valid mood sets are permitted. (ie, a cat s mood can only be one of five things). There is no setbreed() method because the breed of a cat is set at birth and cannot change. Test your class in another file which contains only a main method. Test all methods to make sure they work as expected. Warm-up Question 2 (0 points) Write a program that opens a.txt, reads the contents of the file line by line, and prints the content of each line. To do this, you should use look up how to use the BufferedReader class 1. Remember to use the try and catch statements to handle errors like trying to open an non-existent file. Warm-up Question 3 (0 points) Modify the previous program so that it stores every line in an ArrayList of String objects. You have to properly declare an ArrayList to store the results, and use add to store every line that your program reads in the ArrayList. Warm-up Question 4 (0 points) Finally, modify your program so that, after reading all the content in the file, it prints how many words are inside the text file. To do this, you should use the split method of the String class. Assume the only character that separates words is whitespace " ". 1 The documentation of the BufferedReadder class is available at io/bufferedreader.html. You can find an example on how to use it at bufferedreader_readline.htm Page 2
3 Part 2 The questions in this part of the assignment will be graded. Question 1: Making your own Objects: Cities and Roads (50 points) In this problem, you will implement an abstraction of a Country. The Country class contains an array of City objects. A City is defined by a two dimensional (x, y) position 2, a name, and its neighboring cities. Once the country is populated with cities, your code will determine whether or not the all the cities in the country are connected 3.Using your random country, you will be able to create a map of it using the provided CountryMap.java. Figure 1 depicts completed countries. (a) A non connected sample country (b) A connected sample country Figure 1: Examples of connected and non-connected countries You have been given all the files you need to solve this problem. The files provided for this question are: 1. Vector2D.java 2. City.java 3. Country.java 4. MakeCountry.java 5. CountryMap.java Go through all the comments in the provided files for this question. The comments explain in detail what needs to be done in each of the given files. The part where you are expected to implement a piece of code will be indicated with a comment TODO. In order to create your random country, you will have to populate the provided files with class variables and methods. An overview is shown in Figure 2. The following expands further on the content of each class and their functionalities. 1. Vector2D.java: This file describes an abstraction of a two dimensional vector, a Vector2D object. This class has two private attributes of type double, e.g. an x position and a y position. These values are set by the constructor. This file also contains a distance method that takes as input another Vector2D object and returns the distance between the argument vector and this vector reference, recall d = (v x w x ) 2 + (v y w y ) 2, where v and w are vectors and d is the euclidean distance that separates them. 2. City.java: This class is an abstraction of a city. The file you have been given contains the attributes, as well as some empty methods. You have to complete the file as follows: 2 Vector2D class 3 From any city is it possible to reach any other city by traveling along roads Page 3
4 Methods Class: Country boolean setconnectivity() City[] getcities()) String getname() Class: City void setneighbours( double maxdist,city[] cities) void explore() Vector2D getpos() String getname() String getexplored City[] getneighbours() Class: Vector2D double distance(vector2d v) double getx() double gety() Attributes String name boolean isconnected City [] cities String[] nameprefixes String[] namesuffixes Vector2D pos City[] neighbours boolean explored int numneighbours double xval double yval Figure 2: An overview of the Country, City and Vector2D classes The constructor: The City constructor takes no input and initializes the City class by giving it a random name and a position. In order to create the random name, take an element from a random index of the nameprefixes array and an element from a random index of the namesuffixes array. Concatenating the two together will give the String representing the city s name. Random integer can be generated by using the java.util.random library. To generate a Random integer between 0 and 100, you can do, Random randomgenerator = new Random(); randomgenerator.nextint(100); For more details about Random library, look up at api/java/util/random.html You are encouraged to add more prefixes and suffixes to the arrays (if you wish). The constructor should also initialize the city s position, a Vector2D object, by choosing two random integers between 0 and 150 and setting those values to be the x and y vector coordinates respectively using the Vector2D s constructor. The City[] neighbours attribute: Each city has an array of neighbouring cities. Two cities are deemed to be neighbours if the distance between them is less than some threshold. For the image in Figure 1, a maximum distance of 50 was used. You can play with this value. The maximum number of neighbours is, of course, the number of cities in the country minus one 4. The setneighbours(double maxdist, City[] cities) method populates the neighbours attribute. It takes as input an array of all cities in the country and determines which to add as a neighbour of the current city. A neighbour is defined as any City whose distance to the current City is less than maxdist. In order to determine the size of the array, infer from the following: there are n City instances in a Country object, and a city cannot be its own neighbour. This method does not return anything. Also at the end of setting the Neighbours, make sure to set numneighbours to the exact number of neighbours this city has (Not including the spots that have null in the neighbours array). 4 A city cannot be its own neighbour Page 4
5 The explore() method performs a breadth-first exploration of the Country. For more information, see The pseudo-code is as follows: function explore( ) explored true for all City v in neighbours do if v was not explored then v.explore() end if end for end function This algorithm starts at any City, and then explores all of the city s neighbours. We explore a City by setting its class variable, explored, to be true. If any of the neighbours are not already explored, then we explore their neighbours, and so on. When this algorithm terminates, the explored parameter will be true for every City for which there exists a path between itself and the starting City. 3. The Country.java file. This file defines a class Country. A country has the following private attributes: a name, an array of City objects, and a boolean variable (isconnected) that notes whether or not the country is connected. You will also need: A constructor: This takes as input the name of the country an integer n, representing the number of Cities that should exist in the Country, as well as an integer maxdist representing the maximum distance two neighbouring Cities can be from each other. The constructor sets the name and then initializes the n City objects, and sets neighbours for each city in the cities array. A method called setconnectivity(). This method should first call the explore method from the first City in the Country (cities[0].explore()). It should then iterate through all cities in the Country and verify the values of their boolean explored attributes to determine whether or not every city can be reached from every other city. It should return true if the cities are connected and false otherwise. Also implement the getter methods for cities and the name of the country (getcities( ) and getname( )). 4. The MakeCountry.java file. Here is where your main method is. This method creates a Country, determines whether or not its graph is connected and then creates the diagram of the Country. You should also have a print statement that states whether or not the Country is connected. Question 2: Implementing a Doubly LinkedList (30 points) For this question, you will implement a doubly linked list 5. To do this we provide you the DoublyLinkedList.java and the Node.java files. First, modify the Node class so that it contains a reference to both the previous and next elements in the list. Then, you should complete the DoublyLinkedList class by implementing the following methods: 1. find: This method receives a String value as input, and returns the first Node that matches the value. It returns null otherwise. 2. insertstart: This method receives a String value, and insert a Node with the given value at the beginning of the list. 3. insertend: This method receives a String value, and inserts a Node with the given value at the end of the list. 4. remove: This method receives a String value, and removes all occurrences of the value in the list. 5 Page 5
6 5. removeatindex: This method receives an int index, and removes from the list the element at the position given by the index. 6. tostringreverse: This method returns a string containing all the elements in the list in reverse order. To test if your code works, use the main method in the DoublyLinkedList.java file. Question 3: Sort the Names (20 points) In this question, you are required to read a list of names from the input file provided (names.txt) into an ArrayList String. Then you need to implement a method called Sort that takes this ArrayList as an input and sorts the names in the increasing alphabetical order. For example, if the input list of names is: { ada, aaa, adc, acd }, the sorted list will have { aaa, acd, ada, adc }. Once the ArrayList is sorted, you will write the names in the sorted ArrayList into another text file named sortednames.txt. The detailed instructions for this question are as follows, You are given a text names.txt, that contains a list of Strings, one per line. Write a class called Question3 (in Question3.java). In the main method of this class, you will read the Strings from the file names.txt into an ArrayList. Then call the Sort method (that you will be implementing) with the ArrayList of names as a parameter. You are required to implement a Sort method that takes ArrayList as input parameter and sorts the elements in this ArrayList. For Sorting, you can use the Bubble Sort algorithm, that we saw in the class. In this case, you will be comparing two strings. Use comparetoignorecase( ) method defined under the Strings to compare two Strings. Look up at lang.string) for more details on this method. Once the ArrayList is sorted, in the main method : write the names into another text file with name sortednames.txt. You can use the BufferedReader and BufferedWriter classes for File input / output operations as taught in the class. What To Submit You should submit your assignment on MyCourses. In order to do this, you will need to make a zip of the file. You can do this on windows by following the instructions at this link: slytinen/instructions/zip.html. On a mac or linux, you can find instructions at com/2012/01/10/how-to-zip-files-in-mac-os-x/ You should submit a zip file called Assignment4.zip with the following files inside of it. Vector2D.java City.java Country.java MakeCountry.java Node.java DoublyLinkedList.java Question3.java sortednames.txt Confession.txt (optional) In this file, you can tell the TA about any issues you ran into doing this assignment. If you point out an error that you know occurs in your problem, it may lead the TA to give you more partial credit. On the other hand, it also may lead the TA to notice something that otherwise he or she would not. Page 6
ASSIGNMENT 5. COMP-202, Winter 2015, All Sections. Due: Tuesday, March 31st, 2015 (23:59)
ASSIGNMENT 5 COMP-202, Winter 2015, All Sections Due: Tuesday, March 31st, 2015 (23:59) Please read the entire PDF before starting. You must do this assignment individually and, unless otherwise specified,
More informationASSIGNMENT 4. COMP-202, Fall 2014, All Sections. Due: November 9 th, 2014 (23:59)
ASSIGNMENT 4 COMP-202, Fall 2014, All Sections Due: November 9 th, 2014 (23:59) Please read the entire pdf before starting. You must do this assignment individually and, unless otherwise specified, you
More informationASSIGNMENT 4. COMP-202, Summer 2017, All Sections. Due: Friday, June 16 th, 11:59pm
ASSIGNMENT 4 COMP-202, Summer 2017, All Sections Due: Friday, June 16 th, 11:59pm Please read the entire PDF before starting. You must do this assignment individually. Question 1: 100 points 100 points
More informationASSIGNMENT 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 informationASSIGNMENT 4. COMP-202, Fall 2013, All Sections. Due: December 6 th,2013(23:59)
ASSIGNMENT 4 COMP-202, Fall 2013, All Sections Due: December 6 th,2013(23:59) Please read the entire PDF before starting. You must do this assignment individually and, unless otherwise specified, you must
More informationASSIGNMENT 6. COMP-202, Winter 2015, All Sections. Due: Tuesday, April 14, 2015 (23:59)
ASSIGNMENT 6 COMP-202, Winter 2015, All Sections Due: Tuesday, April 14, 2015 (23:59) Please read the entire pdf before starting. You must do this assignment individually and, unless otherwise specified,
More informationASSIGNMENT 3. COMP-202, Fall 2014, All Sections. Due: October 24 th, 2014 (23:59)
ASSIGNMENT 3 COMP-202, Fall 2014, All Sections Due: October 24 th, 2014 (23:59) Please read the entire pdf before starting. You must do this assignment individually and, unless otherwise specified, you
More informationASSIGNMENT 3. COMP-202, Winter 2015, All Sections. Due: Tuesday, February 24, 2015 (23:59)
ASSIGNMENT 3 COMP-202, Winter 2015, All Sections Due: Tuesday, February 24, 2015 (23:59) Please read the entire pdf before starting. You must do this assignment individually and, unless otherwise specified,
More informationASSIGNMENT 2. COMP-202A, Fall 2011, All Sections. Due: Monday, October 17th, 2011 (23:30)
ASSIGNMENT 2 COMP-202A, Fall 2011, All Sections Due: Monday, October 17th, 2011 (23:30) Please read the entire pdf before starting. The bottom has important instructions for how to test your code before
More informationASSIGNMENT 5 Data Structures, Files, Exceptions, and To-Do Lists
ASSIGNMENT 5 Data Structures, Files, Exceptions, and To-Do Lists COMP-202B, Winter 2009, All Sections Due: Tuesday, April 14, 2009 (23:55) You MUST do this assignment individually and, unless otherwise
More informationASSIGNMENT 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 informationASSIGNMENT 4 Classes and Objects
ASSIGNMENT 4 Classes and Objects COMP-202A, Fall 2010, All Sections Due: Friday, November 19, 2010 (23:55) You MUST do this assignment individually and, unless otherwise specified, you MUST follow all
More informationASSIGNMENT 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 informationAssignment 4. Aggregate Objects, Command-Line Arguments, ArrayLists. COMP-202B, Winter 2011, All Sections. Due: Tuesday, March 22, 2011 (13:00)
Assignment 4 Aggregate Objects, Command-Line Arguments, ArrayLists COMP-202B, Winter 2011, All Sections Due: Tuesday, March 22, 2011 (13:00) You MUST do this assignment individually and, unless otherwise
More informationASSIGNMENT 1 First Java Assignment
ASSIGNMENT 1 First Java Assignment COMP-202B, Winter 2012, All Sections Due: Sunday January 29th, 2012 (23:30) Please read the entire pdf before starting. You must do this assignment individually and,
More informationAssignment 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 informationASSIGNMENT 4 Records and Objects
ASSIGNMENT 4 Records and Objects COMP-202B, Winter 2010, All Sections Due: Wednesday, March 31, 2010 (23:55) You MUST do this assignment individually and, unless otherwise specified, you MUST follow all
More informationASSIGNMENT 3 Classes, Objects and the Robot World
ASSIGNMENT 3 Classes, Objects and the Robot World COMP-202B, Winter 2009, All Sections Due: Tuesday, March 3, 2009 (23:55) You MUST do this assignment individually and, unless otherwise specified, you
More informationASSIGNMENT 3 Methods, Arrays, and the Java Standard Class Library
ASSIGNMENT 3 Methods, Arrays, and the Java Standard Class Library COMP-202B, Winter 2010, All Sections Due: Wednesday, March 3, 2010 (23:55) You MUST do this assignment individually and, unless otherwise
More informationHomework 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 informationCOMP 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 informationASSIGNMENT 1 Expressions, Data Types, and Simple Calculations
ASSIGNMENT 1 Expressions, Data Types, and Simple Calculations COMP-202B, Winter 2010, All Sections Due: Friday, January 22, 2010 (23:55) You MUST do this assignment individually and, unless otherwise specified,
More informationCMPSCI 187 / Spring 2015 Hangman
CMPSCI 187 / Spring 2015 Hangman Due on February 12, 2015, 8:30 a.m. Marc Liberatore and John Ridgway Morrill I N375 Section 01 @ 10:00 Section 02 @ 08:30 1 CMPSCI 187 / Spring 2015 Hangman Contents Overview
More informationACORN.COM CS 1110 SPRING 2012: ASSIGNMENT A1
ACORN.COM CS 1110 SPRING 2012: ASSIGNMENT A1 Due to CMS by Tuesday, February 14. Social networking has caused a return of the dot-com madness. You want in on the easy money, so you have decided to make
More informationCS 61B (Clancy, Yelick) Solutions and grading standards for exam 2 Spring 2001 Exam information
Exam information 345 students took the exam. Scores ranged from 3 to 25, with a median of 19 and an average of 18.1. There were 176 scores between 19 and 25, 125 between 12.5 and 18.5, 42 between 6 and
More informationAssignment3 CS206 Intro to Data Structures Fall Part 1 (50 pts) due: October 13, :59pm Part 2 (150 pts) due: October 20, :59pm
Part 1 (50 pts) due: October 13, 2013 11:59pm Part 2 (150 pts) due: October 20, 2013 11:59pm Important Notes This assignment is to be done on your own. If you need help, see the instructor or TA. Please
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 informationLab 4: Tracery Recursion in C with Linked Lists
Lab 4: Tracery Recursion in C with Linked Lists For this lab we will be building on our previous lab at the end of the previous lab you should have had: #include #include char * make_string_from
More informationASSIGNMENT 3 Object Oriented Programming
ASSIGNMENT 3 Object Oriented Programming COMP-202B, Winter 2011, All Sections Due: Wednesday, February 23rd, 2011 (13:00) You MUST do this assignment individually and, unless otherwise specified, you MUST
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 information************ THIS PROGRAM IS NOT ELIGIBLE FOR LATE SUBMISSION. ALL SUBMISSIONS MUST BE RECEIVED BY THE DUE DATE/TIME INDICATED ABOVE HERE
Program 10: 40 points: Due Tuesday, May 12, 2015 : 11:59 p.m. ************ THIS PROGRAM IS NOT ELIGIBLE FOR LATE SUBMISSION. ALL SUBMISSIONS MUST BE RECEIVED BY THE DUE DATE/TIME INDICATED ABOVE HERE *************
More informationCOMP-202: Foundations of Programming. Lecture 12: Linked List, and File I/O Sandeep Manjanna, Summer 2015
COMP-202: Foundations of Programming Lecture 12: Linked List, and File I/O Sandeep Manjanna, Summer 2015 Announcements Assignment 4 is posted and Due on 29 th of June at 11:30 pm. Course Evaluations due
More informationASSIGNMENT 1. COMP-202, Fall 2015, All Sections. Due: October 5 th, 2015 (23:59)
ASSIGNMENT 1 COMP-202, Fall 2015, All Sections Due: October 5 th, 2015 (23:59) Please read the entire pdf before starting. You must do this assignment individually and, unless otherwise specified, you
More informationWorking with Objects. Overview. This chapter covers. ! Overview! Properties and Fields! Initialization! Constructors! Assignment
4 Working with Objects 41 This chapter covers! Overview! Properties and Fields! Initialization! Constructors! Assignment Overview When you look around yourself, in your office; your city; or even the world,
More informationEECE.2160: ECE Application Programming
Summer 2017 Programming Assignment #9: Doubly-Linked Lists Due Monday, 6/26/17, 11:59:59 PM (+15% if submitted by 6/23, +10% if submitted 6/24-6/25, +5% if submitted 6/26) 1. Introduction This assignment
More informationCollections, Maps and Generics
Collections API Collections, Maps and Generics You've already used ArrayList for exercises from the previous semester, but ArrayList is just one part of much larger Collections API that Java provides.
More informationCS2 Practical 1 CS2A 22/09/2004
CS2 Practical 1 Basic Java Programming The purpose of this practical is to re-enforce your Java programming abilities. The practical is based on material covered in CS1. It consists of ten simple programming
More informationReadings for This Lecture
Lecture 4 Classes Readings for This Lecture Section 1.4, 1.5 in text Section 3.1 in text Plive activities referenced in the text Please look at lecture summaries online Handouts are short version Presentation
More informationLecture 2: Variables & Assignments
http://www.cs.cornell.edu/courses/cs1110/2018sp Lecture 2: Variables & Assignments (Sections 2.1-2.3,2.5) CS 1110 Introduction to Computing Using Python [E. Andersen, A. Bracy, D. Gries, L. Lee, S. Marschner,
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 2017 Miniassignment 1 50 points Due Date: Monday, October 16, 11:59 pm (midnight) Late deadline (25% penalty): Tuesday, October 17, 11:59 pm General information This assignment is to be
More informationStudent Performance Q&A:
Student Performance Q&A: 2016 AP Computer Science A Free-Response Questions The following comments on the 2016 free-response questions for AP Computer Science A were written by the Chief Reader, Elizabeth
More informationCIS 110 Spring 2014 Introduction to Computer Programming 12 May 2014 Final Exam Answer Key
CIS 110 Spring 2014 Final Exam 1 CIS 110 Spring 2014 Introduction to Computer Programming 12 May 2014 Final Exam Answer Key 0.) THE EASY ONE (1 point total) Check coversheet for name, recitation #, PennKey,
More informationEE 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 informationCSCI-140 Midterm Review October 10, 2015 Presented by the RIT Computer Science Community
CSCI-140 Midterm Review October 10, 2015 Presented by the RIT Computer Science Community http://csc.cs.rit.edu 1. In each of the following situations, would it be better to use array-backed storage or
More informationHomework 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 informationCS211 Programming Practicum Fall 2017
Due: Monday, 11/20/17 at 11:59 pm Can I Get There from Here? Programming Project 6 For this program, you will write a C++ Program to represent a travel network. This travel network will use an array of
More informationCSE115 / CSE503 Introduction to Computer Science I Dr. Carl Alphonce 343 Davis Hall Office hours:
CSE115 / CSE503 Introduction to Computer Science I Dr. Carl Alphonce 343 Davis Hall alphonce@buffalo.edu Office hours: Tuesday 10:00 AM 12:00 PM * Wednesday 4:00 PM 5:00 PM Friday 11:00 AM 12:00 PM OR
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 information1.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: Section: You have 180 minutes to complete this exam. For coding questions, you do
More informationHomework 6: Higher-Order Procedures Due: 10:00 PM, Oct 17, 2017
Integrated Introduction to Computer Science Hughes Homework 6: Higher-Order Procedures Due: 10:00 PM, Oct 17, 2017 Contents 1 Fun with map (Practice) 2 2 Unfold (Practice) 3 3 Map2 3 4 Fold 4 5 All You
More informationCS 211 Programming Practicum Spring 2017
Due: Tuesday, 3/28/17 at 11:59 pm Infix Expression Evaluator Programming Project 5 For this lab, write a JAVA program that will evaluate an infix expression. The algorithm REQUIRED for this program will
More informationPart 1: Group Brainstorm (NO computers during this time) Part 2: Submit Individual Brainstorm (You can now use a computer)
Part 1: Group Brainstorm (NO computers during this time) Good programmers think before they begin coding. Part I of this assignment involves brainstorming with a group of peers with absolutely no computers
More informationLab 9 - Classes and Objects Directions
Lab 9 - Classes and Objects Directions The labs are marked based on attendance and effort. It is your responsibility to ensure the TA records your progress by the end of the lab. Do each step of the lab
More information//If target was found, then //found == true and a[index] == target.
230 CHAPTER 5 Arrays //If target was found, then //found == true and a[index] == target. } if (found) where = index; return found; 20. 0 1 2 3 0 1 2 3 0 1 2 3 0 1 2 3 21. int a[4][5]; int index1, index2;
More informationComp Assignment 2: Object-Oriented Scanning for Numbers, Words, and Quoted Strings
Comp 401 - Assignment 2: Object-Oriented Scanning for Numbers, Words, and Quoted Strings Date Assigned: Thu Aug 29, 2013 Completion Date: Fri Sep 6, 2013 Early Submission Date: Wed Sep 4, 2013 This work
More informationFamily Map Server Specification
Family Map Server Specification Acknowledgements The Family Map project was created by Jordan Wild. Thanks to Jordan for this significant contribution. Family Map Introduction Family Map is an application
More informationCOMP-202: Foundations of Programming. Lecture 10: Method Overloading and Passing Objects to Methods. Sandeep Manjanna, Summer 2015
COMP-202: Foundations of Programming Lecture 10: Method Overloading and Passing Objects to Methods. Sandeep Manjanna, Summer 2015 Announcements Assignment 3: Due on 14 th of June at 11:30 pm. Midterm grades
More informationPractice exam for CMSC131-04, Fall 2017
Practice exam for CMSC131-04, Fall 2017 Q1 makepalindrome - Relevant topics: arrays, loops Write a method makepalidrome that takes an int array, return a new int array that contains the values from the
More informationTips from the experts: How to waste a lot of time on this assignment
Com S 227 Spring 2018 Assignment 1 80 points Due Date: Friday, February 2, 11:59 pm (midnight) Late deadline (25% penalty): Monday, February 5, 11:59 pm General information This assignment is to be done
More informationImplementation. Learn how to implement the List interface Understand the efficiency trade-offs between the ArrayList and LinkedList implementations
Readings List Implementations Chapter 20.2 Objectives Learn how to implement the List interface Understand the efficiency trade-offs between the ArrayList and LinkedList implementations Additional references:
More informationCMSC 341 Lecture 7 Lists
CMSC 341 Lecture 7 Lists Today s Topics Linked Lists vs Arrays Nodes Using Linked Lists Supporting Actors (member variables) Overview Creation Traversal Deletion UMBC CMSC 341 Lists 2 Linked Lists vs Arrays
More informationComputer Science II CSci 1200 Test 2 Overview and Practice
Computer Science II CSci 1200 Test 2 Overview and Practice Overview Test 2 will be held Friday, March 21, 2008 2:00-3:45pm, Darrin 308. No make-ups will be given except for emergency situations, and even
More informationComputer Sciences 302 Exam 2 Information & Sample Exam
Computer Sciences 302 Exam 2 Information & Sample Exam Below you ll find information about the second midterm exam and sample exam questions. This sample is intended to be similar in length and difficulty
More informationCSCI 1101B. Boolean Expressions
CSCI 1101B Boolean Expressions Announcements Please respect the TAs Be respectful of their boundaries and needs Go to TA hours instead of knocking on their door Meet with TAs early (instead of the night
More informationSoftware Testing Prof. Meenakshi D Souza Department of Computer Science and Engineering International Institute of Information Technology, Bangalore
Software Testing Prof. Meenakshi D Souza Department of Computer Science and Engineering International Institute of Information Technology, Bangalore Lecture 04 Software Test Automation: JUnit as an example
More informationCOMP-202: Foundations of Programming. Lecture 11: ArrayList, and Linked List Sandeep Manjanna, Summer 2015
COMP-202: Foundations of Programming Lecture 11: ArrayList, and Linked List Sandeep Manjanna, Summer 2015 Announcements Assignment 4 will be posted by the end of day today. Course Evaluations are now open.
More informationLab 5: Java IO 12:00 PM, Feb 21, 2018
CS18 Integrated Introduction to Computer Science Fisler, Nelson Contents Lab 5: Java IO 12:00 PM, Feb 21, 2018 1 The Java IO Library 1 2 Program Arguments 2 3 Readers, Writers, and Buffers 2 3.1 Buffering
More information+ Abstract Data Types
Linked Lists Abstract Data Types An Abstract Data Type (ADT) is: a set of values a set of operations Sounds familiar, right? I gave a similar definition for a data structure. Abstract Data Types Abstract
More informationASSIGNMENT 2 Conditionals, Loops, Utility Bills, and Calculators
ASSIGNMENT 2 Conditionals, Loops, Utility Bills, and Calculators COMP-202A, Fall 2009, All Sections Due: Friday, October 9, 2009 (23:55) You MUST do this assignment individually and, unless otherwise specified,
More informationFINAL EXAMINATION. COMP-250: Introduction to Computer Science - Fall 2011
STUDENT NAME: STUDENT ID: McGill University Faculty of Science School of Computer Science FINAL EXAMINATION COMP-250: Introduction to Computer Science - Fall 2011 December 13, 2011 2:00-5:00 Examiner:
More informationLab 3: Call to Order CSCI 2101 Fall 2018
Due: Monday, October 15, 11:59 pm Collaboration Policy: Level 1 Group Policy: Pair-Optional Lab 3: Call to Order CSCI 2101 Fall 2018 This week s lab will explore sorting, lists, and basic data analysis.
More informationEECE.2160: ECE Application Programming
Fall 2017 Programming Assignment #10: Doubly-Linked Lists Due Monday, 12/18/17, 11:59:59 PM (Extra credit ( 5 pts on final average), no late submissions or resubmissions) 1. Introduction This assignment
More informationCritters. Critter #2 Attack.ROAR Attack.POUNCE Attack.SCRATCH. Critter #1
Critters This assignment was co-created by Stuart Reges and Marty Stepp. This program focuses on classes, objects, and inheritance. You will write the following files: Ant.java, Bird.java, Crab.java, FireAnt.java,
More informationCSCI 136 Written Exam #1 Fundamentals of Computer Science II Spring 2014
CSCI 136 Written Exam #1 Fundamentals of Computer Science II Spring 2014 Name: This exam consists of 5 problems on the following 6 pages. You may use your double- sided hand- written 8 ½ x 11 note sheet
More informationWrite the code to create an enhanced for loop that will go through every member of an ArrayList <String> myarray and print it out to the console.
COSC 201 Review Questions Final Fall 2015 Write the code to create an enhanced for loop that will go through every member of an ArrayList myarray and print it out to the console. Give the code
More information1.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 informationCISC-124. Dog.java looks like this. I have added some explanatory comments in the code, and more explanation after the code listing.
CISC-124 20180115 20180116 20180118 We continued our introductory exploration of Java and object-oriented programming by looking at a program that uses two classes. We created a Java file Dog.java and
More informationCS112 Lecture: Working with Numbers
CS112 Lecture: Working with Numbers Last revised January 30, 2008 Objectives: 1. To introduce arithmetic operators and expressions 2. To expand on accessor methods 3. To expand on variables, declarations
More informationIntroduction to Programming Using Java (98-388)
Introduction to Programming Using Java (98-388) Understand Java fundamentals Describe the use of main in a Java application Signature of main, why it is static; how to consume an instance of your own class;
More informationCSE 143, Winter 2010 Midterm Exam Wednesday February 17, 2010
CSE 143, Winter 2010 Midterm Exam Wednesday February 17, 2010 Personal Information: Name: Section: Student ID #: TA: You have 50 minutes to complete this exam. You may receive a deduction if you keep working
More informationWhat is PHP? [1] Figure 1 [1]
PHP What is PHP? [1] PHP is an acronym for "PHP: Hypertext Preprocessor" PHP is a widely-used, open source scripting language PHP scripts are executed on the server PHP is free to download and use Figure
More informationCSE331 Autumn 2011 Midterm Examination October 28, 2011
CSE331 Autumn 2011 Midterm Examination October 28, 2011 50 minutes; 75 points total. Open note, open book, closed neighbor, closed anything electronic (computers, webenabled phones, etc.) An easier-to-read
More informationCS 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 informationHave fun with a problem that is algorithmically interesting in its own right!
Darwin Due 22 October Assignment 6 CSC 062: Fall, 2017 Objectives For this assignment, you will: Gain practice writing large, multi-class programs. Learn the importance of modular decomposition and information
More informationCOMP-202A, Fall 2007, All Sections Assignment 1
COMP-202A, Fall 2007, All Sections Assignment 1 Due: Monday September 24, 2007 (23:55) You MUST do this assignment individually and, unless otherwise specified, you MUST follow all the general instructions
More informationCOMP-202: Foundations of Programming. Lecture 13: Recursion Sandeep Manjanna, Summer 2015
COMP-202: Foundations of Programming Lecture 13: Recursion Sandeep Manjanna, Summer 2015 Announcements Final exams : 26 th of June (2pm to 5pm) @ MAASS 112 Assignment 4 is posted and Due on 29 th of June
More informationCMPSCI 187 / Spring 2015 Implementing Sets Using Linked Lists
CMPSCI 187 / Spring 2015 Implementing Sets Using Linked Lists Due on Tuesday February 24, 2015, 8:30 a.m. Marc Liberatore and John Ridgway Morrill I N375 Section 01 @ 10:00 Section 02 @ 08:30 1 CMPSCI
More informationObject-Oriented Design Lecture 3 CSU 370 Fall 2007 (Pucella) Friday, Sep 14, 2007
Object-Oriented Design Lecture 3 CSU 370 Fall 2007 (Pucella) Friday, Sep 14, 2007 Java We will be programming in Java in this course. Partly because it is a reasonable language, and partly because you
More informationFaculty of Science COMP-202B - Introduction to Computing I (Winter 2009) Midterm Examination
First Name: Last Name: McGill ID: Section: Faculty of Science COMP-202B - Introduction to Computing I (Winter 2009) Midterm Examination Monday, March 9, 2009 Examiners: Mathieu Petitpas [Section 1] 18:30
More informationCS/IT 114 Introduction to Java, Part 1 FALL 2016 CLASS 3: SEP. 13TH INSTRUCTOR: JIAYIN WANG
CS/IT 114 Introduction to Java, Part 1 FALL 2016 CLASS 3: SEP. 13TH INSTRUCTOR: JIAYIN WANG 1 Notice Reading Assignment Chapter 1: Introduction to Java Programming Homework 1 It is due this coming Sunday
More informationModel Solutions. COMP 103: Test May, 2013
Family Name:............................. Other Names:............................. ID Number:............................... Signature.................................. Instructions Time allowed: 45 minutes
More informationTopics. Java arrays. Definition. Data Structures and Information Systems Part 1: Data Structures. Lecture 3: Arrays (1)
Topics Data Structures and Information Systems Part 1: Data Structures Michele Zito Lecture 3: Arrays (1) Data structure definition: arrays. Java arrays creation access Primitive types and reference types
More informationINTERFACES IN JAVA. Prof. Chris Jermaine
INTERFACES IN JAVA Prof. Chris Jermaine cmj4@cs.rice.edu 1 Now On To Interfaces in Java Java gives the ability to declare an interface Like a, except: Can t declare any member variables (well, you can,
More informationCSci 1113, Fall 2015 Lab Exercise 11 (Week 13): Discrete Event Simulation. Warm-up. Stretch
CSci 1113, Fall 2015 Lab Exercise 11 (Week 13): Discrete Event Simulation It's time to put all of your C++ knowledge to use to implement a substantial program. In this lab exercise you will construct a
More informationUNIVERSITY OF MASSACHUSETTS LOWELL Department of Electrical and Computer Engineering. Program 8 EECE.3220 Data Structures Fall 2017
UNIVERSITY OF MASSACHUSETTS LOWELL Department of Electrical and Computer Engineering Program 8 EECE.3220 Data Structures Fall 2017 Binary Search Trees and Class Templates Word Counter Application The object
More informationHomework 8: Matrices Due: 11:59 PM, Oct 30, 2018
CS17 Integrated Introduction to Computer Science Klein Homework 8: Matrices Due: 11:59 PM, Oct 30, 2018 Contents 1 Reverse (Practice) 4 2 Main Diagonal (Practice) 5 3 Horizontal Flip 6 4 Vertical Flip
More informationCS100J Prelim I, 29 Sept. 2003
CS100J Prelim I, 29 Sept. 2003 CORNELL NETID NAME (PRINT LEGIBLY!) (last, first) Question 0 out of 02 This 90-minute exam has 6 questions worth a total of 100 points. Question 1 out of 20 We suggest that
More information2015 Academic Challenge
2015 Academic Challenge COMPUTER SCIENCE TEST - SECTIONAL This Test Consists of 30 Questions Computer Science Test Production Team James D. Feher, McKendree University Author/Team Leader Nathan White,
More informationOutline. Parts 1 to 3 introduce and sketch out the ideas of OOP. Part 5 deals with these ideas in closer detail.
OOP in Java 1 Outline 1. Getting started, primitive data types and control structures 2. Classes and objects 3. Extending classes 4. Using some standard packages 5. OOP revisited Parts 1 to 3 introduce
More informationExam Principles of Imperative Computation, Summer 2011 William Lovas. June 24, 2011
Exam 3 15-122 Principles of Imperative Computation, Summer 2011 William Lovas June 24, 2011 Name: Sample Solution Andrew ID: wlovas Instructions This exam is closed-book with one double-sided sheet of
More information