Removing all the punctuations from a string Program plan: Create a class StringBuilder to remove all the punctuation stored in a string. In main() function, Initially, assign the original string in variable. Then, invoke the removeIt()function to remove all the punctuation in a string and store the final value in original string. Display the string after removing the punctuation in console screen. In the method removeAt(), It passes input parameter “s” to check whether the character contains punctuation in the string. If yes, then it removes all the punctuation stored in the string “s”. For loop read all the characters from a sentence until the condition leads to false. Then, it calls the function ok() and check whether the character at “j” position matches with the character or not. If the result returns the Boolean value false, then delete the character at the specified position in “j” otherwise store the character using Tostring() method in “s” variable. In the method ok(), It passes input parameter “i” to check whether the character in the sentence matches with the corresponding ASCII values. If yes, then it returns the Boolean value true otherwise it return false.

Question

Want to see the full answer?

Answer 1

Question

Chapter 1, Problem 9R

Program Plan Intro

Removing all the punctuations from a string

Program plan:

Create a class StringBuilder to remove all the punctuation stored in a string.

In main() function,

Initially, assign the original string in variable.

Then, invoke the removeIt()function to remove all the punctuation in a string and store the final value in original string.

Display the string after removing the punctuation in console screen.

In the method removeAt(),

It passes input parameter “s” to check whether the character contains punctuation in the string. If yes, then it removes all the punctuation stored in the string “s”.

For loop read all the characters from a sentence until the condition leads to false.

Then, it calls the function ok() and check whether the character at “j” position matches with the character or not.

If the result returns the Boolean value false, then delete the character at the specified position in “j” otherwise store the character using Tostring() method in “s” variable.

In the method ok(),

It passes input parameter “i” to check whether the character in the sentence matches with the corresponding ASCII values.

If yes, then it returns the Boolean value true otherwise it return false.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

A3Q3.c - You are to write a C program that implements the following disk scheduling algorithms: a. FCFS [10 marks] b. SCAN [10 marks] c. C-SCAN [10 marks] d. SSTF [10 marks] e. LOOK [10 marks] f. C-LOOK [10 marks] • Your program will service a disk with 300 cylinders numbered 0 to 299. • • • • The program will service the requests (a list of 20 cylinder numbers) given in the file request.bin. This file contains (4 byte) integer values representing requests ranging from 0-299. Your program will take the initial position of the disk head as the first command line argument and the direction of the head as the second command line argument. It will then output the requests in the order in which they are serviced, and the total amount of head movements required by each algorithm. In particular, your program needs to do the following: Your program should take two command line arguments a) First command line argument - initial position of the disk head (an integer value) b) Second command line…

2. The memory management has contiguous memory allocation, dynamic partitions, and paging. Compare the internal fragmentation and external fragmentation for these three approaches. [2 marks] 3. Suppose we have Logical address space = 24 = 16 (m = 4), Page size=2² =4 (n = 2), Physical address space = 26 = 64 (r = 6). Answer the following questions: [4 marks] 1) Total # of pages ? 2) Total # of frames ? 3) Number of bits to represent logical address? 4) Number of bits to represent offset ? 5) Number of bits to represent physical address? 6) Number of bits to represent a page number? 7) Number of bits to represent a frame number / 4. What is translation look-aside buffers (TLBS)? Why we need them to implement the page table? [2 marks] 5. Why we need shared pages for multiple processes? Give one example to show the benefits. [2 marks] 6. How to implement the virtual memory by using page out and page in? Explain with an example. [2 marks] 7. We have a reference string of referenced page…

8. List three HDD scheduling algorithms. [2 marks] 9. True or False? The NVM has the same scheduling algorithms with HDD. Explain why? [2 marks] 10. Why the modern mouses use polling to detect movements instead of interrupts? [2 marks] 11. What is thrashing? How does it happen? [2 marks] 12. Given a reference string of page numbers 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1 and 4 frames show how the page replacement algorithms work, and how many page faults? [6 marks], 1) FIFO algorithm? [2 marks] 2) Optimal algorithm? [2 marks] 3) LRU algorithm? [2 marks] 13. List at least three file systems that you know. [2 marks] 14. In C programming, how the seek to a specific position in the file by offset? [2 marks]