CS301 Lab Quiz 1-3

CS301P · (Weekly Lab Quiz of Lab 1,2,3) 15 Marks · Syed Muzahir Ul Hassan

Q1. which type of linked list has two Null pointers?

Answer: Doubly linked list

Q2. Nodes in the linked list are accessed in ------------ order

Answer: Random

Q3. which of the following linked list method moves the pointer forward ?

Answer: Next ()

Q4. which of Nodes class returns the value of node in a Linked list?

Answer: Get()

Q5. in C++ a single stack can be used for different types by using --------------

Answer: Templates

Q6. The stack will be considered full, if the current variable is equal to ---------

Answer: Size -1

Q7. consider a list (2,6,8,7,1) represented as a linked list. In this list “current” is a

Answer: List element ( Table question)

Q8. What is the output of the following program?

Int main ()

Int array [5]={10,20,30,40,50}; Count << array [3] Return 0;

Answer: Syntex Error

Q9. How many times a for loop will be executed if we use the find () method of list data structure to find the value 10 from the given list?

Answer: 5 ( table question )

Q10. All the operation in stack take ----------- time.

Answer: Zero

Q11. Which of the following statement declares an array ‘x’ with 6 integers?

Answer: int x[6];

Q12. in data structure, List is the collection of elements in -----------------

Answer: Linear Order

Q13. Each operator in a postfix expression refers to the previous--------- operand(s)

Answer: 0( not confirm ) 2 not confirm

Q14. which of the following is used in function calls?

Answer: Tree

Q15. in a doubly linked list. We can traverse the list in ---------------

Answer: Both direction

Q16. The postfix expression for the infix expression 1-3-4 is :

Answer: 134--

Q17. Which of the following is used to navigate from one node to another node in the linked list?

Answer: Next part of node

Q19. when an operator is found in stack while evaluating a postfix expression, which of the following operation is performed on previous two operands ?

Answer: Push

Q20. The result of the postfix expression 634*+ is -----------

Answer: 20

Q21. in Linked List, add () method will add the new node after-----

Answer: Current Node

Q22. what will be value of second element of array ‘x’ after the execution of the given code? Int main )

{ int x [3]; For (int j=0; < 3; j++) X [j] = 2* j;

Answer: 0

Q22. In stack, which node will be considered as the Top of stack?

Answer: Last Node

Q23. which of the following is an infix expression?

Answer: 826+*

Q24. Removing an element from the end of stack using a linked list takes------- time than removing an element from the start.

Answer: More