Algorithmic Thinking with Python KTU BTech S1 UCEST 105 2024 scheme - Dr Binu V P

1.How do you use a decomposition strategy to design a menu-driven calculator that supports four basic arithmetic operators - addition, subtraction, multiplication, and division? To design a menu-driven calculator using a decomposition strategy , you break the problem into smaller, manageable sub-tasks. Here's how to approach it step by step: 1. Problem Decomposition Break down the calculator into smaller components based on the tasks: Input Handling : Accept user input for numbers and operator selection. Operation Implementation : Define how each arithmetic operation (addition, subtraction, multiplication, and division) will be performed. Menu Management : Create a menu interface that allows users to select the desired operation. Output Handling : Display the result of the operation. Program Loop : Allow users to perform multiple operations by looping until they choose to exit. 2. Design Components The key components of the calculator can be: Input Functions : For accepting nu...

 

Learning outcome:      Write looping statements while, for      Learn transfer control statements break , continue     Learn to process strings      1.Find the largest,  smallest, sum and average of 'n' numbers. ( use while loop) 2.Print the series 1      2      4      7      11     16     22.........n ( use while loop) 2.Print the following series using for loop ( learn range() function)     1          3        5          7          9      11     13...n     50      45      40      35      30      25      20      15      10      5   0 3.Find the numbers between 1...

Learning Objective:      Learn to use RATOR tool      Learn to use nested control statements RAPTOR programs to try 1.Check positive and negative number 2.Odd or Even Number using modulus (%) operator 3.Print 10, 9, 8, .... 1 4.Print sum of the digits of a number 5.Factorial of a given number Nesting of Loops/control statements Print the following patterns using nested loops. 1.Square Pattern: * * * * * * * * * * * * * * * * * * * * 2.Right-Angled Triangle Pattern: * * * * * * * * * * * * * * * 3.Pyramid Pattern:                   *              * * *           * * * * *       * * * * * * *    * * * * * * * * * 4.Number pattern ( read N; example with N=5 is shown) 5 4 3 2 1 4 3 2 1 3 2 1 2 1 1   5.Write a python program to generate the following type of pattern for the giv...

Learning Objective: Learn to write functions and recursive functions Functions and Recursive Functions 1.Write a function to check whether the given number is even or odd. ( return True or False) 2.Write a function to find the sum of numbers between a lower bound and an upper bound 3.A program that accepts the lengths of three sides of a triangle as inputs. The program should output whether or not the triangle is a right triangle (Recall from the Pythagorean Theorem that in a right triangle, the square of one side equals the sum of the squares of the other two sides). Implement using functions. 4. Write a function that returns True if a given number is prime and False otherwise.Use this function to print all prime numbers less than N. Read N. Use the same function to print n'th prime number. 5.Write a Python program to calculate the area of a circle, given the center and a point on the perimeter. Use a function to find the radius as the distance between two points . 6.Compute nCr...

 

Sample Classroom Exercises:  1. Identify three ill-defined problems and well-defined problems 2. Identify five use cases for Trial and error, Heuristics, backtracking, and Means-ends analysis. 3. Use a diagram to solve the Tower of Hanoi for three pegs with the minimum number of moves. 4. Evaluate different algorithms discussed earlier based on their efficiency by counting the number of steps. 5. A recursive function that takes a number and returns the sum of all the numbers from zero to that number. 6. A recursive function that takes a number as an input and returns the factorial of that number. 7. A recursive function that takes a number ‘n’ and returns the nth Fibonacci number. 8. A recursive function that takes an array of numbers as input and returns the product of all the numbers in the array. 9. A program to reverse the contents of an 1D array without using a second array. 10. To register for the end-semester examination, you need to log into the University portal with your ...