Question 1

A(n) _______ list is also known as a queue.

Accepted Answer

A)  LIFO 
B)  FIFO 
C)  unordered 
D)  ordered 
A)  LIFO 
B)  FIFO 
C)  unordered 
D)  ordered B

Question 2

In postorder traversal of a binary tree, the left subtree is processed _______.

Accepted Answer

A)  first 
B)  second 
C)  last 
D)  after the right subtree 
A)  first 
B)  second 
C)  last 
D)  after the right subtree A

Question 3

In _______ traversal of a binary tree, the left subtree is processed last.

Accepted Answer

A)  preorder 
B)  inorder 
C)  postorder 
D)  out of order 
A)  preorder 
B)  inorder 
C)  postorder 
D)  out of order A

Question 4

The push operation _______ of the stack.

Accepted Answer

A)  deletes an item from the top 
B)  deletes an item from the bottom 
C)  inserts an item at the top 
D)  inserts an item at the bottom 
A)  deletes an item from the top 
B)  deletes an item from the bottom 
C)  inserts an item at the top 
D)  inserts an item at the bottom

Question 5

A stack is a _________ structure.

Accepted Answer

A)  FIFO 
B)  LIFO 
C)  DIFO 
D)  SIFO 
A)  FIFO 
B)  LIFO 
C)  DIFO 
D)  SIFO

Question 6

The pop operation _______ of the stack.

Accepted Answer

A)  deletes an item from the top 
B)  deletes an item from the bottom 
C)  inserts an item at the top 
D)  inserts an item at the bottom 
A)  deletes an item from the top 
B)  deletes an item from the bottom 
C)  inserts an item at the top 
D)  inserts an item at the bottom

Question 7

In an inorder traversal of a binary tree, the root is processed _______.

Accepted Answer

A)  first 
B)  second 
C)  last 
D)  two times 
A)  first 
B)  second 
C)  last 
D)  two times

Question 8

In postorder traversal of a binary tree, the root is processed _______.

Accepted Answer

A)  first 
B)  second 
C)  last 
D)  after the left subtree 
A)  first 
B)  second 
C)  last 
D)  after the left subtree

Question 9

In a binary tree, each node has _______ two subtrees.

Accepted Answer

A)  more than 
B)  less than 
C)  at most 
D)  at least 
A)  more than 
B)  less than 
C)  at most 
D)  at least

Question 10

In _______ traversal of a binary tree, the right subtree is processed last.

Accepted Answer

A)  preorder 
B)  inorder 
C)  postorder 
D)  any order 
A)  preorder 
B)  inorder 
C)  postorder 
D)  any order

Question 11

If A is the first data element input into a queue, followed by B, C, and D, then _______ is the first element to be removed.

Accepted Answer

A)  A 
B)  B 
C)  C 
D)  D 
A)  A 
B)  B 
C)  C 
D)  D

Question 12

If A is the first data element input into a stack, followed by B, C, and D, then _______ is the first element to be removed.

Accepted Answer

A)  A 
B)  B 
C)  C 
D)  D 
A)  A 
B)  B 
C)  C 
D)  D

Question 13

In an abstract data type, _______.

Accepted Answer

A)  the ADT implementation is known 
B)  the ADT implementation is hidden 
C)  the ADT public operations are hidden 
D)  Nothing is hidden 
A)  the ADT implementation is known 
B)  the ADT implementation is hidden 
C)  the ADT public operations are hidden 
D)  Nothing is hidden

A(n) _______ list is also known as a queue.

In postorder traversal of a binary tree, the left subtree is processed _______.

In _______ traversal of a binary tree, the left subtree is processed last.

The push operation _______ of the stack.

A stack is a _________ structure.

The pop operation _______ of the stack.

In an inorder traversal of a binary tree, the root is processed _______.

In postorder traversal of a binary tree, the root is processed _______.

In a binary tree, each node has _______ two subtrees.

In _______ traversal of a binary tree, the right subtree is processed last.

If A is the first data element input into a queue, followed by B, C, and D, then _______ is the first element to be removed.

If A is the first data element input into a stack, followed by B, C, and D, then _______ is the first element to be removed.

In an abstract data type, _______.

Introduction

Number Systems

Data Storage

Operations on Data

Computer Organization

Computer Networks and Internet

Operating Systems

Algorithms

Programming Languages

Software Engineering

Data Structure

File Structure

Databases

Data Compression

Security

Theory of Computation

Artificial Intelligence

Introduction to Social Media

Social and Ethical Issues

Filters

Exam 12: Abstract Data Types

A(n) _______ list is also known as a queue.

In postorder traversal of a binary tree, the left subtree is processed _______.

In _______ traversal of a binary tree, the left subtree is processed last.

The push operation _______ of the stack.

A stack is a _________ structure.

The pop operation _______ of the stack.

In an inorder traversal of a binary tree, the root is processed _______.

In postorder traversal of a binary tree, the root is processed _______.

In a binary tree, each node has _______ two subtrees.

In _______ traversal of a binary tree, the right subtree is processed last.

If A is the first data element input into a queue, followed by B, C, and D, then _______ is the first element to be removed.

If A is the first data element input into a stack, followed by B, C, and D, then _______ is the first element to be removed.

In an abstract data type, _______.

Introduction

Number Systems

Data Storage

Operations on Data

Computer Organization

Computer Networks and Internet

Operating Systems

Algorithms

Programming Languages

Software Engineering

Data Structure

File Structure

Databases

Data Compression

Security

Theory of Computation

Artificial Intelligence

Introduction to Social Media

Social and Ethical Issues

Filters