WorksheetsData structures thru C++
Total questions: 7
Worksheet time: 4mins
Name
Class
Date
1.
what are Data Structures
a)
algorithms
b)
functions
c)
programming language
d)
organization of data
2.
which of them is a data structure
a)
trees
b)
functions
c)
float
d)
pointers
3.
is a data structure
(a)
4.
If the insertion and deletion happens from both the ends then the queue is called a______Queue
a)
a) Deque
b)
b) Header
c)
c) Queue
d)
d) Circular Queue
5.
Process of inserting an element in stack is called ____________
a)
Create
b)
Push
c)
Evaluation
d)
Pop
6.
Entries in a stack are “ordered”. What is the meaning of this statement?
a)
A collection of stacks is sortable
b)
Stack entries may be compared with the ‘<‘ operation
c)
The entries are stored in a linked list
d)
There is a Sequential entry that is one by one
7.
Circular Queue is also known as ________
a)
a) Ring Buffer
b)
b) Square Buffer
c)
c) Rectangle Buffer
d)
d) Curve Buffer
100 %
