Question 1

Queues use pushing and popping to add and delete data.

Accepted Answer

A) True 
 B)False  False

Question 2

When processing a queue:

Accepted Answer

A) An error occurs when adding data to the queue and the queue is filled. 
B) An error occurs when deleting data from the queue and queue is empty. 
C) An error occurs when the wrong option is entered. 
D) All of the above. 
A) An error occurs when adding data to the queue and the queue is filled. 
B) An error occurs when deleting data from the queue and queue is empty. 
C) An error occurs when the wrong option is entered. 
D) All of the above. D

Question 3

Sorting is done through multiple comparisons and exchanges.

Accepted Answer

A) True 
 B)False  True

Question 4

The shell sort is a modification of the selection sort.

Accepted Answer

A) True 
 B)False

Question 5

Stacks use the first in,first out procedure.

Accepted Answer

A) True 
 B)False

Question 6

Use the bubble sort method to show the first pass of the following array: $\begin{array} { c c } 
\text { Element } & \text { Values } \
1 & 15 \
2 & 23 \
3 & 17 \
4 & 12 \
5 & 65
\end{array}$

Accepted Answer

A) 12,17,23,15,65 
B) 12,23,17,15,65 
C) 15,17,12,23,65 
D) 17,15,12,23,65 
A) 12,17,23,15,65 
B) 12,23,17,15,65 
C) 15,17,12,23,65 
D) 17,15,12,23,65

Question 7

Queues use the first in,first out procedure.

Accepted Answer

A) True 
 B)False

Question 8

When a stack is pushed:

Accepted Answer

A) The number is entered into the element number in the stack pointer,the stack pointer is then incremented. 
B) The stack pointer is incremented,then the number is entered into to element number in the stack pointer. 
C) The number is taken out of the stack at the element number in the stack pointer,the stack pointer is then decremented. 
D) The stack pointer is decremented,then the number is taken out of the stack at the element number in the stack pointer. 
A) The number is entered into the element number in the stack pointer,the stack pointer is then incremented. 
B) The stack pointer is incremented,then the number is entered into to element number in the stack pointer. 
C) The number is taken out of the stack at the element number in the stack pointer,the stack pointer is then decremented. 
D) The stack pointer is decremented,then the number is taken out of the stack at the element number in the stack pointer.

Question 9

In a queue:

Accepted Answer

A) Data is added to the top and deleted from the bottom. 
B) Data is added to the bottom and deleted from the top. 
C) The data in the queue is moved to the top when data is deleted. 
D) The data in the queue is moved down when data is deleted. 
A) Data is added to the top and deleted from the bottom. 
B) Data is added to the bottom and deleted from the top. 
C) The data in the queue is moved to the top when data is deleted. 
D) The data in the queue is moved down when data is deleted.

Question 10

The selection exchange sort:

Accepted Answer

A) Finds the smallest value and exchanges it with the first value,then continues with the second value,third value,etc. 
B) Is a system of comparisons and exchanges of adjacent elements to move the largest to the bottom of the selected group of values. 
C) Is a system of comparisons and exchanges of elements that are non-adjacent.The gap is halved at each pass. 
D) None of the above. 
A) Finds the smallest value and exchanges it with the first value,then continues with the second value,third value,etc. 
B) Is a system of comparisons and exchanges of adjacent elements to move the largest to the bottom of the selected group of values. 
C) Is a system of comparisons and exchanges of elements that are non-adjacent.The gap is halved at each pass. 
D) None of the above.

Question 11

Sorting Data means to separate data into catagories.

Accepted Answer

A) True 
 B)False

Question 12

The bubble sort bubbles the largest number to the bottom.

Accepted Answer

A) True 
 B)False

Question 13

The bubble sort:

Accepted Answer

A) Finds the smallest value and exchanges it with the first value,then continues with the second value,third value,etc. 
B) Is a system of comparisons and exchanges of adjacent elements to move the largest to the bottom of the selected group of values. 
C) Is a system of comparisons and exchanges of elements that are non-adjacent.The gap is halved at each pass. 
D) None of the above. 
A) Finds the smallest value and exchanges it with the first value,then continues with the second value,third value,etc. 
B) Is a system of comparisons and exchanges of adjacent elements to move the largest to the bottom of the selected group of values. 
C) Is a system of comparisons and exchanges of elements that are non-adjacent.The gap is halved at each pass. 
D) None of the above.

Question 14

When processing a stack:

Accepted Answer

A) Additions are at one end and deletions are at the other end. 
B) Additions and deletions are both at the same end. 
C) Additions are at the top and deletions are at the bottom. 
D) Additions are at the bottom and deletions are at the top. 
A) Additions are at one end and deletions are at the other end. 
B) Additions and deletions are both at the same end. 
C) Additions are at the top and deletions are at the bottom. 
D) Additions are at the bottom and deletions are at the top.

Question 15

Data structures are the various ways to store data in the computer.

Accepted Answer

A) True 
 B)False

Question 16

The sorting technique that requires the least number of comparisons and exchanges is the selection-exchange method.

Accepted Answer

A) True 
 B)False

Question 17

Use the selection exchange method to show the first pass of the following array: 
$\begin{array} { c c } 
\text { Element } & \text { Values } \
1 & 15 \
2 & 23 \
3 & 17 \
4 & 12 \
5 & 65
\end{array}$

Accepted Answer

A) 12,17,23,15,65 
B) 12,23,17,15,65 
C) 15,17,12,23,65 
D) 17,15,12,23,65 
A) 12,17,23,15,65 
B) 12,23,17,15,65 
C) 15,17,12,23,65 
D) 17,15,12,23,65

Question 18

The Shell sort:

Accepted Answer

A) Finds the smallest value and exchanges it with the first value,then continues with the second value,third value,etc. 
B) Is a system of comparisons and exchanges of adjacent elements to move the largest to the bottom of the selected group of values. 
C) Is a system of comparisons and exchanges of elements that are non-adjacent.The gap is halved at each pass. 
D) None of the above. 
A) Finds the smallest value and exchanges it with the first value,then continues with the second value,third value,etc. 
B) Is a system of comparisons and exchanges of adjacent elements to move the largest to the bottom of the selected group of values. 
C) Is a system of comparisons and exchanges of elements that are non-adjacent.The gap is halved at each pass. 
D) None of the above.

Question 19

Given a stack,what would the final value of the stack pointer be after the following instructions were executed:
 PUSH 23
PUSH 35
PUSH 42
POP X
PUSH 20
POP X
POP X
PUSH 30

Accepted Answer

A) 1. 
B) 2. 
C) 3. 
D) 4. 
E) 5. 
A) 1. 
B) 2. 
C) 3. 
D) 4. 
E) 5.

Queues use pushing and popping to add and delete data.

When processing a queue:

Sorting is done through multiple comparisons and exchanges.

The shell sort is a modification of the selection sort.

Stacks use the first in,first out procedure.

Use the bubble sort method to show the first pass of the following array: Element Values 1 15 2 23 3 17 4 12 5 65

Queues use the first in,first out procedure.

When a stack is pushed:

In a queue:

The selection exchange sort:

Sorting Data means to separate data into catagories.

The bubble sort bubbles the largest number to the bottom.

The bubble sort:

When processing a stack:

Data structures are the various ways to store data in the computer.

The sorting technique that requires the least number of comparisons and exchanges is the selection-exchange method.

Use the selection exchange method to show the first pass of the following array: Element Values 1 15 2 23 3 17 4 12 5 65

The Shell sort:

Given a stack,what would the final value of the stack pointer be after the following instructions were executed: PUSH 23 PUSH 35 PUSH 42 POP X PUSH 20 POP X POP X PUSH 30

General Problem-Solving Concepts

Beginning Problem-Solving Concepts for the Computer

Planning Your Solution

An Introduction to Programming Structure

Problem Solving With the Sequential Logic Structure

Problem Solving With Decisions

Problem Solving With Loops

Processing Arrays

File Concepts

Linked Lists

Binary Trees

Database Management

Relational Database Management Systems

Concepts of Object Oriented Programming

Object Oriented Program Design

Introduction to Concepts of Game Development Using Object Oriented Programming

Introduction to Assembly Language

Sequential-Access File Applications

Sequential File Updating

Filters

Exam 9: Sorting,stacks,and Queues

Queues use pushing and popping to add and delete data.

When processing a queue:

Sorting is done through multiple comparisons and exchanges.

The shell sort is a modification of the selection sort.

Stacks use the first in,first out procedure.

Use the bubble sort method to show the first pass of the following array: Element Values 1 15 2 23 3 17 4 12 5 65

Queues use the first in,first out procedure.

When a stack is pushed:

In a queue:

The selection exchange sort:

Sorting Data means to separate data into catagories.

The bubble sort bubbles the largest number to the bottom.

The bubble sort:

When processing a stack:

Data structures are the various ways to store data in the computer.

The sorting technique that requires the least number of comparisons and exchanges is the selection-exchange method.

Use the selection exchange method to show the first pass of the following array: Element Values 1 15 2 23 3 17 4 12 5 65

The Shell sort:

Given a stack,what would the final value of the stack pointer be after the following instructions were executed: PUSH 23 PUSH 35 PUSH 42 POP X PUSH 20 POP X POP X PUSH 30

General Problem-Solving Concepts

Beginning Problem-Solving Concepts for the Computer

Planning Your Solution

An Introduction to Programming Structure

Problem Solving With the Sequential Logic Structure

Problem Solving With Decisions

Problem Solving With Loops

Processing Arrays

File Concepts

Linked Lists

Binary Trees

Database Management

Relational Database Management Systems

Concepts of Object Oriented Programming

Object Oriented Program Design

Introduction to Concepts of Game Development Using Object Oriented Programming

Introduction to Assembly Language

Sequential-Access File Applications

Sequential File Updating

Filters