Data Structure 7

Question 1

singly-linked list

Answer 1

a data structure for implementing a list ADT, where each node has data and a pointer to the next node

Question 2

doubly-linked list

Answer 2

a data structure for implementing a list ADT, where each node has data, a pointer to the next node, and a pointer to the previous node. The list structure typically points to the first node and the last node

Question 3

hash table

Answer 3

a data structure that stores unordered items by mapping (or hashing) each item to a location in an array (or vector)

Question 4

binary tree

Answer 4

each node has up to two children, known as a left child and a right child.

Question 5

all(list)

Answer 5

True if every element in list is True (!= 0), or if the list is empty.

Question 6

any(list)

Answer 6

True if any element in the list is True.

Question 7

max(list)

Answer 7

Get the maximum element in the list.

Question 8

min(list)

Answer 8

Get the minimum element in the list.

Question 9

sum(list)

Answer 9

Get the sum of all elements in the list.

Question 10

list nesting

Answer 10

a list inside another list
Ex: my_list = [[5, 13], [50, 75, 100]]

Question 11

my_list[start:end]

Answer 11

Get a list from start to end (minus 1).
Code:my_list = [5, 10, 20]print(my_list[0:2])
Output: [5, 10]

Question 12

my_list[start:end:stride]

Answer 12

Get a list of every stride element from start to end (minus 1).
Code: my_list = [5, 10, 20, 40, 80]print(my_list[0:5:3])
Output: [5, 40]

Question 13

my_list[start:]

Answer 13

my_list[start:]

Question 14

my_list[:end]

Answer 14

Get a list from beginning of list to end (minus 1).
Code: my_list = [5, 10, 20, 40, 80]print(my_list[:4])
Output: [5, 10, 20, 40]

Question 15

my_list[:]

Answer 15

Get a copy of the list.

Question 16

list comprehension

Answer 16

A Python construct for creating a list in terms of conditions on other lists

new_list = [expression for name in iterable]

Question 17

dictionary

Answer 17

another type of container object that is different from sequences like strings, tuples, and lists. References to objects as key-value pairs - each key in the dictionary is associated with a value

Question 18

dict method

Answer 18

a function provided by the dict type that operates on a specific dict object.

Question 19

List

Answer 19

an ADT for holding ordered data.
Ex: Array, linked list

Question 20

Stack

Answer 20

an ADT in which items are only inserted on or removed from the top of a stack.
Ex: Linked List

Question 21

Queue

Answer 21

an ADT in which items are inserted at the end of the queue and removed from the front of the queue.
Ex: Linked List

Question 22

Deque

Answer 22

an ADT in which items can be inserted and removed at both the front and back.
Ex: Linked list

Question 23

Bag

Answer 23

an ADT for storing items in which the order does not matter and duplicate items are allowed.
Ex: Array, Linked List

Question 24

Set

Answer 24

an ADT for a collection of distinct items.
Ex: Binary search tree, hash table

Question 25

Priority queue

Answer 25

a queue where each item has a priority, and items with higher priority are closer to the front of the queue than items with lower priority.
Ex: Heap

Question 26

Dictionary (Map)

Answer 26

an ADT that associates (or maps) keys with values.
Ex: Hash table, binary search tree

Question 27

algorithm

Answer 27

sequence of steps to solve a computational problem or perform a calculation