List of top Algorithms Questions

Let \( G \) be an edge-weighted undirected graph with positive edge weights. Suppose a positive constant \( \alpha \) is added to the weight of every edge. Which ONE of the following statements is TRUE about the minimum spanning trees (MSTs) and shortest paths (SPs) in \( G \) before and after the edge weight update?
Which of the following statements regarding Breadth First Search (BFS) and Depth First Search (DFS) on an undirected simple graph \( G \) is/are TRUE?
Which sorting algorithm works by continuously swapping the adjacent elements ?
Let us consider for an Algorithm A, a nested loop and also a single loop is present what would be the time complexity for algorithm A ?
In bubble sort algorithm, every iteration through each element of a list is called?
Consider the following table of arrival time and burst time for three process Po P1 and P2
ProcessArrival Time Burst Time
Po0 ms 9 ms
P11 ms4 ms 
P22 ms9 ms 

The preemptive shortest job first scheduling algorithm is used. Scheduling is carried out only at arrival or completion of process. What is the average waiting time for the three process

The average case complexity of Selection sort, Quick sort and Radix sort is respectively