Test: Fundamentals - Software Development MCQ

The given code snippet has two nested loops, each iterating from 0 to n. Hence, the time complexity is O(n²).

Bubble sort has a worst-case time complexity of O(n²) because it compares adjacent elements and swaps them if they are in the wrong order, potentially requiring multiple passes.

A stack follows the LIFO (Last-In-First-Out) principle, where the last element inserted is the first one to be removed.

The expression ++x increments x to 6, and the expression x++ returns the original value of x (6) before incrementing it to 7. Therefore, y is assigned the sum of 6 and 7, which is 13. The subsequent cout statement outputs 13.

A priority queue is often implemented using a heap, which is a specialized binary tree data structure.

Binary search can be used to search for an element in a sorted and rotated array in O(logn) time complexity.

Prim's algorithm is a minimum spanning tree algorithm, not a graph traversal algorithm.

The height of a binary search tree can vary depending on the order of insertion, and it is not necessarily always O(n). It can be O(logn) in a balanced BST.

Shortest path in a graph is a graph algorithm problem, not a dynamic programming problem.

The array arr has 5 elements (indexed from 0 to 4), so accessing arr[5] leads to accessing an out-of-bounds index, resulting in a runtime error.

A linked list provides efficient insertion and deletion operations at both ends, making it suitable for implementing a queue.

In a max-heap, the maximum element is always stored at the root, which can be accessed in constant time.

Hash tables can dynamically resize to accommodate more elements as needed.

Quick sort is a sorting algorithm based on the divide-and-conquer technique. It partitions the array around a pivot element and recursively sorts the subarrays.

Polynomial recurrence relation is not commonly used in analyzing recursive algorithms.