Python Built-In Data Structures

Question 1

Python has 4 types of built-in data structures, they are?

Answer 1

lists,

tuples,

dictionaries,

sets.

Question 2

Which two types of python data structures are mutatable?

Answer 2

lists and dictionaries.

Question 3

What python data types are not mutable?

Answer 3

tuples and sets.

Question 4

Python lists are created by?

Answer 4

[]

Question 5

Python sets are created by?

Answer 5

{ }

Question 6

Python dictionary are created by?

Answer 6

{ }

dict( )

Question 7

Python tuples are created by?

Answer 7

( )

Question 8

Cite the data structure?

a = [“apple”, “banana”, “cherry”]
print(a)

Answer 8

list

Question 9

Cite the data structure?

a = (“apple”, “banana”, “cherry”)

Answer 9

tuple

Question 10

Cite the data structure?

a = {“apple”, “banana”, “cherry”}

Answer 10

set

Question 11

Cite the data structure?

a = {
“brand”: “Ford”,
“model”: “Mustang”,
“year”: 1964
}

Answer 11

dictionary

Question 12

______ items are ordered, changeable, and allow duplicate values.

______ items are indexed, the first item has index [0], the second item has index [1] etc.

Answer 12

List

List

Question 13

____ items are ordered, unchangeable, and allow duplicate values.

____ items are indexed, the first item has index [0], the second item has index [1] etc.

Answer 13

tuple

tuple

Question 14

____ items are unordered, unchangeable, and do not allow duplicate values.

Answer 14

set

Question 15

_____ items are unordered, changeable, and does not allow duplicates.

_____ items are presented in key:value pairs, and can be referred to by using the key name.

Answer 15

dictionary

Question 16

Cite 6 user type data structures in python3

Answer 16

stacks,

queues,

trees,

linked lists,

graphs,

hashmaps.

Question 17

Last in first out (LIFO) describe what user type data structure?

Answer 17

stacks

linear data-structure, reversing words, recursion programming, word editors,

Question 18

First in first out (FIFO) describe what user type data structure?

Answer 18

queues

about: linear data structure, array structured, heads & tails, traffic congestion management, dequeue, enque to remove elements, job scheduling (ie print que)

Question 19

A non linear data structure ecompassing a root and nodes is what type of user defined data structure?

Answer 19

trees

about: parent child relationships, last node are described as leaves, hierarchy structured (ie web pages), efficient at searching

Question 20

A linear data structure that isn’t sorted and utilizes pointers describes what user defined data structure?

Answer 20

linked list

about: image viewing, pointers -> next, used in music player applications,

Question 21

What user defined data structure encompasses pointers, vertices and edges

Answer 21

graphs

about: real world example of a map, used by Google map, used to determine quickest most efficient routes between nodes or points, used by Uber.

Question 22

What user defined data structure can define a dictionary like structure much like a phone book?

Answer 22

hashmaps

about: identical as a dict object in python, used in applications like phone books,

populate data from a list,

Question 23

_________ are rules or instructions that are formulated in a finite, sequential order to colve problems. They provide the ________ for problems.

Answer 23

algorithms

pseudocode

Question 24

What are the 5 steps involved in writing algorithms?

Answer 24

1. determine the exact problem
2. define start
3. define stop
4. formulate intermediate steps
5. review

Question 25

Elements of a good algorithm are:

Answer 25

• finite, clear, and understandable.
• clear and precise description of input and outputs.
• each step must have a defines output that depends only on inouts in that step of the preceding steps.
• should be flexible.
• every step should make use of general programming fundamentals and be language agnostic.

Question 26

Cite three algorithms classes?

Answer 26

divide & conquer

dynamic programming

greedy algorithms

Question 27

“Divides the problem into sub parts and solves each on separately” describes which algorithm class?

Answer 27

divide & conquer

Question 28

“Divides the problem into sub-parts, remembers the results and applies it to simliar ones” describes which algorithm class?

Answer 28

dynamic programming

Question 29

“Involves taking the easiest step while solving a problem without worrying about the complexity of the future steps” describes which algorithm class?

Answer 29

greedy algorithm

Question 30

Cite the 3 types of tree traversals?

Answer 30

In-order

pre-order

post-order

Question 31

______ traversal refers to visiting the left nodes followed by the root and then right nodes.

Answer 31

in-order

Question 32

______ traversal refers to visiting the root nodes followed by the left nodes and then right nodes.

Answer 32

pre-order

Question 33

_______ traversal refers to visiting the left nodes followed by the right nodes and then root node.

Answer 33

post-order

Question 34

Cite the five(5) sorting algorithms types?

Answer 34

1. merge
2. bubble
3. insertion
4. selection
5. shell

Question 35

What type of algorith​m follows the divide & conquer rule and the given list is divided into smaller lists and compared to adjacent lists and then reorders in the desired sequence all using recursion?

Answer 35

merge sort