Problems to solve using various computational approaches



  1. Implement brute force method of padlocking
  2. Implement brute force method of password guessing
  3. Generate n'th Fibonacci number using Dynamic Programming technique
  4. Implement Greedy approach to solve task completion problem
  5. Implement Coupon collector and Hat Problem.
  6. Implement Random Sampling

Comments

Post a Comment

Popular posts from this blog

Algorithmic Thinking with Python UCEST 105- KTU First Semester BTech Course 2024 scheme notes pdf - Dr Binu V P 9847390760

About Me - Dr Binu V P Algorithmic Thinking with Python KTU S1 2024 scheme - course details and syllabus Algorithmic Thinking with Python - Textbook About NASSCOM Digital 101 Course - KTU 2024 Scheme Model Question Paper UCEST 105 Algorithmic Thinking with Python-University UCEST 105 Algorithmic Thinking with Python - University Model Question Paper and Answer Key UCEST 105 Algorithmic Thinking with Python - KTU University Question Paper Dec 2024 and Answer Key UCEST 105 Algorithmic Thinking with Python - KTU University Question Paper May 2025 and Answer Key UCEST 105 Algorithmic Thinking with Python - KTU University Question Paper Dec 2025 and Answer Key Why Python Introduction to Python How to work with Python Sample Class Room Exercises Laboratory Details Basic Linux Commands Lab Experiments and Solutions  ( mandatory programs) Lab Record Lab Cycle-1 Lab Cycle-2 Lab Cycle-3 Lab Cycle-4 Lab Cycle-5 Lab Cycle-6 Module-I Problem and Computer Programming Problem PROBLEM-SOLVING STRA...
Read more

Lab Experiments and Solutions - Algorithmic thinking with Python KTU S1 2024 scheme

 LAB Experiments:  1. Simple desktop calculator using Python. Only the five basic arithmetic operators. 2. Create, concatenate, and print a string and access a sub-string from a given string. 3. Familiarize time and date in various formats (Eg. “Thu Jul 11 10:26:23 IST 2024”). 4. Write a program to create, append, and remove elements in  lists.( using Numpy array also) 5. Program to find the largest of three numbers. 6. Convert temperature values back and forth between Celsius (c), and Fahrenheit (f). [Formula: °C = (°F - 32) × 5/9] 7. Program to construct patterns of stars (*), using a nested for loop. 8. A program that prints prime numbers less than N. 9. Program to find the factorial of a number using Recursion. 10. Recursive function to add two positive numbers. 11. Recursive function to multiply two positive numbers. 12. Recursive function to find the greatest common divisor of two positive numbers. 13. A program that accepts the lengths of three sides of a triangle ...
Read more

PadLocking

Padlocking Problem – Brute Force Method The padlocking problem is a simple real-life example that can be used to explain the Brute Force method of problem solving . The problem is: A combination padlock has several number dials. The correct combination is unknown. Find the combination that opens the lock by systematically trying all possible combinations. For classroom teaching, we can use a small hypothetical 3-digit padlock . 1. Understanding the Problem Suppose we have a padlock with 3 dials , and each dial contains digits from 0 to 9 . For example: Dial 1 Dial 2 Dial 3 ↓ ↓ ↓ 0 0 0 Each dial has 10 possible values . Therefore, the total number of possible combinations is: 10 × 10 × 10 = 10 3 = 1000 10 \times 10 \times 10 = 10^3 = 1000 So there are 1,000 possible combinations , ranging from: 000 001 002 003 ... 997 998 999 2. Brute Force Approach We don't have any information about the correct combination. Theref...
Read more