Scribd
Upload
41 views

Flow Control Programs

The document contains 10 programming problems involving flow control concepts like loops, conditional statements, and sequence generation. The problems cover topics such as determining if a number is prime or Armstrong, printing Fibonacci sequences, taking input until a sentinel value, and validating passwords. Solutions to each problem are provided using for loops, while loops, if/else statements, string manipulation, and mathematical operations.

Uploaded by

Subbu Suni
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
41 views

Flow Control Programs

The document contains 10 programming problems involving flow control concepts like loops, conditional statements, and sequence generation. The problems cover topics such as determining if a number is prime or Armstrong, printing Fibonacci sequences, taking input until a sentinel value, and validating passwords. Solutions to each problem are provided using for loops, while loops, if/else statements, string manipulation, and mathematical operations.

Uploaded by

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

Programs on flow control

1. Write a program for print given number is prime number or not using for loop and
require 1 to given number odd and even number
Solution :
n = int(input("enter the number : "))
c=0
for i in range (1,n):
if n % i ==0:
c = c+1
break
if c==2:
print (" The Given Number is Prime number")
else:
print (" The Given Number is not Prime number")
for c in range(n):
if c % 2 == 0:
print(c,"-even")
else:
print(c,"-odd")
2. Write a program print Fibonacci series and sum the even numbers. Fibonacci series

is

1,2,3,5,8,13,21,34,55

Solution:
n = int(input("enter the n value :"))
f=0
s=1
sum=0
for i in range(0,n):
n=f+s
print(n)
f=s
s=n
if n%2==0:
sum+=n
print("The sum of even numbers : ",sum)

3. Write a program to print n prime numbers and display the sum of prime numbers.

Solution:

n=int(input("Enter the range: "))


sum=0
for i in range(1,n+1):
for j in range(2,i):
if (i % j) == 0:
break
else:
print (i)
sum += i
print ("\nSum of prime numbers is",sum)

4. Using a for loop, write a program that prints out the decimal equivalents of 1/2, 1/3,

1/4, . . ,1/n

Solution:

n=int(input("Enter the range: "))


for i in range(1,n):
print("decimal equivalents of 1/",i, "is : ",1/i)
5. Write a program that takes input from the user until the user enters -1. After display

the sum of numbers.

Solution:

sum = 0
while True:
n = int(input("enter the Number : "))
if n ==-1:
break
else:
sum=sum+n
print("the sum is :",sum)

6. Write a program to display the following sequence.

ABCDEFGHIJKLMNOPQRSTUVWXYZ

Solution:

ch='A'
n = int(input("enter the number :"))
for i in range(1,n):
print(ch)
ch=chr(ord(ch)+1)
7. Write a program to display the following sequence.

AB

ABC

ABCD

ABCDE

Solution:

n= int(input("enter the number of rows : "))


for i in range(1,n):
ch='A'
for j in range(1,i+1):
print(ch)
ch=chr(ord(ch)+1)
print("")

8. Write a program to display the following sequence.

BC

D E F

G H I

KLMNO

Solution:

ch='A'
n= int(input("enter the number of rows : "))
for i in range(1,n):
for j in range(1,i+1):
print(ch)
ch=chr(ord(ch)+1)
print("")

9. Write a program that takes input string user and display that string if string

contains at least one Uppercase character, one Lowercase character and one digit.

Solution:

pwd = input("enter the password: ")


u = False
l = False
d = False
for i in range(0,len(pwd)):
if pwd[i].isupper():
u = True
elif pwd[i].islower():
l = True
elif pwd[i].isdigit():
d = True
if u == True and l == True and d == True :
print(pwd.center(50,"$"))
else:
print("invallid password")

10. Write a program to print given number is Armstrong or not.

Solution:

n = int(input("enter the number: "))


sum = 0
temp = n
while temp>0:
d = temp%10
sum = sum +(d**3)
temp = temp//10
if n == sum:
print("Armstsrong number : ",n)
else:
print("not Armstsrong number : ",n)

You might also like