WorksheetsData Structures- Introduction
Total questions: 20
Worksheet time: 11mins
Process of inserting an element in stack is called ____________
Create
Push
Evaluation
Pop
If the insertion and deletion happens from both the ends then the queue is called a______Queue
a) Deque
b) Header
c) Queue
d) Circular Queue
If the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time, in what order will they be removed?
a) ABCD
b) DCBA
c) DCAB
d) ABDC
___________ is neither an algorithm nor a program.
a.Computing
b.Pseudo code
c.Computer science
d.None of the above
Data Structure is a particular way of storing and organizing data in a computer so that it can be used efficiently.
True
False
In this type of data structures, data values of different types are grouped, as in structures and classes. Refer to ...
Homogenous
Non-homogenous
A container which can hold a fix number of items and these items should be of the same type. Most of the data structures make use of arrays to implement their algorithms.
Element
Array
Index
Example of linear data structure except
array
tree
queue
stack
Which of these data structures is LIFO?
Stack
Queue
Binary Tree
Double linked list
It use pointer to link nodes.
Variable
Link List
Pointer
Trees
Act of adding values into a stack is called
Popping
Polling
Pushing
None
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
A series of values stored in memory is called ___
an array
a tree
a matrix
a struct
Almost all programming languages start arrays at ___
index 0
index 1
index 2
the null character
Complex data structures built on top of linked lists, that use First-In First-Out behaviour, are called ___
vectors
strings
queues
stacks
What is a data structure?
A method of arranging data
A way of keeping data without an order?
A "stack" only
There is no formal definition for "Data Structure"
