(i) Data Visualization help users to analyze and interpret the data easily.
(ii) It makes complex data understandable and usable.
(iii) Various Charts in Data Visualization helps to show relationship in the data for one or more variables.

The WHERE clause is used to extract only those records that fulfill a specified condition. In this example we are going to display the different grades scored by male students from "student table.
import sqlite3
connection = sqlite3.connect ("Academy.db")
cursor = connection.cursor()
cursor.execute ("SELECT DISTINCT (Grade) FROM student where gender = "M")
result = cursor.fetchall()
print(* result, sep ="\n")
Output:
('B,')
('A,')
('C,')
('D,')

welcome → module name
      ●      →  operator name
display() → definition name

Program: To modify an existing file
import csv
row = ['3: 'Meena','Bangalore']
with open('Student.csv', 'r') as read file:
reader = csv.reader (read File)
lines = list (reader) 
lines [3] = row
with open ('Student.csv', 'w') as write file:
# returns the writer object which converts the user data with delimiter.
writer = csv.writer(writefile)
#writerows() method writes multiple rows to a csv file
writer. writerows(lines)
readFile.close()
writeFile.close()
Output:

(i) The SAVEPOINT command is used to temporarily save a transaction so that you can rollback to the point whenever required.
(ii) The different states of our table can be saved at any time using different names and the rollback to that state can be done using the ROLLBACK command.
(iii) SAVEPOINT savepoint_name:
      UPDATE student SET Name = 'Mini' WHERE Admno=105;
      SAVEPOINT A;

Good Morning Bindu Madhavan.

Sort ( ) :
It sorts the element in list.
Syntax :
   List.sort(reverse=True|False,key=myfunc)
Sorts the element in list :
Both arguments are optional
(i) If reverse is set as True, list sorting is in descending order.
(ii) Ascending is default.
(iii) Key=myFunc; "myFunc" - the name of the user defined function that specifies the sorting criteria.
Example :
MyList = [Thilothamma', "Tharani', 'Anitha','SaiSree', 'Lavanya')
MyList.sort( )
print(MyList)
MyList.sort(reverse=True)
print(MyList)
Output :
['Anitha', 'Lavanya', 'SaiSree', 'Tharani', 'Thilothamma']
['Thilothamma', 'Tharani', 'SaiSree', 'Lavanya', 'Anitha']
 

Output:
Weool

Code:
n=int(input("Enter the year"))
if(y%4==0):
         print ("Leap Year")
else:
         print ("Not a Leap Year")
Output:
Enter the year      2012
Leap Year

Code :
n1 = int(input(:Enter the first number:"))
n2 = int(input("Enter the second number:")
n3 = int(input(:Enter the third number:")
if(n1?=n2) and(n1>=n3) :
        biggest = n1 ;
elif(n2>=nl)and (n2>=n3) :
        biggest = n2
else:
        biggest = n3
print("The biggest number between",n1,",",n2"and"n3"is",biggest)
Output :
Enter the first number : 1
Enter the second number : 3 
Enter the third number : 5
The biggest number between 1, 3 and 5 is 5

The complexity of an algorithm f (n) gives the running time and/or the storage space required by the algorithm in terms of n as the size of input data.
(i) Time Complexity: The Time complexity of an algorithm is given by the number of steps taken by the algorithm to complete the process.
(ii) Space Complexity: Space complexity of an algorithm is the amount of memory required to run to its completion.

(i) All programming languages permit functions to be nested. A function (method) within another function is called nested function.
(ii) A variable which is declared, inside a function which contains another function definition with in it, the inner function can also access the variable of the outer function. This scope is called enclosed scope.
(iii) When a compiler or interpreter search for a variable in a program, it first searches Local, and then searches Enclosing scopes. Consider the following example

1. Disp(); 2. a:=10 3. Disp1(): 4. print a 5. Disp1() 6. print a 7. Disp()

Entire program

Output of the program 10 10

(i) The elements of a list can be accessed in two ways. The first way is via our familiar method of multiple assignment, which unpacks a list into its elements and binds each element to a different name.
lst := [10, 20]
x, y := lst
(ii) In the above example x will become l0 andy will become 20.
(iii) A second method for accessing the elements in a list is by the element selection operator. Unlike a list literal, a square brackets  expression directly following another expression does not evaluate to a list value, but instead selects an element from the value of the preceding expression.
Ist [0]
10
lst [1]
20

 

The variables used inside the function may cause side effects though the functions which are not passed with any arguments. In such cases the function is called impure function.
For example the mathematical function random() will give different outputs for the same function call.
let randomnumber :=
a := random()
if a > 10 then
      return: a
else
      return: 10