CS 3410 - Homework 05
Due date: see course Schedule and Blackboard.
Overview
You will conduct an experiment to determine the average number of cells examined during a random add to a
HashSet using Linear Probing (B-version) or Separate Chaining Hashing (A
MATH 2212 (Spring 2016)
Homework 1 (7.17.3)
NAME:
Due: Thursday, January 21 (Lecture)
REC. DAY/TIME:
Directions: Please write up your work neatly on your own paper, showing all necessary steps, and submit
it with this coversheet. STAPLE ALL PAGES. I will
MATH 2212 (Spring 2016)
NAME:
Homework 2 (7.47.5)
Due: Thursday, January 28
REC. DAY/TIME:
Directions: Please write up your work neatly on your own paper, showing all necessary steps,
and submit it with this coversheet. STAPLE ALL PAGES. I will select fou
Chapter 3 Digital Logic and
Binary Numbers
These are lecture notes to accompany the book
SPARC Architecture, Assembly Language
Programming, and C,
by Richard P. Paul, 2nd edition, 2000.
By Michael Weeks
Richard P. Paul, SPARC Architecture, Assembly Langua
Chapter 4 Binary Arithmetic
These are lecture notes to accompany the book
SPARC Architecture, Assembly Language
Programming, and C,
by Richard P. Paul, 2nd edition, 2000.
By Michael Weeks
Richard P. Paul, SPARC Architecture, Assembly Language Programming,
Chapter 2 Review
2/2/2016
M4 Macro Processor
SPARC Assembly Language Programming
Some instructions:
clear a register to zero
copy contents of one register to
another
combine the contents of the two
source registers, or source register
and literal, with t
MATH 2212 (Spring 2016)
Homework 8 (12.212.5)
NAME:
Due: Tuesday, March 29
REC. DAY/TIME:
Directions: Please write up your work neatly on your own paper, showing all necessary steps, and submit
it with this coversheet. STAPLE ALL PAGES. I will select four
Chapter 3 Digital Logic and
Binary Numbers
These are lecture notes to accompany the book
SPARC Architecture, Assembly Language
Programming, and C,
by Richard P. Paul, 2nd edition, 2000.
By Michael Weeks
Richard P. Paul, SPARC Architecture, Assembly Langua
Accessing Memory
Chapter 5
Lecture notes for SPARC
Architecture, Assembly Language
Programming and C, Richard P. Paul
by Anu G. Bourgeois
Memory
Addresses are 32 bits wide
Therefore, 232 bytes in memory
Each location is numbered consecutively
Memory data
Review
3/29
Alignment rules:
Bytes can start anywhere
Halfwords start on a halfword boundary = address divisible by 2
Words start on a word boundary = address divisible by 4
You can use the .align pseudo-op in your programs (esp. when you
have a word
CS 3410 Ch 18 Trees
Sections
18.1-18.4
Pages
651-680
All code in these notes can be found in the HW 3 download.
18.1 Trees
1. A non-recursive definition of a tree is that it consists of a set of nodes which are connected by a set of edges.
2. In this cour
Ch 6 The Collections API
Sections
6.1-6.9
Pages
201-245
Exercises
1, 2, 7
All code in these notes can be found in the dgibson/cs3410/06 folder on the public drive of the Math/CS network.
6.1 Introduction
1. A data structure is a representation of data and
CS 3410 - Homework 04
Due date: see course Schedule and Blackboard.
Overview
You will compare how long it takes to build a BinarySearchTree and a Red-Black tree using random integers and
patterned integers.
Requirements
1. Obtain the download, hw4.zip.
2.
CS 3410 - Homework 01
Due date: see course Schedule and Vista.
1.
Evaluate the following algorithm via the approach outlined in Section 5.7 (p.188 DS). Your goal is to figure out the
complexity of the algorithm empirically. You might start by trying to fi
CS 3410 - Homework 06
Due date: see course Schedule and Blackboard.
Overview
You will use a Heap (PriorityQueue) to place items into boxes.
Requirements C Version (75 points maximum)
1. Obtain the download, hw6.zip. There, you will find BinaryHeap.java an
CS 3410 - Homework 03
Due date: see course Schedule and Blackboard.
Overview
You will do several problems from the text. I have provided you with code that implements the BinaryTree data
structure discussed in class and a driver to test your solutions.
Re
CS 3410 - Homework 02
Due date: see course Schedule and Blackboard.
Overview
Consider pouring a bucket of water on a particular place on the earth. What path will it take as it flows (conceptually) to the
ocean? Or, does it get trapped, in a bowl, a sink
CS 3410 Ch 7 Recursion
Sections
7.1-7.4, 7.7
Pages
293-319, 333-336
7.1 Introduction
1. A recursive method is a method that either directly or indirectly makes a call to itself. [Weiss]. It does this by
making problem smaller (simpler) at each call. It is
package arraylist;
import java.util.ArrayList;
/*
* @author Aquil
*/
public class Arraylist cfw_
private Object[] theList;
private int size = 0;
public Arraylist() cfw_ /This is the default constructor that will create an
Arraylist object with a default s