Which of the following appropriately relates with

In Data Communication, what protocol is used to ensure reliable transmission of data over a network?

The time complexity of building a heap from an unsorted array of n elements is:

Which of the following sorting algorithms is considered stable (i.e., preserves the relative order of equal elements)?

Which file structure is best suited for handling large datasets and ensuring fast access in C, C++, Java, or Python?         

Which algorithm guarantees the shortest path in a graph with negative weights but no negative cycles?

The amortized time for inserting into a dynamic array (like C++ vector) is:

Which of the following is a critical concern for securing critical infrastructure?

The recurrence relation T(n) = 2T(n/2) + O(n) corresponds to which algorithm’s time complexity?

In Database Management Systems, what is the primary purpose of normalization?

Which is not true about minimum spanning tree?