Exam 14: Introduction to Collections and Stacks

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).

(Essay)

4.9/5

(37)

Question 21

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

(True/False)

4.7/5

(36)

Question 22

A stack is a ___________________ data structure.

(Multiple Choice)

4.9/5

(35)

Question 23

Which of the following methods removes an element from a queue?

(Multiple Choice)

4.9/5

(44)

Question 24

Which of the following methods inserts an element into a stack data structure?

(Multiple Choice)

4.8/5

(39)

Question 25

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

(Essay)

4.9/5

(31)

Question 26

A postfix expression can be easily evaluated using a queue.

(True/False)

4.9/5

(38)

Question 27

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?

(Essay)

4.7/5

(41)

Question 28

What exception is thrown if the pop method is called on an empty stack?

(Multiple Choice)

4.7/5

(32)

Question 29

Which of the following is not a queue operation?

(Multiple Choice)

4.8/5

(42)

Question 30

A queue is a FIFO structure.

(True/False)

4.8/5

(35)

Question 31

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

(Short Answer)

4.9/5

(32)

Question 32

It is only possible to implement a queue using an array-based structure.

(True/False)

4.8/5

(35)

Question 33

List the five basic operations on a stack.

(Short Answer)

4.7/5

(34)

Question 34

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?

(Essay)

4.8/5

(37)

Question 35

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

(Short Answer)

4.9/5

(35)

Question 36

In an ideal implementations of a stack and a queue, all operations are ______________________ .

(Multiple Choice)

4.8/5

(36)

Question 37

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

(True/False)

4.9/5

(34)

Question 38

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

(True/False)

4.7/5

(34)

Question 39

A stack is the ideal collection to use when _______________________ .

(Multiple Choice)

4.9/5

(38)

Question 40

Showing 21 - 40 of 40

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

A stack is a ___________________ data structure.

Which of the following methods removes an element from a queue?

Which of the following methods inserts an element into a stack data structure?

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

A postfix expression can be easily evaluated using a queue.

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?

What exception is thrown if the pop method is called on an empty stack?

Which of the following is not a queue operation?

A queue is a FIFO structure.

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

It is only possible to implement a queue using an array-based structure.

List the five basic operations on a stack.

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?

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

In an ideal implementations of a stack and a queue, all operations are ______________________ .

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

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

A stack is the ideal collection to use when _______________________ .

Introduction

Data and Expressions

Using Classes and Objects

Conditionals and Loops

Writing Classes

Graphical User Interfaces

Arrays

Inheritance

Polymorphism

Recursion

Exceptions

Searching and Sorting

Trees

Heaps and Priority Queues

Graphs

Filters