Average Case Time Complexity of Merge Sort and Computer Science Fundamentals

Problem Statement

What is the average case time complexity of the Merge Sort algorithm? O(n) O(n log n) O(n^2) O(log n) What is the time complexity of sorting an array with Insertion Sort when: a) the array is already sorted, and b) the array is reverse sorted? a) O(n), b) O(n^2) a) O(n log n), b) O(n^2) a) O(n^2), b) O(n^2) a) O(n), b) O(n log n) In database design, Third Normal Form (3NF) ensures that non-key attributes are dependent only on the primary key, thereby eliminating which of the following? Partial dependency Multivalued dependency Transitive dependency Join dependency Given the code snippet: struct XYZ { int x; float y; double z; }; struct XYZ *ABC[10]; How is ABC defined? An array of 10 structures of type XYZ A pointer to an array of 10 structures An array of 10 pointers to structures of type XYZ A structure containing 10 pointers What is the worst-case time complexity for the deletion operation in a B-Tree? O(n) O(n log n) O(1) O(log n)