• #### 1.  Data structure can be of two types namely___________

• Simple and Nested
• Simple and Compound
• Sequential and random
• All of the above
• #### 2.  Main Operations in Stacks are Called

• Insertion and deletion
• Push and Pop
• append and insertion
• append and pop

• True
• False
• #### 4.  Main Operations in Queue are Called

• Enqueue and Dequeue
• Append and Insertion
• Push and Pop
• append and traverse
• #### 5.  Array or linear list comes under the category of______

• Compound Data Structure
• Simple Data Structure
• Random Data Structure
• None of these

• Traversing
• Searching
• Movement
• Visiting
• #### 7.  Python built-in data structures are

• integer,float,string
• list,tuple,dictionary,sets
• Tree, graph

• Bottom
• Top
• Start
• Last

• Sorting
• Stack
• Tree
• Queue
• #### 10.  Queue follows____________ order

• FIFO (First In First Out )
• LIFO (Last In First Out)
• Random
• FILO(First In Last Out)
• #### 11.  Compound Data structure can be ______ & _______

• Simple and Nested
• Linear and Non Linear
• Sequential and random
• #### 12.  Stacks follows____________ order

• FIFO (First In First Out )
• LIFO (Last In First Out)
• Random
• FILO(First In Last Out)

• True
• False
• #### 14.  The examples of Linear Data Structures are

• int,float,complex
• Operators,tokens,punctuators
• Tree, graph
• #### 15.  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)
• #### 16.  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

• start, last
• front, rear
• rear, front
• begin, stop

• Searching
• Arrangement
• Sorting
• Indexing
Report Question
access_time