NPTEL » The Joy of Computing using Python

Please scroll down for latest Programs 👇

Week 2 - Programming Assignment 1

Due on 2025-08-07, 23:59 IST

Gautam Gambhir, freshly appointed head coach for India’s 2025 away Test series against England, has asked the new analyst, Aryan, to keep a quirky statistic:

“At the end of each day’s play,” Gambhir says, “tell me the total runs we scored in every odd-numbered over—1st, 3rd, 5th … all the way up to the last over bowled that day. It helps me spot momentum in the sessions where bowlers are freshest.”

Aryan realises the job boils down to simple maths: if n is the last over of the day (always a positive integer), he just needs the sum of all odd integers from 1 through n.

Your task is to step into Aryan’s shoes and automate this little ritual.

Input Format:

A single integer

Output Format:

A single integer: the sum of all odd numbers from 1 to n

Compilation : Passed
Public Test Cases: 3 / 3 Passed

Note: These tests may not be considered while scoring. Know more.

Public Test Cases	Input	Expected Output	Actual Output	Status
Test Case 1	1	1	1\n	Passed after ignoring Presentation Error
Test Case 2	2	1	1\n	Passed after ignoring Presentation Error
Test Case 3	10	25	25\n	Passed after ignoring Presentation Error

Week 2 - Programming Assignment 2

Due on 2025-08-07, 23:59 IST

A high-security vault uses a custom PIN authentication mechanism. To reduce the chances of brute-force attacks, the system only allows PINs that are Neon Numbers.

The rule is:

A PIN is valid if the sum of the digits of its square equals the PIN itself.

Your Task: Write a Python program that reads a numeric PIN input by the user and validates whether it is a Neon Number or not.

Your last recorded submission was on 2025-08-02, 19:41 IST

Select the Language for this assignment.

pin = int(input())
square = pin ** 2
digit_sum = sum(int(digit) for digit in str(square))
if digit_sum == pin:
    print("Neon Number")
else:
    print("Not Neon Number")

You may submit any number of times before the due date. The final submission will be considered for grading.

This assignment has Public Test cases. Please click on "Compile & Run" button to see the status of Public test cases. Assignment will be evaluated only after submitting using Submit button below. If you only save as or compile and run the Program , your assignment will not be graded and you will not see your score after the deadline.

Compilation : Passed
Public Test Cases: 3 / 3 Passed

Note: These tests may not be considered while scoring. Know more.

Public Test Cases	Input	Expected Output	Actual Output	Status
Test Case 1	0	Neon Number	Neon Number\n	Passed after ignoring Presentation Error
Test Case 2	1	Neon Number	Neon Number\n	Passed after ignoring Presentation Error
Test Case 3	2	Not Neon Number	Not Neon Number\n	Passed after ignoring Presentation Error

Public Test Cases

Input

Expected Output

Actual Output

Status

Test Case 1

Neon Number

Neon Number\n

Passed after ignoring Presentation Error

Test Case 2

Neon Number

Neon Number\n

Passed after ignoring Presentation Error

Test Case 3

Not Neon Number

Not Neon Number\n

Passed after ignoring Presentation Error

Week 2 - Programming Assignment 3

Due on 2025-08-07, 23:59 IST

While analysing intercepted communications, TASC officer Srikant Tiwari suspects that some messages might be carrying hidden signals. One of the red flags used by the agency is the density of vowels in a message — unusually high vowel counts may indicate a coded alert.

To assist in screening these messages quickly, a script is needed to count the number of vowels in any given string.

Write a Python program that:

Takes a message as input.

Counts the number of vowels (a, e, i, o, u — both uppercase and lowercase).

Prints the vowel count.

Input Format:

A single line containing a string .

Output Format:

A single integer — the count of vowels (A, E, I, O, U in both uppercase and lowercase).

Compilation : Passed
Public Test Cases: 3 / 3 Passed

Note: These tests may not be considered while scoring. Know more.

Public Test Cases	Input	Expected Output	Actual Output	Status
Test Case 1	hello	2	2\n	Passed after ignoring Presentation Error
Test Case 2	PYTHON	1	1\n	Passed after ignoring Presentation Error
Test Case 3	OpenAI 123	4	4\n	Passed after ignoring Presentation Error

Week 6 Programming Assignment : 1

Due on 2025-09-04, 23:59 IST

Problem: Robot Arithmetic Module – Engineering Constraint

At RoboCore Labs, engineers are developing an embedded system for a low-power educational robot.
Due to hardware limitations, the robot’s control unit cannot use the built-in multiplication operation.

As a member of the firmware team, your task is to implement a function that computes the product of two positive integers without using the * operator.

Requirements:

Function Name: multiply
Parameters:
- a (positive integer)
- b (positive integer)
Constraints:
- You may only use the + (addition) and - (subtraction) operators.
- The * (multiplication) operator is strictly forbidden.
Return Value:
- The function should return the product of a and b.
Implementation:
- The solution must be implemented using recursion.
Note:

Do not read input from the user.
Do not print output to the console.

Your last recorded submission was on 2025-08-31, 19:47 IST

Select the Language for this assignment.

def multiply(a, b):
    if a == 0 or b == 0:
        return 0
    if a == 1:
        return b
    if b == 1:
        return a
    if a > b:
        return multiply(b, a)
    return a + multiply(a, b-1)

~~~THERE IS SOME INVISIBLE CODE HERE~~~

You may submit any number of times before the due date. The final submission will be considered for grading.

Compilation : Passed
Public Test Cases: 5 / 5 Passed

Note: These tests may not be considered while scoring. Know more.

Public Test Cases	Input	Expected Output	Actual Output	Status
Test Case 1	2 3	6	6\n	Passed after ignoring Presentation Error
Test Case 2	5 4	20	20\n	Passed after ignoring Presentation Error
Test Case 3	10 17	170	170\n	Passed after ignoring Presentation Error
Test Case 4	23 4	92	92\n	Passed after ignoring Presentation Error
Test Case 5	100 1	100	100\n	Passed after ignoring Presentation Error

Week 6 Programming Assignment : 2

Due on 2025-09-04, 23:59 IST

Problem: Searching Patient Records in a Health Analytics System

The hospital network MedNexus maintains a centralized database of patient record IDs.
These IDs are stored in sorted order to enable fast lookups.

You are part of the software development team tasked with optimizing the search functionality.
Since the system follows a recursive design pattern, you must implement a recursive version of the search algorithm to determine whether a given patient ID exists in the records.

Requirements

Function Name: search
Parameters:
- L → A sorted list of integers (patient record IDs).
- k → An integer representing the ID to search for.
Return Value:
- Return True if k is present in L.
- Return False if k is not present.
Constraints:
- Must use recursion.
- No need to accept input from the user.
- No need to print output to the console. Only the function definition is required.

Example


L = [101, 203, 307, 402, 509]
k = 307
search(L, k)   # Output: True

Your last recorded submission was on 2025-08-31, 19:49 IST

Select the Language for this assignment.

def search(L, k):
    if not L:
        return False
    mid = len(L) // 2
    if L[mid] == k:
        return True
    elif k < L[mid]:
        return search(L[:mid], k)
    else:
        return search(L[mid+1:], k)

~~~THERE IS SOME INVISIBLE CODE HERE~~~

You may submit any number of times before the due date. The final submission will be considered for grading.

Compilation : Passed
Public Test Cases: 7 / 7 Passed

Note: These tests may not be considered while scoring. Know more.

Public Test Cases	Input	Expected Output	Actual Output	Status
Test Case 1	search([1, 2, 3, 4], 2)	True	True\n	Passed after ignoring Presentation Error
Test Case 2	search([10, 20, 30, 40, 50], 15)	False	False\n	Passed after ignoring Presentation Error
Test Case 3	search([-100, -10, 1, 10, 20, 30, 30, 40, 50], 31)	False	False\n	Passed after ignoring Presentation Error
Test Case 4	search([-100, -10, 1, 10, 20, 30, 30, 40, 50], 50)	True	True\n	Passed after ignoring Presentation Error
Test Case 5	search([-100, -10, 1, 10, 20, 30, 30, 40, 50], -100)	True	True\n	Passed after ignoring Presentation Error
Test Case 6	search([-100, -10, 1, 10, 20, 30, 30, 40, 50], -200)	False	False\n	Passed after ignoring Presentation Error
Test Case 7	search([10], 10)	True	True\n	Passed after ignoring Presentation Error

Week 6 : Programming Assignment 3

Due on 2025-09-04, 23:59 IST

Problem: Signal Propagation in Network Simulation

At NeuroLink Systems, researchers are developing a simulation to analyze how signals propagate in a neural network grid.

The network is represented as a square matrix A, where each entry represents the connection strength between neurons.
To study influence over multiple steps, the team must compute the matrix raised to a power m.
Each matrix multiplication represents one time step of propagation.

Your task is to implement a recursive function to compute the power of a matrix.

Requirements

Function Name: power
Parameters:
- A: A square matrix (2D list of integers or floats).
- m: A positive integer (exponent).
Return Value:
- The matrix A^m, computed recursively.
Constraints:
- Must use recursion.
- No user input or console printing — only function definition required.

Example


A = [[1, 2],
     [3, 4]]
m = 2

power(A, m)
# Expected output:
# [[7, 10],
#  [15, 22]]
Hint: You may find it helpful to implement a helper function for matrix multiplication.

Your last recorded submission was on 2025-08-31, 19:52 IST

Select the Language for this assignment.

def power(A, m):
    def multiply(M1, M2):
        n = len(M1)
        result = [[0] * n for _ in range(n)]
        for i in range(n):
            for j in range(n):
                for k in range(n):
                    result[i][j] += M1[i][k] * M2[k][j]
        return result
    if m == 1:
        return A
    if m % 2 == 0:
        half = power(A, m // 2)
        return multiply(half, half)
    else:
        return multiply(A, power(A, m - 1))

~~~THERE IS SOME INVISIBLE CODE HERE~~~

You may submit any number of times before the due date. The final submission will be considered for grading.

Compilation : Passed
Public Test Cases: 4 / 4 Passed

Note: These tests may not be considered while scoring. Know more.

Public Test Cases	Input	Expected Output	Actual Output	Status
Test Case 1	3 3 1,2,3 4,5,6 7,8,9	468,576,684\n 1062,1305,1548\n 1656,2034,2412	468,576,684\n 1062,1305,1548\n 1656,2034,2412\n	Passed after ignoring Presentation Error
Test Case 2	3 2 1,2,3 4,5,6 7,8,10	30,36,45\n 66,81,102\n 109,134,169	30,36,45\n 66,81,102\n 109,134,169\n	Passed after ignoring Presentation Error
Test Case 3	3 4 1,0,0 0,1,0 0,0,1	1,0,0\n 0,1,0\n 0,0,1	1,0,0\n 0,1,0\n 0,0,1\n	Passed after ignoring Presentation Error
Test Case 4	4 3 1,2,3,4 5,6,7,8 9,10,11,12 13,14,15,16	3140,3560,3980,4400\n 7268,8232,9196,10160\n 11396,12904,14412,15920\n 15524,17576,19628,21680	3140,3560,3980,4400\n 7268,8232,9196,10160\n 11396,12904,14412,15920\n 15524,17576,19628,21680\n	Passed after ignoring Presentation Error

Week 7 : Programming Assignment 1

Due on 2025-09-11, 23:59 IST

Problem 1: Image Noise Isolation in Data Analysis

At a medical research lab, image preprocessing involves working with square matrices that represent pixel intensity grids extracted from medical images.

Sometimes, due to faulty sensor data, certain rows and columns must be eliminated to isolate sub-regions of the matrix.

Your task is to implement a function that removes a specified row and column from a square matrix to produce a minor matrix.

Requirements

Function Name: minor_matrix
Parameters:
- M: A square matrix (list of lists).
- i: Index of the row to remove (0-based).
- j: Index of the column to remove (0-based).
Return Value:
- A new matrix with the i-th row and j-th column removed.
Constraints:
- The matrix M is always square (n × n).
- M has at least 3 rows and columns.
- Indexing is zero-based.
No input/output required — just define the function.

Example


M = [[1, 2, 3],
     [4, 5, 6],
     [7, 8, 9]]

minor_matrix(M, 0, 1)
# Expected output:
# [[4, 6],
#  [7, 9]]

Your last recorded submission was on 2025-08-30, 21:28 IST

Select the Language for this assignment.

def minor_matrix(M, i, j):
    n = len(M)
    result = []
    for r in range(n):
        if r == i:
            continue
        new_row = []
        for c in range(n):
            if c == j:
                continue
            new_row.append(M[r][c])
        result.append(new_row)
    return result

~~~THERE IS SOME INVISIBLE CODE HERE~~~

You may submit any number of times before the due date. The final submission will be considered for grading.

Compilation : Passed
Public Test Cases: 4 / 4 Passed

Note: These tests may not be considered while scoring. Know more.

Public Test Cases	Input	Expected Output	Actual Output	Status
Test Case 1	3 1,2,3 4,5,6 7,8,9 0 1	4,6\n 7,9	4,6\n 7,9\n	Passed after ignoring Presentation Error
Test Case 2	3 1,2,3 4,5,6 7,8,9 2 0	2,3\n 5,6	2,3\n 5,6\n	Passed after ignoring Presentation Error
Test Case 3	3 1,2,3 1,2,3 1,2,3 0 0	2,3\n 2,3	2,3\n 2,3\n	Passed after ignoring Presentation Error
Test Case 4	4 1,2,3,1 2,10,20,4 43,19,98,100 19,48,49,1 2 3	1,2,3\n 2,10,20\n 19,48,49	1,2,3\n 2,10,20\n 19,48,49\n	Passed after ignoring Presentation Error

Week 7 : Programming Assignment 2

Due on 2025-09-11, 23:59 IST

Problem: Generating the IPL Points Table

You are part of the analytics team at the Indian Premier League (IPL) headquarters.
This year, a special edition of the tournament was organized as a round-robin event where each team played exactly one match against every other team. There were no ties — every match resulted in a clear winner and loser.

Eight teams participated in this format:
CSK, DC, KKR, MI, PK, RR, RCB, SH

The tournament officials recorded match outcomes in a specific format. For each team (in a fixed order), they listed the names of the teams it defeated. The lines follow this order:
CSK, DC, KKR, MI, PK, RR, RCB, SH

Example:


CSK,MI,DC,PK

indicates that CSK won against MI, DC, and PK, and lost its remaining matches.

If a line only contains the team’s name (e.g., RCB), it means that team lost all its matches.

Your Task

(a) Process the 8 lines of input and compute the total number of matches won by each team.
(b) Prepare the final IPL points table in descending order of number of wins.
(c) If two or more teams have the same number of wins, sort them in alphabetical order.
(d) Print each entry in the format:


<team name>:<wins>

with no spaces and one entry per line.

Constraints

Input always follows the described format.
Every team plays exactly 7 matches.
No drawn or tied games.

Example Input


CSK,MI,DC,PK
DC,MI,SH
KKR,CSK,RR
MI
PK,RR,MI
RR,MI
RCB,DC
SH,PK

Example Output


CSK:3
DC:2
KKR:3
MI:0
PK:2
RR:1
RCB:1
SH:2

Your last recorded submission was on 2025-08-30, 21:38 IST

Select the Language for this assignment.

def solve():
    teams = ['CSK', 'DC', 'KKR', 'MI', 'PK', 'RR', 'RCB', 'SH']
    wins = {}
    for i in range(8):
        s = input().strip()
        parts = s.split(',')
        wins[teams[i]] = len(parts) - 1
    sorted_teams = sorted(teams, key=lambda x: (-wins[x], x))
    for team in sorted_teams:
        print(f"{team}:{wins[team]}")
solve()

You may submit any number of times before the due date. The final submission will be considered for grading.

Compilation : Passed
Public Test Cases: 5 / 5 Passed

Note: These tests may not be considered while scoring. Know more.

Public Test Cases	Input	Expected Output	Actual Output	Status
Test Case 1	CSK,DC,KKR,MI,PK,RR,RCB,SH DC,KKR,MI,PK,RR,RCB,SH KKR,MI,PK,RR,RCB,SH MI,PK,RR,RCB,SH PK,RR,RCB,SH RR,RCB,SH RCB,SH SH	CSK:7\n DC:6\n KKR:5\n MI:4\n PK:3\n RR:2\n RCB:1\n SH:0	CSK:7\n DC:6\n KKR:5\n MI:4\n PK:3\n RR:2\n RCB:1\n SH:0\n	Passed after ignoring Presentation Error
Test Case 2	CSK,DC,MI,PK DC,RR,RCB,SH KKR,CSK,DC,RR,MI MI,DC,RCB,RR PK,DC,KKR,MI,RCB RR,CSK,PK,SH RCB,CSK,KKR,RR SH,CSK,KKR,MI,PK,RCB	SH:5\n KKR:4\n PK:4\n CSK:3\n DC:3\n MI:3\n RCB:3\n RR:3	SH:5\n KKR:4\n PK:4\n CSK:3\n DC:3\n MI:3\n RCB:3\n RR:3\n	Passed after ignoring Presentation Error
Test Case 3	CSK,RCB,MI,KKR DC,CSK,KKR,MI,SH KKR,PK,RR,RCB,SH MI,KKR,PK,RR,SH,RCB PK,CSK,DC,RCB RR,CSK,DC,PK,SH RCB,DC,RR SH,CSK,PK,RCB	MI:5\n DC:4\n KKR:4\n RR:4\n CSK:3\n PK:3\n SH:3\n RCB:2	MI:5\n DC:4\n KKR:4\n RR:4\n CSK:3\n PK:3\n SH:3\n RCB:2\n	Passed after ignoring Presentation Error
Test Case 4	CSK DC,CSK,KKR,MI,PK,RR,RCB,SH KKR,CSK,MI,PK MI,CSK,PK,RR,SH,RCB PK,CSK,RCB,SH RR,CSK,KKR,PK RCB,CSK,KKR,RR,SH SH,CSK,KKR,RR	DC:7\n MI:5\n RCB:4\n KKR:3\n PK:3\n RR:3\n SH:3\n CSK:0	DC:7\n MI:5\n RCB:4\n KKR:3\n PK:3\n RR:3\n SH:3\n CSK:0\n	Passed after ignoring Presentation Error
Test Case 5	CSK,SH,RCB DC,CSK,SH KKR,CSK,DC MI,CSK,DC,KKR PK,CSK,DC,KKR,MI RR,CSK,DC,KKR,MI,PK RCB,DC,KKR,MI,PK,RR SH,KKR,MI,PK,RR,RCB	RCB:5\n RR:5\n SH:5\n PK:4\n MI:3\n CSK:2\n DC:2\n KKR:2	RCB:5\n RR:5\n SH:5\n PK:4\n MI:3\n CSK:2\n DC:2\n KKR:2\n	Passed after ignoring Presentation Error

Week 7 : Programming Assignment 3

Due on 2025-09-11, 23:59 IST

Problem Statement: Symmetric Double Pyramid Pattern

Objective:
Write a program to print a symmetric star pattern based on a given integer input n.

Input:

A single integer n (1 ≤ n ≤ 100), representing the number of rows in the upper half of the pattern.

Output:

Print a pattern consisting of 2n - 1 rows.
Each row should contain stars and spaces arranged symmetrically according to the value of n.

Example:

Input:

Output:

*      *
**    **
***  ***
********
***  ***
**    **
*      *

Your last recorded submission was on 2025-08-30, 21:37 IST

Select the Language for this assignment.

def pattern(n):
    total_rows = 2 * n - 1
    for i in range(1, total_rows + 1):
        if i <= n:
            stars = i
            spaces = 2 * (n - i)
        else:
            stars = 2 * n - i
            spaces = 2 * (i - n)
        print('*' * stars + ' ' * spaces + '*' * stars)

~~~THERE IS SOME INVISIBLE CODE HERE~~~

You may submit any number of times before the due date. The final submission will be considered for grading.

Compilation : Passed
Public Test Cases: 3 / 3 Passed

Note: These tests may not be considered while scoring. Know more.

Public Test Cases	Input	Expected Output	Actual Output	Status
Test Case 1	4	* \n * \n * *\n ****\n * *\n *\n *	* \n * \n * *\n ****\n * *\n *\n *\n	Passed after ignoring Presentation Error
Test Case 2	2	* \n **\n *	* \n **\n *\n	Passed after ignoring Presentation Error
Test Case 3	3	* \n * \n **\n *\n *	* \n * \n **\n *\n *\n	Passed after ignoring Presentation Error

Public Test Cases

Input

Expected Output

Actual Output

Status

Test Case 1

*      *\n
**    **\n
***  ***\n
********\n
***  ***\n
**    **\n
*      *

*      *\n
**    **\n
***  ***\n
********\n
***  ***\n
**    **\n
*      *\n

Passed after ignoring Presentation Error

Test Case 2

*  *\n
****\n
*  *

*  *\n
****\n
*  *\n

Passed after ignoring Presentation Error

Test Case 3

*    *\n
**  **\n
******\n
**  **\n
*    *

*    *\n
**  **\n
******\n
**  **\n
*    *\n

Passed after ignoring Presentation Error

Swayam Solver

NPTEL The Joy of Computing using Python July - 2025 | Swayam

Week 2 - Programming Assignment 1

Week 2 - Programming Assignment 2

Week 2 - Programming Assignment 3

Week 6 Programming Assignment : 1

Problem: Robot Arithmetic Module – Engineering Constraint

Requirements:

Week 6 Programming Assignment : 2

Problem: Searching Patient Records in a Health Analytics System

Requirements

Example

Week 6 : Programming Assignment 3

Problem: Signal Propagation in Network Simulation

Requirements

Example

Week 7 : Programming Assignment 1

Problem 1: Image Noise Isolation in Data Analysis

Requirements

Example

Week 7 : Programming Assignment 2

Problem: Generating the IPL Points Table

Your Task

Constraints

Example Input

Example Output

Week 7 : Programming Assignment 3

Problem Statement: Symmetric Double Pyramid Pattern

Input:

Output:

Example:

No comments:

Post a Comment