Data Structures and Algorithms

A recursive function is defined by its ability to call itself during execution to solve smaller instances of the same problem. This process continues until a base case is reached.

Arrays have a fixed size defined at creation, whereas linked lists can grow or shrink dynamically by allocating and deallocating memory for individual nodes as needed.

A queue follows the First-In-First-Out (FIFO) principle, where the first element added is the first one to be removed. This is analogous to a line of people waiting for service.

A stack follows the Last-In-First-Out (LIFO) principle, where the most recently added element is the first one to be removed. This is analogous to a stack of plates.

Bubble sort works by repeatedly stepping through the list, comparing adjacent elements, and swapping them if they are in the wrong order. This process 'bubbles' the largest unsorted element to the end of the array in each pass.

Binary search works by repeatedly dividing the search interval in half. This process requires the data to be sorted so that the algorithm can determine whether the target value is in the left or right half.

In Java, array indexing is zero-based, meaning the first element is at index 0. If the last index of an array is 12, the total number of elements (the length) is 12 + 1 = 13.

The index of the last element in a Java array is always one less than the array's length, which is represented by 'list.length - 1'. Note that 'list[list.length - 1]' refers to the element itself, not its index.

In Java, arrays are objects and must be instantiated using the 'new' keyword followed by the data type and the size in square brackets. The correct syntax to declare and initialize an array of 20 integers is 'int[] myArray = new int[20];'.

The loop in Option A starts with i = 0 and continues as long as i is strictly less than 10, incrementing by 1 each time. This executes the loop body for values 0 through 9, which is exactly 10 iterations. Option C only runs 9 times, and Option D runs 11 times.

A linear search, also known as a sequential search, checks each element of a list one by one in order until a match is found or the end of the list is reached. Binary search requires a sorted list and divides the search interval in half each time, which is much faster but works differently. Other options like singular search or bubble search are not standard search algorithms.

Merge, Bubble, and Insertion are all well-known sorting algorithms used to arrange data in a specific order. Binary, in this context, refers to Binary Search, which is a searching algorithm rather than a sorting algorithm. Therefore, Binary is the odd one out.