Data Structures and Algorithms
COMP 2140
Department of Computer Science
University of Manitoba
Assignment 4: Trees due Wednesday November 19 by 12:00 pm (noon)
Objective
This assignment deals with binary trees. An instance of the class BinaryTree is a binary
COMP 2140 Assignment 5: 2-3 Tree Insertions and Heap Sort
Helen Cameron and Stephane Durocher
Due: Wednesday December 3 at noon
Programming Standards
When writing code for this course, follow the programming standards, available on this course's website on
CS110 Project 3
Bob Wilson
Writing a Class “from Scratch” to Satisfy a Provided API and JUnit TestCase
Some applications involve linear equations such as:
ax + by = c
CS110 Project 1
Bob Wilson
Solving Quadratic Equations
We want to write and test a program for solving a quadratic equation of the form:
a x2 + b x + c = 0
1. Answer each of the following questions about the application:
a) In the original application, what were the different ways that NumberFormatException and IOException are handled?
The former use the method of calling a function to prompt the user and the later use the method of throwing an exception
1. Answer each of the following questions about the application:
a) Why did the author of the software decide to create a Price class and its sub classes: RegularPrice and ChildrenPrice instead of creating subclasses RegularMovie and ChildrenMovie of the Movie class.
CS 110: Introduction to Computing with Java
CS 110: Introduction to Computing with Java
CS 110: Introduction to Computing with Java
CS 110: Introduction to Computing with Java
Lab 4
Pre-Lab
Do the following exercises before coming to lab.
1. What is printed by the following Java statements: