-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathUser-Defined-Functions-Questions.py
135 lines (124 loc) · 3.04 KB
/
User-Defined-Functions-Questions.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
# Increment elements of list passed as arguments
def increment(list2):
for i in range(0,len(list2)):
list2[i]+=5
list1=[10,20,30,40,50]
print('Original list:',list1)
increment(list1)
print('New list:',list1)
# Average of marks
def avgmarks(l,n):
s=0
for m in l:
s+=m
a=s/n
return a
l=[]
n=int(input('Enter number of students: '))
for i in range(0,n):
print('Enter marks of student',(i+1),': ')
m=int(input())
l.append(m)
a=avgmarks(l,n)
print('Average of marks:',a)
# If element present in list
l=eval(input('Enter elements for list: '))
def numpreslst(l):
e=eval(input('Enter element you want to check if in list: '))
if e in l:
print('Element is present in list at index number:',l.index(e),'and at position',(l.index(e)+1))
else:
print('Element not present in list.')
numpreslst(l)
# Reverse list
l=eval(input('Enter elements of list: '))
def revlist(l):
return l[-1:-len(l)-1:-1]
print('Reversed list:',revlist(l))
# Remove element by index number or element itself
def delpos(i):
l.pop(i)
return l
def delelem(e):
l.remove(e)
return l
l=eval(input('Enter list: '))
print('Enter 1 to remove by index number, or 2 to remove by element.')
ch=int(input('Enter choice (1 or 2): '))
if ch==1:
i=int(input('Enter index number: '))
print('New list:',delpos(i))
if ch==2:
e=eval(input('Enter element: '))
print('New list:',delelem(e))
# Insert element
def insele(l):
l.insert(i,e)
return l
l=eval(input('Enter list: '))
e=eval(input('Enter element: '))
i=int(input('Enter index number: '))
print('New list:',insele(l))
# Remove duplicate elements
l=eval(input('Enter elements: '))
def delrepelem(l):
for i in range(0,len(l)):
for j in l:
if l.count(j)>1:
l.remove(j)
return l
print('New list:',delrepelem(l))
# Median of List
m=0
def medl(l):
if len(l)%2==0:
m=(l[len(l)//2]+l[(len(l)//2)-1])/2
return m
else:
m=l[(len(l)-1)//2]
return m
l=eval(input('Enter elements: '))
l.sort()
print('Median of list:',medl(l))
# Second largest element
def secmaxno(l):
l.sort()
return l[-2]
l=eval(input('Enter elements: '))
print('List given:',l)
l.sort()
print('Second largest element is:',secmaxno(l))
# Largest element
def maxelem(l):
l.sort()
return l[-1]
l=eval(input('Enter elements: '))
print('List given:',l)
l.sort()
print('Largest element is:',maxelem(l))
# Frequency of element
def countelem(l,e):
count=0
for i in range(0,len(l)):
if l[i]==e:
count=count+1
return count
l=eval(input('Enter elements: '))
e=eval(input('Enter element to count: '))
print('Frequency of element:',countelem(l,e))
# Separate positive and negative numbers in list
l=eval(input('Enter elements: '))
def sepposneg(l):
p=[]
n=[]
z=[]
for i in l:
if i>0:
p.append(i)
print('List of positive numbers:',p)
for j in l:
if j<0:
n.append(j)
print('List of negative numbers',n)
print('Original list:',l)
sepposneg(l)