नीचे दिए गए वाक्यों

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

Which sorting algorithm has an average-case time complexity of O(n log n) and is known for its efficiency, often using a divide-and-conquer approach?

For a comparison-based sorting algorithm, which lower bound applies to the worst-case number of comparisons?

In dynamic programming, which principle ensures correctness by solving overlapping subproblems and storing results?

Which sorting algorithm divides the array into halves recursively?

Which data structure supports extraction of both min and max in O(1) time and insertion in O(log n)?

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

What is the default replication factor in HDFS?

In a binary search tree (BST), what is true about the left child of a node?

What is the worst-case time complexity of Bubble Sort?