Crowdly
Додати до Chrome
Questions Bank (1517801 total)
What is a fundamental property of arrays?
Supports direct insertion at the beginning in O(1)
0%
Can store elements of different data types
0%
Fixed-size allocation in memory
100%
Variable size after initialization
0%
Переглянути це питання
What is a list in data structures?
A collection of elements stored in contiguous memory
0%
A dynamic data structure that allows insertion and deletion at any position
100%
A special type of array that supports only traversal
0%
A data structure that follows Last In, First Out (LIFO)
0%
Переглянути це питання
What is a common real-world application of arrays?
Storing images in memory
100%
Undo/Redo functionality in text editors
0%
CPU Scheduling
0%
Graph-based navigation
0%
Переглянути це питання
What formula is used for accessing an element in a row-major 2D array?
Base_Address + (Row_Index - Column_Index) × Size_of_Element
0%
Base_Address + (Column_Index × Number_of_Rows + Row_Index) × Size_of_Element
0%
Base_Address × (Row_Index + Column_Index)
0%
Base_Address + (Row_Index × Number_of_Columns + Column_Index) × Size_of_Element
0%
Переглянути це питання
What does the process of "infix to postfix conversion" involve?
Changing the order of operators to avoid parentheses
100%
Reversing the order of the operands
0%
Adding parentheses to operators
0%
Removing all parentheses and operators
0%
Переглянути це питання
What does the "divide and conquer" strategy typically involve?
Reducing the input until a base case is reached
0%
Dividing the input into parts and solving them separately
0%
Dividing a problem into smaller subproblems, solving them, and combining the results
0%
Breaking the input into equal sizes only
0%
Переглянути це питання
What are the two techniques to store 2D arrays in memory?
Sorted and unsorted
0%
Row-major and column-major
100%
Indexed and non-indexed
0%
Stack and queue allocation
0%
Переглянути це питання
What data structure is commonly used in routing algorithms?
Graph
100%
Queue
0%
Hash Table
0%
Stack
0%
Переглянути це питання
What does Big O notation represent?
The memory address of an array
0%
The worst-case complexity of an algorithm
100%
The size of an array
0%
The best case of an algorithm
0%
Переглянути це питання
The time complexity of deleting an element from a dynamic array is:
O(1)
100%
O
0%
O(log n)
0%
O(n²)
0%
Переглянути це питання
Попередня
1
Більше сторінок
139738
139739
139740
139741
139742
Більше сторінок
151781
Наступна
Telegram
Instagram
TikTok
Question Bank
Умови використання
Зв'яжіться з нами
Додати до Chrome