String Manipulation and Palindrome-Anagram Exercises
Explore exercises on string manipulation, counting characters in a sentence, creating a diamond-shaped array based on a string's characters, checking palindrome strings, and detecting anagrams. Practice coding skills with these engaging challenges.
Download Presentation
Please find below an Image/Link to download the presentation.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author. Download presentation by click this link. If you encounter any issues during the download, it is possible that the publisher has removed the file from their server.
E N D
Presentation Transcript
Praktikum PBO String
Soal 1 Buatlah program untuk menghitung jumlah huruf dan angka dalam sebuah kalimat Kalimat : Keputih 78 A Jumlah huruf : 8 Jumlah angka : 2
Soal 2 Write a program that reads a string and then prints a diamond shaped array based on the characters of the string. As an example, if the string has the value "SAMPLE", then the program should print the pattern S SAS SAMAS SAMPMAS SAMPLPMAS SAMPLELPMAS SAMPLPMAS SAMPMAS SAMAS SAS S
Soal 3 A palindrome is a string that reads the same both forward and backward. Examples of palindromes are "radar" and "31413". (a) Write a boolean-valued method isPalindrome that has a single String parameter. The method should return true if and only if its parameter is a palindrome. (b) Modify your method so that it ignores cases of letters, punctuation marks, and blanks in making a decision about whether or not a string is a palindrome. For example, the string: "A man, a plan, a canal: Panama!" should be taken to be a palindrome. Write a program that prompts the user for a string and notifies the user if it is apalindrome.
Soal 4 Exercise: An anagram is a word or a phrase made by transposing the letters of another word or phrase; for example, "parliament" is an anagram of "partial men," and "software" is an anagram of "swear oft." Write a program that figures out whether one string is an anagram of another string. The program should ignore white space and punctuation. Example
