Practice Problem 6-Vowgram

Practice Problem 6-Vowgram

Q.Vowgrams are words or sentences that has every vowel of  the English alphabet occurring  at least  once. Write an algorithm and  a subsequent Python code to check whether a string is a vowgram or not. Write a function to check if a given string is a vowgram. For example, "The quick brown fox jumps over the lazy dog" is a vowgram.

Input:
the string

Processing:
def vowgram(s):
    s = s.lower()
    s = ''.join(s.split())
    if set(s) > set('aeiou'):
        print('Vowgram')
    else:
        print('Not vowgram')

Output:
display whether string is a vowgram or not

Program
def vowgram(s):
    s = ''.join(s.split())
    s = s.lower()
    if set(s) > set('aeiou'):
        print('Vowgram')
    else:
        print('Not vowgram')

s= input()

vowgram(s)

Algorithm:
Step1. define the function vowgram with one parameter s
Step1.1 convert all the letters of s into lower case and remove all the whitespace characters
Step1.2 check if set(s) is a superset of the set of vowels if yes then display the string is a vowgram else display not vowgram
Step2. get the string and check whether it is a vowgram or not using the vowgram function
Step3. End

Comments

Post a Comment

Popular posts from this blog

MATLAB WEEK-2

Image
MATLAB Plotting of curves and surfaces Week: 2 METHOD 1 x=linspace(0,1,101) plot(x,x.^3, 'r+' ,x,sin(x), 'b-' ,x,exp(x), 'g.' ) METHOD 2 using Hold on clear all x=linspace(0,1,101) plot(x,x^3, 'r*' ) hold on plot(x,sin(x), 'g.' ) hold on plot (x,exp(x), 'b+' ) If we remove hold on, only last graph will be displayed. METHOD 3 using subplot x=0:.1:2*pi; subplot(2,2,1); plot (x,sin(x)); subplot(2,2,2); plot(x,cos(x)); subplot(2,2,3); plot(x,exp(-x)); subplot(2,2,4); plot(x,sin(3*x)); Diffrentiation syms x y f=x^2+2*x*y+y*sin(x) diff(f,x) diff(f,y) f =2*x*y + y*sin(x) + x^2 ans = 2*x + 2*y + y*cos(x) ans = 2*x + sin(x) Integration syms x f=x^3 + 3*x^2 + 5*x + 12 int(f,x,0,2) f = x^3 + 3*x^2 + 5*x + 12 ans = 46 Plotting graph syms x f=sin(2*x)+ cos(3*x) ezplot(f) ...
Read more

PRACTICE PROBLEM 8

Image
PRACTICE PROBLEM 8 Verification of 'L' shaped arrangement of Coins on Game Board (Id-2435) Consider a nxn board game with four types of coins red, green, blue and yellow. Given the state of the board with coins in all cells, develop an algorithm and write a C program to check if the same coins are placed in ‘L’ shape on the board. The number of cells in the vertical and horizontal line of ‘L’ shape should be same and should be greater than 1. Red coins are represented by ‘r’, blue coins are represented by ‘b’, green coins are represented by ‘g’ and yellow coins are represented by ‘y’.  For example, given the configuration of a 4 X 4 board with coins as shown below, b r y r r r y b y r b b b r r r the program must print 'Yes'. As there is a 'L' shape as shown in the figure below. Input Format Number of rows, r Number of columns, c Next ‘r x c’ lines contains the elements in the matrix Elements in the matrix given row by row ...
Read more

Practice Problem 6-Isomorphic Numbers

ISOMORPHIC NUMBERS Given ‘n’ integers, write an algorithm and the subsequent Python code to print all numbers that are isomorphic to the first number. Two numbers with non-distinct (numbers in which digits get repeated) are said to be isomorphic if they have the same number of digits in it and the sets of positions  having the same  digits are equal.. For example: • 12321 is isomorphic to 83538 . Both the  numbers are of length five.  In 12321, positions 2 and 4 have the same digit 2, Positions 1 and 5 have same digit 1. Hence the set of positions having the same digit are {{1,5},{2,4}. Similarly , for the number 83538, the set of positions having the same digit is {{1,5}, {2,4}}. • 1232 is not isomorphic to 2342 because set of places having same digits for 1232 is {{2, 4}} and for 2342 is {{1, 4}} (digits are numbered from left to right starting from 1). • 12 is not isomorphic to 10. Write a function to check whether two  numbers are isomorphic....
Read more