Programming, Data Structures And Algorithms Using Python Week 2 Assignment Solution Jan Apr 2025 CMI

Welcome to our **detailed walkthrough** of the **"NPTEL Programming, Data Structures, and Algorithms Using Python Week 2 Assignment Solution for January - April 2025,"** offered by **Chennai Mathematical Institute.** This video is designed to help students and programming enthusiasts understand key **Python programming concepts, data structures, and algorithmic techniques** to successfully complete their assignments.

In this tutorial, we will cover the **Week 2 assignment solutions**, focusing on **fundamental data structures (lists, tuples, dictionaries), recursion, searching and sorting algorithms, and problem-solving strategies using Python.** We will provide **step-by-step explanations** and **in-depth solutions** to each question, ensuring you grasp the essential concepts required for this assignment.

We will start with an **overview of the assignment questions** and then dive into the **detailed explanations, code implementations, and debugging tips** to help you improve your Python coding skills.

📌 **Subscribe** to our channel for more updates on this course and other **NPTEL assignment solutions.** If you have any **questions or doubts**, feel free to **drop a comment below!**

**Happy coding, and let’s explore Python for Data Structures and Algorithms!**

---

### **Video Tags:**
NPTEL Python Programming, Data Structures in Python, Algorithms Using Python, NPTEL Assignment Solution, IIT Python Course, Week 2 Python Solution, NPTEL January April 2025, Searching and Sorting, Recursion in Python, Algorithmic Problem Solving, NPTEL Online Courses, Chennai Mathematical Institute

---

### **Hashtags:**
#nptel #python #datastructures #algorithms #chennai #nptel2025 #programming #sorting #recursion #nptelassignments #coding #computerscience

[CodingOClock]

def is_prime(n):
if n <= 1:
return False
for i in range(2, int(n**0.5) + 1):
if n % i == 0:
return False
return True

def primepartition(m):
if m <= 0:
return False
for p in range(2, m):
q = m - p
if is_prime(p) and is_prime(q):
return True
return False

def matched(s):
count = 0
for char in s:
if char == '(':
count += 1
elif char == ')':
count -= 1
if count < 0:
return False
return count == 0

def rotatelist(l, k):
if k <= 0:
return l
k = k % len(l) # In case k is greater than the length of the list
return l[k:] + l[:k]

[sudikinpramanik]

@codingOClock the second answer is also wrong. It will be the first option (a).

[dontwannasay]

def is_prime(n):
if n <= 1:
return False
for i in range(2, int(n**0.5) + 1):
if n % i == 0:
return False
return True

def primepartition(m):
if m <= 0:
return False
for p in range(2, m):
q = m - p
if is_prime(p) and is_prime(q):
return True
return False

def matched(s):
count = 0
for char in s:
if char == '(':
count += 1
elif char == ')':
count -= 1
if count < 0:
return False
return count == 0

def rotatelist(l, k):
if len(l) == 0: # Handle empty list case
return l
if k <= 0:
return l
k = k % len(l)
return l[k:] + l[:k]
this code is passing all public test cases and all private cases broo..anyway thankyouu