Dsa exam with correct answers 100% 2025&2026

Dsa exam with correct answers 100% 2025&2026 Which procedure is used to solve a problem in a sequence? - Correct Answer Algorithm Which of the following is a data structure used in programming? - Correct Answer binary tree A storage that is used to organize, process, and retrieve data is called: - Correct Answer Data structure n an unordered array, it's generally faster to find out an item is not in the array, than to find out it is. - Correct Answer True Six files F1, F2, f3, F4, F5 and F6 have 100, 200, 50, 80, 120, 150 records respectively. In what order should they be stored so as to optimize act. Assume each file is accessed with the same frequency. - Correct Answer F3, F4, F1, F5, F6, F2 Which of the following standard algorithms is not a Greedy algorithm? - Correct Answer Bellmen Ford Shortest path algorithm Backtracking can be used to solve: - Correct Answer Combinatorial optimization problems What of the following is NOT a characteristic of dynamic programming? - Correct Answer Solving problems in a sequential manner. What does it mean when we say that an algorithm X is asymptotically more efficient than Y? - Correct Answer X will be a better choice for all inputs except possibly small inputs The Fibonacci sequence is often used to illustrate dynamic programming concepts. What is the time complexity of a naive recursive implementation of Fibonacci numbers? - Correct Answer O(2^n) The "Egg Dropping Puzzle" involves determining the minimum number of attempts needed to find the critical floor from which an egg will break when dropped. What is the time complexity of the dynamic programming approach for solving the Egg Dropping Puzzle for K eggs and N floors? - Correct Answer O(K * N)