countryqueen Goto Github PK

2nd-data

3linklist_merge

Create this sort, instrument by counting iterations, run it using a large (1000 or more links) linked list. What if the Merge sort separated the list into three lists? Would it be faster, slower, or the same. Make a prediction, then write the code for 3 lists and then run the new sort. Was your prediction correct? Submit a Word document discussing your results,

advancedjava3

Demonstrate the use of Classes and Objects - Inheritance and Polymorphism. Write a program for a used book store to track their inventory. The book dealer buys and sells three kinds of items, books, DVD movies, and paintings. Each item in inventory should have an instance of an object instantiated for it. Each object should have at least one constructor and should use get and set methods to set and read the object properties. The super class StoreItem should contain all the objects and methods that all StoreItems share such as the properties title, author, date acquired, purchasePrice (what the dealer paid to get this item in the store), asking price (the price the dealer wants for this item), etc., and the methods get, set, printableString. A method to calculate the profit on a sale is also necessary. The Book class should have the properties that are unique to Books (genre, title author, etc). The Movie class should have the properties that are unique to movies(title, director, actors[], actresses[], etc.). The Painting class should have the properties that are unique to paintings (height, width, media (oil, water color, etc.) ). Make the object instances keep track of how many of each type of StoreItem are in the store. When selling a item, you will remove the object and decrement the count for that item's class. When adding an item to inventory, an object needs to be instantiated and the count for that item type increased. (Hint: Use a static counter.) Demonstrate the use of inheritance (Hint: StoreItem is the super class). Also, demonstrate polymorphism in this project. Allow the user to add inventory (create new objects), sell inventory (remove objects), and display current inventory (display each object’s properties one at a time). IMPORTANT: None of these classes, StoreItem, book, Movie, or Painting, should have direct input or output. This means that the GUI class should handle the IO, not the StoreItem class. Or, said another way, the Book class should not ask the user for the value of a property, nor shall it print output directly to the screen. Listed below is the UML diagram for the minimum level project for this assignment.

advjava2

carbon-tutorial

An app for the Carbon Design System tutorial

darkmodekit

A library for backporting Dark Mode in iOS

data-2

data-3-aj

data-structures

datastructures4

Create a binary tree to count the number of each word in a text document. Start by creating a modified B-Tree. The B-Tree should be modified to record the Word and a word count. Scan a text document and parse each word found. Remove and discard all punctuation and make all words lower case. One at a time, add each word to the tree. If the word is already in the tree, increment the counter, otherwise, add the new word to the B-Tree setting the new words counter to one. Once the document has been scanned, use in order traversal to print the words in alphabetical order with the word count.

finite-state-machine

Upload textfile with the rules and implement a finite state machine

for-tutor

git-workshop

Repo w/ example for Women Who Code Diversity Hackathon Git workshop

jonesproject2datastructures

Write a program that implements a stack using a linked list.

practice

proj-6-ds

project-4-own-gui

project-5-adv-java

project-6-adv-java

project-8-adv-java

project1-data-strucutres

project1errorhandling

This Java code is for the Java class taught by Dr. Woodcock.

project5datastructures

234 tree and textfile combo

project6ds

text file + hash function

sherwoodalgorithm

For this assignment, I want you to take a Binary Search program and convert it to a Sherwood algorithm program. In Binary search you always find the middle of the range, recursively choosing the side that has the value you are looking for. In Sherwood you randomly select any point in the range rather than the middle to divide and conquer.