Question 1

All items in the collection can be either the same type of different.

Accepted Answer

homogeneous and heterogeneous collections

Answer

heterogeneous

Answer

homogeneous

Answer

none of the above

Question 2

Ordered by position. Each item has a unique predecessor and a unique successor.

Accepted Answer

Linear Collection

Answer

Non-Linear Collection

Answer

Hierarchical Collection

Answer

Graph Collection

Question 3

Tree-like structure. Each item except for top has one predecessor but possibly many successors.

Accepted Answer

Hierarchical Collection

Answer

Graph Collection

Answer

Non-Linear Collection

Answer

Linear Collection

Question 4

Each item may have many predecessors and many successors.

Accepted Answer

Graph Collection

Answer

Hierarchical Collection

Answer

Linear Collection

Question 5

See image

Accepted Answer

No particular order with no defined predecessor or successor.,Unordered Collection

Question 6

See image

Accepted Answer

Imposes some natural rule upon a collection in order to define a system of organization.,Sorted Collection

Question 7

See image

Accepted Answer

The work grows in direct proportion to the size of the problem (problem size = 10, work size = 10),Linear Algorithm

Question 8

See image

Accepted Answer

The problem requires the same number of operations for any problem size. (Best Type),Constant Algorithm

Question 9

See image

Accepted Answer

The work is the square of the size of the problem (problem size = 10, work size = 100),Quadratic Algorithm

Question 10

See image

Accepted Answer

The work increases by 1 per doubling of problem size.,Logarithmic Algorithm

Question 11

See image

Accepted Answer

The work grows at a rate of n^k where k is a constant greater than 1 (n^2, n^3, n^10),Polynomial Time Algorithm

Question 12

See image

Accepted Answer

The work grows at a rate of 2^n. (very impractical),Exponential Algorithm

Question 13

See image

Accepted Answer

A sequential search is a search that compares the target to each item in the sequence until finding a match. The best-case scenario is that the item is found within the first comparison which would be O(1) complexity. The worst and average cases would be a complexity of O(n) as each item in the list has to be compared.,What is a sequential search? Describe the best, worst, and average case scenarios.

Question 14

See image

Accepted Answer

When data is not arranged in any particular order.,When is it appropriate to use a sequential search?

Question 15

See image

Accepted Answer

When you are searching sorted data.,When is it appropriate to use a binary search?

Question 16

See image

Accepted Answer

A binary search is performed by taking the middle value and comparing it to the target. If the target is greater than the middle value, the values to the left are evaluated. Likewise if the target is less than the middle value, the values to the right are evaluated. The complexity of a binary search is O(log2n).,How does a binary search work? What is the complexity?

Question 17

See image

Accepted Answer

__eq__, __lt__, and __gt__ methods.,What methods can be defined for comparison of new types of objects?

Question 18

See image

Accepted Answer

A selection sort compares the target element with each element in the collection starting with the first. When it finds the smallest element in the collection, it swaps the two elements. This process is continued until all elements have been sorted. The complexity is O(n2).,What is a selection sort? What is the complexity?

Question 19

See image

Accepted Answer

A bubble sort compares each element to its adjoining element start at the beginning. The larger of the two elements is swapped to the right and this continues until the largest element is at the end of the list. The process starts again from the beginning of the collection and continues until all elements have been processed. The complexity is O(n2).,What is a bubble sort? What is the complexity?

Question 20

See image

Accepted Answer

Insertion sort takes advantage of the partial order that a collection may already have. i ranges from 1 to n-1, and for all items in i-1, i is compared until it's proper spot is found. It is similar to the way that people organize cards in their hand. The complexity is O(n2),What is insertion sort? What is the complexity?

Question 21

See image

Accepted Answer

Immutable Data Structure,A data structure in which one cannot insert, remove, or replace the values contained therein.

Question 22

See image

Accepted Answer

Mutable Data Structure,Structure and data can be changed at runtime

Question 23

See image

Accepted Answer

Which Data Structures are considered Immutable?,Tuples are considered an immutable data structure.

Question 24

See image

Accepted Answer

What Data Structures are considered Mutable?,Lists, Dictionaries, and sets are considered mutable data structures.

Question 25

See image

Accepted Answer

Tuples,are a data structure that, while similar to lists due to their ordered nature and ability to store multiple different data types, exhibit certain features that make them unique.

Question 26

See image

Accepted Answer

This data structure is enclosed by parentheses().

Question 27

See image

Accepted Answer

This data structure is immutable; that is, they CANNOT be modified in any way after being declared.

Question 28

See image

Accepted Answer

This data structure is indexable, allows duplicates, and does NOT store key-value pairs.

Question 29

See image

Accepted Answer

Lists,this data structure stores ordered collections that are enclosed in square brackets [].

Question 30

See image

Accepted Answer

They are mutable, meaning that elements within them can be changed/ modified as needed.

Question 31

See image

Accepted Answer

Any data type, including other data structures, can be stored within them. This data structures elements can be directly accessed via indexing which makes this structure indexable. This data structure allows duplicates, but does not store key-value pairs.

Question 32

See image

Accepted Answer

Sets,This data structure, unlike tuples, are mutable collections of data.

Question 33

See image

Accepted Answer

They are unordered collections, meaning that any sorting functions do not apply here.

Question 34

See image

Accepted Answer

While being mutable, only allow unique elements and will automatically eliminate any duplicates that you add within them.

Question 35

See image

Accepted Answer

This data structure is declared using curly braces {}

Question 36

See image

Accepted Answer

This data structure does NOT allow all data types to be stored within them as elements.

Question 37

See image

Accepted Answer

This data structure only allow hashable data types, which means that these data types must be immutable (cannot be modified any further after declaration). As such, lists and sets themselves are mutable, which means that they cannot be inserted as elements within a set.

Question 38

See image

Accepted Answer

This data type can be useful for performing mathematical logical operations such as intersections, unions and differences between sets.

Question 39

See image

Accepted Answer

This data structure will automatically order elements for you from least to greatest.

Question 40

See image

Accepted Answer

Dictionaries,Out of all data structures that we covered so far, this data structure has the most peculiar yet important structure, especially for many projects where values can have associated values that denote them in a different manner.

Question 41

See image

Accepted Answer

This data structure key-value pairs, meaning that each element in a dictionary consists of a key that corresponds to a specific value. Keys must be represented by hashable (immutable) data types, such as integers, float numbers, strings and tuples (only if they contain immutable elements). On the other hand, values can be represented by any data type without restriction, including dictionaries themselves.

Question 42

See image

Accepted Answer

This data structure is initialized with curly braces and have the following structure:

Question 43

See image

Accepted Answer

dictionary = {key : value, key : value, ...}

Question 44

See image

Accepted Answer

Dictionary Data Structure,Out of all data structures that we covered so far, this data structure has the most peculiar yet important structure, especially for many projects where values can have associated values that denote them in a different manner.

Question 45

See image

Accepted Answer

List Data Structure,this data structure stores ordered collections that are enclosed in square brackets [].

Question 46

See image

Accepted Answer

Tuples Data Structure,This data structure is immutable; that is, they CANNOT be modified in any way after being declared.

Question 47

See image

Accepted Answer

Duck typed,A programming language that does require variable data types to be explicitly declared. A type system where an object is considered compatible with a given type if it has all the methods and attributes that the type requires.

Question 48

See image

Accepted Answer

Code will execute an action based on the types of built-in objects being processed.

Question 49

See image

Accepted Answer

Built in data structures,data structures that are so common as to be provided by default

Question 50

See image

Accepted Answer

ex: arrays, lists, tuples, dictionaries, sets, stacks, and queues.

Question 51

See image

Accepted Answer

Strong typed languages,

Question 52

See image

Accepted Answer

in-place operation,An operation that modifies a variable without making a copy is known as ....

Question 53

See image

Accepted Answer

duck-typed,A data structure where the type or the class is less important than the methods it defines is known as what?

Question 54

See image

Accepted Answer

Python Structure Fact 1,Python code is structured and indented blocks must be used

Question 55

See image

Accepted Answer

#!/usr/bin/env phyton3,What is the proper shebang to indicate the script is using Python version 3?

Question 56

See image

Accepted Answer

interpreter,translates one statement of the source code at a time into machine code

Question 57

See image

Accepted Answer

compiler,scans the entire source code file and translates the whole of it into machine code at once. This code tends to execute faster than interpreted code.

Question 58

See image

Accepted Answer

Casting this data type improperly would cause a runtime error.,A string cast as an int

Question 59

See image

Accepted Answer

"break" Statements,Terminate the loop and transfer control to the statement following the loop

Question 60

See image

Accepted Answer

"continue" Statements,it does not break the loop and it terminates the execution of statements while iterating the loop

Question 61

See image

Accepted Answer

single dimension array,arr = []

Question 62

See image

Accepted Answer

Which of the following is a collection type that implements a method called 'keys()' ?,dictionary

Question 63

See image

Accepted Answer

Which of the following is a collection type that implements a method called 'insert()' ?,list

Question 64

See image

Accepted Answer

Which collection structure allows items that are ordered, changeable, and does not allow duplicate values?,Dictionary

Related quizzes

Related quizzes