What is defined as a collection of numbers, symbols, or characters that are raw and unorganized in their natural state?, Information, Data, Algorithm, Variable, Which of the following is an example of a primitive data structure?, Array, Queue, Integer, Stack, Which of the following best describes “information”?, It is a raw facts without context, It is randomly stored values in memory, An organized collection or data, A set of instructions for solving a problem, It is NOT a prerequisite for studying Data Structures and Algorithms?, Loops and conditional statements, Functions/Methods, Knowledge of quantum computing, Arrays and Collections, What is pseudocode?, A machine-executable program, An informal, text-based describe of an algorithm written in plain English mixed with programming logic., A type of flowchart, A programming language used in databases, In the standard algorithm flow, what comes after process?, Input, Output, Storage, Compilation, It is described as an array?, It can only store one value at a time, It is accessed using an index, It cannot be used for sorting, It is a non-primitive data structure, What is an algorithm?, A physical component of the computer, A set of instructions designed to perform a specific task, A type of data structure, A programming language, Which of the following is a linear data structure?, Tree, Graph, Array, Heap, Which of the following best describes a non-linear data structure?, Data is organized on a single level only, Elements are arranged in hierarchical or network-like order, Elements form a straight line or sequence, Each element has at most one predecessor and one successor, In a tree data structure, what is the topmost node called?, Root, Leaf, Child, Edge, Which data structure follows the FIFO (First In, First Out) principle?, Stack, Queue, Tree, Graph, In a tree data structure, what is the topmost node called?, Queue, Stack, Array, Linked List, Which operation adds an element to the top of a stack?, pop(), push(), peek(), enqueue(), Which operation removes an element from the top of a stack?, pop(), dequeue(), push(), peek(), Which stack operation returns the top element without removing it?, peek(), dequeue(), pop(), size(), In a queue, which operation inserts data at the rear?, dequeue(), enqueue(), push(), pop(), If you enqueue the elements 1, 2, 3, 4, 5 into a queue and then dequeue twice, what will be the front element?, 1, 2, 3, 4, What does the isEmpty() operation do in a stack?, Returns the topelement., Checks whether the stack is empty or not2, Removes all elements from the stack, Returns the size of the stack, What does Big O notation describe?, The worst-case scenario of how runtime or memory usage grows as input size increases, The exact runtime of an algorithm in seconds, The best-case scenario of an algorithm, The programming language used to implement an algorithm, Which Big O complexity represents constant time?, O(n), O(log n), O(1), O(n²), In a circular queue, when the rear pointer reaches the end of the array, where does it go next?, It stays at the end, It resets to the front position using modulo arithmetic, It moves to the middle of the array, It stops accepting new elements, Which Big O complexity is associated with binary search on a sorted list?, O(n), O(n log n), O(1), O(log n), Which Big O complexity grows explosively and doubles with every added input?, O(n²), O(n!), O(n log n), O(2ⁿ), In Big O notation, what does "n" typically represent?, The number of operations, The size of the input, The runtime in seconds, The amount of memory used, Which Big O complexity is associated with traversing all elements in a list?, O(1), O(log n), O(n), O(n²), Which of the following complexities is ordered from smallest to largest?, O(n), O(1), O(log n), O(n²), O(1), O(log n), O(n), O(n log n), O(n²), O(n²), O(n), O(log n), O(1), O(log n), O(1), O(n²), O(n), Which sorting algorithm selects the smallest element from the unsorted portion and exchanges it with the first unsorted element?, Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, Which of the following is a non-comparison-based sorting algorithm?, Bubble Sort, Merge Sort, Counting Sort, Quick Sort, Which sorting algorithm uses a pivot element to partition the array into smaller sub-arrays?, Merge Sort, Heap Sort, Counting Sort, Quick Sort, It is a divide-and-conquer algorithm that repeatedly divides the array until each piece holds a single element?, Bubble Sort, Quick Sort, Merge Sort, Heap Sort, Which sorting algorithm builds a max-heap from the array and repeatedly extracts the root element?, Merge Sort, Bubble Sort, Selection Sort, Heap Sort, What is the correct order of elements in ascending sorting?, Largest to smallest (e.g., 12, 9, 5, 1), Smallest to largest (e.g., 1, 5, 9, 12), Random Order, Alphabetical order only, Which of the following is the process of arranging a collection of items (data) in a specific order?, Random Order, Sorting Algorithm, Ascending, Descending, Which of the following is a straightforward sorting algorithm that repeatedly swaps adjacent elements if they are in the incorrect order?, Merge Sort, Bubble Sort, Heap Sort, Selection Sort

Pick-a-Pick

by
Print
Embed

Leaderboard

Visual style

Options

Switch template

Continue editing: ?