Question 1

What is the result of evaluating the following postfix expression: 4 8 + 2 *

Accepted Answer

A)  40 
B)  24 
C)  64 
D)  20 
E)  none of the above are correct 
A)  40 
B)  24 
C)  64 
D)  20 
E)  none of the above are correct B

Question 2

In a radix sort, the radix refers to __________________________ .

Accepted Answer

A)  a circular array 
B)  the number of elements being sorted 
C)  the range of values of the sort key 
D)  a stack 
E)  a queue 
A)  a circular array 
B)  the number of elements being sorted 
C)  the range of values of the sort key 
D)  a stack 
E)  a queue C

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) True 
 B)False  False

Question 4

It is only possible to implement a stack using a linked structure.

Accepted Answer

A) True 
 B)False

Question 5

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

A stack is implemented as an array with

Question 6

Which of the following is not a valid postfix expression?

Accepted Answer

A)  5 4 + 
B)  6 5 4 + - 
C)  4 + 5 
D)  8 2 + 2 / 
E)  all of the above are valid postfix expressions 
A)  5 4 + 
B)  6 5 4 + - 
C)  4 + 5 
D)  8 2 + 2 / 
E)  all of the above are valid postfix expressions

Question 7

A stack is a LIFO structure.

Accepted Answer

A) True 
 B)False

Question 8

In a array-based implementation of a queue that stores the front of the queue at index 0 in the array, the dequeue operation is ___________________.

Accepted Answer

A)  impossible to implement 
B)  has several special cases 
C)  O(n) 
D)  O(n2) 
E)  none of the above 
A)  impossible to implement 
B)  has several special cases 
C)  O(n) 
D)  O(n2) 
E)  none of the above

Question 9

A queue is the ideal collection to use when ____________________ .

Accepted Answer

A)  implementing a radix sort 
B)  evaluating a postfix expression 
C)  evaluating an infix expression 
D)  implementing a quick sort 
E)  none of the above 
A)  implementing a radix sort 
B)  evaluating a postfix expression 
C)  evaluating an infix expression 
D)  implementing a quick sort 
E)  none of the above

Question 10

A radix sort is a comparison-based sorting algorithm.

Accepted Answer

A) True 
 B)False

Question 11

A queue is helpful in implementing a __________________ sort.

Accepted Answer

A)  insertion 
B)  selection 
C)  quick 
D)  radix 
E)  merge 
A)  insertion 
B)  selection 
C)  quick 
D)  radix 
E)  merge

Question 12

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

Accepted Answer

The resulting queue

Question 13

List the five basic operations on a queue.

Accepted Answer

The five basic opera

Question 14

A queue is a ____________________ data structure.

Accepted Answer

A)  LIFO 
B)  FIFO 
C)  link based 
D)  array based 
E)  none of the above 
A)  LIFO 
B)  FIFO 
C)  link based 
D)  array based 
E)  none of the above

Question 15

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

Accepted Answer

The java.util.Stack class is derived fro

Question 16

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

public void enqueue(T element)

Question 17

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

In order to implement a queue as an arra

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

public void enqueue(T element)

Question 19

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

public void push(T element) {

Question 20

Which of the following is not an operation on a stack?

Accepted Answer

A)  push 
B)  pop 
C)  peek 
D)  dequeue 
E)  all of the above are operations on a stack 
A)  push 
B)  pop 
C)  peek 
D)  dequeue 
E)  all of the above are operations on a stack

What is the result of evaluating the following postfix expression: 4 8 + 2 *

In a radix sort, the radix refers to __________________________ .

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

It is only possible to implement a stack using a linked structure.

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

Which of the following is not a valid postfix expression?

A stack is a LIFO structure.

In a array-based implementation of a queue that stores the front of the queue at index 0 in the array, the dequeue operation is ___________________.

A queue is the ideal collection to use when ____________________ .

A radix sort is a comparison-based sorting algorithm.

A queue is helpful in implementing a __________________ sort.

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

List the five basic operations on a queue.

A queue is a ____________________ data structure.

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

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

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.

Which of the following is not an operation on a stack?

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

Exam 14: Introduction to Collections and Stacks

What is the result of evaluating the following postfix expression: 4 8 + 2 *

In a radix sort, the radix refers to __________________________ .

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

It is only possible to implement a stack using a linked structure.

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

Which of the following is not a valid postfix expression?

A stack is a LIFO structure.

In a array-based implementation of a queue that stores the front of the queue at index 0 in the array, the dequeue operation is ___________________.

A queue is the ideal collection to use when ____________________ .

A radix sort is a comparison-based sorting algorithm.

A queue is helpful in implementing a __________________ sort.

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

List the five basic operations on a queue.

A queue is a ____________________ data structure.

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

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

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.

Which of the following is not an operation on a stack?

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