Write a Java GUI program stacking Student objects of a class. Your program should have buttons for push, pop, and peek. Create a student class with these fields: name (as String) age (as int) major (as String) gpa (as double) gender (as char) Use Java Stack class for implementation and use the GUI for user interaction. At run time books stored in stack should follow the last in first out (LIFO) of a stack. Push is to insert a new student object. Pop is to delete the topmost student object. Peek is to view the to student obiect fields.

Write a Java GUI program stacking Student objects of a class. Your program should have buttons for push, pop, and peek. Create a student class with these fields: name (as String) age (as int) major (as String) gpa (as double) gender (as char) Use Java Stack class for implementation and use the GUI for user interaction. At run time books stored in stack should follow the last in first out (LIFO) of a stack. Push is to insert a new student object. Pop is to delete the topmost student object. Peek is to view the to student obiect fields.

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. Java provides one interface to sort objects of user defined types. What is the name of this interface type. Use an example to describe how to implement this interface. (You answer must be within 5 lines) 2. Suppose I add the following numbers 1, 2, 3, 4, 5 into a Stack, and then remove two numbers from the Stack. What are the remaining numbers in the Stack? Now suppose I add the following numbers 1, 2, 3, 4, 5 into a Queue, and then remove two numbers from the Queue. What are the remaining numbers in the Queue? (You answer must be within 2 lines) 3. In our demo program, we compared the efficiency of ArrayList and LinkedList by adding a number of items to beginning of these two kinds of lists. Which kind of list (ArrayList or LinkedList) takes less time to add? Briefly explain why is that? You may diagrams to explain. 4. To respond to a button event, which overriding method should be implemented in a listener. Use an implementation example to explain. (You answer must be within 5…
Create a Generic Class Assignment Instructions Overview It would be nice if we could write a single sort method to sort the elements in an Integer array, a String array or an array of any type that supports ordering (i.e., its elements can be compared). It would also be nice if we could write a single Stack class that could be used as a Stack of integers, a Stack of floating-point numbers, a Stack of Strings or a Stack of any other type. It would be even nicer if we could detect type mismatches at compile time—known as compile-time type safety. Generic methods and generic classes provide the means to create the type-safe general models mentioned above. Instructions Write a generic class Pair which has two type parameters—F and S—each representing the type of the first and second element of the pair, respectively. Add set and get methods for the first and second elements of the pair and be sure to demonstrate your setters/getters actually work. (Hint: The class header should be public…
The first image is the main question and the second image is the directions for the program. The program has to be written in Java and please use the directions given in the second image to write the program.
For the Queue use the java interface Queue with the ArrayDeque classFor the Stack use the java Deque interface with the ArrayDeque classFor the LinkedList, use the java LinkedList class Also, when you are asked to create and use a Queue, you can use only those methods pertaining to the general operations of a queue (Enqueue: addLast, Dequeue: removeFirst, and peek() Similarly, when you are asked to create and/or use a stack, you can use only those methods pertaining to the general operations of a Stack (push: addFirst, pop:removeFirst, and peek() ) Your code should not only do the job, but also it should be done as efficiently as possible: fast and uses no additional memory if at all possible Questions Write a method “int GetSecondMax(int[] array)” . this method takes an array of integers and returns the second max value Example: if the array contains: 7, 2, 9, 5, 4, 15, 6, 1}. It should return the value: 9
Answer the below attached question ( in java) and also inlcude comments
Data structure: Using Java,
JAVA Two stacks are the same if they have the same size and their elements at the corresponding positions are the same. Add the method equalStack to Class StackClass that takes as a parameter a StackClass object, say otherStack and return true if the stack is the same as otherStack. Also write the definition of method equalStack and a program to test your method. In StackClass.java, please finish method - public boolean equalStack(StackClass<T> otherStack) and testing main program – Problem52.java. (Download Problem52.zip to complete this problem) /*Problem52 public class Problem52 { public static void main(String[] args) { StackClass<Integer> intStack = new StackClass<Integer>(50); StackClass<Integer> tempStack = new StackClass<Integer>(50); } } */
in java starting with an empty stack mimic the functionality of the back and forward button on modern browsers that is, at any point that the stack is not empty,allow a back function to display to previous page.also if you viewing a back page allow a forward button to go to the forward pages stack =[] go to page 1 - display page 1 - stack [page 1] go to page 2 - display page 2 -stack [page1,page 2] go back- display 1 - stack[ page1] go forward - display2 - [page 1 ,page 2] go to page 5- display page 5 -stack[page1,[age2,page5]
Create a graphical application that provides a button for pushand pop from a stack, a text field to accept a string as input forpush, and a text area to display the contents of the stack aftereach operation.
Assume class MyStack implements the following StackGen interface. For this question, make no assumptions about the implementation of MyStack except that the following interface methods are implemented and work as documented. Write a public instance method for MyStack, called interchange(T element) to replace the bottom "two" items in the stack with element. If there are fewer than two items on the stack, upon return the stack should contain exactly two items that are element.
Project Overview: This project is for testing the use and understanding of stacks. In this assignment, you will be writing a program that reads in a stream of text and tests for mismatched delimiters. First, you will create a stack class that stores, in each node, a character (char), a line number (int) and a character count (int). This can either be based on a dynamic stack or a static stack from the book, modified according to these requirements. I suggest using a stack of structs that have the char, line number and character count as members, but you can do this separately if you wish.Second, your program should start reading in lines of text from the user. This reading in of lines of text (using getline) should only end when it receives the line “DONE”.While the text is being read, you will use this stack to test for matching “blocks”. That is, the text coming in will have the delimiters to bracket information into blocks, the braces {}, parentheses (), and brackets [ ]. A string…
Write a java GUI program stacking Student objects of a class. Your program should have buttons for push, pop, and peek. Create a student class with these fields: name (type: String), age (type : int), major ( type: String), gpa (type: double) and gender (type:char). Use Java Stack class for implementation and use the GUI for user interaction. At run time books stored in stack should follow the last in First out (LIFO) of a stack.