Coursework

This is a repository for my past course projects.

Map with Hashing

Design and develop the data structure representing a Map object by layering it on top of Array and Map itself. The algorithmic approach is to use hashing to immediately narrow every search to a much smaller Map. A JUnit test is performed on implementations of all the constructors and kernel methods defined in interface MapKernel.

Set On Binary Search Trees

Design and develop the data structrue representing a Set object based on top of binary tree. The purpose of using binary search tree is to produce a reduction in search time. A JUnit test is performed on implementations of constructor and all kernel methods.

Sorting Machine with Heapsort

Design and develop the data structure representing a SortingMachine object based on top of Queue and Array. Sorting algorithm Heapsort is applied here. A JUnit test is performed on implementations of constructor and all kernel methods.

List with Retreat

Design and develop a representation that involves a doubly-linked list of nodes using Java reference. A JUnit test is performed on implementations of constructor and all kernel methods.

Implementation of Program and Statement kernels

Implement and test the constructor and all kernel methods defined in interfaces ProgramKernel and StatementKernel.

BL Parser

Implement a recursive-descent parser for the BL language.

WaitingLine Family Design

Design the interfaces for a new component family called WaitingLine. WaitingLinecomponent family is trying to capture the idea of a waiting line like you might encounter at a restaurant.

Hashing Experiments

The program takes various hash table sizes and files as input, then do hashing on the hundred lines of text in the file. The purpose of this project is to get familiar with hashing, including hashcode, hash function and mod.

Java Collections Framework(JCF) Exploration

The purpose of this lab is to get familiar with JCF components by implementing two methods using both JCF components and OSU components.

Java IO Exploration

This lab implements two programs that read input from a file and write output to a file. It also includes exceptions handling with try-catch and command-line arguments manipulation.

Map On Queue

This lab is to implement and test a kernel component Map2 layered on top of Queue.

List with Two Smart Nodes

This lab is to work with linked structures by modifying a given implementation of the kernel component List2 implemented with a singly-linked list. The given implementation uses only one "smart" node at the start of the singly-linked list. After modification a second smart node should be placed at the end of the list.

Tokenizer

This lab is to provide a Tokenizer utility class with the task of tokenizing a simple input.

Stack with LinkedList

This lab is to work with linked structures by implementing and testing a kernel component Stack2 implemented with a singly-linked list.

Set on Queue

This lab is to implement and test a kernel component Set2 implemented on Queue.

Binary Tree

This lab is to get familiar with using the BinaryTree component and recursion by writing the height and isInTree static, generic methods for BinaryTree<T>.

Binary Search Tree

This lab is to get a better understanding of binary search trees and practice using the BinaryTree component and recursion by writing and testing the isInTree static, generic method for BinaryTree<T>.

Sequence Smooth

This lab is to practice writing the smooth static method for Sequence<Integer> in a couple different ways and testing implementations with JUnit test fixture.

Glossary

This project creates a relatively easy-to-maintain glossary facility in HTML format.

A glossary is a list of difficult or specialized words, or terms, with their definitions, that is usually near the end of a book.

Crypto Utilities

This project is about public-key cryptography, which is a crucial factor in Internet's secure communication. One popular public-key cryptographic scheme, RSA, is provably secure under the assumption that factoring of such large numbers is so expensive in terms of execution time as to be computationally infeasible in practice. RSA relies on the ability to decide efficiently whether such a large number is prime, i.e., whether it has any non-trivial factors at all. The project implements a few utility methods that could be used in cryptographic computations, including one that can generate a huge number that is very likely a prime number.

Expression Evaluator

This program calculates the value of an expression consisting of numbers, arithmetic operators, and parentheses.

Natural Number Calculator

Develop a complete calculator application with MVC design(model, view,controller) that uses the NaturalNumber components: a natural number calculator. It works just like any other calculator except that it does exact arithmetic with natural numbers that have no explicit bounds on their values.

chrisxu333 / coursework Goto Github PK

coursework's Introduction