Question
Which data structure uses FILO (First In, Last Out) order?
Solution
Stack follows FILO — the element pushed in first is the last to be popped out. Applications include function call management (call stack), undo operations, expression evaluation, and backtracking algorithms. Queue uses FIFO (First In, First Out).
More Data Structure Questions
- Which sorting algorithm has O(n log n) average case?
- What is the difference between 'BFS' (Breadth-First Search) and 'DFS' (Depth-First Search) in graph traversal?
- Which of the following is an effective countermeasure against Cross-Site Scripting (XSS) attacks in a web application?
- An algorithm with a time complexity of O(log n) means that its execution time:
- What is "unit testing" and how does it relate to debugging?
- What is the primary purpose of an abstract class?
- Which of the following is a key characteristic of an effective Management Information System (MIS)?
- If a program crashes with a "NullPointerException" (or similar null reference error), what is the most likely cause?
- Tarjan’s Algorithm finds:
- Which sorting algorithm is considered the most efficient for large datasets with no additional memory constraints?
Relevant for Exams:
