case study in programming please..
please help me, here's the problem,
CASE STUDY
The user will input a sentence. Your program will determine the longest word/s.
Example:
Input: Life is so beautiful
Output: beautiful
Input: The quick brown fox jumps over the lazy dog.
Output: quick, brown, jumps
B. ALPHABETICAL ORDER
The user will input 10 words with maximum 15 characters. Your program will arrange the words alphabetically.
Example:
Input1: massage
Input2: message
Input3: mass
Input4: abraded
Input5: waxing
Input6: elephant
Input7: loops
Input8: laugh
Input9: yacht
Input10: rosy
Output:
Alphabetical Order: abraded elephant laugh loops mass massage message rosy waxing yacht
C. TEXT MESSAGING
The user will input a regular message or text. Your program will convert it into text message with the following rules:
1. if the word starts with ‘qu’ or ‘c’, convert it to ‘kw’ or ‘k’ respectively
ex. quit kwit
cast kast
2. if the word contains “ee” consecutively, change to ‘i’
ex. meet mit
3. if the word end with ‘y’, change to ‘i’
ex. jury juri
4. if the word contains vowel followed by a consonant, eliminate the vowel
ex. text txt
5. if the word contains with “ate”, change it to ‘8’; and contains with “ite”, change ‘i’ to ‘y’ and eliminate ‘e’.
ex. mates m8
category k8gori
site syt
liter lytr
6. if the word contains same letter consecutively, eliminate one of it; if word contains “eas” change to “is” eliminate the next letter if vowel
ex. mass mas
mirror mirror
lease lis
pleasant plisnt
measure misr
7. if the word contains “ote”, change it to “ow” and eliminate ‘e’; if word contains “at”, “ot” or “ut” change to ‘@’
ex. quote kowt
emote emowt
hotshot h@sh@
8. if the word contains “oo”, change to ‘u’; if word contains “ex” or “ix”, change to ‘x’; if word contains “el” or “il”, change to ‘l’ if not in front of the word
ex. book buk
expert xprt
gel gl
illness ilnes
9. if the word contains “ck”, change to ‘k’; if word contains “sh” change to “sy”; if word contains “ou” change to “aw”; if word contains “ks”, “cts” change to ‘x’
ex. quick kwik
checker chekr
shoot syut
loud lawd
licks lix
insects nsex
10. if the word contains “the”,”tha”, “da”, “de” or “di”, change to ‘d’; if word contains “if” or “ef” change to ‘f’ if not in front of the word and will not follow by ‘e’, otherwise change to ‘y’ and eliminate ‘e’
ex. delimiter dlimitr
there dr
radar radr
radix radx
effects efex
lift lft
life lyf
11. if the word contains “ove”, change ‘o’ to ‘u’ and eliminate ‘e’; if word contains “ar” , “ur”, or “er” change to ‘r’; if word contains “to”, “too” or “tu” change to ‘2’; if contains “wan”, “won” change to ‘1’; if “tre”, “tree” change to ‘3’; if “for”, “fore”, “fur” change to ‘4’
ex. love luv
discover dskuvr
12. if the word contains “is” or “es”, change to ‘s’; if contains “be”, “bee” or “bi”, change to ‘b’ if the letter after it is consonant, otherwise, change it to “by”; if contains “ti”, “te” or “ty” change to ‘t’ if the word is not ends on it, otherwise, change to “ti”; if contains “yo” or “yu”, change to ‘u’; if contains “ey” or “ay”, change to ‘i’; if contains “in” or “en”, change to ‘n’
ex. beautiful byutful
beauty byuti
miss, mess ms
message msg
binary bnari
bending bndng
your ur
embryo mbru
13. if word contains numbers change to digit
ex. times three tyms 3
14. eliminate all the vowels in the word if not in the above rule if not one syllable word
ex. eliminate elmn8
make make
Example:
Input: the quick brown fox jumps over the lazy dog
Output: d kwik brwn fx jmps ovr d lzy dog
Input: life is so beautiful
Output: lyf s so butful
Input: I love you
Output: I luv u
Input: one moment please
Output: 1 mmnt plis
Input: Later than the sunset, later than the rain.
Output: L8r dn d snst, l8r dn d rain
note: one translated text applies one or more rule/s
II. ARRAY
A. MULTIPLICATION TABLE
Your program will output a 10x10 multiplication table.
B. SUPPLY IT!
Your program will have a 3x3 array. The user will input the sum of each row and each column. Then the user will input 3 values and store them anywhere, or any location or index, temporarily in the array. Your program will supply the remaining six (6) values and determine the exact location of each value in the array.
Example:
Input: Sum of row 1: 6
Sum of row 2: 15
Sum of row 3: 24
Sum of column 1: 12
Sum of column 2: 15
Sum of column 3: 18
Value 1: 3
Value 2: 5
Value 3: 6
Output: Sum of Row
1 2 3 6
4 5 6 15
7 8 9 24
Sum of column
12 15 18
Note: Your program will not necessary sort the values in the array.
C. FIND ME!
The user will input 15 different integer numbers. Your program will find if the input number is already existing or inputted in the array, otherwise your program will ask another value. Then the user will input another number. Your program will find the nearest value/s in the array.
Example:
Input value 1: 13
Input value 2: 18
Input value 3: –9
Input value 4: 1
Input value 5: 0
Input value 6: 15
The number already exists!
Input value 6: 10
Input value 7: –34
Input value 8: 76
Input value 9: 8
Input value 10:100
The number already exists!
Input value 10: –7
Input value 11: 25
Input value 12: 37
Input value 13: 49
Input value 14: 45
Input value 15: –20
Input number to find: 17
Output:
18
Input number to find: 76
Output:
The number is existing.
Input number to find: 47
Output:
45, 49
III. GAME
A. BANTUMI
Your program will simulate a bantumi or “sungka” game. The logic of your program will be based on the manual game of bantumi and not on cell phone game.
B. TIC, TAC, TOE
Your program will simulate a tic-tac-toe game. The logic of your program will be based on the manual game of tic-tac-toe.
C. GUESSING GAME
Your program will initialize the word/s, with maximum of 20 characters, that your user will be guessed and will show only asterisks (*) on the screen. Your program will display also the clue/s for the mystery word/s. The user will input or enter one character at a time. And for every correct character, the asterisk will be replaced by that character until all the characters or the mystery word/s will reveal. Your program will accept a maximum three (3) errors or mistakes in entering/inputting character otherwise the mystery word/s will be viewed. Be sure that you have different clues or definitions for your mystery word/s.
Example:
Your mystery word/s: science (this will not be show on the screen)
Output: *******
Clue: knowledge attained through study or practice
Enter your character: e
Output: ***e**e
Clue: knowledge covering general truths of the operation of general laws
Enter your character: a
Output: sorry! the character is not existing. you still have
2 chances.
Clue: refers to a system of acquiring knowledge
Enter your character: s
Output: s**e**e
Clue: the purpose of it is to produce useful models of reality
Enter your character: x
Output: sorry! the character is not existing. you still have
1 chance.
Clue: refers to the organized body of knowledge people have gained using that system
Enter your character: c
Output: sc*e*ce
Clue: the purpose of it is to produce useful models of reality
Enter your character: p
Output: sorry! the character is not existing. game over!
Final Output: science
please reply! thanks!
CASE STUDY
The user will input a sentence. Your program will determine the longest word/s.
Example:
Input: Life is so beautiful
Output: beautiful
Input: The quick brown fox jumps over the lazy dog.
Output: quick, brown, jumps
B. ALPHABETICAL ORDER
The user will input 10 words with maximum 15 characters. Your program will arrange the words alphabetically.
Example:
Input1: massage
Input2: message
Input3: mass
Input4: abraded
Input5: waxing
Input6: elephant
Input7: loops
Input8: laugh
Input9: yacht
Input10: rosy
Output:
Alphabetical Order: abraded elephant laugh loops mass massage message rosy waxing yacht
C. TEXT MESSAGING
The user will input a regular message or text. Your program will convert it into text message with the following rules:
1. if the word starts with ‘qu’ or ‘c’, convert it to ‘kw’ or ‘k’ respectively
ex. quit kwit
cast kast
2. if the word contains “ee” consecutively, change to ‘i’
ex. meet mit
3. if the word end with ‘y’, change to ‘i’
ex. jury juri
4. if the word contains vowel followed by a consonant, eliminate the vowel
ex. text txt
5. if the word contains with “ate”, change it to ‘8’; and contains with “ite”, change ‘i’ to ‘y’ and eliminate ‘e’.
ex. mates m8
category k8gori
site syt
liter lytr
6. if the word contains same letter consecutively, eliminate one of it; if word contains “eas” change to “is” eliminate the next letter if vowel
ex. mass mas
mirror mirror
lease lis
pleasant plisnt
measure misr
7. if the word contains “ote”, change it to “ow” and eliminate ‘e’; if word contains “at”, “ot” or “ut” change to ‘@’
ex. quote kowt
emote emowt
hotshot h@sh@
8. if the word contains “oo”, change to ‘u’; if word contains “ex” or “ix”, change to ‘x’; if word contains “el” or “il”, change to ‘l’ if not in front of the word
ex. book buk
expert xprt
gel gl
illness ilnes
9. if the word contains “ck”, change to ‘k’; if word contains “sh” change to “sy”; if word contains “ou” change to “aw”; if word contains “ks”, “cts” change to ‘x’
ex. quick kwik
checker chekr
shoot syut
loud lawd
licks lix
insects nsex
10. if the word contains “the”,”tha”, “da”, “de” or “di”, change to ‘d’; if word contains “if” or “ef” change to ‘f’ if not in front of the word and will not follow by ‘e’, otherwise change to ‘y’ and eliminate ‘e’
ex. delimiter dlimitr
there dr
radar radr
radix radx
effects efex
lift lft
life lyf
11. if the word contains “ove”, change ‘o’ to ‘u’ and eliminate ‘e’; if word contains “ar” , “ur”, or “er” change to ‘r’; if word contains “to”, “too” or “tu” change to ‘2’; if contains “wan”, “won” change to ‘1’; if “tre”, “tree” change to ‘3’; if “for”, “fore”, “fur” change to ‘4’
ex. love luv
discover dskuvr
12. if the word contains “is” or “es”, change to ‘s’; if contains “be”, “bee” or “bi”, change to ‘b’ if the letter after it is consonant, otherwise, change it to “by”; if contains “ti”, “te” or “ty” change to ‘t’ if the word is not ends on it, otherwise, change to “ti”; if contains “yo” or “yu”, change to ‘u’; if contains “ey” or “ay”, change to ‘i’; if contains “in” or “en”, change to ‘n’
ex. beautiful byutful
beauty byuti
miss, mess ms
message msg
binary bnari
bending bndng
your ur
embryo mbru
13. if word contains numbers change to digit
ex. times three tyms 3
14. eliminate all the vowels in the word if not in the above rule if not one syllable word
ex. eliminate elmn8
make make
Example:
Input: the quick brown fox jumps over the lazy dog
Output: d kwik brwn fx jmps ovr d lzy dog
Input: life is so beautiful
Output: lyf s so butful
Input: I love you
Output: I luv u
Input: one moment please
Output: 1 mmnt plis
Input: Later than the sunset, later than the rain.
Output: L8r dn d snst, l8r dn d rain
note: one translated text applies one or more rule/s
II. ARRAY
A. MULTIPLICATION TABLE
Your program will output a 10x10 multiplication table.
B. SUPPLY IT!
Your program will have a 3x3 array. The user will input the sum of each row and each column. Then the user will input 3 values and store them anywhere, or any location or index, temporarily in the array. Your program will supply the remaining six (6) values and determine the exact location of each value in the array.
Example:
Input: Sum of row 1: 6
Sum of row 2: 15
Sum of row 3: 24
Sum of column 1: 12
Sum of column 2: 15
Sum of column 3: 18
Value 1: 3
Value 2: 5
Value 3: 6
Output: Sum of Row
1 2 3 6
4 5 6 15
7 8 9 24
Sum of column
12 15 18
Note: Your program will not necessary sort the values in the array.
C. FIND ME!
The user will input 15 different integer numbers. Your program will find if the input number is already existing or inputted in the array, otherwise your program will ask another value. Then the user will input another number. Your program will find the nearest value/s in the array.
Example:
Input value 1: 13
Input value 2: 18
Input value 3: –9
Input value 4: 1
Input value 5: 0
Input value 6: 15
The number already exists!
Input value 6: 10
Input value 7: –34
Input value 8: 76
Input value 9: 8
Input value 10:100
The number already exists!
Input value 10: –7
Input value 11: 25
Input value 12: 37
Input value 13: 49
Input value 14: 45
Input value 15: –20
Input number to find: 17
Output:
18
Input number to find: 76
Output:
The number is existing.
Input number to find: 47
Output:
45, 49
III. GAME
A. BANTUMI
Your program will simulate a bantumi or “sungka” game. The logic of your program will be based on the manual game of bantumi and not on cell phone game.
B. TIC, TAC, TOE
Your program will simulate a tic-tac-toe game. The logic of your program will be based on the manual game of tic-tac-toe.
C. GUESSING GAME
Your program will initialize the word/s, with maximum of 20 characters, that your user will be guessed and will show only asterisks (*) on the screen. Your program will display also the clue/s for the mystery word/s. The user will input or enter one character at a time. And for every correct character, the asterisk will be replaced by that character until all the characters or the mystery word/s will reveal. Your program will accept a maximum three (3) errors or mistakes in entering/inputting character otherwise the mystery word/s will be viewed. Be sure that you have different clues or definitions for your mystery word/s.
Example:
Your mystery word/s: science (this will not be show on the screen)
Output: *******
Clue: knowledge attained through study or practice
Enter your character: e
Output: ***e**e
Clue: knowledge covering general truths of the operation of general laws
Enter your character: a
Output: sorry! the character is not existing. you still have
2 chances.
Clue: refers to a system of acquiring knowledge
Enter your character: s
Output: s**e**e
Clue: the purpose of it is to produce useful models of reality
Enter your character: x
Output: sorry! the character is not existing. you still have
1 chance.
Clue: refers to the organized body of knowledge people have gained using that system
Enter your character: c
Output: sc*e*ce
Clue: the purpose of it is to produce useful models of reality
Enter your character: p
Output: sorry! the character is not existing. game over!
Final Output: science
please reply! thanks!
Topic archived. No new replies allowed.