Create a template class representing a stack containing up to ten elements, using a main and Stack.h. Recall that in order for class templates to work correctly, all code for that class (definition and implementation) must be in the .h file. You have been provided with a starting point for Stack.h with all the necessary code for a stack, and you will need to convert it to a template. In your main, declare a stack of longs and a stack of strings. The input will follow the same pattern as the other stack and queue labs, except that each command will then be followed by either an 'S' or an 'L', indicating which stack to perform that command on. Those commands are: • 'P', which will be followed by a value. You should push that value onto the appropriate stack • 'O', which will pop the value from the top of the appropriate stack and print it, followed by a new line • 'K'. which will peek at the value on top of the appropriate stack and print it, followed by a new line 'Q', which will quit the program You can assume that all the input is valid. For instance, if the input was: PS Cat P S Dog P L 10 P L 11 K SOLO SOLO SQ

Create a template class representing a stack containing up to ten elements, using a main and Stack.h. Recall that in order for class templates to work correctly, all code for that class (definition and implementation) must be in the .h file. You have been provided with a starting point for Stack.h with all the necessary code for a stack, and you will need to convert it to a template. In your main, declare a stack of longs and a stack of strings. The input will follow the same pattern as the other stack and queue labs, except that each command will then be followed by either an 'S' or an 'L', indicating which stack to perform that command on. Those commands are: • 'P', which will be followed by a value. You should push that value onto the appropriate stack • 'O', which will pop the value from the top of the appropriate stack and print it, followed by a new line • 'K'. which will peek at the value on top of the appropriate stack and print it, followed by a new line 'Q', which will quit the program You can assume that all the input is valid. For instance, if the input was: PS Cat P S Dog P L 10 P L 11 K SOLO SOLO SQ

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

1. Use a below-given starter code. Use StackInterface.(h), and ArrayStack.(h,cpp). You will write your own StackDriver.cpp application file. IT'S IN C++Also...If the class that you create is Star, remember that you will declare your stack as follows:ArrayStack<Star> myStarStack;and you will push, pop, and peek Star objects.2. Create your own class definition. I should have at least one attribute, a constructor, and set and get methods for each attribute in your class.NOTE: If your class is offensive your lab will be rejected and you will receive a score of zero. I'm sorry I have to say this but there is a history of this happening and it is not appropriate.3. Write a driver program that exercises the Stack class from the downloaded starter code. Create multiple instances of your own class and demonstrate the stack operations: push, pop, and peek. ( you write your own class that you will put on the stack and you will write a driver that pushes, peeks, and pops your class items…
Write a C++ program that creates and prints a linked list of classes. Base this program on what you know so far about using structures and linked lists, however, create a class. Create a class with private member variables string and next (to point to the next class in the list). You'll need setters and getters. The string will simply be a word you enter. Request a word from the user until the user enters end. As the words are entered, build a linked list of classes, forward. Once the list is built, print the list of classes. Enter at least 4 words for a linked list of 4 class objects. You may call the class list . The program must compile and create at least one node with data.
Two stacks of the same kind are the same if they contain the same number of elements and have the same items at the same places. Overload the relational operator == for the class stackType, which returns true if two stacks of the same type are identical; otherwise, it returns false. Also, write the function template definition to overload this operator. Create a programme to test the overloaded operators and functions of the stackType class.
Two stacks of the same type are the same if they have the same number of elements and their elements at the corresponding positions are the same. Overload the relational operator == for the class stackType that returns true if two stacks of the same type are the same; it returns false otherwise. Also, write the definition of the function template to overload this operator. Write a program to test the various overloaded operators and functions of class stackType.
C# Programing Language Given the code below 1.Change all of the low-level arrays in your program to use the appropriate C# collection class instead. Be sure to implement Deck as a Stack 2. Make sure that you use the correct type-safe generic designations throughout your program. 3.Write code that watches for that incorrect data and throws an appropriate exception if bad data is found.4. Write Properties instead of Getter and Setter methods. no lamdas, no delegates, no LINQ, no eventsGo Fish using System; namespace GoFish{public enum Suit { Clubs, Diamonds, Hearts, Spades };public enum Rank { Ace, Two, Three, Four, Five, Six, Seven, Eight, Nine, Ten, Jack, Queen, King }; // ----------------------------------------------------------------------------------------------------- public class Card{public Rank Rank { get; private set; }public Suit Suit { get; private set; } public Card(Suit suit, Rank rank){this.Suit = suit;this.Rank = rank;} public override string ToString(){return ("[" +…
for c++ A set is a collection of distinct elements of the same type. Design the class unorderedSetType. Design the class unorderedSetType, derived from the class unorderedArrayListType, to manipulate sets. Note that you need to redefine only the functions insertAt, insertEnd, and replaceAt. If the item to be inserted is already in the list, the functions insertAt and insertEnd output an appropriate message. Similarly, if the item to be replaced is already in the list, the function replaceAt outputs an appropriate message. Write a program to test your class.
Write a c++ program. You will create a class “Node” with the following private data attributes: line – line from a file (string) next - (pointer to a Node) Put your class definition in a header file and the implementation of the methods in a .cpp file. Follow the style they use in the book of having a "#include" for the implementation file at the bottom of the header file. You will have the following public methods: Accessors and mutators for each attribute Constructor that initializes the attributes to nulls (empty string and nullptr) LinkedList class You will create a class “LinkedList” with the following private data attributes: headPtr – raw pointer to the head of the list numItems – number of items in the list Put your class definition in a header file and the implementation of the methods in a .cpp file. Follow the style they use in the book of having a "#include" for the implementation file at the bottom of the header file. You will have the following public methods:…
You will write a program to process the lines in a text file using a linked list ADT and raw pointers. Node class You will create a class “Node” with the following private data attributes: line – line from a file (string) next - (pointer to a Node) Put your class definition in a header file and the implementation of the methods in a .cpp file. Follow the style they use in the book of having a "#include" for the implementation file at the bottom of the header file. You will have the following public methods: Accessors and mutators for each attribute Constructor that initializes the attributes to nulls (empty string and nullptr) LinkedList class You will create a class “LinkedList” with the following private data attributes: headPtr – raw pointer to the head of the list numItems – number of items in the list Put your class definition in a header file and the implementation of the methods in a .cpp file. Follow the style they use in the book of having a "#include" for the…
You will create two programs. The first one will use the data structure Stack and the other program will use the data structure Queue. Keep in mind that you should already know from your video and free textbook that Java uses a LinkedList integration for Queue. Stack Program Create a deck of cards using an array (Array size 15). Each card is an object. So you will have to create a Card class that has a value (1 - 10, Jack, Queen, King, Ace) and suit (clubs, diamonds, heart, spade). You will create a stack and randomly pick a card from the deck to put be pushed onto the stack. You will repeat this 5 times. Then you will take cards off the top of the stack (pop) and reveal the values of the cards in the output. As a challenge, you may have the user guess the value and suit of the card at the bottom of the stack. Queue Program There is a new concert coming to town. This concert is popular and has a long line. The line uses the data structure Queue. The people in the line are objects…
Write a C++ program. Node class You will create a class “Node” with the following private data attributes: line – line from a file (string) next - (pointer to a Node) Put your class definition in a header file and the implementation of the methods in a .cpp file. Follow the style they use in the book of having a "#include" for the implementation file at the bottom of the header file. You will have the following public methods: Accessors and mutators for each attribute Constructor that initializes the attributes to nulls (empty string and nullptr) LinkedList class You will create a class “LinkedList” with the following private data attributes: headPtr – raw pointer to the head of the list numItems – number of items in the list Put your class definition in a header file and the implementation of the methods in a .cpp file. Follow the style they use in the book of having a "#include" for the implementation file at the bottom of the header file. You will have the following public…
c++ student instruction1. SimpleVector Generic Template2. SearchableVector Generic Template3. SimpleVectorInterface Generic Template4. Soccer Class implemented with MyString 5. Implementation of operators.6. Use three files in your implementation.Description of the problem:1. Use the Soccer class described in Gaddis chapter 11 number 6 page 6522. Implement the operators in your code, and make the code modifications discussed in class, to create a one-dimensional array composed of instances of type Soccer and show your results in solving the following problems:to. (Gaddis) Programming Challenger 9. SearchableVectorModification page 1023 Chapter 16b. (Gaddis) Programming Challenger 10. SortableVector ClassTemplate Modification page 1023 Chap16. order with himSelection Sort algorithm p. 474 Chap. 8=============================================================== Soccer Scores class infoWrite a program that stores the following data about a soccer player in a structure: Player’s Name…
Please write a full C++ code and provide code and output Two stacks of the same type are the same if they have the same number of elements and their elements at the corresponding positions are the same. Overload the relational operator == for the class linkedStackTypethat returns true if two stacks of the same type are the same; it returns false otherwise. Also, write the definition of the function template to overload this operator.