Exam 21: Stacks and Queues

A stack based on a linked list is based on the following code Class Node{ String element; Node next; Node(String el,Node n){ Element = el; Next = n; } } Node top = null; The code for implementing the String pop()operation is

A queue based on a linked list uses the following code Class Node{ String element; Node next; Node (String el,Node n){ Element = el; Next = n; } } Node front = null,rear = null; What is the right code for String remove()operation? Such an operation removes and returns an element from the queue.

In a list implementation of a queue,the end of the list from which elements are removed is called

The stack pull operation

The stack peek operation

Consider a class that uses the following variables to implement an array-based stack: String [ ] s = new String[100]; Int top = -1;// Note top == -1 indicates stack is empty A method that implements a String pop()operation can be written as

A queue is a container that allows elements to be stored and removed

Consider a class that uses the following variables to implement an array-based stack: String [ ] s = new String[100]; Int top = 0; A method that implements the String peek()operation can be written as

Consider a class that uses the following variables to implement an array-based stack: String [ ] s = new String[100]; Int top = 0; A method for adding an item x to the stack can be written as

In an implementation of a stack based on a singly-linked list,it is most efficient to add a new item so that

A queue based on a linked list uses the following code Class Node{ String element; Node next; Node (String el,Node n){ Element = el; Next = n; } } Node front = null,rear = null; What is the right code for the boolean empty()method?

In a list implementation of a stack,the end of the list at which elements are added and removed is called

Compilers of modern programming languages support method calls and returns with an internal

Consider a class that uses the following variables to implement an array-based stack: String [ ] s = new String[100]; Int top = -1;// Note top == -1 indicates stack is empty A method that implements a String peek()operation can be written as

In an array-based implementation of a stack,an operation that needs to add a new element to the stack may not be able to complete because the array is full.In this case,the failed operation should

The JCF Stack class is used to instantiate a stack: Stack< Integer > intStack = new Stack< Integer >(); The statements Int k = 77; IntStack.push(k*k); Use the primitive type int instead of the wrapper type Integer.These statements

A stack is a container that allows elements to be stored and removed

A stack based on a linked list is based on the following code Class Node{ String element; Node next; Node(String el,Node n){ Element = el; Next = n; } } Node top = null; The code for implementing the String peek()operation is

The operation for removing an item from a queue is called

The stack pop operation