WorksheetsDSC QUIZ 4
Total questions: 30
Worksheet time: 15mins
Name
Class
Date
1.
In _______ data structure elements can be added in circular fashion
a)
Simple Queue
b)
Circular Queue
c)
Stack
d)
Deque
2.
While displaying circular queue elements, which method is suitable to increment front value? Max: Maximum size of the queue
a)
front=(front+1)/ Max
b)
front=(front+1) % Max
c)
front=front% Max
d)
front+=1
3.
In circular queue, insertion can be done by _________
a)
(rear % 1) + MAXSIZE
b)
rear %( 1 + MAXSIZE)
c)
(rear +1) %MAXSIZE
d)
rear + ( 1 % MAXSIZE)
4.
Front and rear end is logically connected in ________ queue
a)
Simple Queue
b)
Circular Queue
c)
Stack
d)
Deque
5.
In priority queue elements will be inserted and deleted based on __________
a)
Ascending order
b)
Descending order
c)
Priority of element
d)
FIFO
6.
A data structure where elements can be added or removed at both the ends called __________
a)
Tree
b)
Stack
c)
Queue
d)
Deque
7.
A queue is called __________ when insertion as well as deletion of elements can take place at both the ends
a)
Tree
b)
Stack
c)
Queue
d)
Deque
8.
A _______________ is queue in which insertion of an element takes place at one end only but deletion occurs at both ends.
a)
Output restricted Deque
b)
Input restricted Deque
c)
Dequeue
d)
Enqueue
9.
A _______________ is queue in which deletion of an element takes place at one end only but insertion occurs at both ends.
a)
Output restricted Deque
b)
Input restricted Deque
c)
Dequeue
d)
Enqueue
10.
The data is “ordered” only in the ___________
a)
Simple Queue
b)
Circular Queue
c)
Stack
d)
Deque
11.
The operator used to find the size of any variable
a)
sizeof()
b)
SizeOf()
c)
SizeOff()
d)
size()
12.
A __________ is method of storing data in a computer so that t can be used efficiently.
a)
Data Structure
b)
Structure
c)
Self referential
d)
pointer
13.
The operator __________ is used to access the members of the structure using structure pointer variable
a)
->
b)
*
c)
&
d)
#
14.
A ____________ is an ordered collection of data structure, which contains the location of the next element
a)
Queue
b)
Stack
c)
Linked List
d)
Pointer
15.
Linked list uses ___________ type of memory allocation
a)
Static
b)
Dynamic
c)
Compiler Depended
d)
pointer
16.
A ___________ is a connected sequence of Nodes
a)
Queue
b)
Stack
c)
Linked List
d)
Pointer
17.
No limit to the number of elements in list is ________
a)
Stack
b)
linked list
c)
array
d)
pointer
18.
Which one is the suitable way to create a node in a linked list
a)
Arrays
b)
Structure
c)
list
d)
union
19.
Link field of last node in a singly linked list will point to __________
a)
Next Node
b)
NULL
c)
Previous Node
d)
First Node
20.
Nodes are not named objects, but are referred by _________
a)
Structure
b)
Pointer
c)
NULL
d)
void
21.
The list which travels only from first node to last node is __________
a)
Singly linked List
b)
Doubly Linked list
c)
Circular Linked list
d)
stack
22.
Linked list use ___________ type of structures
a)
nested
b)
self referential
c)
union
d)
Simple
23.
Member field that points to the same structure is called _________
a)
nested
b)
self referential
c)
union
d)
Simple
24.
Link field of last node in a circular singly linked list will point to
a)
Next Node
b)
NULL
c)
Previous Node
d)
First Node
25.
In which of the linked list each node contains 2 pointers ____________
a)
Circular Doubly linked list
b)
Singly linked list
c)
Circular singly Linked list
d)
stack
26.
If the last node link points to the first node in the list, then the list is __________
a)
Singly linked List
b)
Doubly Linked list
c)
Circular Linked list
d)
stack
27.
The link travels from left to right & right to left is ________
a)
Singly linked List
b)
Doubly Linked list
c)
Circular singly Linked list
d)
stack
28.
If head node is NULL means___________
a)
List Empty
b)
List not created
c)
One Node
d)
List full
29.
Doubly linked list consist of minimum of ________ link fields
a)
0
b)
1
c)
2
d)
3
30.
Header node store normally ________
a)
Actual data
b)
Number of nodes in the list
c)
First node Address
d)
Last Node Address
100 %
