Delfina Sol Martinez Pandiani

The function for calculating the n-th Fibonacci number takes as input an integer “n”. If “n” is less than or equal to 0, then 0 is returned as result. Otherwise,...

1. Creating a specific color hue of acrylic paint 2. Making bechamel Common features: - Different ingredients have to be mixed in together - There is a specific result desired,...

Mmmm.. I wonder if I got this wrong: ("spam" not in "spa span sparql") --> is "spam" not in "spa span sparql"? --> No = True ("egg" > "span") -->...

From regular grammar with production rules: `` ::= "I" `` `` ::= "you" `` `` ::= "write" `` ::= "read" Possible sentences: I write ( `` = "I"; `=("write"))` I...

``` my_queue = deque(["Draco", "Harry", "Hermione", "Ron", "Severus"]) # currently my_queue contains five elements: # deque(["Draco", "Harry", "Hermione", "Ron", "Severus"]) print(my_queue) # check my queue looks right my_queue.popleft() # this...

``` # METHOD 1: alphabetize manually and add apend them already in alphabetical order harrypotter_list0 = list() # this creates a new list harrypotter_list0.append("Draco") harrypotter_list0.append("Harry") harrypotter_list0.append("Hermione") harrypotter_list0.append("Ron") harrypotter_list0.append("Severus") # check...

``` my_stack = deque(["Draco", "Harry", "Hermione", "Ron", "Severus"]) # currently my_stack contains five elements: # "Severus"]) # "Ron", # "Hermione", # "Harry", # deque(["Draco", print(my_stack) # check my stack looks...

Rules to keep in mind: Order of operations (without counting brackets): 1. not 2. and 3. or False and True = False True and False = False False or True...

``` def test_find_words(first_word, second_word, bib_entry, expected): result = find_words(first_word, second_word, bib_entry) if result == expected: return True else: return False def find_words(first_word, second_word, bib_entry): result = 0 if first_word in...