CSC 207 Software Design
Winter 2015 | Exercise 2
1 Logistics
 Due date: 9:00pm Tuesday 10 November 2015
 Group size: Individual
 Topics: Java Generics, Exceptions
For the rules and procedures for the exercises, including how to submit, please see the Exercises page of the
course website.
2 What to do for this exercise
1. Your individual svn repository now contains a new directory called E2. It contains the starter code for
this exercise. Checkout and study the starter code.
2. Complete/implement Java classes Graph.java and NoSuchNodeException.java, so that obey the
specications below and the descriptions in the starter code.
3. To submit your work, add and commit your changes to your repository.
Do not commit the les and directories generated by Eclipse, such as bin, doc, .project, etc. Marks
will be deducted if you submit these.
3 Abstract Data Type: Graph
In this exercise, you will implement a data structure to represent a graph. A graph consists of nodes and
edges. An edge is a connection between two

Com S 228 Fall 2015

Project 3: Prime Factor List (200 pts)

Due at 11:59pm   Monday, November 2

1. Prime Factorization  A prime number is an integer greater than one and is divisible by one and itself only.  The sequence of prime numbers starts with 2, 3, 5, 7, 11, 13, 17, 19, …   You may check out the first 500 primes at the following site:

https://en.wikipedia.org/wiki/List_of_prime_numbers#The_first_500_prime_numbers

There are infinitely many primes.  As of September 2015, the largest known prime is 257,885,161 –  1, which has 17,425,170 digits.

An integer greater than one and divisible by a third natural number besides 1 and itself is called a composite number.  For example, 4 is a composite number because it is also divisible by 2 in addition to 1 and itself.  The sequence of composite numbers starts with 4, 6, 8, 9, 10, 12, 14, 15, 16, 18, …

By definition, 1 is neither a prime number nor a composite number.

The Fundamental Theorem of Arithmetic states that every integer greater than one is either

Chat Server – Part 1
l Due 2015-11-22 at 11:59pm.
l This is a team project. Each team can have at most two
students.
l Each class that you write in this project should contain
each team member’s name, email, lab section, and date at
the top of the file in the class javadoc.
l Only one team member needs to submit to webcat.
The person who submits should choose the other person as
partner during the submission process. If both team
members submit then the team will eventually get a 0.
Prerequisites
1. String Manipulation & Parsing
2. Member Methods and Variables
3. Input Validation
4. Using Fixed Size Arrays
5. Designing Classes
Learning Objectives
1. Basic Server Operations
2. Understanding a Protocol
3. Session Cookies
4. Measuring Time in Java
5. Circular Arrays
6. Teamwork
Teamwork Advice
If this is your first programming team project then the following information might be useful.
l Each team member should read the handout on her own and write down the important
requirements for each class in her own w

MIE250: Fundamentals of object oriented programming
University of Toronto
Prof. Aleman
aleman@mie.utoronto.ca
Project 3: Stable marriage problem v1
Contents
1 The stable marriage problem (SMP) 1
1.1 A simple example . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.2 SMP applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
2 Program description 3
2.1 Students . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
2.2 Schools . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
2.3 Matching . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
3 Menu options 4
4 Error messages 5
5 Required elements 5
5.1 Variables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5
5.2 Classes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

CSC 207 Software Design
Fall 2015 | Assignment 1
Logistics
 Due date: Thursday 22 October 9:00pm
 Group size: Individual
Overview
For Assignment 1, you will implement a set of Java classes according to the UML diagrams provided in
this assignment description. To help make sure you have properly translated the UML diagrams into code,
we have provided a type checker with your starter code; make sure to check your code with it before the
assignment due date.
Learning Goals
By the end of this assignment, you should have:
1. gained an understanding of how one species the design for an object oriented (OO) program using
basic UML class diagrams,
2. implemented a given OO design, specied by a UML class diagram, in Java,
3. become more familiar with Java generics, interfaces, abstract classes, and inheritance,
4. practised writing high quality Java documentation.
What to do for this assignment
1. Update your local copy of your subversion repository to get the starter les for the assignment. You
should see a dire

COMP1010 (D01) – Fall 2015 – Assignment 2
Due: Oct 13, 2015, 11:59 PM
Material Covered:
 Loops
 Static Methods
Notes:
 Please follow the “Programming Standards” for all your works.
 Hand-in will be via the UMLearn Dropbox facility. Make sure you leave enough time before the deadline to ensure your hand-in works properly.
 Keep in mind that the UMLearn Dropbox facility will only keep the most recent submission. Therefore, if you want to update your submission, make sure you re-upload ALL your assignment files.
Question 1: Star Patterns (version 2)
We saw this question in Assignment 1, now let’s spice it up a little bit. 🙂
Write a program that uses loops to displays the following patterns:
*******
* *****
* ****
* ***
* **
* *
*******
Different from the question in Assignment 1, here are two extra rules:
1. You are allowed to use at most 5 System.out.print() (or println()) in your code. (Exclude the print for “End of processing…” at the end)
2. Each System.out.print() (or println()) can only output 1 ch

CSEE 4119: Computer Networks, Fall 2015
Programming Assignment 1: Socket Programming
Due October 8th
Academic Honesty Policy
You are permitted and encouraged to help each other through Piazza’s web board. This only
means that you can discuss and understand concepts learnt in class. However, you may NOT
share source code or hard copies of source code. Refrain from sharing any material that could
cause your source code to APPEAR TO BE similar to another student’s source code enrolled
in this or previous years. Refrain from getting any code off the Internet. Cheating will be
dealt with severely. Cheaters will be penalized. Source code should be yours and yours only.
Do not cheat.
1. Introduction
In this assignment, starting from the simplest chat functionalities, you will develop more
comprehensive servers for messaging applications, including elementary security features and
current state of the chatroom.
This will require that various processes in different machines
are able to work with each other, and recupe

CSC 207 Assignment3

Due date: 9th August 2015 @ 11:59pm

Welcome to the final CSC 207 programming assignment. You are free to use any IDE that you

wish. This assignment is intended to help you practice basic Java Programming skills, navigate

a bit of Java API and understand regular expressions better.

The main problem statement is more of a text analysis and you will learn how to read the

contents of a webpage by building a Java application. The assignment requires you to write a

program, which reads and analyzes the contents of the Google Scholar Page of an author.

Google Scholar is a freely accessible web search engine that indexes the full text of scholarly

literature across an array of publishing formats and disciplines. For this assignment, you need to

extract information from the Google Scholar publication page of a number of authors. The

format of the link towards the Google Scholar publication page of an author would be like:

http://scholar.google.ca/citations?user=X

where X is the user id

CS110: Introduction to Computing
Spring 2015, Tue/Thu, 5:30 PM – 6:45 PM
Instructor: Pejman Ghorbanzade
Assignment 5
Release Date: Apr 19, 2015 at 00:00 AM
Due Date: Apr 30, 2015 at 05:30 PM
Question 1
Write a program FlightTest.java that controls two airplanes, one plane1
a commercial plane from Eagle company and one plane2, a ghter-bomber
from Dragon company. All airplanes y at some altitude and with some
speed. They take o and land. Just as bombers may drop bomb (if they
have any) while they are in sky, commercials can board passengers (as much
as their capacity allows) while grounded.
Assuming all planes made by Eagle have 300 seats, y at 39000 ft and 550
mph and all planes made by Dragon have 2 bomb bays and y at 30000 ft
and 1000 mph, develop classes Aircraft, Bomber, Commercial, Eagle and
Dragon and use them in a program FlightTest.java.
Question 2
Your manager has just learned basic concepts of interfaces and abstraction in
Java and has asked you to implement the methods in the following interface
i