NPTEL Programming, Data Structures And Algorithms Using Python (Week 4 Programming Assignment) 2024

Programming Assignment Week 4

1. Scores of Batsmen (Additional Question)

We represent scores of batsmen across a sequence of matches in a two-level dictionary as follows:

{'match1':{'player1':57, 'player2':38}, 'match2':{'player3':9, 'player1':42}, 'match3':{'player2':41, 'player4':63, 'player3':91}}
                

Each match is identified by a string, as is each player. The scores are all integers. The names associated with the matches are not fixed (here they are 'match1', 'match2', 'match3'), nor are the names of the players. A player need not have a score recorded in all matches.

Define a Python function orangecap(d) that reads a dictionary d of this form and identifies the player with the highest total score. Your function should return a pair (playername, topscore) where playername is a string, the name of the player with the highest score, and topscore is an integer, the total score of playername.

The input will be such that there are never any ties for the highest total score.

Example:

orangecap({'match1':{'player1':57, 'player2':38}, 'match2':{'player3':9, 'player1':42}, 'match3':{'player2':41, 'player4':63, 'player3':91}})
# Output: ('player3', 100)
                

orangecap({'test1':{'Pant':84, 'Kohli':120}, 'test2':{'Pant':59, 'Gill':42}})
# Output: ('Pant', 143)
                

2. Polynomials (Additional Question)

Let us consider polynomials in a single variable x with integer coefficients. For instance:

3x⁴ - 17x² - 3x + 5

Each term of the polynomial can be represented as a pair of integers (coefficient, exponent). The polynomial itself is then a list of such pairs.

We have the following constraints to guarantee that each polynomial has a unique representation:

• Terms are sorted in descending order of exponent
• No term has a zero coefficient
• No two terms have the same exponent
• Exponents are always nonnegative

For example, the polynomial introduced earlier is represented as:

[(3,4),(-17,2),(-3,1),(5,0)]
                

The zero polynomial, 0, is represented as the empty list [], since it has no terms with nonzero coefficients.

Write Python functions for the following operations:

• addpoly(p1, p2)
• multpoly(p1, p2)

that add and multiply two polynomials, respectively. You may assume that the inputs to these functions follow the representation given above. Correspondingly, the outputs from these functions should also obey the same constraints.

You can write auxiliary functions to "clean up" polynomials – e.g., remove zero coefficient terms, combine like terms, sort by exponent etc. Build a library of functions that can be combined to achieve the desired format.

You may also want to convert the list representation to a dictionary representation and manipulate the dictionary representation, and then convert back.

Examples:

# Example 1
addpoly([(4,3),(3,0)],[(-4,3),(2,1)])
# Output: [(2, 1),(3, 0)]
                

Explanation: (4x³ + 3) + (-4x³ + 2x) = 2x + 3

# Example 2
addpoly([(2,1)],[(-2,1)])
# Output: []
                

Explanation: 2x + (-2x) = 0

# Example 3
multpoly([(1,1),(-1,0)],[(1,2),(1,1),(1,0)])
# Output: [(1, 3),(-1, 0)]
                

Explanation: (x - 1) * (x² + x + 1) = x³ - 1

Programming Assignment Solutions

Python

def orangecap(d):
    total = {}
    l = []
    for p in d.values():
        for ply in p.keys():
            if ply not in l:
                l = l + [ply]
    for n in l:
        total[n] = 0
        for match in d.keys():
            if n in d[match].keys():
                total[n] = total[n] + d[match][n]
    topscore = 0
    for player in total.keys():
        if total[player] > topscore:
            playername = player
            topscore = total[player]
    return (playername, topscore)


def csort(l):
    for start in range(len(l)):
        minpos = start
        for i in range(start, len(l)):
            if l[i][1] > l[minpos][1]:
                minpos = i
        (l[start], l[minpos]) = (l[minpos], l[start])


def remove(l):
    for j in (l):
        if j[0] == 0:
            l.remove(j)
    return (l)


def addpoly(p1, p2):
    l = []
    for i in range(len(p1)):
        for j in range(len(p2)):
            if p1[i][1] == p2[j][1]:
                l = l + [(p1[i][0] + p2[j][0], p1[i][1])]
                break
        else:
            l = l + [(p1[i][0], p1[i][1])]
    for i in range(len(p2)):
        flag = 1
        for j in range(len(l)):
            if p2[i][1] == l[j][1]:
                flag = 0
                break
        if flag:
            l = l + [(p2[i][0], p2[i][1])]
    remove(l)
    csort(l)
    return (l)


def remdup(l):
    p = []
    for x in l:
        if x not in p:
            p = p + [x]
    return p


def multpoly(p1, p2):
    l = []
    for i in range(len(p1)):
        for j in range(len(p2)):
            l = l + [(p1[i][0] * p2[j][0], p1[i][1] + p2[j][1])]
    csort(l)
    list2 = []
    for j in l:
        sum = 0
        for k in l:
            if j[1] == k[1]:
                sum += k[0]
        list2 += [(sum, j[1])]
    for j in list2:
        if j[0] == 0:
            while j in list2:
                list2.remove(j)
    l = remdup(list2)
    return l