Scribd
Upload
105 views

Question Text: Correct All Answer Saved Marked Out of 1.00

1. The document contains 10 multiple choice questions about data structures like stacks, queues, trees, graphs, and binary search trees. 2. The questions ask about which data structures can store non-homogeneous data, whether a queue algorithm could produce a given output, suitable data structures for applications like address books and airline routes, and properties of stacks, trees, queues, and graphs. 3. The questions have single correct answers to select from options like stacks, queues, trees, graphs, and more.

Uploaded by

Nhiel Yoyotea
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
105 views

Question Text: Correct All Answer Saved Marked Out of 1.00

1. The document contains 10 multiple choice questions about data structures like stacks, queues, trees, graphs, and binary search trees. 2. The questions ask about which data structures can store non-homogeneous data, whether a queue algorithm could produce a given output, suitable data structures for applications like address books and airline routes, and properties of stacks, trees, queues, and graphs. 3. The questions have single correct answers to select from options like stacks, queues, trees, graphs, and more.

Uploaded by

Nhiel Yoyotea
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 7

correct all

Question 1
Answer saved
Marked out of 1.00

Flag question

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

Select one:
a.
Stacks

b.
Pointers

c.
Arrays

d.
Records

Clear my choice

Question 2
Answer saved
Marked out of 1.00

Flag question

Question text
The following algorithm is a count-controlled loop going from 1 through 5.  At each
iteration, the loop counter is either printed or put on a queue depending on the result of
Boolean function RanFun().  (The behavior of RanFun() is immaterial.)  At the end of the
loop, the items on the queue are dequeued and printed.  Because of the logical properties
of a queue, this algorithm cannot print certain sequences of the values of the loop 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

Previous page

Question 3
Answer saved
Marked 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

Select one:
a.
Tree

b.
Queue

c.
Stack

d.
Binary search tree

e.
Graph

Clear my choice

Previous page

Question 4
Answer saved
Marked 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.

Select one:
a.
insert, delete

b.
pop, push

c.
delete, insert

d.
push, pop
Question 5
Answer saved
Marked 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.

Select one:
a.
list

b.
stack

c.
none of these

d.
queue

Clear my choice

Previous page

Question 6
Answer saved
Marked 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.
Select one:
a.
Stack

b.
Tree

c.
Graph

d.
Binary search tree

e.
Queue

Question 7
Answer saved
Marked out of 1.00

Flag question

Question text
Binary search trees are ordered.

Select one:
True
False

Previous page

Question 8
Answer saved
Marked out of 1.00
Flag question

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

Select one:
True
False

Previous page

Question 9
Answer saved
Marked out of 1.00

Flag question

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

Select one:
a.
Stack

b.
Binary tree

c.
Trees

d.
Graph

Clear my choice

Previous page
Question 10
Answer saved
Marked out of 1.00

Flag question

Question text
Herder node is used as sentinel in __________________.

Select one:
a.
Binary tree

b.
Stacks

c.
Queues

d.
Graphs

Clear my choice

Previous page

You might also like