python练习题

ThearticlediscussesfundamentallistoperationsinPython,includingslicing,sorting,appendingelements,anddictionaryconcepts.Italsoincludesacodingexampletofindandprinttwinprimeswithinagivenrange.
摘要由CSDN通过智能技术生成

1.已知列表x=list(range(9)),那么执行语句delx[:2]之后,x的值为(D)
A.[1,3,5,7,9]
B.[1,3,5,7]
C.[0,1,3,5,7]
D.[2,3,4,5,6,7,8]

2.len(range(1,10))的值是(B)
A.8
B.9
C.10
D.11

3.表达式”,".join(list)中list是列表类型,以下选项中对其功能的描述正确的是(D)
A.将逗号字符串增加到列表list中
B.在列表list每个元素后增加一个逗号
C.将列表所有元素连接成一个字符串,每个元素后增加一个逗号
D.将列表所有元素连接成一个字符串,元素之间增加一个逗号

list1=['1','2','3','4','5']
a=",".join(list1)
print(a,type(a))

结果为

1,2,3,4,5 <class 'str'>

4.表达式[1,2,3]*3的执行结果为(A)
A.[1,2,3,1,2,3,1,2,3]
B.{[1,2,3],[1,2,3],[1,2,3]}
C.[1,2,3],[1,2,3],[1,2,3]
D.([1,1,1,2,2,2,3,3,3])

list1=[1,2,3]
print(list1*3)

结果为

[1, 2, 3, 1, 2, 3, 1, 2, 3]

5.假设列表对象aList的值为[3,4,5,6,7,9,11,13,15,17],那么切片aList[3:7]得到的值是(B)
A.[5,6,7,9,11]
B.[6,7,9,11]
C.[5,6,7.9.
D.[7,9,11,13]

6.已知x=list(range(20)),那么表达式x[-1]的值为(D)。
A.0
B.1
C.20
D.19

7.切片操作list(range(6))[::2]执行结果为(D)
A.[0,1]
B.[0,2,4,6]
C.[0,1,2]
D.[0,2,4]

8.已知x=[3,7,5],那么执行语句x=x.sort(reverse=True)之后,x的值为(B)
A.[3,5,7]
B.[7,5,3]
C.None
D.[3.7.5]

9.下面程序输出是什么? D
txt=["a”,“b”,“c”,“d”,“e”]
stop words=[“d”.“j”]
t=[x for x in txt if x not in stop_words]print(t)
A.["a”,"b”,“c”,“d”,“e”]
B.[“a”,“b”,“c”,“d”]
C.[“a”,"b”,“c”]
D.[“a”,”b”,"c”,”e”]

txt = ["a", "b", "c", "d", "e"]
stop_words = ["d", "i"]
t = [x for x in txt if x not in stop_words]
print(t)

结果为

['a', 'b', 'c', 'e']

10.下面程序的输出是:C
ls=[“abcd”,“ab”,“cd”,“cdab”]
n,m=0.0for line in 1s:
if"ab"and"cd"in line:
n+=1
m+=1
elif "ab"in line:
n+=1
elif "cd"in line:
m+=1
print(n.m)
A:33
B:34
C:43
D:44

ls = ["abcd", "ab", "cd", "cdab"]
n, m = 0, 0
for line in ls:
    if "ab" and "cd" in line:
        n += 1
        m += 1
    elif "ab" in line:
        n += 1
    elif "cd" in line:
        m += 1
print(n, m)

结果为

4 3

11.以下程序的输出结果是(A):
1s=[11,22,33,44]
for i in ls:
if j==”33".
print(“找到!i=”,i)
break
else
print(“未找到.”)
A:未找到…
B:未找到…未找到…找到!I=33
C:未找到…未找到…未找到…未找到…
D:找到!I=33

ls=[11,22,33,44]
for i in ls:
    if i=="33":
        print("找到!i=",i)
        break
else:
        print("未找到...")

结果为

未找到...

12.以下程序的输出结果是(C):
k=0
for i in range(4):
for j in range(i+1):k+=j
if j>1:break
print(k)
A:5
B:6
C:7
D:8

k=0
for i in range (4):
    for j in range(i+1):
        k+=j
        if j>1:
            break
print(k)

结果为

7

13.列表可以作为字典的“键”。

14.Python列表属于无序序列。

15.Python列表中所有元素必须为相同类型的数据。

16.对于列表而言,在尾部追加元素比在中间位置插入元素速度更快一些,尤其是对于包含大量
元素的列表。

17.使用Python列表的方法insert()为列表插入元素时会改变列表中插入位置之后元素的索引。

18.已知列表x=[1,3,2],那么执行语句x=x.reverse()之后,x的值为 2,3,1

19.已知x=([1],[2]),那么执行语句x[0].append(3)后x的值为 ([1,3],[2])

20.编程题:有一个list1列表存储2-99的数据,查找孪生素数后输出,孪生素数:两个素数之间间隔为2

list1=list(range(2,100))
list2=[]
for i in list1:
    for j in range(2,i):
        if i%j==0:
            break
        else:
            list2.append(i)
print(list2)
for i in range(1,len(list2)):
    if list2[i]-list2[i-1]==2:
        print(list2[i-1],'与',list2[i],'是孪生素数')

运行结果

[3, 5, 5, 5, 7, 7, 7, 7, 7, 9, 11, 11, 11, 11, 11, 11, 11, 11, 11, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 15, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 21, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 25, 25, 25, 27, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 33, 35, 35, 35, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 39, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 45, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 49, 49, 49, 49, 49, 51, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 55, 55, 55, 57, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 63, 65, 65, 65, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 69, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 75, 77, 77, 77, 77, 77, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 81, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 85, 85, 85, 87, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 91, 91, 91, 91, 91, 93, 95, 95, 95, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 97, 99]
35 是孪生素数
57 是孪生素数
79 是孪生素数
911 是孪生素数
1113 是孪生素数
1315 是孪生素数
1517 是孪生素数
1719 是孪生素数
1921 是孪生素数
2123 是孪生素数
2325 是孪生素数
2527 是孪生素数
2729 是孪生素数
2931 是孪生素数
3133 是孪生素数
3335 是孪生素数
3537 是孪生素数
3739 是孪生素数
3941 是孪生素数
4143 是孪生素数
4345 是孪生素数
4547 是孪生素数
4749 是孪生素数
4951 是孪生素数
5153 是孪生素数
5355 是孪生素数
5557 是孪生素数
5759 是孪生素数
5961 是孪生素数
6163 是孪生素数
6365 是孪生素数
6567 是孪生素数
6769 是孪生素数
6971 是孪生素数
7173 是孪生素数
7375 是孪生素数
7577 是孪生素数
7779 是孪生素数
7981 是孪生素数
8183 是孪生素数
8385 是孪生素数
8587 是孪生素数
8789 是孪生素数
8991 是孪生素数
9193 是孪生素数
9395 是孪生素数
9597 是孪生素数
9799 是孪生素数

Process finished with exit code 0
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值