Java String Manipulation Tasks
Uploaded by
Abdullah AbeedJava String Manipulation Tasks
Uploaded by
Abdullah AbeedCommon questions
Powered by AITask7 identifies unique characters by checking each character from the first input string against all characters of the second string and vice versa. It constructs a result string containing characters that do not appear in the other string. The process utilizes nested loops to compare each character in one string with all characters in the other .
Task2 determines if an input string is a palindrome by first reversing the string and storing it in a variable 'rev'. It then compares 'rev' with the original string to see if they are identical, printing 'true' if they are and 'false' otherwise. This comparison checks if the string reads the same forwards and backwards .
The method used in Task2 and Task4 reverses strings by concatenating each character in reverse order. This approach is inefficient due to the use of string concatenation inside loops, which can lead to O(n^2) complexity due to repeated creation of new strings. Using a StringBuilder, which allows modifications in place, could optimize this to O(n), improving performance significantly .
In Task1, ASCII value manipulation is central for converting lower-case to upper-case letters by adjusting each character's value by 32. Changes in encoding, such as using UTF-16, could affect this logic as ASCII values might not apply, breaking the conversion logic since Unicode may alter character value mapping .
Task9 evaluates password strength based on five criteria: it must be at least 8 characters long and contain at least one upper-case letter, one lower-case letter, one digit, and one special character. The program iterates over the password, using conditional checks to set boolean flags for each criterion. A password is considered strong if all flags are true, indicated by a final conditional check .
Using Scanner for input reading allows for simple and effective user interaction. However, potential pitfalls include resource leaks if Scanner is not closed, and input mismatch exceptions if user inputs do not match expected formats. Also, Scanner's nextLine method reads input as strings only and might capture unexpected new line characters or be overridden by previous next or nextInt calls .
Task5 prints "Aaarr! Me Plunder!!" if the input string contains vowels and consonants such that the number of vowels is divisible by 3 and the number of consonants is divisible by 5. It counts vowels and consonants by iterating over each character and checking if it falls within the respective categories .
Task1 converts lower-case letters to upper-case by iterating through each character of the input string, checking if its ASCII value is between 97 and 122 (the range for lower-case letters). If so, it subtracts 32 from the ASCII value to convert it to its corresponding upper-case character. This subtraction works because in the ASCII table, the difference between upper and lower-case letter values is consistently 32 .
Similar to Task2, Task4 reverses the input string by iterating from the last character to the first and appending each character to a new string 'rev'. However, it differs because Task4 does not compare the reversed string to the original; it simply outputs the reversed string without additional checks for palindrome properties .
Nested loops in Task7 allow every character of the first string to be compared against every character of the second string. The outer loop iterates over characters of one string, while the inner loop enables checking each against characters in the second. This exhaustive traversal ensures all unique characters can be identified by the result of the absence within each comparison .
