lowercase
UPPERCASE
Capitalized
None of the mentioned
list()
str()
Both of the above
None of the above
Flowchart
Algorithm
Process
None of these
bin()
int()
binary()
Zip()
tuple()
frozenset()
obj()
input()
set (x)
dict(d)
frozenset(s)
chr(x)
**
//
is
not in
unichr (x)
oct (x)
None of the these
values()
chr()
uni()
exp(x)
int (x)
chr (x)
algorithm
program
Graph
Python
Java
Fortran
Function overloading
operator overloading
Both of the above.
eval(str)
str(x)
print(t[3])
t[3] = 45
print(max(t))
print(len(t))
Every recursive function must have a base case
Infinite recursion can occur if the base case isn't properly mentioned
A recursive function makes the code easier to understand
Every recursive function must have a return value
Range
Input
Open
Pass
Open()
