10/12/2019 Finals

Dashboard / My courses / BL-ITE-6201-LEC-1923T / Week 14: Final Exam / Finals

Question 1 This is very useful in situation when data have to be stored and then retrieved in reverse order.
Not yet
answered
Select one:
Marked out of
a. stack
1.00
b. link list

c. list

d. queue

Clear my choice

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

Marked out of
Select one:
1.00
a. Queue

b. Binary search tree

c. Graph

d. Stack

e. Tree

Clear my choice

Question 3 The value in the left child of a node (if it exists) in a binary search tree will be greater than the value in the node
Not yet itself.
answered

Marked out of Select one:

1.00
True

False

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

Marked out of Select one:

1.00
a. delete, insert

b. push, pop

c. insert, delete

d. pop, push

Clear my choice

Question 5 Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
Not yet
answered
Select one:
Marked out of
a. Output restricted dequeue
1.00
b. Priority queues

c. Input restricted dequeue 

d. Stack
blended.amaesonline.com/abl-trimestral/mod/quiz/attempt.php?attempt=19251&cmid=3204 1/11
10/12/2019 Finals

Clear my choice

Question 6 Herder node is used as sentinel in __________________.

Not yet
answered
Select one:
Marked out of
a. Queues
1.00
b. Graphs

c. Binary tree

d. Stacks

Clear my choice

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

Not yet
answered
Select one:
Marked out of
a. Data
1.00
b. Operations

c. None of these

d. Both of these

Clear my choice

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

Marked out of
Select one:
1.00
a. Binary search tree

b. Stack

c. Queue

d. Tree

e. Graph

Clear my choice

Question 9 On average, searching in a binary search tree is faster than searching in a list.
Not yet
answered
Select one:
Marked out of
True
1.00
False

Question 10 Algorithms that use a list must know whether the list is array based or linked.
Not yet
answered
Select one:
Marked out of True
1.00
False

Question 11 A list may be linear or nonlinear, depending on its implementation.

Not yet
answered
Select one:
Marked out of
True
1.00
False


blended.amaesonline.com/abl-trimestral/mod/quiz/attempt.php?attempt=19251&cmid=3204 2/11
10/12/2019 Finals

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

Marked out of Select one:

1.00
a. Queue linked list

b. Both of these

c. Neither of these

d. Stacks linked list

Clear my choice

Question 13 Which of the following is/are the levels of implementation of data structure?
Not yet
answered
Select one:
Marked out of
a. Abstract level
1.00
b. Application level

c. Implementation level

d. All of these

Clear my choice

Question 14 Which data structure is suitable to represent the hierarchal relationship between elements?
Not yet
answered
Select one:
Marked out of
a. Dequeue
1.00
b. Tree

c. Priority

d. Graph

Clear my choice

Question 15 A leaf in a tree is a node with no children.

Not yet
answered
Select one:
Marked out of
True
1.00
False

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

Marked out of
Select one:
1.00
a. Tree

b. Queue

c. Graph

d. Binary search tree

e. Stack

Clear my choice

blended.amaesonline.com/abl-trimestral/mod/quiz/attempt.php?attempt=19251&cmid=3204 3/11
10/12/2019 Finals

Question 17 The following algorithm is a count-controlled loop going from 1 through 5.  At each iteration, the loop counter is
Not yet either printed or put on a queue depending on the result of Boolean function RanFun().  (The behavior of
answered RanFun() is immaterial.)  At the end of the loop, the items on the queue are dequeued and printed.  Because of
Marked out of the logical properties of a queue, this algorithm cannot print certain sequences of the values of the loop
1.00
counter.  You are given an output and asked if the algorithm could generate the output. 

Set count to 0
         WHILE (count < 5)

                    Set count to count + 1

                    IF (RanFun())

                             Write count, ' '

                    ELSE

                             Enqueue(myQueue, count)

         WHILE (NOT IsEmpty(myQueue))

                    Dequeue(myQueue, number)      

                    Write number, ' '

The following output is possible using a queue: 1 3 5 4 2

 

Select one:
True

False

Question 18 Binary search trees are ordered.

Not yet
answered
Select one:
Marked out of
True
1.00
False

Question 19 A binary search cannot be applied to a tree.

Not yet
answered Select one:
Marked out of
True
1.00
False

Question 20 Which data structure is used in breadth first search of a graph to hold nodes?
Not yet
answered
Select one:
Marked out of
a. Tree
1.00
b. Array

c. Queue

d. Stack

Clear my choice

blended.amaesonline.com/abl-trimestral/mod/quiz/attempt.php?attempt=19251&cmid=3204 4/11
10/12/2019 Finals

Question 21 What is written by the following algorithm?

Not yet
Enqueue(myQueue, 5)
answered
Enqueue(myQueue, 4)
Marked out of
Enqueue(myQueue, 4)
1.00
Dequeue(myQueue, item)
Dequeue(myQueue, item)
Enqueue(myQueue, item)
WHILE (NOT IsEmpty(myQueue))
     Dequeue(myQueue, item)
     Write item, ' '

Answer: Push(myStack, 5)

Question 22 A stack displays FIFO behavior.

Not yet
answered
Select one:
Marked out of
True
1.00
False

Question 23 Indicate which structure would be a more suitable choice for each of the following applications.
Not yet
A word processor to have a PF key that causes the preceding command to be redisplayed. Every time the PF key
answered
is pressed, the program is to show the command that preceded the one currently displayed
Marked out of
1.00
Select one:
a. Stack

b. Binary search tree

c. Graph

d. Tree

e. Queue

Clear my choice

Question 24 Which of the following is true about the characteristics of abstract data types?
Not yet
i. It exports a type.
answered

Marked out of
ii. It exports a set of operations.
1.00
Select one:
a. False, True

b. True, False

c. True, True

d. False, False

Clear my choice

blended.amaesonline.com/abl-trimestral/mod/quiz/attempt.php?attempt=19251&cmid=3204 5/11
10/12/2019 Finals

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

Marked out of
Select one:
1.00
a. Binary search tree

b. Queue

c. Graph

d. Tree

e. Stack

Clear my choice

Question 26 A stack and a queue are different names for the same ADT.
Not yet
answered
Select one:
Marked out of
True
1.00
False

Question 27 It is a pile in which items are added at one end and removed from the other.
Not yet
answered
Select one:
Marked out of a. none of these
1.00
b. stack

c. queue

d. list

Clear my choice

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

Not yet
answered
Select one:
Marked out of a. Strings
1.00
b. Graph

c. Lists

d. Stacks

Clear my choice

Question 29 What is written by the following algorithm?

Not yet
Push(myStack, 5)
answered
Push(myStack, 4)
Marked out of
Push(myStack, 4)
1.00
Pop(myStack, item)
Pop(myStack, item)
Push(myStack, item)
WHILE (NOT IsEmpty(myStack))
     Pop(myStack, item)
     Write item, ' '

Answer: Push(myStack, 5)

blended.amaesonline.com/abl-trimestral/mod/quiz/attempt.php?attempt=19251&cmid=3204 6/11
10/12/2019 Finals

Question 30 A binary search tree is another name for a binary tree.

Not yet
answered
Select one:
Marked out of
True
1.00
False

Question 31 A binary tree is a tree in which each node can have zero, one, or two children.
Not yet
answered
Select one:
Marked out of
True
1.00
False

Question 32 ____________________ level is where the model becomes compatible executable code.
Not yet
answered
Select one:
Marked out of
a. All of these
1.00
b. Application level

c. Implementation level

d. Abstract level

Clear my choice

Question 33 In a graph, the vertices represent the items being modeled.

Not yet
answered
Select one:
Marked out of
True
1.00
False

Question 34 The following algorithm is a count-controlled loop going from 1 through 5.  At each iteration, the loop counter is
Not yet either printed or put on a queue depending on the result of Boolean function RanFun().  (The behavior of
answered RanFun() is immaterial.)  At the end of the loop, the items on the queue are dequeued and printed.  Because of
Marked out of the logical properties of a queue, this algorithm cannot print certain sequences of the values of the loop
1.00 counter.  You are given an output and asked if the algorithm could generate the output. 

Set count to 0
         WHILE (count < 5)

                    Set count to count + 1

                    IF (RanFun())

                             Write count, ' '

                    ELSE

                             Enqueue(myQueue, count)

         WHILE (NOT IsEmpty(myQueue))

                    Dequeue(myQueue, number)      

                    Write number, ' '

The following output is possible using a queue: 1 3 5 2 4

 

Select one:
True

False 

blended.amaesonline.com/abl-trimestral/mod/quiz/attempt.php?attempt=19251&cmid=3204 7/11
10/12/2019 Finals

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

Marked out of
Select one:
1.00
a. Binary search tree

b. Graph

c. Tree

d. Queue

e. Stack

Clear my choice

Question 36 Draw the binary search tree whose elements are inserted in the following order:
Not yet
50 72 96 94 107 26 12 11 9 2 10 25 51 16 17 95
answered

Marked out of If Print is applied to the tree formed above, in which order would the elements be printed?
1.00

Answer: 3rd

Question 37 Which of the following data structures is linear type?

Not yet
answered
Select one:
Marked out of
a. Stack
1.00
b. Trees

c. Graph

d. Binary tree

Clear my choice

Question 38 Indicate which structure would be a more suitable choice for each of the following applications.
Not yet
A program to keep track of patients as they check into a medical clinic, assigning patients to doctors on a first-
answered
come, first-served basis.
Marked out of
1.00
Select one:
a. Binary search tree

b. Stack

c. Graph

d. Tree

e. Queue

Clear my choice

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

Not yet
answered
Select one:
Marked out of
a. Strings
1.00
b. List

c. Trees

d. Stacks

Clear my choice


blended.amaesonline.com/abl-trimestral/mod/quiz/attempt.php?attempt=19251&cmid=3204 8/11
10/12/2019 Finals

Question 40 ____________________ is not the component of data structure.

Not yet
answered
Select one:
Marked out of
a. Storage structures
1.00
b. Algorithms

c. Operations

d. None of these

Clear my choice

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

Marked out of
Select one:
1.00
a. Graph

b. Binary search tree

c. Stack

d. Tree

e. Queue

Clear my choice

Question 42 The value in the right child of a node (if it exists) in a binary search tree will be greater than the value in the node
Not yet itself.
answered

Marked out of Select one:

1.00
True

False

Question 43 Stack is also called the ________________.

Not yet
answered
Select one:
Marked out of
a. First in, last out
1.00
b. Last in, first out

c. Last in, last out

d. First in, first out

Clear my choice

Question 44 Which of the following data structure can't store the non-homogeneous data elements?
Not yet
answered
Select one:
Marked out of
a. Arrays
1.00
b. Stacks

c. Records

d. Pointers

Clear my choice

blended.amaesonline.com/abl-trimestral/mod/quiz/attempt.php?attempt=19251&cmid=3204 9/11
10/12/2019 Finals

Question 45 Which data structure allows deleting data elements from and inserting at rear?
Not yet
answered
Select one:
Marked out of
a. stacks
1.00
b. queues

c. dequeues

d. binary search tree

Clear my choice

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

Marked out of Select one:

1.00
a. None of these

b. Red-black tree

c. Lemma tree

d. AVL tree

Clear my choice

Question 47 Indicate which structure would be a more suitable choice for each of the following applications.
Not yet
 
answered

Marked out of A bank simulation of its teller operation to see how waiting times would be affected by adding another teller.
1.00
Select one:
a. Binary search tree

b. Queue

c. Graph

d. Stack

e. Tree

Clear my choice

Question 48 The root of a tree is the node that has no ancestors.

Not yet
answered
Select one:
Marked out of
True
1.00
False

Question 49 A queue displays LIFO behavior.

Not yet
answered Select one:
Marked out of
True
1.00
False

blended.amaesonline.com/abl-trimestral/mod/quiz/attempt.php?attempt=19251&cmid=3204 10/11
10/12/2019 Finals

Question 50 Indicate which structure would be a more suitable choice for each of the following applications.
Not yet
 
answered

Marked out of A program to receive data that is to be saved and processed in the reverse order.
1.00
Select one:
a. Stack

b. Tree

c. Binary search tree

d. Graph

e. Queue

Clear my choice

◄ Quiz 006 Jump to...

blended.amaesonline.com/abl-trimestral/mod/quiz/attempt.php?attempt=19251&cmid=3204 11/11