a. StackA
b. None of the choicesc. Listd. Queue
CORRECT ANSWER: A
5. Which of the following best describes an array?
a. Container of objects of mixed types
b. All of the choices.
c. A data structure that shows a sequential values
d. Container of objects of similar types.D
CORRECT ANSWER: D
6. Deque is an acronym oF
a. Dual Queue
b. Dual Ended Queuec. Dijkstra Ended Queued. Double Ended QueueD
CORRECT ANSWER: D
7. In insertion operation of data structure, new element can be added at any given index.
A. True B. False
CORRECT ANSWER: A
8. CPU task scheduling is an application of what ADT
a. Queue A b. Tree c. Job scheduling d. Algorithm
CORRECT ANSWER: A
9. Link list is a data structure wherein the elements are not stored at adjacent memory locations.
A.True B. False
CORRECT ANSWER: A
10. Index of an arrays starts at index 1.
A. True B. False
CORRECT ANSWER: B
A data structure wherein data items are traverse in a single run.
Select one:a. Tree b. Graph c. Non-Linear d. Linear
CORRECT ANSWER: D
ADT should have a specification(s) that
Select one:a. declaration of operationsAb. declaration of functions and operationsc. declaration of functionsd. declaration of data and operations
CORRECT ANSWER: A
Which of the following defines a Binary Tree?
Select one:a. Binary is a data structure where each data element can be connected to maximum two other data elementsb. All of the choicesBc. Binary tree is a linear data structured. Binary tree is hierarchical data structure
CORRECT ANSWER: B
Implementation of ADT requires
Select one:a. None of the choicesb. choosing a suitable algorithm and data representationc. choosing a suitable algorithmd. choosing a data representation
CORRECT ANSWER: D
A queue is a FIFO list.
A. True B. False
CORRECT ANSWER: A
The first step to insert an element at the tail of a linked list is to increase the size of the linked list.
A. True B. False
CORRECT ANSWER: B
Nodes in a linked list are also called elements.
A. True B. False
CORRECT ANSWER: A
In an algorithm, how many input(s) should be taken from a specified set of objects.
Algorithm
Start from the beginning
