Have an account?
Skip to Content
Build your own quiz
14 questions
Show Answers
See Preview
- 1. Multiple Choice
Example of linear data structure except
array
tree
queue
stack
- 2. Multiple Choice_________________ is a collection of elements used to store the same type of data.ArraySwitchCaseLoop
- 3. Multiple Choice
Which of these data structures is LIFO?
Stack
Queue
Binary Tree
Double linked list
- 4. Multiple Choice
int nums[ ] =
{2, 3, 5, 8, 9, 11};
How would you access the fourth element in nums
nums[8]
nums[3]
nums(4)
nums(3)
- 5. Multiple ChoiceWhich of the following is NOT a Type of Data Structures?ArraysTablesStacksTrees
- 6. Multiple ChoiceStorage for data defined in terms of set of operations to be performed on the dataArraysVariablesAbstract Data TypesAlgorithms
- 7. Multiple Choice
A FIFO structure implemented as a ring where the front and rear pointers can wrap around the end of the start of the array.
Linear Queue
Circular Queue
Priority Queue
- 8. Multiple Choice
It use pointer to link nodes.
Variable
Link List
Pointer
Trees
- 9. Multiple ChoiceWhat kind of Data structure would you expect to find utilised to store operations in a CPU?StackQueueListTree
- 10. Multiple Choice
LIFO stands for
List of Outputs
Last in First Out
First in Last Out
None of them
- 11. Multiple Choice
Act of adding values into a stack is called
Popping
Polling
Pushing
None
- 12. Multiple Choice
If the elements “A”, “B”, “C” and “D” are placed in a stack and are deleted one at a time, in what order will they be removed?
ABCD
DCBA
DCAB
ABDC
- 13. Multiple Choice
Consider the following operation performed on a stack of size 5.
Push(1);
Pop();
Push(2);
Push(3);
Pop();
Push(4);
Pop();
Pop();
Push(5);
After the completion of all operation, get the total number of element present in stack is
1
2
3
4
- 14. Multiple Choice
circular linked list
linked list
doubly circular linked list
doubly linked list
- Answer choicesTagsAnswer choicesTags