A _______________ is a data structure that organizes data similar to a line in the supermarket,

where the first one in line is the first one out.

a.
Queue linked list
b.
Both of these
c.
Stacks linked list
d.
Neither of these
Feedback
The correct answer is: Queue linked list

Question 2
Correct
Mark 1.00 out of 1.00

Flag question

Question text
A binary search tree whose left subtree and right subtree differ in height by at most 1 unit is
called ____________________.

a.
AVL tree
b.
Red-black tree
c.
Lemma tree
d.
None of these
Feedback
The correct answer is: AVL tree

Question 3
Correct
Mark 1.00 out of 1.00
 Flag question

Question text
Herder node is used as sentinel in __________________.

a.
Queues
b.
Graphs
c.
Binary tree
d.
Stacks
Feedback
The correct answer is: Binary tree

Question 4
Correct
Mark 1.00 out of 1.00

Flag question

Question text
Identify the data structure which allows deletions at both ends of the list but insertion at
only one end.

a.
Priority queues
b.
Stack
c.
Output restricted dequeue
d.
Input restricted dequeue
 Feedback
The correct answer is: Input restricted dequeue

Question 5
Correct
Mark 1.00 out of 1.00

Flag question

Question text
Indicate which structure would be a more suitable choice for each of the following
applications.A program keeping track of where canned goods are located on a shelf.

a.
Tree
b.
Graph
c.
Stack
d.
Binary search tree
e.
Queue
Feedback
The correct answer is: Stack

Question 6
Correct
Mark 1.00 out of 1.00

Flag question

Question text
Indicate which structure would be a more suitable choice for each of the following
applications. A bank simulation of its teller operation to see how waiting times would be
affected by adding another teller.
 a.
Queue
b.
Graph
c.
Binary search tree
d.
Tree
e.
Stack
Feedback
The correct answer is: Queue

Question 7
Correct
Mark 1.00 out of 1.00

Flag question

Question text
Indicate which structure would be a more suitable choice for each of the following
applications.A program to maintain the routes in an airline.

a.
Binary search tree
b.
Queue
c.
Tree
d.
Graph
e.
Stack
Feedback
The correct answer is: Graph

Question 8
Correct
Mark 1.00 out of 1.00

Flag question

Question text
Indicate which structure would be a more suitable choice for each of the following
applications.A program to keep track of family relationships

a.
Stack
b.
Tree
c.
Graph
d.
Queue
e.
Binary search tree
Feedback
The correct answer is: Binary search tree

Question 9
Correct
Mark 1.00 out of 1.00

Flag question

Question text
Indicate which structure would be a more suitable choice for each of the following
applications.A program to keep track of the soccer teams in a city tournament

a.
Stack
b.
Queue
 c.
Graph
d.
Binary search tree
e.
Tree
Feedback
The correct answer is: Tree

Question 10
Correct
Mark 1.00 out of 1.00

Flag question

Question text
Indicate which structure would be a more suitable choice for each of the following
applications.A program to keep track of patients as they check into a medical clinic,
assigning patients to doctors on a first-come, first-served basis.

a.
Binary search tree
b.
Tree
c.
Queue
d.
Graph
e.
Stack
Feedback
The correct answer is: Queue

Indicate which structure would be a more suitable choice for each of the following
applications.A dictionary of words used by a spelling checker to be built and maintained.
 a.
Binary search tree
b.
Tree
c.
Graph
d.
Stack
e.
Queue
Feedback
The correct answer is: Binary search tree

Question 2
Correct
Mark 1.00 out of 1.00

Flag question

Question text
Indicate which structure would be a more suitable choice for each of the following
applications.A word processor to have a PF key that causes the preceding command to be
redisplayed. Every time the PF key is pressed, the program is to show the command that
preceded the one currently displayed

a.
Queue
b.
Graph
c.
Tree
d.
Stack
e.
Binary search tree
Feedback
The correct answer is: Stack

Question 3
Correct
Mark 1.00 out of 1.00

Flag question

Question text
Indicate which structure would be a more suitable choice for each of the following
applications.An electronic address book ordered by name

a.
Graph
b.
Tree
c.
Binary search tree
d.
Stack
e.
Queue
Feedback
The correct answer is: Binary search tree

Question 4
Correct
Mark 1.00 out of 1.00

Flag question

Question text
Indicate which structure would be a more suitable choice for each of the following
applications. A program to receive data that is to be saved and processed in the reverse
order.

a.
Graph
b.
Binary search tree
c.
Stack
d.
Tree
e.
Queue
Feedback
The correct answer is: Stack

Question 5
Correct
Mark 1.00 out of 1.00

Flag question

Question text
Inserting an item into the stack when stack is not full is called ____________ while operation
and deletion of item from the stack, when stack is not empty is called ________________
operation.

a.
insert, delete
b.
push, pop
c.
pop, push
d.
delete, insert
Feedback
The correct answer is: push, pop

Question 6
Correct
Mark 1.00 out of 1.00
 Flag question

Question text
It is a pile in which items are added at one end and removed from the other.

a.
none of these
b.
queue
c.
stack
d.
list
Feedback
The correct answer is: queue

Question 7
Correct
Mark 1.00 out of 1.00

Flag question

Question text
Stack is also called the ________________.

a.
Last in, first out
b.
First in, first out
c.
First in, last out
d.
Last in, last out
Feedback
The correct answer is: Last in, first out

Question 8
Correct
Mark 1.00 out of 1.00

Flag question

Question text
This is very useful in situation when data have to be stored and then retrieved in reverse
order.

a.
link list
b.
list
c.
queue
d.
stack
Feedback
The correct answer is: stack

Question 9
Correct
Mark 1.00 out of 1.00

Flag question

Question text
Which data structure allows deleting data elements from and inserting at rear?

a.
dequeues
b.
stacks
c.
binary search tree
d.
queues
Feedback
The correct answer is: queues

Question 10
Correct
Mark 1.00 out of 1.00

Flag question

Question text
Which data structure is suitable to represent the hierarchal relationship between elements?

a.
Graph
b.
Dequeue
c.
Tree
d.
Priority
Feedback
The correct answer is: Tree

A _______________ is a data structure that organizes data similar to a line in the supermarket,
where the first one in line is the first one out.

a.
Queue linked list
b.
Stacks linked list
c.
Both of these
d.
Neither of these
Feedback
The correct answer is: Queue linked list

Question 2
Correct
Mark 1.00 out of 1.00

Flag question

Question text
Which data structure is used in breadth first search of a graph to hold nodes?

a.
Array
b.
Queue
c.
Stack
d.
Tree
Feedback
The correct answer is: Queue

Question 3
Correct
Mark 1.00 out of 1.00

Flag question

Question text
Which of the following data structure can't store the non-homogeneous data elements?

a.
Arrays
b.
Pointers
 c.
Stacks
d.
Records
Feedback
The correct answer is: Arrays

Question 4
Correct
Mark 1.00 out of 1.00

Flag question

Question text
Which of the following data structure is non-linear type?

a.
Graph
b.
Strings
c.
Stacks
d.
Lists
Feedback
The correct answer is: Graph

Question 5
Correct
Mark 1.00 out of 1.00

Flag question

Question text
Which of the following data structures is linear type?
 a.
Trees
b.
Binary tree
c.
Stack
d.
Graph
Feedback
The correct answer is: Stack

Question 6
Correct
Mark 1.00 out of 1.00

Flag question

Question text
Which of the following is non-linear data structure?

a.
Trees
b.
Strings
c.
List
d.
Stacks
Feedback
The correct answer is: Trees

Question 7
Correct
Mark 1.00 out of 1.00
 Flag question

Question text
Which of the following is not the part of ADT description?

a.
Data
b.
None of these
c.
Operations
d.
Both of these
Feedback
The correct answer is: None of these

Question 8
Correct
Mark 1.00 out of 1.00

Flag question

Question text
Which of the following is true about the characteristics of abstract data types?i. It exports a
type.ii. It exports a set of operations.

a.
False, True
b.
True, True
c.
True, False
d.
False, False
 Feedback
The correct answer is: True, True

Question 9
Correct
Mark 1.00 out of 1.00

Flag question

Question text
Which of the following is/are the levels of implementation of data structure?

a.
Application level
b.
Implementation level
c.
Abstract level
d.
All of these
Feedback
The correct answer is: All of these

Question 10
Correct
Mark 1.00 out of 1.00

Flag question

Question text
____________________ is not the component of data structure.

a.
Storage structures
b.
Operations
c.
Algorithms
d.
None of these
Feedback
The correct answer is: None of these

Question 11
Correct
Mark 1.00 out of 1.00

Flag question

Question text
____________________ level is where the model becomes compatible executable code.

a.
Abstract level
b.
All of these
c.
Implementation level
d.
Application level
Feedback
The correct answer is: Implementation level

Question 12
Correct
Mark 1.00 out of 1.00

Flag question

Question text
A binary search tree whose left subtree and right subtree differ in height by at most 1 unit is
called ____________________.

a.
AVL tree
b.
None of these
c.
Lemma tree
d.
Red-black tree
Feedback
The correct answer is: AVL tree

Question 13
Correct
Mark 1.00 out of 1.00

Flag question

Question text
Herder node is used as sentinel in __________________.

a.
Stacks
b.
Queues
c.
Binary tree
d.
Graphs
Feedback
The correct answer is: Binary tree

Question 14
Correct
Mark 1.00 out of 1.00

Flag question
 Question text
Identify the data structure which allows deletions at both ends of the list but insertion at
only one end.

a.
Output restricted dequeue
b.
Stack
c.
Input restricted dequeue
d.
Priority queues
Feedback
The correct answer is: Input restricted dequeue

Question 15
Correct
Mark 1.00 out of 1.00

Flag question

Question text
Indicate which structure would be a more suitable choice for each of the following
applications.A program keeping track of where canned goods are located on a shelf.

a.
Stack
b.
Tree
c.
Binary search tree
d.
Queue
e.
Graph
Feedback
The correct answer is: Stack
Question 16
Correct
Mark 1.00 out of 1.00

Flag question

Question text
Indicate which structure would be a more suitable choice for each of the following
applications. A bank simulation of its teller operation to see how waiting times would be
affected by adding another teller.

a.
Binary search tree
b.
Stack
c.
Graph
d.
Tree
e.
Queue
Feedback
The correct answer is: Queue

Question 17
Correct
Mark 1.00 out of 1.00

Flag question

Question text
Indicate which structure would be a more suitable choice for each of the following
applications.A program to maintain the routes in an airline.

a.
Queue
 b.
Graph
c.
Tree
d.
Binary search tree
e.
Stack
Feedback
The correct answer is: Graph

Question 18
Correct
Mark 1.00 out of 1.00

Flag question

Question text
Indicate which structure would be a more suitable choice for each of the following
applications.A program to keep track of family relationships

a.
Tree
b.
Queue
c.
Stack
d.
Binary search tree
e.
Graph
Feedback
The correct answer is: Binary search tree

Question 19
Correct
Mark 1.00 out of 1.00
 Flag question

Question text
Indicate which structure would be a more suitable choice for each of the following
applications.A program to keep track of the soccer teams in a city tournament

a.
Graph
b.
Binary search tree
c.
Tree
d.
Stack
e.
Queue
Feedback
The correct answer is: Tree

Question 20
Correct
Mark 1.00 out of 1.00

Flag question

Question text
Indicate which structure would be a more suitable choice for each of the following
applications.A program to keep track of patients as they check into a medical clinic,
assigning patients to doctors on a first-come, first-served basis.

a.
Stack
b.
Binary search tree
 c.
Tree
d.
Graph
e.
Queue
Feedback
The correct answer is: Queue

Question 21
Correct
Mark 1.00 out of 1.00

Flag question

Question text
Indicate which structure would be a more suitable choice for each of the following
applications.A dictionary of words used by a spelling checker to be built and maintained.

a.
Stack
b.
Graph
c.
Queue
d.
Binary search tree
e.
Tree
Feedback
The correct answer is: Binary search tree

Question 22
Correct
Mark 1.00 out of 1.00
 Flag question

Question text
Indicate which structure would be a more suitable choice for each of the following
applications.A word processor to have a PF key that causes the preceding command to be
redisplayed. Every time the PF key is pressed, the program is to show the command that
preceded the one currently displayed

a.
Tree
b.
Stack
c.
Binary search tree
d.
Graph
e.
Queue
Feedback
The correct answer is: Stack

Question 23
Correct
Mark 1.00 out of 1.00

Flag question

Question text
Indicate which structure would be a more suitable choice for each of the following
applications.An electronic address book ordered by name

a.
Binary search tree
b.
Queue
 c.
Tree
d.
Stack
e.
Graph
Feedback
The correct answer is: Binary search tree

Question 24
Correct
Mark 1.00 out of 1.00

Flag question

Question text
Indicate which structure would be a more suitable choice for each of the following
applications. A program to receive data that is to be saved and processed in the reverse
order.

a.
Stack
b.
Binary search tree
c.
Graph
d.
Queue
e.
Tree
Feedback
The correct answer is: Stack

Question 25
Correct
Mark 1.00 out of 1.00
 Flag question

Question text
Inserting an item into the stack when stack is not full is called ____________ while operation
and deletion of item from the stack, when stack is not empty is called ________________
operation.

a.
push, pop
b.
insert, delete
c.
pop, push
d.
delete, insert
Feedback
The correct answer is: push, pop

Question 26
Correct
Mark 1.00 out of 1.00

Flag question

Question text
It is a pile in which items are added at one end and removed from the other.

a.
none of these
b.
list
c.
stack
d.
queue
Feedback
The correct answer is: queue

Question 27
Correct
Mark 1.00 out of 1.00

Flag question

Question text
Stack is also called the ________________.

a.
First in, last out
b.
First in, first out
c.
Last in, last out
d.
Last in, first out
Feedback
The correct answer is: Last in, first out

Question 28
Correct
Mark 1.00 out of 1.00

Flag question

Question text
This is very useful in situation when data have to be stored and then retrieved in reverse
order.

a.
queue
b.
stack
c.
list
d.
link list
Feedback
The correct answer is: stack

Question 29
Correct
Mark 1.00 out of 1.00

Flag question

Question text
Which data structure allows deleting data elements from and inserting at rear?

a.
queues
b.
dequeues
c.
stacks
d.
binary search tree
Feedback
The correct answer is: queues

Question 30
Correct
Mark 1.00 out of 1.00

Flag question

Question text
Which data structure is suitable to represent the hierarchal relationship between elements?
 a.
Graph
b.
Tree
c.
Priority
d.
Dequeue
Feedback
The correct answer is: Tree