lisasiurina

blank: '0' start state: A table: A: 0: {write: 1, L: B} 1: {write: 0, R: C} B: 0: {write: 1, R: A} C: 0: {write: 1, R: D} end...

Thank you @delfimpandiani and @federicafaithbologna hugs and kisses :) ``` def test_my_enumerate(input_list, expected): result = my_enumerate(input_list) if expected == result: return True else: return False def my_enumerate(input_list): result = list()...

input: '00111' blank: ' ' start state: A table: A: [0,1,' ']: {R: b} B: 1: {R:C} 0: {R:B} C: 1: {R:D} 0: {R:B} D: 1: {L:y} 0: {R:B} y:...

def linear_search(input_list, value_to_search):​ for ​position, item in enumerate(input_list): if item == value_to_search: return position list_of_books = list(["Coraline", "American Gods", "The Graveyard Book", "Good Omens", "Neverwhere"]) linear_search(list)["Coraline", "American Gods", "The Graveyard...

``` def partition(input_list, start, end, pivot_position): l =list() u=0 for i in input_list : print(l) if pivot_position

def test_fab(n,expected): if expected == fab(n): return True else: return False def fab(n): if(n

``` from networkx import Graph authors = Graph() authors.add_node("Tim Berners-Lee") authors.add_node("Christian Bizer") authors.add_node("Tom Heath") authors.add_node("Sören Auer") authors.add_node("Lalana Kagal") authors.add_node("James A. Hendler") authors.add_edge("Tim Berners-Lee", "Christian Bizer", weight=17) authors.add_edge("Tim Berners-Lee", "Tom Heath",...

set_hobbit = set(["Frodo", "Sam", "Pippin", "Merry"]) set_magician=set(["Saruman", "Gandalf"]) my_dict = dict () my_dict["hobbit"] = set_hobbit my_dict["magician"] = set_magician print (my_dict) output {'magician': set(['Gandalf', 'Saruman']), 'hobbit': set(['Frodo', 'Pippin', 'Sam', 'Merry'])}

def test_exponentiation(n,e, expected): result = exponentiation(n,e) if expected == result: return True else: return False def exponentiation(n, e): if e==0: return 1 elif e==1: return n else: return n *...

#Test case for the algorithm def test_stack_from_list(input_list, expected): result = stack_from_list(input_list) if expected == result: return True else: return False from collections import deque def stack_from_list(input_list): output_stack = deque() for...