DSA

Question 1

is a way to store data

Answer 1

data structure

Question 2

If we want to store data about people we are related to, we use a ___ ____ as the data structure

Answer 2

family tree

Question 3

give us the possibility to manage large amounts of data efficiently for uses such as large databases and internet indexing services

Answer 3

Data structures

Question 4

are essential ingredients in creating fast and powerful algorithms.

Answer 4

Data structures

Question 5

In Computer Science there are two different kinds of data structures

Answer 5

Primitive Data Structures
Abstract Data Structures

Question 6

A cooking recipe written on a piece of paper is an example of an

Answer 6

algorithm

Question 6

are basic data structures provided by programming languages to represent single values, such as integers, floating-point numbers, characters, and booleans

Answer 6

Primitive Data Structures

Question 7

are higher-level data structures that are built using primitive data types and provide more complex and specialized operations

Answer 7

Abstract Data Structures

Question 8

is a set of step-by-step instructions to solve a given problem or achieve a specific goal

Answer 8

algorithm

Question 9

DSA stands for

Answer 9

Data structures and algorithms

Question 10

the step-by-step instructions are written in a programming language,

Answer 10

algorithms in Computer Science

Question 11

is about finding efficient ways to store and retrieve data, to perform operations on data, and to solve specific problems

Answer 11

DSA

Question 12

By understanding DSA, you can

Answer 12

Decide which data structure or algorithm is best for a given situation.

Make programs that run faster or use less memory.

Understand how to approach complex problems and solve them in a systematic way.

Question 13

algorithms in this tutorial are not worth much without a __ ___ to work on

Answer 13

data structure

Question 13

A data structure is not worth much if you cannot search through it or manipulate it efficiently using ___

Answer 13

algorithms

Question 14

DSA is fundamental in nearly every part of
the software world:

Answer 14

Operating Systems
● Database Systems
● Web Applications
● Machine Learning
● Video Games
● Cryptographic Systems
● Data Analysis
● Search Engines

Question 15

algorithm must consist of a
finite sequence of steps, ensuring it
concludes with a specific endpoint or
output, rather than continuing indefinitely

Answer 15

Finiteness

Question 15

Characteristics of a Very Good Algorithm

Answer 15

Finiteness
Definiteness
Input/Output
Effectiveness
Generality

Question 16

An algorithm must have
precise definitions for each step, with
clear and simple instructions to ensure
that every step is easily understood and
executable

Answer 16

Definiteness

Question 17

An algorithm necessitates one or
more inputs, which are the initial values
provided before processing begins. These
inputs must fall within a specified range of
acceptable values

Answer 17

Input

Question 18

An algorithm must generate one
or more outputs, which are the results
obtained after all steps are completed. The
connection between the inputs and the
resulting outputs should be clearly defined

Answer 18

Output

Question 19

The stages of an algorithm
must be simple enough to be executed
within a finite time using basic
operations. Each operation should be
feasible and practical with the available
resources

Answer 19

Effectiveness

Question 20

An algorithm should be
capable of addressing a range of
problems, not just a single specific case. It
should provide a general solution that can
handle various inputs within a defined
range or domain

Answer 20

Generality

Question 21

A measure of the
amount of time an algorithm takes to run,
depending on the amount of data the
algorithm is working on

Answer 21

Time Complexity

Question 22

measure of the
amount of memory an algorithm uses,
depending on the amount of data the
algorithm is working on

Answer 22

Space Complexity

Question 23

mathematical notation
that describes the limiting behavior of a
function when the argument tends
towards a particular value or infinity. Used
in this tutorial to describe the time
complexity of an algorithm

Answer 23

Big O Notation

Question 24

programming technique
where a function calls itself

Answer 24

Recursion

Question 25

A method of
solving complex problems by breaking
them into smaller, more manageable
sub-problems, solving the sub-problems,
and combining the solutions. Recursion is
often used when using this method in an
algorithm

Answer 25

Divide and Conquer

Question 26

simple and
straightforward way an algorithm can
work by simply trying all possible
solutions and then choosing the best one

Answer 26

Brute Force