McqMate

Q. |
## Which of the following methods can be used to find the largest and smallest number in a linked list? |

A. | recursion |

B. | iteration |

C. | both recursion and iteration |

D. | impossible to find the largest and smallest numbers |

Answer» C. both recursion and iteration | |

Explanation: both recursion and iteration can be used to find the largest and smallest |

3.1k

0

Do you find this helpful?

21

View all MCQs in

Design and Analysis of AlgorithmsNo comments yet

- Which of the following methods can be used to find the largest and smallest element in an array?
- Which of the following methods can be used to search an element in a linked list?
- You are given n dice each having f faces. You have to find the number of ways in which a sum of S can be achieved. This is the dice throw problem. Which of the following methods can be used to solve the dice throw problem?
- Which of the following methods can be used to find the sum of digits of a number?
- Which of the following methods can be used to find the nth Catalan number?
- Given a string, you have to find the minimum number of characters to be inserted in the string so that the string becomes a palindrome. Which of the following methods can be used to solve the problem?
- In general, which of the following methods isn’t used to find the factorial of a number?
- Can binary search be applied on a sorted linked list in O(Logn) time?
- What is the time complexity of the program to reverse stack when linked list is used for its implementation?
- Which of the following is considered as the top of the stack in the linked list implementation of the stack?