Skip to main content

Stack and Queue Implementation with JUnitTesting according to UML

Image
By

Objectives:

After completing this assignment the student should be able to,

  1. Write concrete classes that implement Java Interfaces according to specifications given in UML.
  2. Implement a last-in-first-out (LIFO) stack class in java.
  3. Implement a first-in-first-out (FIFO) queue class in Java.

Requirements:


For this assignment you are given the following Java source code files:
CSE205_Assignment03.java (This file is complete – you will make no changes to this file)
IStack.java (This file is complete – you will make no changes to this file)
IQueue.java (This file is complete – you will make no changes to this file)
MyStack.java (you must complete this file)
MyQueue.java (you must complete this file)
The specifications for the files are given below (including the UML diagram on the following page).
Special requirements:
Both MyStack and MyQueue Classes

http://bit.ly/Hjsoft-JavaHelp

  • size method
    1. Returns the number of items in the collection.
  • empty method
    1. Returns true if the size of the collection is zero; otherwise returns false.
  • peek method
    1. Returns the item at the front or top of the collection.
    2. Throws a NoSuchElementException is the collection is empty
  • 4. search method
    1. Returns the (zero-based) number of elements from the front or top of the collection where the specified item is first found. Returns -1 if the item is not found in the collection.
  • MyStack
    1. You must implement the IStack interface as either a linked list or an array list (refer to your work from Assignment 02). Your MyStack must not be arbitrarily limited to any fixed size at run-time.
    2. push method
    3. Insert the new item at the top of the stack.
    4. pop method
    5. Remove and return the item at the top of the stack.
    6. Throws a NoSuchElementException is the stack is empty
  • MyQueue
    • You must implement the IQueue interface as either a linked list or an array list (refer to your work from Assignment 02). Your MyQueue must not be arbitrarily limited to any fixed size at run-time.
    • add method
      1. Insert the new item at the back of the queue.
    • remove method
      1. Remove and return the item at the front of the queue.
      2. Throws a NoSuchElementException is the queue is empty

CONTACT DETAILS

For any other questions or other tasks please feel free to contact me
via email: mhassnainjamil@gmail.com
via WhatsApp: +92-324-7042178
via skype: hassnainjamil1
Labels:

Comments

Post a Comment

Popular posts from this blog

The Zoo Management System - entity relationship diagram & MS Access Database

By
Zoo Management System - Project Details: You are the employee of a big, worldwide working Zoo Management Company. Your company is responsible for the Zoo management. Your boss thinks it would be a great idea to store all data for each Zoo in a brand new self-developed ZOO Management System. Up to now, the ZOO management company has maps of each ZOO available. Your boss knows that you took a course in introduction on an ERP system, so he asks you if you could help designing such a system. Each ZOO must have the same organizational structure, which should look like this: Each Zoo has a Zoo-Address. Each Zoo has many visitors (Visitor Ticket Process (VTP). Many Zoo-Attractions belong to a Zoo. Module 1: Entity Relationship Diagram Design a ER (entity-relationship) diagram for your ZOO Management System. Use the information provided below with the entities and its attributes. Put the entities in the correct relationship to each other (organizational structure). Module 2: DB Implem...
1 comment
Read more

Human Physiology by Stuart Ira Fox [PDF] (12th edition) free download

By
21 comments
Read more

Sudoku Game Project in Java with full source code including GUI task

By
Introduction The purpose of the project is to try in practice the use of recursion and object-oriented program design. Please make sure to read this entire note before starting your work. Pay close attention to the sections on deadlines, deliverables, and exam rules. The problem Your task in this part of the project is to write a solver for Sudoku puzzles. Sudoku puzzles are a kind of crossword puzzles with numbers where the following two conditions have to be met: In each row or column, the nine numbers have to be from the set [1,2,3,4,5,6,7,8,9] and they must all be different.  For each of the nine non-overlapping 3x3 blocks, the nine numbers have to be from the set [1,2,3,4,5,6,7,8,9] and they ust all be different. The following two figures show a Sudoku puzzle and its solution. The input The input of your program, the Sudoku puzzles, is given in text files. More specifically, they are represented as nine lines of nine characters separated by spaces. The characters can be of two...
Post a Comment
Read more