(i) Foxpro

(ii) dBase

my_ dict = {'x':500, 'y': 5874, 'z': 560}

val = my_ dict. values ()

print ("max value", max (val))

print ("min value', min (val))

Output :

max value 5874

min value 500

Python enables reverse or negative indexing for the list elements. Thus, python lists index in opposite order. The python sets -1 as the index value for the last element in list and -2 for the preceding element and so on. This is called as Reverse Indexing.

Strings in python are immutable. That means, once you define a string modifications or deletion is not allowed. However, we can replace the existing string entirely with the new string.

(i) Python stops calling recursive function after 1000 calls by default.

(ii) So, it also allows you to change the limit using sys.setrecursionlimit (limit_value)

Example:

import sys

sys.setrecursionlimit(3000)

deffact(n):

if n == 0:

return 1

else:

return n * fact(n-1)

print(fact (2000)

Main advantages of functions are

(i) It avoids repetition and makes high degree of code reusing.

(ii) It provides better modularity for your application.

The break statement terminates the loop containing it. Control of the program flows to the statement immediately after the body of the loop

Literal is a raw data given in a variable or. constant. In Python, there are various types of literals.

(i) Numeric Literals consists of digits and are immutable.

(ii) String literal is a sequence of characters surrounded by quotes.

(iii) Boolean literal can have any of the two values: True or False.

Sorting is a method of arranging group of items in ascending or descending order.

List is constructed by placing expressions within square brackets separated by commas.

Example : 1st := [10, 20]

x, y := 1st

The difference between interface and implementation is

DBA takes care of the security of the DBMS, managing the license keys, managing user accounts and access etc.

(i) List is an ordered set of elements. But, a dictionary is a data structure that is used for matching one element (Key) with another (Value).

(ii) The index values can be used to access a particular element. But, in dictionary key represents index and key may be a number of a string.

(iii) Lists are used to look up a value whereas a dictionary is used to take one value and look up another value.

string = input ("Enter string:")

char = 0

word = 1 # start with l since last word won't end with space

line = 1 # start with 1 assuming at least one line

for i in string :

char += 1

if i == '':

word += 1

elif i == '\n':

line += 1

print("Number of words in the string:", word)

print("Number of characters in the string:", char)

print("Number of lines in the string:", line)

Output :

Enter string: Hello world

Number of words in the string: 2

Number of characters in the string: 11

Number of lines in the string: 1

(i) The format( ) function used with strings is very versatile and powerful function used for formatting strings.

(ii) The curly braces {} are used as placeholders or replacement fields which get replaced along with format( ) function.

(iii) Example :

num1 = int (input("Number 1: ")

num2 = int (input("Number 2: ")

print ("The sum of {} and {} is {}".format(num1, num2, (num1 + num2)))

Output :

Number 1: 34

Number 2: 54

The sum of 34 and 54 is 88

(i) The value returned by a function may be used as an argument for another
function in a nested manner. This is called composition.

(ii) Example:

# This program explains composition

>>> n1 = eval (input ("Enter a number: ")

Enter a number: 234

>>>n1

234

>>> n2 = eval (input ("Enter an arithmetic expression: "))

Enter an arithmetic expression: 12.0+13.0 * 2

>>> n2

38.0

(i) In Python strings, the backslash "\" is a special character, also called the "escape" character.

(ii) It is used in representing certain whitespace characters: "\t" is a tab, "\n" is a newline, and "\r" is a carriage return.

Asymptotic Notations are languages that use meaningful statements about time and space complexity.

(i) Big O : Worst-case of an algorithm.

(ii) Big Ω: Best -case of an algorithm.

(iii) Big \(\Theta\): complexity case of an algorithm (Or) lower bound = upper bound.

(i) Access control is a security technique that regulates who or what can view or use resources in a computing environment.

(ii) It is a fundamental concept in security that minimizes risk to the object.

(iii) In other words access control is a selective restriction of access to data.

(iv) In object oriented programming languages is implemented through access modifiers

(v) C++ and Java control the access to class members by public, private and protected keywords.

(i) Local scope refers to variables defined in current function. Always, a function will first look up for a variable name in its local scope.

(ii) Only if it does not find it there, the outer Scopes are checked.

(iii) Example :