Monday, 16 October 2017

Multiple Choice Question on Data Structure and Algorithm Design

Q1. Which of the following component is used for Dynamic memory allocation for a node in a linked list
a. RAM
b. ROM
c. Hard disk
d. Heap
Q2. In a linked list, linear collection of homogeneous data elements are known as:
a. structures
b. nodes
c. data
d. none of the above

Q3. Inserting a data element in a linked list can be done from which side:
a. beginning
b. end
c. middle
d. all of the above


Q4. The traversal directions which are possible in a double-linked list are:
a. forward
b. backward
c. forward and backward
d. right 

Q5. A node in a double linked list comprises which of the following:
a. information field
b. information field and next pointer
c. information field, next pointer and thread field
d. information field, next pointer, previous pointer & previous pointer                 

Q6. The situation in which the user tries to delete a node from an empty linked list is known as:
a. empty
b. free
c. overflow
d. underflow

Q7. When a new node is inserted in between a linked list, which of these is true:
a. only the nodes appearing after the new node needs to be moved          
b. only the nodes appearing before the new node needs to be moved
c. the nodes appearing before and after the new node need to be  moved 
d. None of the above

Q8.The situation in which memory is not available for the allocation of a new node:
a. empty
b. free
c. overflow
d. underflow

Q9. A linear linked list in which the next field of the last node points back to the first node then that linked list is known as:
a. single linked list
b. double linked list
c. circular linked list
d. reversed linked list

Q10. A node can be dynamically inserted into a linked list, for which the memory manager maintains a special list known as: 
a. available list
b. free-storage list
c. single linked list
d. dynamic storage list

Q11. The insertion or deletion on a stack are known as:
a. insert and delete
b. enter and exit
c. push and pop
d. none of the above

Q12. A stack could be implemented using which of the following:
a. single and double
b. single and circular
c: array and linked list
d: any of the above

Q13. The pointer which is used to point the data element in the beginning of the stack is known as:
a. start
b. front
c. root
d. top

Q14.Postfix notation is also know as:
a. polish notation
b. reverse polish notation
c. post notation
d. post-operator notation

Q15. A linked list is which type of data-structure:
a. static
b. non-linear
c. linear
d. none of the above

Q16. Prefix notation is also known as:
a. polish notation
b. reverse polish notation
c. pre notation            
d. post-operator notation

Q17. When converting an infix expression to postfix using algorithm, when ‘(‘ is encountered, it is:
a. added to postfix string
b. pushed and operators are popped from the stack 
c. pushed onto the stack
d. options a and c are performed

Q18. Data-structure in which insertion and deletion take place from the start:
a. linked list
b. queue
c. tree
d. stack

Q19. The postfix expression: 5 6 2 + * 12 4 /- when evaluated gives the following result:
a. -37  
b. -47
c. 45  
d. 37

Q20.The condition top = -1 indicates that the stack is:
a. one element
b. full
c. empty         
d. none of these

Thanks
Mukesh Rajput

No comments:

Post a Comment

Thanks
Mukesh Rajput