Question 1

What are the advantages of the java.util.Stack implementation of a stack?

Accepted Answer

Because the java.util.Stack implementation is an extension of the Vector class, it can keep track of the positions of elements in the stack using an index and thus does not require each node to store an additional pointer. This implementation also allocates space only as it is needed, like the linked implementation.

Question 2

Stack elements are processed in a FIFO manner-the first element in is the first element out.

Accepted Answer

A) True 
 B)False  False

Question 3

When all references to an object are lost and the object can no longer be used, JAVA uses ______ to free up the memory taken up by the unreferenced object.

Accepted Answer

Automatic Garbage Collection

Question 4

What is the principle difference in behavior between a stack and a queue?

Accepted Answer

A)  a stack reverses order whereas a queue preserves order 
B)  a stack does nothing whereas a queue can preserve and reverse order 
C)  there is no difference 
D)  a stack preserves order whereas a queue reverses order 
A)  a stack reverses order whereas a queue preserves order 
B)  a stack does nothing whereas a queue can preserve and reverse order 
C)  there is no difference 
D)  a stack preserves order whereas a queue reverses order

Question 5

What is abstraction and what advantage does it provide?

Accepted Answer

Abstraction is the concept of

Question 6

A Java interface defines a set of ______ methods and is useful in separating the concept of an abstract data type from its implementation.

Accepted Answer

The answer of A Java interface defines a set of...

Question 7

______ processing can be simulated using a stack to keep track of the appropriate data.

Accepted Answer

The answer of ______ processing can be simulated using a...

Question 8

What is a data type?

Accepted Answer

A data type is a set of values

Question 9

The order in which references are changed is crucial to maintaining a linked list.

Accepted Answer

A) True 
 B)False

Question 10

Stacks operate as _______________.

Accepted Answer

A)  Last Out, First In 
B)  First In, First Out 
C)  Last In, First Out 
D)  None of the above 
A)  Last Out, First In 
B)  First In, First Out 
C)  Last In, First Out 
D)  None of the above

Question 11

What are the 3 primary methods for a stack?_______

Accepted Answer

The answer of What are the 3 primary methods for...

Question 12

What would be the time complexity of the push operation if we chose to push at the end of the list instead of the front?

Accepted Answer

To push at the end of the list, we would

Question 13

A ______ can be used to reverse the order of a set of data.

Accepted Answer

A)  Queue 
B)  Stack 
C)  Software 
D)  Heaps 
A)  Queue 
B)  Stack 
C)  Software 
D)  Heaps

Question 14

When two object references refer to the same object, the references are called ____ of each other.

Accepted Answer

The answer of When two object references refer to the...

Question 15

A linked list is ____ where as an array is ______.

Accepted Answer

The answer of A linked list is ____ where as...

Question 16

Elements in a collection are typically organized by

Accepted Answer

A)  the order of their addition to the collection 
B)  by some inherent relationship among the elements 
C)  randomly 
D)  A and B 
E)  None of the above 
A)  the order of their addition to the collection 
B)  by some inherent relationship among the elements 
C)  randomly 
D)  A and B 
E)  None of the above

Question 17

What is an abstract data type?

Accepted Answer

An abstract data type is a dat

Question 18

If an exception occurs during the execution of a java program and is not handled in the method where it occurs, the exception will be ______.

Accepted Answer

propagated

Question 19

A linked list dynamically grows as needed and essentially has no capacity limitations.

Accepted Answer

A) True 
 B)False

Question 20

Explain how a linked list is formed using object reference variables.

Accepted Answer

Each object stores a next poin

What are the advantages of the java.util.Stack implementation of a stack?

Stack elements are processed in a FIFO manner-the first element in is the first element out.

When all references to an object are lost and the object can no longer be used, JAVA uses ______ to free up the memory taken up by the unreferenced object.

What is the principle difference in behavior between a stack and a queue?

What is abstraction and what advantage does it provide?

A Java interface defines a set of ______ methods and is useful in separating the concept of an abstract data type from its implementation.

______ processing can be simulated using a stack to keep track of the appropriate data.

What is a data type?

The order in which references are changed is crucial to maintaining a linked list.

Stacks operate as _______________.

What are the 3 primary methods for a stack?_______

What would be the time complexity of the push operation if we chose to push at the end of the list instead of the front?

A ______ can be used to reverse the order of a set of data.

When two object references refer to the same object, the references are called ____ of each other.

A linked list is where as an array is __.

Elements in a collection are typically organized by

What is an abstract data type?

If an exception occurs during the execution of a java program and is not handled in the method where it occurs, the exception will be ______.

A linked list dynamically grows as needed and essentially has no capacity limitations.

Explain how a linked list is formed using object reference variables.

Introduction

Analysis of Algorithms

Introduction to Collections - Stacks

Queues

Lists

Iterators

Recursion

Searching and Sorting

Trees

Binary Search Trees

Heaps and Priority Queues

Sets and Maps

Multi-Way Search Trees

Graphs

UML

Object-Oriented Design

Filters

Exam 4: Linked Structures - Stacks

What are the advantages of the java.util.Stack implementation of a stack?

Stack elements are processed in a FIFO manner-the first element in is the first element out.

When all references to an object are lost and the object can no longer be used, JAVA uses ______ to free up the memory taken up by the unreferenced object.

What is the principle difference in behavior between a stack and a queue?

What is abstraction and what advantage does it provide?

A Java interface defines a set of ______ methods and is useful in separating the concept of an abstract data type from its implementation.

______ processing can be simulated using a stack to keep track of the appropriate data.

What is a data type?

The order in which references are changed is crucial to maintaining a linked list.

Stacks operate as _______________.

What are the 3 primary methods for a stack?_______

What would be the time complexity of the push operation if we chose to push at the end of the list instead of the front?

A ______ can be used to reverse the order of a set of data.

When two object references refer to the same object, the references are called ____ of each other.

A linked list is ____ where as an array is ______.

Elements in a collection are typically organized by

What is an abstract data type?

If an exception occurs during the execution of a java program and is not handled in the method where it occurs, the exception will be ______.

A linked list dynamically grows as needed and essentially has no capacity limitations.

Explain how a linked list is formed using object reference variables.

Introduction

Analysis of Algorithms

Introduction to Collections - Stacks

Queues

Lists

Iterators

Recursion

Searching and Sorting

Trees

Binary Search Trees

Heaps and Priority Queues

Sets and Maps

Multi-Way Search Trees

Graphs

UML

Object-Oriented Design

Filters

A linked list is where as an array is __.