NEW
Font size
WorksheetsData structure test1
Total questions: 20
Worksheet time: 15mins
Data structure can be of two types namely___________
Simple and Nested
Simple and Compound
Sequential and random
All of the above
_________ is an example of non linear data structure
Sorting
Stack
Tree
Queue
Compound Data structure can be ______ & _______
Simple and Nested
Linear and Non Linear
Sequential and random
Array or linear list comes under the category of______
Compound Data Structure
Simple Data Structure
Random Data Structure
None of these
Python built-in data structures are
integer,float,string
list,tuple,dictionary,sets
Tree, graph
Arranging elements of a data structure in increasing or decreasing order is known as_________
Searching
Arrangement
Sorting
Indexing
The examples of Linear Data Structures are
Stacks,Queues,Linked list
int,float,complex
Operators,tokens,punctuators
Tree, graph
In Stack Insertion and deletion of an element is done at single end called ________
Bottom
Top
Start
Last
Stacks follows____________ order
FIFO (First In First Out )
LIFO (Last In First Out)
Random
FILO(First In Last Out)
Main Operations in Stacks are Called
Insertion and deletion
Push and Pop
append and insertion
append and pop
In stack we can not insert an element in between the elements that are already inserted.
True
False
Queue follows____________ order
FIFO (First In First Out )
LIFO (Last In First Out)
Random
FILO(First In Last Out)
Insertion in Queue is done at_____ end , and deletion is at _______ end
start, last
front, rear
rear, front
begin, stop
In Queue we can not insert an element in between the elements that are already inserted but we can delete it.
True
False
While implementing Stack using list when we want to delete element we must use pop function as__________
list.pop(0)
list.pop(pos)
list.pop()
list.pop(1)
While implementing Queue using list when we want to delete element we must use pop function as__________
list.pop(pos)
list.pop(0)
list.pop()
list.pop(1)
The process of Visiting each element in any Data structure is termed as ____________
Traversing
Searching
Movement
Visiting
Searching of any element in a data structure can be done in 2 ways _________ and ________
Sequential and random
linear and non linear
linear and binary
linear and random
Main Operations in Queue are Called
Enqueue and Dequeue
Append and Insertion
Push and Pop
append and traverse
___________________ is a way to represent data in memory.
Data Handling
Data Structure
Data Dumping
Data Collection
