Data Structures Project

Week 0 Plans, Team, and Jobs:

Week 0 Plans, Team, Jobs Individual Review Ticket - Dylan Luo

Key Learning Code Snippets:

Swap, Keypad Matrix, Christmas Tree, Boat Animations, and The Python Menu:

import swap
import christmastree
import keypad
import badboat
import goodboat


main_menu = [
    ["Swap", swap.run],
    ["Keypad", keypad.run],
]

drawingsub_menu = [
    ["Christmas Tree", christmastree.options]
]

animationsub_menu = [
    ["Bad Boat", badboat.run],
    ["Good Boat", goodboat.ship]
]

border = "=" * 25
banner = f"\n{border}\nPlease Select An Option\n{border}"


def buildMenu(banner, options):
    print(banner)
    prompts = {0: ["Exit", None]}
    for op in options:
        index = len(prompts)
        prompts[index] = op
    for key, value in prompts.items():
        print(key, '->', value[0])
    choice = input("Type your choice> ")
    try:
        choice = int(choice)
        if choice == 0:
            return
        try:
            action = prompts.get(choice)[1]
            action()
        except TypeError:
            try:
                exec(open(action).read())
            except FileNotFoundError:
                print(f"File not found!: {action}")
    except ValueError:
        print(f"Not a number: {choice}")
    except UnboundLocalError:
        print(f"Invalid Choice: {choice}")
    buildMenu(banner, options)

Week 1 Lists and Loops:

Week 1 Lists and Loops Individual Review Ticket - Dylan Luo

Key Learning Code Snippets:

InfoDb lists and InfoDb loops:

# given an index this will print InfoDb content
def print_list(n):
    print("Anime Name:", InfoDb[n]["AnimeName"], "Date of First Episode:", InfoDb[n]["DateofFirstEpisode"], "Anime Studio(s):", InfoDb[n]["AnimeStudio(s)"] )  # using comma puts space between values
    print("\t", "Most Famous Anime Characters: ", end="")  # \t is a tab indent, end="" make sure no return occurs
    print(", ".join(InfoDb[n]["MostFamousAnimeCharacters"]))  # join allows printing a string list with separator
    print()

def run():
    print("For Loop:")
    for_loop(0,1)
    print("While loop:")
    while_loop(0)  # requires initial index to start while
    print("Recursive loop:")
    recursive_loop(0)  # requires initial index to start recursion

def for_loop(initial, final):
    for n in range(initial, final + 1):
      print_list(n)

# while loop contains an initial n and an index incrementing statement (n += 1)
def while_loop(n):
    while n < len(InfoDb):
        print_list(n)
        n += 1
    return

# recursion simulates loop incrementing on each call (n + 1) until exit condition is met
def recursive_loop(n):
    if n < len(InfoDb):
        print_list(n)
        recursive_loop(n + 1)
    return # exit condition

Fibonacci:

# Factorial of a number using recursion
def recur_factorial(n):
    if n == 1 or n == 0:
        return 1
    else:
        return n * recur_factorial(n-1)

def Tester():
    num = int(input("Enter a number for fibonacci terms: "))
    A1, A2 = 0, 1
    count = 0
  
    if num < 0:
        print("Sorry, factorial does not exist for negative numbers")
    elif num ==1:
        print("Fibonacci sequence upto",num,":")
        print(A1)
    else:
       print("Fibonacci sequence:")
    while count < num:
       print(A1)
       nth = A1 + A2
       A1 = A2
       A2 = nth
       count += 1

Week 2 Classy Functions:

Week 2 Classy Functions Individual Review Ticket - Dylan Luo

Key Learning Code Snippets:

Organized Python Menu and Submenus:

import Src.Week0.swap as swap
import Src.Week0.christmastree as christmastree
import Src.Week0.keypad as keypad
import Src.Week0.badboat as badboat
import Src.Week0.goodboat as goodboat
import Src.Week1.listsandloops as listsandloops
import Src.Week1.Fibonacci as Fibonacci
import Src.Week2.factorialclass as factorialclass
import Src.Week2.mathfunction as mathfunction
import Src.Week2.palindrome as palindrome

Main_menu = [
]

Week0_menu = [
    ["Swap", swap.run],
    ["Keypad", keypad.run],
    ["Christmas Tree", christmastree.options],
    ["1st Boat", badboat.run],
    ["2nd Boat", goodboat.ship]
]

Week1_menu = [
    ["Anime lists and loops", listsandloops.run],
    ["Fibonacci", Fibonacci.Tester]
]

Week2_menu = [
    ["Factorial Class", factorialclass.solve],
    ["Math Function", mathfunction.prime],
    ["Palindrome", palindrome.driver]
]

Factorial and Prime Math Function:

class Factorial:

    def algorithm(self, FactorialNumber):
        w = 1
        for i in range(1, FactorialNumber + 1):
            w = w * i
        return w


def solve():
  FactorialNumber = int(input("Enter a number:"))
  
  obj = Factorial()
  w = obj.algorithm(FactorialNumber)
  print("Factorial is:", w)
  
# def __init__(self):
#      self.Number = [0, 1]
# def __call__(self, w):

# Function to find a range of primes

def findprimes(min, max):
        for Number in range(min, max + 1):
            count = 0
            for i in range(2, (Number // 2 + 1)):
                if (Number % i == 0):
                    count = count + 1
                    break
            if (count == 0 and Number != 1):
                print(" %d" % Number, end='  ')
    
def prime():
    minimum = int(input(" Enter the Minimum Value for Primes: "))
    maximum = int(input(" Enter the Maximum Value for Primes: "))
    findprimes(minimum, maximum)