Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
0% found this document useful (0 votes)
2 views

Review_Python_Language

The document outlines a series of Python programming exercises aimed at practicing various concepts such as prime numbers, composite numbers, perfect numbers, and string manipulation. Each lesson presents a specific task, including printing numbers based on certain criteria, counting specific types of numbers, and manipulating arrays and strings. The exercises are designed to enhance programming skills in Python through practical applications.

Uploaded by

taonguzzz123
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
2 views

Review_Python_Language

The document outlines a series of Python programming exercises aimed at practicing various concepts such as prime numbers, composite numbers, perfect numbers, and string manipulation. Each lesson presents a specific task, including printing numbers based on certain criteria, counting specific types of numbers, and manipulating arrays and strings. The exercises are designed to enhance programming skills in Python through practical applications.

Uploaded by

taonguzzz123
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Python LANGUAGE EXERCISES

Lesson 1 : Print to the screen odd composite numbers <100. (Composite number is natural
numbers greater than 1 and must be divisible by a number > 1 and itself.)
Lesson 2 : Print out 10 second prime numbers.
Lesson 3 : Print out the screen the numbers between 100 and 200 and divide by 2, 4, 6.
Lesson 4: Print the first 4 perfect numbers on the screen (Perfect number is the number that
equals the sum of its divisors including 1)
Lesson 5 : In the natural numbers <= 100 count how many numbers there are:
- Divide by 5.
- Divide 5 with the remainder 2.
- The end digit is “5”.
Lesson 6: Given any natural number N> 1 (previously assigned). Print out the successful
development of prime numbers from small to large.
Example: 9 --> 3.3 12 --> 2.2.3

Lesson 7: Given an array of natural numbers, write a program that arranges this array in
descending order.
Lesson 8 : Given an array of natural numbers, print out the screen all prime numbers of this
array.
Lesson 9 : Given an array of natural numbers, count how many prime numbers there are in
the above array, how many composite numbers there are.
Lesson 10: Given a string of full name's name, please separate: lastname and firstname.
Lesson 11 : Given a string consisting of all characters 0, 1. Let's transform this string in a
way 0 -> 1, 1-> 0 and print the result.
Lesson 12 : Given an array of string S1, S2 ... Sn. Find and print the longest string element.
Lesson 13 : Give a students list with the fullname of students. Count how many Students
that first name’s "Yen".
Lesson 14 : Give a students list with fullname of students. Count how many of you have the
"Van" padding.
Lesson 15: Give a students list with fullname of students. Count how many students that their
lastnames starting with the letter "T".

You might also like