University : University of Florida UniLearnO is not sponsored or endorsed by this college or university.
Subject Code : COP3503
Country : United States
Assignment Task 

 

Overview  

In this assignment, you will be implementing your own Array-Based Stack (ABS) and Array-Based Queue (ABQ). A stack is a linear data structure which follows the Last-In, First-Out (LIFO) property. LIFO means that the data most recently added is the first data to be removed. (Imagine a stack of books, or a stack of  papers on a desk—the first one to be removed is the last one placed on top.) 

A queue is another linear data structure that follows the First-In, First-Out (FIFO) property. FIFO means  that the data added first is the first to be removed (like a line in a grocery store—the first person in line  is the first to checkout). 

Both of these are data structures—some sort of class to store information. What makes them different is  how they store and access the information. Adding the same values (say, the numbers 1-10) to either  data structure would result in different ordering/output of the information. Why you might choose one  or the other depends on the specific needs of a program.

 

New keywords/language concepts 

  • Templates – write code to work with multiple data types 
  • The Big Three – Copy Constructor, Copy Assignment Operator, and Destructor – necessary when  working with dynamic memory 
  • Exceptions – Used to indicate something went wrong in an application. Unhandled exceptions  will cause a program to terminate 
  • Deep copy – Creating a copy of dynamically allocated memory requires new memory to be  allocated before copying values

 

Description  

Your ABS and ABQ will be template classes, and thus will be able to hold any data type. (Many data  structures follow this convention—reuse code whenever you can!) Because these classes will be using  dynamic memory, you must be sure to define The Big Three: 

  • Copy Constructor 
  • Copy Assignment Operator 
  • Destructor 

Data will be stored using a dynamically allocated array (hence the array-based stack and queue). You  may use any other variables/function in your class to make implementation easier.

 

 

This (COP3503) Computer Science Assignment has been solved by our Computer Science experts at UniLearnO. Our Assignment Writing Experts are efficient to provide a fresh solution to this question. We are serving more than 10000+ Students in Australia, UK & US by helping them to score HD in their academics. Our Experts are well trained to follow all marking rubrics & referencing style.
Be it a used or new solution, the quality of the work submitted by our assignment experts remains unhampered. You may continue to expect the same or even better quality with the used and new assignment solution files respectively. There’s one thing to be noticed that you could choose one between the two and acquire an HD either way. You could choose a new assignment solution file to get yourself an exclusive, plagiarism (with free Turnitin file), expert quality assignment or order an old solution file that was considered worthy of the highest distinction

Eureka! You've stumped our genius minds (for now)! This exciting new question has our experts buzzing with curiosity. We can't wait to craft a fresh solution just for you!

  • Uploaded By : William
  • Posted on : February 17th, 2019

Whatsapp Tap to ChatGet instant assistance