Question 1

Write an enqueue method for a queue implemented as a linked structure. You may assume that the class has references to LinearNode<T> objects called front and rear, which represent the front and rear of the queue respectively. You may also assume that the class has a variable called count, which represents the number of elements in the queue.

Accepted Answer

The answer of Write an enqueue method for a queue...

Question 2

What is the fundamental difference between radix sort and the other sorting techniques that have been studies.

Accepted Answer

The answer of What is the fundamental difference between radix...

Question 3

In a circular array-based implementation of a queue, the elements must all be shifted when the dequeue operation is called.

Accepted Answer

A circular array-based implementation of a queue eliminates the need to shift elements, so all queue operations can be achieved in constant time.

Question 4

What is wrong with implementing a queue via an array where index 0 represents the front of the queue?

Accepted Answer

The answer of What is wrong with implementing a queue...

Question 5

A radix sort is a comparison-based sorting algorithm.

Accepted Answer

A radix sort is not comparison based; it assumes that the elements to be sorted are all in a certain range, and then sorts them using a set of queues.

Question 6

Suppose the following sequence of elements are inserted into a stack and a queue in the following order: 50, 26, 32, 18, 26, 51. What is the result of three pop operations of the stack and three dequeue operations of the queue?

Accepted Answer

The answer of Suppose the following sequence of elements are...

Question 7

List the five basic operations on a queue.

Accepted Answer

The answer of List the five basic operations on a...

Question 8

What is wrong with the java.util.Stack implementation of a stack?

Accepted Answer

The answer of What is wrong with the java.util.Stack implementation...

Question 9

The peek operation on a stack returns a reference to the element at the bottom of the stack.

Accepted Answer

The peek operation returns a reference to the element at the top of the stack.

Question 10

It is possible to implement a stack and a queue in such a way that all operations take a constant amount of time.

Accepted Answer

Ideal implementations of a stack and a queue have all operations requiring a constant amount of time.

Question 11

Write a push method for a stack implemented as a linked structure. You may assume that the implementation has the top element of the stack referenced by a LinearNode<T> reference top and that an integer variable count keeps track of the number of elements in the stack.

Accepted Answer

The answer of Write a push method for a stack...

Question 12

Write out the order of elements that are contained in a queue after the following operations are performed.

Accepted Answer

The answer of Write out the order of elements that...

Question 13

In a linked implementation of a stack, a pushed element should be added to the end of the list.

Accepted Answer

In a linked implementation of a stack, a pushed element should be added to the front of the list. If the element is added to the end of the list, the pop operation would require linear time, because we would need to go through the entire element to get a pointer to the next-to-last element in the list.

Question 14

Explain how a queue can be implemented using an array, where the enqueue and the dequeue operations are both constant time operations (for simplicity, we'll assume we will never need to expand the capacity of the array).

Accepted Answer

The answer of Explain how a queue can be implemented...

Question 15

Suppose there were no count variable stored for the linked implementation of a queue. Would it still be possible to implement a constant time size operation? How about if there were no count variable stored for an array based implementation of a queue?

Accepted Answer

The answer of Suppose there were no count variable stored...

Question 16

List the five basic operations on a stack.

Accepted Answer

The answer of List the five basic operations on a...

Question 17

Write out the order of elements that are contained in a stack after the following operations are performed.

Accepted Answer

The answer of Write out the order of elements that...

Question 18

Write an enqueue method for a queue implemented as a circular array. You may assume that you have access to a method called expandCapacity that will double the size of the array if necessary. The class has instance variables front and rear, which represent the indexes of the front and rear of the queue. It also has an integer variable called count that represents the number of elements in the queue, as well as an array of generic T types called queue that represents the queue.

Accepted Answer

The answer of Write an enqueue method for a queue...

Question 19

Write a push method for a stack implemented with an array. You may assume that the stack is referenced by an array named stack, and that there is an integer variable named count that keeps track of the number of elements in the stack. You may not assume that you have access to an expandCapacity method (meaning that your method should include code to expand the capacity of the array if it is full).

Accepted Answer

The answer of Write a push method for a stack...

Question 20

In an array-based implementation of a stack, which end of the contents of the array represents the bottom of the stack and why?

Accepted Answer

The answer of In an array-based implementation of a stack,...

Quiz 14: Introduction to Collections and Stacks

What is the fundamental difference between radix sort and the other sorting techniques that have been studies.

In a circular array-based implementation of a queue, the elements must all be shifted when the dequeue operation is called.

What is wrong with implementing a queue via an array where index 0 represents the front of the queue?

A radix sort is a comparison-based sorting algorithm.

Suppose the following sequence of elements are inserted into a stack and a queue in the following order: 50, 26, 32, 18, 26, 51. What is the result of three pop operations of the stack and three dequeue operations of the queue?

List the five basic operations on a queue.

What is wrong with the java.util.Stack implementation of a stack?

The peek operation on a stack returns a reference to the element at the bottom of the stack.

It is possible to implement a stack and a queue in such a way that all operations take a constant amount of time.

Write a push method for a stack implemented as a linked structure. You may assume that the implementation has the top element of the stack referenced by a LinearNode<T> reference top and that an integer variable count keeps track of the number of elements in the stack.

Write out the order of elements that are contained in a queue after the following operations are performed.

In a linked implementation of a stack, a pushed element should be added to the end of the list.

Explain how a queue can be implemented using an array, where the enqueue and the dequeue operations are both constant time operations (for simplicity, we'll assume we will never need to expand the capacity of the array).

Suppose there were no count variable stored for the linked implementation of a queue. Would it still be possible to implement a constant time size operation? How about if there were no count variable stored for an array based implementation of a queue?

List the five basic operations on a stack.

Write out the order of elements that are contained in a stack after the following operations are performed.

In an array-based implementation of a stack, which end of the contents of the array represents the bottom of the stack and why?