Java Data Structures Final Exam
Solved Correctly To Score A+ 2025|
2026!!!
The end at which the insertions and deletions occur in a stack is called the ____ of the
stack. CORRECT ANSWERS top
In the Reverse Polish notation, the operators are written before the operands.
CORRECT ANSWERS False
In a stack, the ____ operation adds an element onto the stack. CORRECT ANSWERS
push
The method ____ from the Java class Stack returns and removes the top element of the
stack. CORRECT ANSWERS pop
The push method of the stack can be compared with the method ____ for a general list.
CORRECT ANSWERS insertFirst
Physical simulators include wind tunnels used to experiment with the design of car
bodies. CORRECT ANSWERS true
A stack is also called a ____data structure. CORRECT ANSWERS LIFO
As in a stack, the middle elements of the queue are inaccessible, even if the queue
elements are stored in an array. CORRECT ANSWERS false
Simulating the behavior of an expensive or dangerous experiment using a computer
model is usually more expensive than using the real system. CORRECT ANSWERS
false
In a queuing system, the term ____represents the time it takes to serve a customer.
CORRECT ANSWERS transaction time
In a queuing system, when a server becomes free, the customer at the rear of the
queue moves to the free server to be served. CORRECT ANSWERS false
You can use stacks to convert recursive algorithms into nonrecursive algorithms.
CORRECT ANSWERS true
Adding or pushing an element onto the stack is a two-step process. CORRECT
ANSWERS true
, Elements are deleted from a queue at one end, called the ____. CORRECT ANSWERS
front
The ____ method from the interface QueueADT adds a new element to the rear of the
queue. CORRECT ANSWERS addQueue
An array is a random access data structure; that is, you can directly access any element
of the array. CORRECT ANSWERS TRue
A technique in which one system models the behavior of another system is called ____.
CORRECT ANSWERS simulation
The method isFullQueue from the interface QueueADT initializes the queue to an empty
state. CORRECT ANSWERS false
Adding an element to a full stack would generate an error or exception called ____.
CORRECT ANSWERS stack overflow exception
Postfix or Reverse Polish notation has the advantage that the operators appear in the
order required for computation. CORRECT ANSWERS true
What are the two steps in pushing a value onto a stack? CORRECT ANSWERS First,
you must determine if there
is room on the stack for another value. If there is, you push the value onto the stack;
otherwise, you don't.
A ____list is a linked list in which every node has a next pointer and a back pointer.
CORRECT ANSWERS doubly linked
If first points to the first node in a list and first is ____, the list is empty. CORRECT
ANSWERS null
One of the basic operations performed on a list is to process each node of the list.
CORRECT ANSWERS True
An unordered list can be built in two ways: in the forward manner and in the backward
manner. CORRECT ANSWERS true
A doubly linked list can be traversed in either direction. CORRECT ANSWERS true
When building an unordered list in the forward manner, you need ____ reference
variables. CORRECT ANSWERS 3
When building an unordered list in the backward manner, a new node is always inserted
at the end of the linked list. CORRECT ANSWERS false
Solved Correctly To Score A+ 2025|
2026!!!
The end at which the insertions and deletions occur in a stack is called the ____ of the
stack. CORRECT ANSWERS top
In the Reverse Polish notation, the operators are written before the operands.
CORRECT ANSWERS False
In a stack, the ____ operation adds an element onto the stack. CORRECT ANSWERS
push
The method ____ from the Java class Stack returns and removes the top element of the
stack. CORRECT ANSWERS pop
The push method of the stack can be compared with the method ____ for a general list.
CORRECT ANSWERS insertFirst
Physical simulators include wind tunnels used to experiment with the design of car
bodies. CORRECT ANSWERS true
A stack is also called a ____data structure. CORRECT ANSWERS LIFO
As in a stack, the middle elements of the queue are inaccessible, even if the queue
elements are stored in an array. CORRECT ANSWERS false
Simulating the behavior of an expensive or dangerous experiment using a computer
model is usually more expensive than using the real system. CORRECT ANSWERS
false
In a queuing system, the term ____represents the time it takes to serve a customer.
CORRECT ANSWERS transaction time
In a queuing system, when a server becomes free, the customer at the rear of the
queue moves to the free server to be served. CORRECT ANSWERS false
You can use stacks to convert recursive algorithms into nonrecursive algorithms.
CORRECT ANSWERS true
Adding or pushing an element onto the stack is a two-step process. CORRECT
ANSWERS true
, Elements are deleted from a queue at one end, called the ____. CORRECT ANSWERS
front
The ____ method from the interface QueueADT adds a new element to the rear of the
queue. CORRECT ANSWERS addQueue
An array is a random access data structure; that is, you can directly access any element
of the array. CORRECT ANSWERS TRue
A technique in which one system models the behavior of another system is called ____.
CORRECT ANSWERS simulation
The method isFullQueue from the interface QueueADT initializes the queue to an empty
state. CORRECT ANSWERS false
Adding an element to a full stack would generate an error or exception called ____.
CORRECT ANSWERS stack overflow exception
Postfix or Reverse Polish notation has the advantage that the operators appear in the
order required for computation. CORRECT ANSWERS true
What are the two steps in pushing a value onto a stack? CORRECT ANSWERS First,
you must determine if there
is room on the stack for another value. If there is, you push the value onto the stack;
otherwise, you don't.
A ____list is a linked list in which every node has a next pointer and a back pointer.
CORRECT ANSWERS doubly linked
If first points to the first node in a list and first is ____, the list is empty. CORRECT
ANSWERS null
One of the basic operations performed on a list is to process each node of the list.
CORRECT ANSWERS True
An unordered list can be built in two ways: in the forward manner and in the backward
manner. CORRECT ANSWERS true
A doubly linked list can be traversed in either direction. CORRECT ANSWERS true
When building an unordered list in the forward manner, you need ____ reference
variables. CORRECT ANSWERS 3
When building an unordered list in the backward manner, a new node is always inserted
at the end of the linked list. CORRECT ANSWERS false
