Class 11 CS Chapter 14 Understanding Sorting Solutions Sumita Arora New Syllabus

/ Uncategorized / By

Exercise 14.1 Solutions

Back Exercise Part A

Back Exercise Part B

Back Exercise Part C

1. Election is a dictionary where key : value pairs are in the form of name:votes received. Write a program that sorts the contents of the Election dictionary and creates two lists that stores the sorted data. List A[i] will contain the name of the candidate and ListB[i] will contain the votes received by candidate ListA[i]. Print the name of candidates with votes received in descending order of the number of votes received.
def bubble_sort(arr): ...
click here for answer
2. Given following list L that stores the names of Nobel prize winners . Each element of the list is a tuple containing details of one Nobel prize winner. L = [ (“Wilhelm Conrad R’ontgen”, “Physics”, 1901), (“Ronald Ross”, “Medicine”, 1902), (“Marie Curie”, “Physics”, 1903) (“Ivan Pavlov”, “Medicine”, 1904), (“Henryk Sienkiewicz”, “Literature”, 1905), (“Theodore Roosevelt”, “Peace”, 1906)] Write a program to sort the list in the order of Last names of the winners. Use insertion sort algorithm.
def insertion_sort(arr): ...
click here for answer
3. Write a program to read a list containing 3-digit integers only. Then write an insertion sort program that sorts the list on the basis of one’s digit of all elements. That is, if given list is :
[387, 410, ...
click here for answer
4. Write a program to perform sorting on a given list of strings, on the basis of length of strings. That is, the smallest-length string should be the first string in the list and the largest-length string should be the last string in the sorted list.
# Code ...
click here for answer
5. Write a program that sorts a list of tuple-elements in descending order of Points using Bubble sort.
...
click here for answer