dsa
問題一覧
1
is about how data can be stored in different structures.
data structures
2
__________ are about how to solve different problems, often by searching through and manipulating data structures.
algorithms
3
The ________ Data Structures and Algorithms (DSA) helps us use large amounts of data to solve problems efficiently.
theory of
4
____________ give us the possibility to manage large amounts of data efficiently for uses such as large databases and internet indexing services
They are also essential ingredients in creating fast and powerful algorithms. They help in managing and organizing data, reduce complexity, and increase efficiency.
data structures
5
___________ is a step-by-step instructions to solve given problems
algorithms
6
In computer society, the step-by-step instructions are written in a ____________
programming language
7
an algorithm uses ______________
data structures
8
_______________ go hand in hand. A data structure is not worth much if you cannot search through it or manipulate it efficiently using algorithms, and the algorithms in this tutorial are not worth much without a data structure to work on.
data structures and algorithms (DSA)
9
____ is about finding efficient ways to store and retrieve data, to perform operations on data, and to solve specific problems.
DSA
10
A measure of the amount of time an algorithm takes to run, depending on the amount of data the algorithm is working on.
time complexity
11
A measure of the amount of memory an algorithm uses, depending on the amount of data working on
space complexity
12
A mathematical notation that describes the limiting behavior of a function when the argument tends toward a particular value or infinity
big O notation
13
a programming technique where a function call itself
recursion
14
a method of solving complex problems by breaking them into smaller, more manageable sub-problems, solving the sub-problems, and combing the solutions.
divide and conquer
15
When using divide and conquer, __________ is often used in an algorithm
recursion
16
A simple and straightforward way an algorithm can work by simply trying all possible solutions and then choosinv the best one.
brute force
17
An ______ is a collection of variables of the same type i.e. it stores a collection of data of the same type.
array
18
consist of contiguous memory locations.
array
19
The ________ corresponds to the first element and the ___________ to the last element.
lowest address, highest address
20
All arrays have 0 as the index of their first element which is also called the ________ and the last index of an array will be total size of the array minus 1.
base index
21
A specific element in an array is accessed by an ________.
index
22
________ are commonly used in computer programs to organize data so that a related set of values can be easily sorted or searched. Also, used to Implement other data structures like Stacks, Queues, Heaps, Hash tables, etc.
arrays
23
In _________, an array can be created like this:
my_array = [7, 12, 9, 4, 11]
python
24
You can use the ________ to loop through all the elements of an array.
for in loop
25
To use a for loop, we need is a __________, _____________, and __________ with each run of our loop.
starting point, ending point, and amount to increment
26
The for loop starts with the keyword "____" followed by a ________ that represents each element in the list during each iteration.
for, variable name
27
After the variable name, the keyword "__" is used to specify the iterable object over which the loop will iterate.
in
28
The __________ following the for statement executes for each element in the list. This is to indicate that it belongs to the for loop.
indented block of code
29
To access the elements of an array in programming, you typically use the ______ of the element within the array.
index
30
Accessing the elements of an array refers to _______________ the values stored at specific positions within the array using their corresponding indices.
retrieving or modifying
31
the __________ is a control flow statement that is used to immediately terminate the execution of a loop (either a for loop or a while loop) and transfer control to the statement immediately following the loop.
break statement
32
___________ provides a mechanism to exit a loop prematurely based on a specific condition. It is commonly used within conditional statements (if, elif, else) to check for a condition that triggers the loop's termination.
break statement
33
The break statement is typically placed within a conditional block (e.g., if statement) that checks for a specific condition.
condition evaluation
34
When the condition is met, the break statement is executed, causing the loop to terminate immediately.
loop termination
35
The program flow continues to the statement immediately after the loop's closing bracket.
control transfer
pee
pee
Leanne Lamano · 65問 · 1年前pee
pee
65問 • 1年前pee_lesson 10
pee_lesson 10
Leanne Lamano · 35問 · 1年前pee_lesson 10
pee_lesson 10
35問 • 1年前pee_finals
pee_finals
Leanne Lamano · 46問 · 1年前pee_finals
pee_finals
46問 • 1年前OS_ module 1
OS_ module 1
Leanne Lamano · 56問 · 1年前OS_ module 1
OS_ module 1
56問 • 1年前os
os
Leanne Lamano · 57問 · 1年前os
os
57問 • 1年前os_module 2_lesson 1 and 2
os_module 2_lesson 1 and 2
Leanne Lamano · 46問 · 1年前os_module 2_lesson 1 and 2
os_module 2_lesson 1 and 2
46問 • 1年前問題一覧
1
is about how data can be stored in different structures.
data structures
2
__________ are about how to solve different problems, often by searching through and manipulating data structures.
algorithms
3
The ________ Data Structures and Algorithms (DSA) helps us use large amounts of data to solve problems efficiently.
theory of
4
____________ give us the possibility to manage large amounts of data efficiently for uses such as large databases and internet indexing services
They are also essential ingredients in creating fast and powerful algorithms. They help in managing and organizing data, reduce complexity, and increase efficiency.
data structures
5
___________ is a step-by-step instructions to solve given problems
algorithms
6
In computer society, the step-by-step instructions are written in a ____________
programming language
7
an algorithm uses ______________
data structures
8
_______________ go hand in hand. A data structure is not worth much if you cannot search through it or manipulate it efficiently using algorithms, and the algorithms in this tutorial are not worth much without a data structure to work on.
data structures and algorithms (DSA)
9
____ is about finding efficient ways to store and retrieve data, to perform operations on data, and to solve specific problems.
DSA
10
A measure of the amount of time an algorithm takes to run, depending on the amount of data the algorithm is working on.
time complexity
11
A measure of the amount of memory an algorithm uses, depending on the amount of data working on
space complexity
12
A mathematical notation that describes the limiting behavior of a function when the argument tends toward a particular value or infinity
big O notation
13
a programming technique where a function call itself
recursion
14
a method of solving complex problems by breaking them into smaller, more manageable sub-problems, solving the sub-problems, and combing the solutions.
divide and conquer
15
When using divide and conquer, __________ is often used in an algorithm
recursion
16
A simple and straightforward way an algorithm can work by simply trying all possible solutions and then choosinv the best one.
brute force
17
An ______ is a collection of variables of the same type i.e. it stores a collection of data of the same type.
array
18
consist of contiguous memory locations.
array
19
The ________ corresponds to the first element and the ___________ to the last element.
lowest address, highest address
20
All arrays have 0 as the index of their first element which is also called the ________ and the last index of an array will be total size of the array minus 1.
base index
21
A specific element in an array is accessed by an ________.
index
22
________ are commonly used in computer programs to organize data so that a related set of values can be easily sorted or searched. Also, used to Implement other data structures like Stacks, Queues, Heaps, Hash tables, etc.
arrays
23
In _________, an array can be created like this:
my_array = [7, 12, 9, 4, 11]
python
24
You can use the ________ to loop through all the elements of an array.
for in loop
25
To use a for loop, we need is a __________, _____________, and __________ with each run of our loop.
starting point, ending point, and amount to increment
26
The for loop starts with the keyword "____" followed by a ________ that represents each element in the list during each iteration.
for, variable name
27
After the variable name, the keyword "__" is used to specify the iterable object over which the loop will iterate.
in
28
The __________ following the for statement executes for each element in the list. This is to indicate that it belongs to the for loop.
indented block of code
29
To access the elements of an array in programming, you typically use the ______ of the element within the array.
index
30
Accessing the elements of an array refers to _______________ the values stored at specific positions within the array using their corresponding indices.
retrieving or modifying
31
the __________ is a control flow statement that is used to immediately terminate the execution of a loop (either a for loop or a while loop) and transfer control to the statement immediately following the loop.
break statement
32
___________ provides a mechanism to exit a loop prematurely based on a specific condition. It is commonly used within conditional statements (if, elif, else) to check for a condition that triggers the loop's termination.
break statement
33
The break statement is typically placed within a conditional block (e.g., if statement) that checks for a specific condition.
condition evaluation
34
When the condition is met, the break statement is executed, causing the loop to terminate immediately.
loop termination
35
The program flow continues to the statement immediately after the loop's closing bracket.
control transfer