.jpg)
1. What is an algorithm?
An algorithm is a step-by-step procedure or set of rules designed to perform a specific task or solve a particular problem.
2. Define asymptotic notation.
Asymptotic notation is a mathematical tool used to describe the behavior of functions as their inputs grow large, commonly used to characterize the time or space complexity of algorithms.
3. What is a minimal spanning tree?
A minimal spanning tree (MST) is a subset of the edges in a weighted, connected graph that connects all the vertices with the minimum possible total edge weight, without forming any cycles.
4. What are the graph traversal techniques?
The main graph traversal techniques are Depth-First Search (DFS) and Breadth-First Search (BFS).
5. Give the complexity of heapsort.
The time complexity of heapsort is O(n log n).
6. What is the time complexity of merge sort?
The time complexity of merge sort is O(n log n).
7. What is decision tree?
A decision tree is a flowchart-like structure used for decision-making or classification, where each internal node represents a test on an attribute, each branch represents the outcome of the test, and each leaf node represents a class label or decision.
8. What do you understand by worst case time complexity?
Worst case time complexity refers to the maximum amount of time an algorithm can take to complete, given the most difficult input of a particular size. It provides an upper bound on the running time.
.jpg)