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

 

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 10 and 1000 that are divisible by 13 but not divisible by 3( use for) 4.Generate Fibonacci Series 0 1 1 2 3 5 8...n ( use while loop) 5.Print the factorial of a number. ( use for) 6.Print the factors of a number. ( use for) 7.Find the sum of the digits of a number. ( use while) 8.Check whether the given number is a Krishnamurti number( Krishnamurthy Number: It is a number which is equal to the sum of the factorial

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 given N rows where N <= 26.(University Question) A A B A B C A B C D A B C D E 6.Pascals Triangle n=0                     1 n=1                  1      1 n=2               1    2    1 n=3. 

Learning Objective: Learn to write functions and recursive functions Learn list, tuples dictionaries and set Functions and Recursive Functions 1.Write a function to find the sum of numbers between a lower bound and an upper bound 2.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. 3. 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. 4.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 . 5.Compute nCr. Read 'n' and 'r'. Use your own factorial functions ( recursive) 6. Recursive function to

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 cred

NASSCOM Digital 101 Course Skill Enhancement Course: Digital 101 is an introductory Massive Open Online Course (MOOC) offered by NASSCOM. It is designed to provide students with foundational knowledge and skills in digital technologies, preparing them for further studies and careers in the digital domain. By incorporating the Digital 101 course into the curriculum, KTU ensures that all students gain valuable digital skills early in their academic journey, enhancing their readiness for advanced courses and future careers in technology. Course Registration and Completion: ● Students have the flexibility to register and complete the Digital 101 course either in their first semester (S1) or second semester (S2). ● The credit for this course (1 credit) will be officially recorded in the second semester grade card. Signup for the course in Futureskills website Search for Digital 101 Course 30 Hours Learn  the 10 modules There are 54 chapters in this 10 module- You have to earn 54 badges afte

Definition of Problem-Solving Strategies: Problem-solving strategies are systematic methods or approaches used to find solutions to challenges, issues, or complex situations. These strategies guide the process of identifying the problem, exploring possible solutions, and implementing the best course of action. Description of Problem-Solving Strategies: Problem-solving strategies are essential tools that help individuals and groups approach challenges in an organized and effective manner. Different strategies are used depending on the nature of the problem, the available information, and the desired outcome. Here are some common problem-solving strategies: Trial and Error : Description : This strategy involves trying different solutions and learning from mistakes until the correct one is found. It's practical when you have no clear path to the solution and need to explore various options. Heuristics : Description : Heuristics are mental shortcuts or "rules of thumb" that