tabris2015

def depthFirstSearch(problem):
    """
    Search the deepest nodes in the search tree first.
    Your search algorithm needs to return a list of actions that reaches the
    goal. Make sure to implement a graph search algorithm.
    To get started, you might want to try some of these simple commands to
    understand the search problem that is being passed in:
    print("Start:", problem.getStartState())
    print("Is the start a goal?", problem.isGoalState(problem.getStartState()))
    print("Start's successors:", problem.getSuccessors(problem.getStartState()))

tabris2015

#### PISTA EJERCICIO 2 ####
calificaciones_estudiantes = [('jose', 76),('mariana', 96),('jorge', 58),('esteban', 88),('julia', 45)]

def calcular_promedio(estudiantes):
    """Esta funcion toma como argumento una lista de tuplas (estudiante, nota) y
    devuelve la nota promedio de todos los estudiantes"""
    acumulado = 0
    for estudiante in estudiantes:
        acumulado += estudiante[1]