In this exercise we will be processing some data stored as a list of dictionaries in order to be able to answer queries on the data. In our case we simply have a list of student records, where each record is a dictionary that has the student's name and their GPA. An example of the data set is below: roster = [{'name': 'Alice', 'gpa': 4.0}, {'name': 'Bob', 'gpa': 3.5}, {'name': 'Cody', 'gpa': 3.75}, {'name': 'David', 'gpa': 3.65} {'name': 'Archy', 'gpa': 3.39}, {'name': 'Nadia', 'gpa': 2.39}, {'name': 'Cesya', 'gpa': 3.34}, {'name': 'Kellie', 'gpa': 2.32}, {'name': 'Jordana', 'gpa': 3.64}, {'name': 'Wilton', 'gpa': 2.59}, {'name': 'Meagan', 'gpa': 3.45}, {'name': 'Leela', 'gpa': 2.66}, {'name': 'Kaela', 'gpa': 2.71}, {'name': 'Isabelita', 'gpa': 3.47}, {'name': 'Phillipe', 'gpa': 2.95}, {'name': 'Eula', 'gpa': 3.46}, {'name': 'Odetta', 'gpa': 3.56}, {'name': 'Christian', 'gpa': 3.4}, {'name': 'Zared', 'gpa': 2.84}, {'name': 'Devondra', 'gpa': 2.02}, {'name': 'Scarface', 'gpa': 2.21}, {'name': 'Reena', 'gpa': 3.21}, {'name': 'Benita', 'gpa': 3.93}, {'name': 'Rosalinde', 'gpa': 3.47}, {'name': 'Emlynn', 'gpa': 3.69} ] Your task is to create a function called topStudent which takes in a list of students of the form shown above and finds the name of the student with the highest GPA. For this assignment you can assume that no two students will have the same GPA.  where you'll find a class roster of 100 students.  def topStudent(grades):     print (topStudent(roster))

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

In this exercise we will be processing some data stored as a list of dictionaries in order to be able to answer queries on the data. In our case we simply have a list of student records, where each record is a dictionary that has the student's name and their GPA. An example of the data set is below:

roster = [{'name': 'Alice', 'gpa': 4.0}, {'name': 'Bob', 'gpa': 3.5}, {'name': 'Cody', 'gpa': 3.75}, {'name': 'David', 'gpa': 3.65}
{'name': 'Archy', 'gpa': 3.39}, {'name': 'Nadia', 'gpa': 2.39}, {'name': 'Cesya', 'gpa': 3.34}, {'name': 'Kellie', 'gpa': 2.32}, {'name': 'Jordana', 'gpa': 3.64}, {'name': 'Wilton', 'gpa': 2.59}, {'name': 'Meagan', 'gpa': 3.45}, {'name': 'Leela', 'gpa': 2.66}, {'name': 'Kaela', 'gpa': 2.71}, {'name': 'Isabelita', 'gpa': 3.47}, {'name': 'Phillipe', 'gpa': 2.95}, {'name': 'Eula', 'gpa': 3.46}, {'name': 'Odetta', 'gpa': 3.56}, {'name': 'Christian', 'gpa': 3.4}, {'name': 'Zared', 'gpa': 2.84}, {'name': 'Devondra', 'gpa': 2.02}, {'name': 'Scarface', 'gpa': 2.21}, {'name': 'Reena', 'gpa': 3.21}, {'name': 'Benita', 'gpa': 3.93}, {'name': 'Rosalinde', 'gpa': 3.47}, {'name': 'Emlynn', 'gpa': 3.69}
]

Your task is to create a function called topStudent which takes in a list of students of the form shown above and finds the name of the student with the highest GPA. For this assignment you can assume that no two students will have the same GPA.

 where you'll find a class roster of 100 students. 

def topStudent(grades):
 
 

print (topStudent(roster))
 
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Hash Table
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education