Data Structures and Algorithms Exam Notes

False (B)

<p>To compute the location of the key in the array.</p> Signup and view all the answers

<p>3</p> Signup and view all the answers

<p>Stack (C)</p> Signup and view all the answers

<p>Stack (D)</p> Signup and view all the answers

<p>Completeness = Is the strategy guaranteed to find the solution when there is one. Time Complexity = How long does it take to find a solution. Space Complexity = How much memory is needed to perform the search.</p> Signup and view all the answers

<p>O(1) time (D)</p> Signup and view all the answers

<p>Array (B)</p> Signup and view all the answers

<p>O(n) (B)</p> Signup and view all the answers

<p>True (A)</p> Signup and view all the answers

<p>Linear data structures have a sequential arrangement (e.g., arrays, linked lists) while non-linear data structures have a hierarchical arrangement (e.g., trees, graphs).</p> Signup and view all the answers

<p>row size</p> Signup and view all the answers

<p>Bubble Sort = Rearranging elements in ascending order Postfix Evaluation = Evaluating expressions Insertion Sort = Building a sorted array incrementally Stack Operations = Pushing and popping elements</p> Signup and view all the answers

<p>First In First Out (B)</p> Signup and view all the answers

<p>True (A)</p> Signup and view all the answers

<p>A sparse matrix is a matrix in which most of the elements are zero.</p> Signup and view all the answers

<p>O(n log n)</p> Signup and view all the answers

<p>Use a stack to manage operators and output the operands in the correct order by applying operator precedence.</p> Signup and view all the answers

A method where a problem's solution is defined in terms of smaller instances of the same problem.

In a full binary tree, the number of nodes at level 'L' (starting from level 0) is 2^L.

The data structure most suitable for implementing Quick Sort iteratively is a stack.

Hashing aims to achieve O(1) search time on average.

Completeness refers to whether a search algorithm guarantees finding a solution if one exists.

Time Complexity measures how long it takes an algorithm to find a solution.

Space Complexity measures how much memory is needed to execute an algorithm.

An array is a linear data structure where elements are stored in contiguous memory locations.

In an array-based stack, the 'push' operation involves incrementing the 'top' pointer and placing the new element at the new top location.

A stack is a data structure that allows insertion and deletion operations only at one end, known as the 'top'.

A data structure that stores ordered elements (values) of the same data type, accessed by indexes.

A data structure where elements are arranged in a linear sequence, linked by references (pointers).

A data structure that stores elements in a Last-In, First-Out (LIFO) manner. Elements are added and removed from the top.

A data structure that stores elements in a First-In, First-Out (FIFO) manner. Elements are added at the rear and removed from the front.

A linear data structure with a circular arrangement where the last element points to the first element, forming a loop.

A data structure that allows efficient insertion and deletion at both ends (front and rear), but not in the middle.

A data structure that uses a contiguous block of memory to store elements, where each element is uniquely identified by its index.

A method for sorting an array by repeatedly stepping through the list, comparing adjacent elements and swapping them if they are in the wrong order.

A sorting algorithm that effectively inserts each element into its correct position within a sorted subarray.

A sorting algorithm that uses a divide-and-conquer approach to sort elements in an array. Recursively partitions the array into two sub-arrays and sorts them independently.