DFS & BFS
Explain how BFS traverses a graph
Level by Level, top down
Why is computing the square root avoided?
It is computationally intensive
T/F the selection sort is considered in-place
Which is older Python or Java?
Python
Breadth-First Search (BFS) utilizes a ___ data structure, which adheres to a _____ order, to manage and sequentially select the next vertex for traversal.
Queue, FIFO
exponentially
Who is the Author of the Linux Kernel?
Linus Torvalds
Which Data structure is used for DFS?
Generally a Stack
List three qualities of the Brute force approach
Simple, General, improved with modest effort, limited efficiency
With each pass, the ___ sort positions the largest unsorted value correctly.
Bubble
What is origin of the term 'Bug' in software engineering?
Grace Hopper, Mark II computer in 1947
What is the primary difference between DFS and BFS?
The exploration strategy employed
power of machines
How can the Selection Sort be improved?
By using an additional structure to store indices of smallest numbers
List 3 of the top 6 Programming languages according to the TIOBE 2025 index. IN CORRECT ORDER
1. Python, 2. C, 3. C++
4. Java, 5. C#, 6. JS
Explain how DFS determines the next vertex to visit
Depends on the data structure representing the graph
Describe the brute force approach for string matching
Systematically compares characters in the test and pattern NOT sub-string comparison
What is significant about the Hungarian method concerning the assignment problem?
It guarantees the optimal solution (for any instance)
Who is the greatest NHL Hockey Player of all time? and what was his jersey number?
Wayne Gretzky, 99