Python: Find the second lowest grade of any student(s) from the given names and grades of each student using lists and Lambda
Python Lambda: Exercise-16 with Solution
Write a Python program to find the second lowest grade of any student(s) from the given names and grades of each student using lists and lambda. Input number of students, names and grades of each student.
Note: If there are multiple students with the same grade then print each name alphabetically.
Python Code :
students =  sec_name =  second_low = 0 n = int(input("Input number of students: ")) for _ in range(n): s_name = input("Name: ") score = float(input("Grade: ")) students.append([s_name,score]) print("\nNames and Grades of all students:") print(students) order =sorted(students, key = lambda x: int(x)) for i in range(n): if order[i] != order: second_low = order[i] break print("\nSecond lowest grade: ",second_low) sec_student_name = [x for x in order if x == second_low] sec_student_name.sort() print("\nNames:") for s_name in sec_student_name: print(s_name)
Input number of students: 5 Name: S ROY Grade: 1 Name: B BOSE Grade: 3 Name: N KAR Grade: 2 Name: C DUTTA Grade: 1 Name: G GHOSH Grade: 1 Names and Grades of all students: [['S ROY', 1.0], ['B BOSE', 3.0], ['N KAR', 2.0], ['C DUTTA', 1.0], ['G GHOSH', 1.0]] Second lowest grade: 2.0 Names: N KAR
Visualize Python code execution:
The following tool visualize what the computer is doing step-by-step as it executes the said program:
Python Code Editor:
Have another way to solve this solution? Contribute your code (and comments) through Disqus.
What is the difficulty level of this exercise?
Test your Python skills with w3resource's quiz
Python: Tips of the Day
Python: Cache results with decorators
There is a great way to cache functions with decorators in Python. Caching will help save time and precious resources when there is an expensive function at hand.
Implementation is easy, just import lru_cache from functools library and decorate your function using @lru_cache.
from functools import lru_cache @lru_cache(maxsize=None) def fibo(a): if a <= 1: return a else: return fibo(a-1) + fibo(a-2) for i in range(20): print(fibo(i), end="|") print("\n\n", fibo.cache_info())
0|1|1|2|3|5|8|13|21|34|55|89|144|233|377|610|987|1597|2584|4181| CacheInfo(hits=36, misses=20, maxsize=None, currsize=20)
- New Content published on w3resource:
- Scala Programming Exercises, Practice, Solution
- Python Itertools exercises
- Python Numpy exercises
- Python GeoPy Package exercises
- Python Pandas exercises
- Python nltk exercises
- Python BeautifulSoup exercises
- Form Template
- Composer - PHP Package Manager
- PHPUnit - PHP Testing
- Laravel - PHP Framework