C949 Data Structures and Algorithms
1. A datatype that is immutable, which Tuple
means that once it's been created, the
elements can't be changed. It is also a
sequence type. Is typically used when
element position, and not just the rela-
tive ordering of elements is important.
2. An immutable datatype where the el- Named Tuple
ement position is important. Each el-
ement can have it's own designated
name.
3. An ADT that serves as an unordered col- Set
lection of unique elements. When cre-
ated, the values should be contained
within a sequence-type iterateable ob-
ject.
4. Returns a new set containing only the Intersection
elements in common between one set
and all provided sets.
5. Returns a new set containing all of the Union
unique elements in all sets.
6. Returns a set containing only the ele- Difference
ments of set that are not found in any
of the provided sets.
7. Returns a set containing only elements Symmetric Difference
that appear in exactly one of set A or set
B.
, C949 Data Structures and Algorithms
8. A python container used to describe Dictionary
associative relationships. It associates
keys with values. A key can be any im-
mutable type, such as a number, string,
or tuple. A value can be any type.
9. A data type which supports all of Numeric Data Type
the normal mathematical operations.
These are the most common types
used to store data.
10. Data types which are collections of ob- Sequence Data Type
jects ordered by position.
11. A data type used exclusively by the Mapping Data Type
dict type. Each element is independent,
which means there is no special order-
ing. Also uses key value pairs to associ-
ate a key with a value.
12. A sequence of steps for accomplishing Algorithm
a task.
13. A search algorithm that starts from the Linear Search
beginning of a list and checks each el-
ement until the search key is found or
the end of the list is reached.
14. The time it takes for an algorithm to Runtime
execute.
15. An algorithm for searching a list if the Binary Search
list's elements are sorted. It starts by
, C949 Data Structures and Algorithms
checking the middle element of the list.
If the search key is found, the algorithm
returns the matching location. If not,
the algorithm repeats the search on the
remaining left sublist if the search key
is less than the middle element, or on
the remaining right sublist if it's larger.
16. The maximum number of steps re- [log2N]+1
quired to reduce the search space to an
empty sublist.
17. O(N) Which of the following Big O Notations is equiv-
alent to O(N+999)?
18. O(N) Which of the following Big O Notations is equiv-
alent to O(734*N)?
19. O(N^3) Which of the following Big O Notations is equiv-
alent to O(12*N)+6(N^3+1000)?
20. O(N^2) Simplify: 10*O(N^2)
21. O(N^3) Simplify: 2*N^3+O(N^2)
22. O(logN) Simplify: log2N
23. Constant runtime complexity. O(1)
24. Logarithmic runtime complexity. O(logN)
25. Linear runtime complexity. O(N)
26. Log-linear runtime complexity. O(NlogN)
1. A datatype that is immutable, which Tuple
means that once it's been created, the
elements can't be changed. It is also a
sequence type. Is typically used when
element position, and not just the rela-
tive ordering of elements is important.
2. An immutable datatype where the el- Named Tuple
ement position is important. Each el-
ement can have it's own designated
name.
3. An ADT that serves as an unordered col- Set
lection of unique elements. When cre-
ated, the values should be contained
within a sequence-type iterateable ob-
ject.
4. Returns a new set containing only the Intersection
elements in common between one set
and all provided sets.
5. Returns a new set containing all of the Union
unique elements in all sets.
6. Returns a set containing only the ele- Difference
ments of set that are not found in any
of the provided sets.
7. Returns a set containing only elements Symmetric Difference
that appear in exactly one of set A or set
B.
, C949 Data Structures and Algorithms
8. A python container used to describe Dictionary
associative relationships. It associates
keys with values. A key can be any im-
mutable type, such as a number, string,
or tuple. A value can be any type.
9. A data type which supports all of Numeric Data Type
the normal mathematical operations.
These are the most common types
used to store data.
10. Data types which are collections of ob- Sequence Data Type
jects ordered by position.
11. A data type used exclusively by the Mapping Data Type
dict type. Each element is independent,
which means there is no special order-
ing. Also uses key value pairs to associ-
ate a key with a value.
12. A sequence of steps for accomplishing Algorithm
a task.
13. A search algorithm that starts from the Linear Search
beginning of a list and checks each el-
ement until the search key is found or
the end of the list is reached.
14. The time it takes for an algorithm to Runtime
execute.
15. An algorithm for searching a list if the Binary Search
list's elements are sorted. It starts by
, C949 Data Structures and Algorithms
checking the middle element of the list.
If the search key is found, the algorithm
returns the matching location. If not,
the algorithm repeats the search on the
remaining left sublist if the search key
is less than the middle element, or on
the remaining right sublist if it's larger.
16. The maximum number of steps re- [log2N]+1
quired to reduce the search space to an
empty sublist.
17. O(N) Which of the following Big O Notations is equiv-
alent to O(N+999)?
18. O(N) Which of the following Big O Notations is equiv-
alent to O(734*N)?
19. O(N^3) Which of the following Big O Notations is equiv-
alent to O(12*N)+6(N^3+1000)?
20. O(N^2) Simplify: 10*O(N^2)
21. O(N^3) Simplify: 2*N^3+O(N^2)
22. O(logN) Simplify: log2N
23. Constant runtime complexity. O(1)
24. Logarithmic runtime complexity. O(logN)
25. Linear runtime complexity. O(N)
26. Log-linear runtime complexity. O(NlogN)
