Implementation of linear data structures

Assignment Help Data Structure & Algorithms
Reference no: EM131958910

Array Version Assignment

Overview

In lecture, you've learned the array implementation of several linear data structures. The ArrayList was fully coded but the array version of the stack, queue, and deque were discussed only in general terms, no code. Also, the array version of each of these data structures discussed in class had a fixed amount of storage, the array data member could not be reassigned an array which is larger or smaller than the current array. But, a dynamic version of the ArrayList was covered as well. Coding the dynamic array versions of the stack, queue, and deque are important to strengthen your understanding of the inner workings of these data structures.

Design

You will write the implementation for the DynamicArrayStack, DynamicArrayQueue, and DynamicArrayDeque classes. Download the files DynamicArrayStack.java, DynamicArrayQueue.java, DynamicArrayDeque.java Stack.java, Queue.java, and Deque.java needed for the assignment.

You will write code for all the methods of the DynamicArrayStack.java, DynamicArrayQueue.java, and DynamicArrayDeque.java classes. You cannot add any additional data members to each class and you cannot modify the code for the constructors of each class. For the "Dynamic" aspect of this assignment, you can use the appropriate code from the DynamicArrayList.java class. You do not need to create any other classes for this assignment at all!

You do not need to write any other code for the assignment but you will need to thoroughly test your code implementation for the three classes.

Attachment:- Java files.rar

Verified Expert

In this assignment we are implementing dynamic version of stack and queue. Dynamic states that the size of the data structure is not fixed at compile time. It can be changed at the time of execution.

Reference no: EM131958910

Questions Cloud

What was net operating working capital : What was net operating working capital for 2014 and 2015? What price must you pay to purchase this bond? Ignore any accrued interest or trading costs.
Explain how financial performance will be measured : Describe the environmental forces that affect health care operating budgets. Explain how financial performance will be measured.
What is the entropy changes : What is the entropy changes, delta S (in units of J/K) when Argon gas (Ar), at 1.00 atm in a 0.5 L container is allowed to expand to 1 L at a constant
Measure the initial potential of an unknown : From the initial measurements you determine the electrode slope is -55.5 mV. Following the same procedure as described in your lab
Implementation of linear data structures : Array implementation of several linear data structures. The ArrayList was fully coded but the array version of the stack, queue, and deque were discussed
What is the molarity of fluoride in the original : After the addition of 0.1001 M fluoride the potential drops to 35.7 mV. What is the molarity of fluoride in the original, undiluted, unknown?
Applied for bank loan to finance italian restaurant : Jennifer Pisano just applied for a bank loan to finance an Italian restaurant she wants to launch, what would you say to Jennifer in response to her comments?
How do the results fit with previous research in the area : How do the results fit with previous research in the area? Were there any untoward events during the conduct of the study?
Finding all of the molecules in one bulb one hour later : The more gas molecules you release, the less chance there is of finding all of the molecules in one bulb one hour later.

Reviews

len1958910

4/26/2018 5:44:53 AM

Once you submit your assignment you will not be able to resubmit it! Make absolutely sure the assignment you want to submit is the assignment you want graded. There will be NO exceptions to this rule! You will submit your Zip file via your CUNY Blackboard account. Follow these instructions: Log onto your CUNY BlackBoard account. Click on the CSCI 313 course link in the list of courses you're taking this semester. Click on Content in the green area on the left side of the webpage. You will see the Assignment 2 – Array Version Assignment. Click on the assignment. Upload your Zip file and then click the submit button to submit your assignment.

len1958910

4/26/2018 5:44:46 AM

Creating a Zip file in Mac OS X: 1. Click File on the menu bar. 2. Click on Compress 3 Items. 3. Mac OS X creates the file Archive.zip. 4. Rename Archive as described below. 5. Follow the directions below to submit your assignment. Save the Zip file with the filename having the following format: your last name, followed by an underscore _, followed by your first name, followed by an underscore _, followed by the word Assignment2. For example, if your name is John Doe then the filename would be: Doe_John_Assignment2

len1958910

4/26/2018 5:44:39 AM

Go to the folder containing your files: DynamicArrayStack.java, DynamicArrayQueue.java, and DynamicArrayDeque.java and select them in order to place them in a Zip file. The file should NOT be a 7z or rar file! Then, follow the directions below for creating a zip file depending on the operating system running on the computer containing your selected .java files. Creating a Zip file in Microsoft Windows (any version): 1. Right-click any of the selected .java files to display a pop-up menu. 2. Click on Send to. 3. Click on Compressed (zipped) Folder. 4. Rename your Zip file as described below. 5. Follow the directions below to submit your assignment.

len1958910

4/26/2018 5:44:28 AM

The total project is worth 20 points, broken down as follows: If none of your .java files compile successfully then the grade for the assignment is zero. If the program compiles successfully and executes without significant runtime errors then the grade computes as follows: Followed proper submission instructions, 2 points: Was the file submitted a zip file. The zip file has the correct filename. The contents of the zip file are in the correct format. DynamicArrayStack class, 6 points: The code works, executes properly, and adheres to the requirements of the assignment. DynamicArrayQueue class, 6 points: The code works, executes properly, and adheres to the requirements of the assignment. DynamicArrayDeque class, 6 points: The code works, executes properly, and adheres to the requirements of the assignment.

Write a Review

Data Structure & Algorithms Questions & Answers

  Implement an open hash table

In this programming assignment you will implement an open hash table and compare the performance of four hash functions using various prime table sizes.

  Use a search tree to find the solution

Explain how will use a search tree to find the solution.

  How to access virtualised applications through unicore

How to access virtualised applications through UNICORE

  Recursive tree algorithms

Write a recursive function to determine if a binary tree is a binary search tree.

  Determine the mean salary as well as the number of salaries

Determine the mean salary as well as the number of salaries.

  Currency conversion development

Currency Conversion Development

  Cloud computing assignment

WSDL service that receives a request for a stock market quote and returns the quote

  Design a gui and implement tic tac toe game in java

Design a GUI and implement Tic Tac Toe game in java

  Recursive implementation of euclids algorithm

Write a recursive implementation of Euclid's algorithm for finding the greatest common divisor (GCD) of two integers

  Data structures for a single algorithm

Data structures for a single algorithm

  Write the selection sort algorithm

Write the selection sort algorithm

  Design of sample and hold amplifiers for 100 msps by using n

The report is divided into four main parts. The introduction about sample, hold amplifier and design, bootstrap switch design followed by simulation results.

Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd