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


About NASSCOM Digital 101 Course - KTU 2024 Scheme



Laboratory Details

Lab Experiments and Solutions ( mandatory programs)

Module-I


Problem and Computer Programming Problem

PROBLEM-SOLVING STRATEGIES


Heuristic Method- Examples ( tutorial discussion)

Means-End Analysis- Examples(tutorial discussion)

Backtracking-Examples(tutorial discussion)

THE PROBLEM-SOLVING PROCESS

Program Development

Essentials of Python Programming

Identifiers, variables and keywords

Lab Programs ( Contact for More Programs)
Basic Programs to Try
Algorithmic Thinking


Introduction to Algorithmic Thinking (By Dr. Wayne Brown Supplementary Reading)



Introduction to RAPTOR (Rapid Algorithmic Prototyping Tool for Ordered Reasoning)

Lab

RAPTOR is a flowchart-based programming environment, designed specifically to help students visualize their algorithms and avoid syntactic baggage. RAPTOR programs are created visually and executed visually by tracing the execution through the flowchart.(Download RAPTOR)

Module - III

Control Statements- Selection and Iteration

Conditional statements if,if-elif, switch

Data structures

Example Programs using Lists ( university questions)
Example Programs using Set ( university questions)
Example Programs using strings ( university questions)
Example Program using Dictionary ( university questions)


Lab


Example Programs using recursion(university questions)

Lab


Module-IV 

Computational Approaches to Problem Solving


Introduction to Computational Approaches to Problem Solving

Comments

  1. Lenovo Laptop Service Centres14 March 2026 at 03:54

    Appreciate the helpful information shared here. If anyone needs reliable support from a Lenovo Laptop Service Center in Navi Mumbai, experienced technicians are available to fix motherboard, battery, screen, and performance issues. We offer affordable services, doorstep services, out-of-warranty repair service, and multi-brand service. Call +91-7042640351, +91-9891868324.

    ReplyDelete

Post a Comment

Popular posts from this blog

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