Question
Which algorithm is a greedy algorithm used to find the
Minimum Spanning Tree (MST) of a graph by repeatedly adding the smallest weight edge that connects two disconnected components?Solution
Kruskal's Algorithm is a greedy algorithm for finding an MST. It sorts all the edges in non-decreasing order of their weights and then adds edges one by one to the MST if they do not form a cycle with the already added edges. Prim's Algorithm is also greedy but builds the MST by growing a single component.
Which of the following is the most effective data collection method for gathering real-time data from a website or application?
Which of the following is the most accurate example of metadata?
Which of the following statements is true regarding the Dickey-Fuller test in time series analysis?
In data transformation, what is the primary purpose of standardization?
Which of the following best describes a key advantage of containerization over traditional virtual machines?
Which of the following best describes the primary role of a data analyst within an organization?
In a min-heap, what is the complexity of removing the smallest element and restoring the heap property?
In time series analysis, which component is characterized by predictable, cyclical patterns that repeat at fixed intervals?
Which of the following Excel functions is most appropriate for dynamically summarizing data from multiple tables by matching a key value?
What differentiates big data from traditional data in terms of its defining characteristics?
