Python Programming | JNTUA | UNIT 3 | Updating Variables & Iteration |

Jun 1, 20210 likes136 views

This document contains summaries of two lectures on updating variables and iteration in Python programming. Lecture 17 discusses reassignment of variables to new values and updating variable values based on their previous values. Lecture 18 introduces for and while loops for automating repetitive tasks, the break keyword to terminate loops, and calculating square roots through iterative approximation. The document provides examples of reassigning variable values, updating variables, using for and while loops, and computing square roots with the iterative formula.

Python Programming
Unit – III (Part I)
(Lecture 17)
Updating variables
& Iteration

Python Programming
Unit – III (Part I)
(Lecture 17)
Updating variables & Iteration
Reassignment Updating variables

Updating variables & Iteration
Lecture 17
Lecture 18
Reassignment
Updating variables Break
Square roots
for & while statement

Lecture 17
Reassignment
Updating variables
Updating variables

• More than one assignment
to the same variable.
• A new assignment makes
an existing variable refer to
a new value (and stop
referring to the old value)
Reassignment
a = 5
Print (a) is 5
a = 6
Print (a) is 6

Updating variables
• The new value of the
variable depends on
the old.
x = x + 1
• Get the current value
of x, add one, and then
update x with the new
value.
• Before you can update a
variable, you have to
initialize it, usually with
a simple assignment:
x = 5
x = x+1

Python Programming
Unit – III (Part I)
(Lecture 18)
Updating variables
& Iteration

for & while statement
Python Programming
Unit – III (Part I)
(Lecture 18)
Updating variables & Iteration
Break Square roots

Lecture 17
Lecture 18
Reassignment
Updating variables Break
Square roots
for & while statement
Updating variables & Iteration

Iteration
Lecture 18
Break
Square roots
for & while statement

for & while statement
• Computers are often
used to automate
repetitive tasks.
• Repeating identical or
similar tasks without
making errors
• Two main loop
statements are
available.
for
while

Break
• The break is a keyword in
python which is used to
terminate the loop.
• It breaks the inner loop first
and then proceeds to outer
loops.
while True:
line = input('Enter line to print: ')
if line == 'Exit':
break
print (line)

Square roots
• Suppose that you want to know
the square root of a.
• Take x initially, compute a better
estimate with the following
formula:

The activity selection problem involves scheduling a shared resource among competing activities. Activities have start and finish times, and only one activity can use the resource at a time. A greedy algorithm finds a maximum set of compatible activities by sorting by finish time and sequentially selecting activities that do not overlap in time. The algorithm runs in O(n log n) time to sort activities and Θ(n) time to select activities, for a total runtime of O(n log n).

Activity selection problemQAU ISLAMABAD,PAKISTAN

A greedy algorithm is a problem-solving technique that follows the problem-solving heuristic of making locally optimal choices at each step to find a global optimum. While this may find an optimal solution, it does not guarantee to do so as it does not consider the overall problem. The document discusses applying a greedy algorithm to solve the activity selection problem by always selecting the next activity that finishes earliest without conflicting with previously selected activities. It provides recursive and iterative implementations of the greedy algorithm to solve this problem in O(n log n) time by first sorting activities by finish time.

Activity selection problemSumita Das

The document describes an activity selection problem where a set of activities must share a single resource. Each activity has a start and finish time, and activities are mutually compatible if one activity finishes before another starts. The problem is to find the maximum subset of mutually compatible activities. A recursive greedy algorithm is presented that takes the activities sorted by finish time and recursively selects the next compatible activity to build the subset. Pseudocode for the algorithm is provided and stepped through on a sample activity set to produce the optimal subset.

Priorty queuesidra ali

CS106 Lab 10 - Functions (passing by value)Nada Kamel

This document contains the agenda and slides from a CS106 lecture presented by TA Nada Kamel. The agenda covers sorting arrays using bubble sort, functions including passing by value and examples, and a hands-on problem calculating factorials using a user-defined function. The slides explain bubble sort, define functions and how they are called, provide examples of function definitions and calls, and present a problem to write a function to calculate factorials.

01 part7 properties pure substance more probgunabalan sellan

This document discusses properties of pure substances and provides three homework problems. It defines latent heat of vaporization and discusses how superheated steam behaves like an ideal gas obeying Charles' Law. The first problem asks to calculate the internal energy of wet steam at a dryness fraction of 0.9 under constant pressure. The second problem asks to explain Van der Waals' equation, Clausius equation, and Dieterici equation. References for further reading on thermodynamics are also provided.

String Matching (Naive,Rabin-Karp,KMP)Aditya pratap Singh

This document discusses and compares several algorithms for string matching: 1. The naive algorithm compares characters one by one and has O(mn) runtime, where m and n are the lengths of the pattern and text. 2. Rabin-Karp uses hashing to compare substrings, running in O(m+n) time. It calculates hash values for the pattern and text substrings. 3. Knuth-Morris-Pratt improves on naive by using the prefix function to avoid re-checking characters, running in O(m+n) time. It constructs a state machine from the pattern to skip matching.

CS106 Lab 11 - Functions (passing by reference)Nada Kamel

This document summarizes a lab on functions passing by reference versus passing by value in C++. It provides examples of functions that pass integers by value and by reference. It also presents a hands-on problem to write functions to swap two integers if passed in in reverse order, and to read and validate two integers as input. The document is presented by TA Nada Kamel and covers passing parameters by reference, examples, and a practice problem.

CS106 Lab 6 - While and Do..While loopNada Kamel

This document summarizes a lab session on loops presented by TA Nada Kamel. It introduces different types of loops like while, do-while and for loops. Examples are provided to illustrate while and do-while loops, including one that prints all integers divisible by 7 between 1 to 100. Hands-on problems are given, like using a do-while loop to count and sum all numbers divisible by 7 from 1 to 200, and generating a series using a while loop.

Lecture4Rudy Martinez

This document summarizes a CS151 lecture that covered functions in Python. It showed examples of defining functions using def, passing arguments, and returning values. It also explained the range function and how it can be used in for loops. Finally, it provided a full example of writing functions to check if a string is a palindrome by reversing it and comparing the original to the reversed string.

CS106 Lab 8 - Nested loopsNada Kamel

Concept of cRohan Gajre

This document discusses three ways to perform addition of two numbers using only one variable in C and C++ programming. The first method uses a function that accepts user input for the variable and returns its value. This function is called twice in the main method to perform the addition. The second method uses scope resolution to access a global variable. It accepts input, performs the addition, and prints the result. The third method also uses a function but returns the variable value directly to perform the addition in the main method. It accepts input inside the function and returns the variable.

Labreportofaiilias ahmed

Counting Sort Lowerbounddespicable me

1. The document discusses lower bounds for sorting algorithms and proves that all comparison sorts require at least Ω(n lg n) time. 2. It then introduces counting sort, which runs in linear O(n) time by counting elements rather than comparing them, but requires the elements to be drawn from a small known range. 3. Radix sort is then described, which sorts integers digit-by-digit using counting sort, achieving linear time for integers by treating them as d-digit numbers in a base k system. This allows sorting large integers faster than comparison-based sorts.

lecture 5sajinsc

Introduction to design and analysis of algorithmDevaKumari Vijay

This document defines algorithms and describes how to analyze their efficiency. It states that an algorithm is a set of unambiguous instructions that accepts input and produces output within a finite number of steps. The document outlines criteria algorithms must satisfy like being definite, finite, and effective. It also describes different representations of algorithms like pseudocode and flowcharts. The document then discusses analyzing algorithms' time and space efficiency using asymptotic notations like Big-O, Big-Omega, and Big-Theta. It defines these notations and provides examples to classify algorithms' order of growth.

Heaps & Adaptable priority QueuesPriyanka Rana

Counting sortarjunnaik19

Evaluation of prefix expression with exampleGADAPURAMSAINIKHIL

The document discusses the algorithm for evaluating postfix expressions. It explains that postfix notation is faster than infix notation because it does not require parentheses. It then presents the steps of the algorithm to evaluate a postfix expression: 1) scan the expression from end to beginning 2) push operands onto a stack and pop operands to apply operators 3) push results back onto the stack 4) return the final value on the stack. An example is provided to demonstrate evaluating the postfix expression "2 3 1 * + 9 -".

Summing the squares of a number's digitsgoldenratio618

Counting sortzahraa F.Muhsen

Counting sort is an algorithm that sorts a collection of objects by their integer keys in linear time. It works by counting the number of objects with each key value, calculating the positions of each key based on the counts, and copying the objects to the output array in sorted order based on these positions. Counting sort is only suitable when the key values are close to the number of items being sorted.

Arithmetic and Arithmetic assignment operatorsimtiazalijoono

Activities on Software DevelopmentNicole Ynne Estabillo

This document contains instructions for 4 programming problems. Each problem requires determining the number of inputs and outputs, writing an algorithm to convert inputs to outputs, and testing the algorithm using sample data when provided. The problems involve calculating distance from speed and time, exponential growth given an equation, displaying a name and address, and determining Ergies from Fergies and Lergies values.

201707 CSE110 Lecture 29Javier Gonzalez-Sanchez

This document discusses sorting algorithms in Java. It begins with an explanation of bubble sort, including a basic implementation and a more efficient version. It then covers selection sort, describing the algorithm, providing examples, and including an implementation in Java. The document is from a CSE110 class on principles of programming taught by Javier Gonzalez-Sanchez in the summer of 2017.

Data structures Lecture no.6AzharIqbal710687

The document discusses several topics related to arrays in data structures and algorithms: 1) It explains how array elements are addressed in memory using the base address of the array, the size of each element, and the lower and upper bounds. 2) It provides an example of calculating the address of a specific element in a 1D array. 3) It presents an algorithm for finding the largest value in an array by iterating through the elements and tracking the largest. 4) It outlines an algorithm for inserting an element into an array at a specified location by shifting existing elements and making space for the new element.

Linked listCS Simple education

HeapHimadri Sen Gupta

This document discusses heaps and their implementation and applications. It defines a heap as a complete binary tree where each node's value is greater than its children in a max heap or less than its children in a min heap. Heaps can be implemented using an array, where calculations allow accessing a node's children and parent. Common heap operations like insertion and deletion take O(log n) time. Heaps are used in priority queues, sorting algorithms like heapsort, and some graph algorithms. Heapsort first builds a max or min heap from an array then repeatedly deletes the root to sort in descending or ascending order respectively.

Algorithms - "heap sort"Ra'Fat Al-Msie'deen

This document describes the heap sort algorithm. It begins by explaining heaps and their properties like the heap property. It then describes key heap operations like Max-Heapify, Build-Max-Heap, finding the maximum element, extract max, increase key, and insert. These operations allow heaps to function as priority queues. Heap sort works by building a max heap from the input array using Build-Max-Heap, then repeatedly extracting the maximum element and putting it in its sorted position. This runs in O(n log n) time, combining advantages of insertion and merge sort by sorting in-place like insertion sort but with a faster running time of merge sort.

Python Programming | JNTUA | UNIT 3 | Lists | FabMinds

Python Programming | JNTUA | UNIT 3 | Strings | FabMinds

This document contains summaries of three lectures (19-21) about strings in Python. It discusses that strings are sequences of characters that can be accessed individually by index and that the len() function returns the length of a string. It also describes how to traverse the characters of a string from beginning to end, slice strings to extract substrings, and that strings are immutable. Additional topics covered include searching for characters in strings, common string methods like count and find, using the in operator to check for substrings, and comparing strings.

More Related Content

What's hot (20)

CS106 Lab 6 - While and Do..While loopNada Kamel

Lecture4Rudy Martinez

CS106 Lab 8 - Nested loopsNada Kamel

Concept of cRohan Gajre

Labreportofaiilias ahmed

Counting Sort Lowerbounddespicable me

lecture 5sajinsc

Introduction to design and analysis of algorithmDevaKumari Vijay

Heaps & Adaptable priority QueuesPriyanka Rana

Counting sortarjunnaik19

Evaluation of prefix expression with exampleGADAPURAMSAINIKHIL

Summing the squares of a number's digitsgoldenratio618

Counting sortzahraa F.Muhsen

Arithmetic and Arithmetic assignment operatorsimtiazalijoono

Activities on Software DevelopmentNicole Ynne Estabillo

201707 CSE110 Lecture 29Javier Gonzalez-Sanchez

Data structures Lecture no.6AzharIqbal710687

Linked listCS Simple education

HeapHimadri Sen Gupta

Algorithms - "heap sort"Ra'Fat Al-Msie'deen

CS106 Lab 6 - While and Do..While loopNada Kamel

Lecture4Rudy Martinez

CS106 Lab 8 - Nested loopsNada Kamel

Concept of cRohan Gajre

Labreportofaiilias ahmed

Counting Sort Lowerbounddespicable me

lecture 5sajinsc

Introduction to design and analysis of algorithmDevaKumari Vijay

Heaps & Adaptable priority QueuesPriyanka Rana

Counting sortarjunnaik19

Evaluation of prefix expression with exampleGADAPURAMSAINIKHIL

Summing the squares of a number's digitsgoldenratio618

Counting sortzahraa F.Muhsen

Arithmetic and Arithmetic assignment operatorsimtiazalijoono

Activities on Software DevelopmentNicole Ynne Estabillo

201707 CSE110 Lecture 29Javier Gonzalez-Sanchez

Data structures Lecture no.6AzharIqbal710687

Linked listCS Simple education

HeapHimadri Sen Gupta

Algorithms - "heap sort"Ra'Fat Al-Msie'deen

More from FabMinds (20)

Python Programming | JNTUA | UNIT 3 | Lists | FabMinds

Python Programming | JNTUA | UNIT 3 | Strings | FabMinds

Python Programming | JNTUA | UNIT 2 | Case Study | FabMinds

The document discusses Python's turtle module which allows drawing lines by steering turtles around the screen. It can be imported from the Swampy package. The turtle module provides functions like fd, bk, lt, rt for moving the turtle forward, backward, left, right. Simple repetition and encapsulation techniques are demonstrated. Generalization is discussed by adding parameters to functions. Interface design principles around parameters and return values are covered. Refactoring existing code and adding docstrings for documentation are also mentioned.

Python Programming | JNTUA | UNIT 2 | Fruitful Functions | FabMinds

This document discusses Python programming concepts including fruitful functions, return values, incremental development, nested functions, Boolean functions, recursion, and type checking. Fruitful functions allow a function to return a value that can be used. Return values terminate function execution, and code after a return is dead code. Incremental development adds and tests small amounts of code at a time to avoid long debugging sessions. Nested functions allow one function to be called within another through composition. Boolean functions return True or False values. Recursion and type checking with isinstance are also covered.

Python Programming | JNTUA | UNIT 2 | Conditionals and Recursion | FabMinds

This document summarizes key concepts from lectures 9-11 on conditionals and recursion in Python programming. It discusses logical operators, relational operators, boolean expressions, floor division, modulus, conditional execution using if/else statements, chained and nested conditionals. Recursion is defined as a function calling itself and examples of valid and infinite recursion are provided. The document also covers taking keyboard input in Python using the input function.

Application layer protocolsFabMinds

The document discusses several application layer protocols used in TCP/IP including HTTP, HTTPS, FTP, and Telnet. HTTP is used to access resources on the world wide web over port 80 and is stateless. HTTPS is a secure version of HTTP that encrypts communications over port 443. FTP is used to transfer files between hosts but sends data and passwords in clear text. Telnet allows users to access programs on remote computers.

Internet connectivityFabMinds

Introduction for internet connectivity (IoT)FabMinds

The document discusses key concepts related to internet connectivity including protocols, headers, packets and network interfaces. It defines common terms like IP header, TCP header, packet, IP address, port, socket and host. Packet refers to a set of bytes that travels through routers until reaching its destination. Headers include parameters encoded according to the IP and TCP protocols and travel with a packet. Network interfaces link layers and addresses and are identified by ports.

web connectivity in IoTFabMinds

This document discusses various protocols for web connectivity, including communication gateways, HTTP, SOAP, REST, and WebSockets. Communication gateways allow different protocols to be used at each end of a connection. HTTP is the most widely used application layer protocol and uses request/response methods. SOAP is an XML-based protocol for exchanging objects between applications. REST is a simpler alternative to SOAP that uses HTTP methods like GET, POST, PUT and DELETE. WebSockets enable bidirectional communication over a single TCP connection.

message communication protocols in IoTFabMinds

The document discusses various protocols for web connectivity and message communication, including request/response, publish/subscribe, resource directories, and pull/push data models. It defines terminology and describes several protocols in more detail, such as CoAP-SMS which uses SMS for message transport, CoAP-MQ which uses a message queue, and MQTT which is an open-source M2M protocol that uses topics and a broker.

web communication protocols in IoTFabMinds

This document discusses various web communication protocols used for connectivity of devices over constrained and unconstrained environments. It describes protocols like CoAP, DTLS, JSON and TLV formats that allow small devices with limited resources to communicate securely over the web. CoAP is a specialized web transfer protocol that uses request/response model and supports resource discovery. DTLS provides security services like integrity, authentication and confidentiality for UDP-based applications. JSON and TLV are compact data formats used for message transmission.

introduction for web connectivity (IoT)FabMinds

The document defines key terms related to web connectivity and communication protocols. It describes concepts like applications, APIs, web services, objects, communication gateways, clients, servers, brokers, proxies, web protocols, firewalls, headers, states, resources, and URIs. The definitions provide explanations of these terms in the context of enabling connectivity and communication between devices, systems, and over the web.

Python Introduction | JNTUA | R19 | UNIT 1 | FunctionsFabMinds

This document discusses functions in Python programming. It covers parameters and arguments, how local variables only exist within a function, and the differences between fruitful functions that return values and void functions that do not return values. Some built-in functions like math.sqrt require arguments, while math.pow requires two arguments for the base and exponent. Local variables declared within a function only exist in that function's scope. Fruitful functions like math.sqrt that returns a float value, while void functions like a greeting function that prints a value but does not return it explicitly.

Python Introduction | JNTUA | R19 | UNIT 1 | FunctionsFabMinds

The document discusses functions in Python programming, including math functions, function composition, adding new functions, and the flow of execution. It explains that the math module contains mathematical functions that must be imported and can then be accessed by specifying the module and function name separated by a dot. The flow of execution is described as functions being called in the program code and then executed with their own block of statements before returning.

Python Programming | JNTUK | UNIT 2 | Lecture 6 & 7 | Conditional & Control S...FabMinds

The document discusses various Python programming concepts including control statements, loops, strings, files and string manipulation. Control statements like if-else are used to conditionally execute code. Loops like for and while are used to repeatedly execute code while a condition is true. Strings can be manipulated using indexing, slicing and other string methods. Files can be read from and written to using file handling methods in Python.

Data enrichmentFabMinds

Communication technologiesFabMinds

This document discusses various wireless and wired communication technologies used for Internet of Things (IoT) systems, including Near-Field Communication (NFC), RFID, Bluetooth, ZigBee, Wi-Fi, cellular networks, USB, and Ethernet. It provides details on the standards, features, modes of operation, and applications of these different technologies for physical and data link layer communication functions in IoT/M2M systems.

M2M systems layers and designs standardizationsFabMinds

The document discusses standards and standardization bodies for Internet of Things (IoT) systems. The Internet Engineering Task Force (IETF), International Telecommunication Union (ITU-T), European Telecommunication Standards Institute (ETSI), and Open Geospatial Consortium (OGC) have all proposed standards and reference models for IoT layers, communication, and device/sensor capabilities. Specifically, ETSI defined domains and capabilities for machine-to-machine communication systems, while IETF, ITU-T, and OGC focused on network layers, transport protocols, and sensor discovery/metadata.

Business models for business processes on IoTFabMinds

The document discusses business models for business processes on the Internet of Things. It covers key topics like IoT applications, business models, value creation using IoT, and business model scenarios for IoT. Business models need innovation to adapt to new customer access and interactions enabled by technologies like cloud computing and mobile communications. Value is created on IoT through addressing emergent needs, information convergence, and recurrent revenue from networked products. Example business model scenarios for IoT leverage data from multiple sources like sensors, M2M, and open data.

Python Programming | JNTUK | UNIT 1 | Lecture 5FabMinds

This document provides an overview of the topics covered in Unit 1 of a Python programming syllabus. It includes introductions to computer science topics, computer systems, installing Python, basic syntax, data types, variables, arithmetic operators, expressions, comments, and understanding error messages. Example code and explanations of operators like arithmetic, assignment, comparison, logical, membership, identity, and bitwise are also provided.

Python Programming | JNTUA | UNIT 3 | Lists | FabMinds

Python Programming | JNTUA | UNIT 3 | Strings | FabMinds

Python Programming | JNTUA | UNIT 2 | Case Study | FabMinds

Python Programming | JNTUA | UNIT 2 | Fruitful Functions | FabMinds

Python Programming | JNTUA | UNIT 2 | Conditionals and Recursion | FabMinds

Application layer protocolsFabMinds

Internet connectivityFabMinds

Introduction for internet connectivity (IoT)FabMinds

web connectivity in IoTFabMinds

message communication protocols in IoTFabMinds

web communication protocols in IoTFabMinds

introduction for web connectivity (IoT)FabMinds

Python Introduction | JNTUA | R19 | UNIT 1 | FunctionsFabMinds

Python Programming | JNTUK | UNIT 2 | Lecture 6 & 7 | Conditional & Control S...FabMinds

Data enrichmentFabMinds

Communication technologiesFabMinds

M2M systems layers and designs standardizationsFabMinds

Business models for business processes on IoTFabMinds

Python Programming | JNTUK | UNIT 1 | Lecture 5FabMinds

Recently uploaded (20)

IDF 30min presentation - December 2, 2024.pptxArneeAgligar

Analysis of Quantitative Data Parametric and non-parametric tests.pptxShrutidhara2

This presentation covers the following points-- Parametric Tests • Testing the Significance of the Difference between Means • Analysis of Variance (ANOVA) - One way and Two way • Analysis of Co-variance (One-way)  Non-Parametric Tests: • Chi-Square test • Sign test • Median test • Sum of Rank test • Mann-Whitney U-test Moreover, it includes a comparison of parametric and non-parametric tests, a comparison of one-way ANOVA, two-way ANOVA, and one-way ANCOVA.

How to Manage & Create a New Department in Odoo 18 EmployeeCeline George

Black and White Illustrative Group Project Presentation.pdf (1).pdfAnnasofiaUrsini

LDMMIA Free Reiki Yoga S9 Grad Level Intuition IILDM & Mia eStudios

Completed Sunday 6/8. For Weekend 6/14 & 15th. (Fathers Day Weekend US.) These workshops are also timeless for future students TY. No admissions needed. A 9th FREE WORKSHOP Reiki - Yoga “Intuition-II, The Chakras” Your Attendance is valued. We hit over 5k views for Spring Workshops and Updates-TY. Thank you for attending our workshops. If you are new, do welcome. Grad Students: I am planning a Reiki-Yoga Master Course (As a package). I’m Fusing both together. This will include the foundation of each practice. Our Free Workshops can be used with any Reiki Yoga training package. Traditional Reiki does host rules and ethics. Its silent and within the JP Culture/Area/Training/Word of Mouth. It allows remote healing but there’s limits As practitioners and masters, we are not allowed to share certain secrets/tools. Some content is designed only for “Masters”. Some yoga are similar like the Kriya Yoga-Church (Vowed Lessons). We will review both Reiki and Yoga (Master tools) in the Course upcoming. S9/This Week’s Focus: * A continuation of Intuition-2 Development. We will review the Chakra System - Our temple. A misguided, misused situation lol. This will also serve Attunement later. Thx for tuning in. Your time investment is valued. I do select topics related to our timeline and community. For those seeking upgrades or Reiki Levels. Stay tuned for our June packages. It’s for self employed/Practitioners/Coaches… Review & Topics: * Reiki Is Japanese Energy Healing used Globally. * Yoga is over 5k years old from India. It hosts many styles, teacher versions, and it’s Mainstream now vs decades ago. * Anything of the Holistic, Wellness Department can be fused together. My origins are Alternative, Complementary Medicine. In short, I call this ND. I am also a metaphysician. I learnt during the 90s New Age Era. I forget we just hit another wavy. It’s GenZ word of Mouth, their New Age Era. WHOA, History Repeats lol. We are fusing together. * So, most of you have experienced your Spiritual Awakening. However; The journey wont be perfect. There will be some roller coaster events. The perks are: We are in a faster Spiritual Zone than the 90s. There’s more support and information available. (See Presentation for all sections, THX AGAIN.)

MATERI PPT TOPIK 4 LANDASAN FILOSOFIS PENDIDIKANaditya23173

TV Shows and web-series quiz | QUIZ CLUB OF PSGCAS | 13TH MARCH 2025Quiz Club of PSG College of Arts & Science

Unit 3 Poster Sketches with annotations.pptxbobby205207

How to Create an Event in Odoo 18 - Odoo 18 SlidesCeline George

How to Create a Rainbow Man Effect in Odoo 18Celine George

How to Manage Upselling of Subscriptions in Odoo 18Celine George

Module 4 Presentation - Enhancing Competencies and Engagement Strategies in Y...GeorgeDiamandis11

Gibson "Secrets to Changing Behaviour in Scholarly Communication: A 2025 NISO...National Information Standards Organization (NISO)

How to Configure Vendor Management in Lunch App of Odoo 18Celine George

Optimization technique in pharmaceutical product development.pptxUrmiPrajapati3

EUPHORIA GENERAL QUIZ FINALS | QUIZ CLUB OF PSGCAS | 21 MARCH 2025Quiz Club of PSG College of Arts & Science

What is FIle and explanation of text files.pptxRamakrishna Reddy Bijjam

Capitol Doctoral Presentation -June 2025.pptxCapitolTechU

Allomorps and word formation.pptx - Google Slides.pdfAbha Pandey

Strengthened Senior High School - Landas Tool Kit.pptxSteffMusniQuiballo

IDF 30min presentation - December 2, 2024.pptxArneeAgligar

Analysis of Quantitative Data Parametric and non-parametric tests.pptxShrutidhara2

How to Manage & Create a New Department in Odoo 18 EmployeeCeline George

Black and White Illustrative Group Project Presentation.pdf (1).pdfAnnasofiaUrsini

LDMMIA Free Reiki Yoga S9 Grad Level Intuition IILDM & Mia eStudios

MATERI PPT TOPIK 4 LANDASAN FILOSOFIS PENDIDIKANaditya23173

TV Shows and web-series quiz | QUIZ CLUB OF PSGCAS | 13TH MARCH 2025Quiz Club of PSG College of Arts & Science

Unit 3 Poster Sketches with annotations.pptxbobby205207

How to Create an Event in Odoo 18 - Odoo 18 SlidesCeline George

How to Create a Rainbow Man Effect in Odoo 18Celine George

How to Manage Upselling of Subscriptions in Odoo 18Celine George

Module 4 Presentation - Enhancing Competencies and Engagement Strategies in Y...GeorgeDiamandis11

Gibson "Secrets to Changing Behaviour in Scholarly Communication: A 2025 NISO...National Information Standards Organization (NISO)

How to Configure Vendor Management in Lunch App of Odoo 18Celine George

Optimization technique in pharmaceutical product development.pptxUrmiPrajapati3

EUPHORIA GENERAL QUIZ FINALS | QUIZ CLUB OF PSGCAS | 21 MARCH 2025Quiz Club of PSG College of Arts & Science

What is FIle and explanation of text files.pptxRamakrishna Reddy Bijjam

Capitol Doctoral Presentation -June 2025.pptxCapitolTechU

Allomorps and word formation.pptx - Google Slides.pdfAbha Pandey

Strengthened Senior High School - Landas Tool Kit.pptxSteffMusniQuiballo

Python Programming | JNTUA | UNIT 3 | Updating Variables & Iteration |

1. Python Programming Unit – III (Part I) (Lecture 17) Updating variables & Iteration

2. Python Programming Unit – III (Part I) (Lecture 17) Updating variables & Iteration Reassignment Updating variables

3. Updating variables & Iteration Lecture 17 Lecture 18 Reassignment Updating variables Break Square roots for & while statement

4. Lecture 17 Reassignment Updating variables Updating variables

5. • More than one assignment to the same variable. • A new assignment makes an existing variable refer to a new value (and stop referring to the old value) Reassignment a = 5 Print (a) is 5 a = 6 Print (a) is 6

6. Lecture 17 Reassignment Updating variables Updating variables

7. Updating variables • The new value of the variable depends on the old. x = x + 1 • Get the current value of x, add one, and then update x with the new value. • Before you can update a variable, you have to initialize it, usually with a simple assignment: x = 5 x = x+1

8. Lecture 17 Reassignment Updating variables Updating variables

9. Python Programming Unit – III (Part I) (Lecture 18) Updating variables & Iteration

10. for & while statement Python Programming Unit – III (Part I) (Lecture 18) Updating variables & Iteration Break Square roots

11. Lecture 17 Lecture 18 Reassignment Updating variables Break Square roots for & while statement Updating variables & Iteration

12. Iteration Lecture 18 Break Square roots for & while statement

13. for & while statement • Computers are often used to automate repetitive tasks. • Repeating identical or similar tasks without making errors • Two main loop statements are available. for while

14. Iteration Lecture 18 Break Square roots for & while statement

15. Break • The break is a keyword in python which is used to terminate the loop. • It breaks the inner loop first and then proceeds to outer loops. while True: line = input('Enter line to print: ') if line == 'Exit': break print (line)

16. Iteration Lecture 18 Break Square roots for & while statement

17. Square roots • Suppose that you want to know the square root of a. • Take x initially, compute a better estimate with the following formula:

18. Square roots

19. Square roots

20. Iteration Lecture 18 Break Square roots for & while statement

Python Programming | JNTUA | UNIT 3 | Updating Variables & Iteration |

Recommended

More Related Content

What's hot (20)

More from FabMinds (20)

Recently uploaded (20)

Python Programming | JNTUA | UNIT 3 | Updating Variables & Iteration |