EBK STARTING OUT WITH PROGRAMMING LOGIC
EBK STARTING OUT WITH PROGRAMMING LOGIC
4th Edition
ISBN: 8220100659386
Author: GADDIS
Publisher: PEARSON
Question
Book Icon
Chapter 12, Problem 2AW
Program Plan Intro

Character testing library functions:

  • Library functions other than the string library functions are provided by programming language, which are intended to work with single characters.
  • The support library functions are used for testing the value of the character.
  • The function will return the Boolean result on testing; the result will be in “True” or “False” format.

isUpper(character):

  • This function is used to validate whether the character given is upper case letter.
    • The function will return “True” if the character is in upper case.
    • The function will return “False” if the character is in lower case.

isLower(character):

  • This function is used to validate whether the character given is lower case letter.
    • The function will return “True” if the character is in lower case.
    • The function will return “False” if the character is in upper case.

Example:

The below algorithm determines whether the first character in the string is in lower case and the present is in lower case, the character gets replaced by “0”.

//determine if the first character is in lower case

If isLower(str[0]) Then

//replace the values present at the first position

Set str [0] = "0"

//end if

End If

Explanation:

  • If condition validates the first position of the “str” is in lower case or not.
  • If the condition becomes true, the character at positon “0” gets replaced with the character “0”.

Algorithm:

  • Declare and define a string variable “str”.
  • Declare and define the required variables for storing index and count of lower case letters.
  • Loop that iterates for the entire string.
  • Condition to validate whether the given string contains lower case.
  • On true add the lower case character count by 1.
  • Display the count.

Blurred answer
Students have asked these similar questions
Considering the TM example of binary sum ( see attached)do the step-by-step of execution for the binary numbers 1101 and 11. Feel free to use the Formal Language Editor Tool to execute it; Write it down the current state of the tape (including the head position) and indicate the current state of the TM at each step.
I need help on inculding additonal code where I can can do the opposite code of MatLab, where the function of t that I enter becomes the result of F(t), in other words, turning the time-domain f(t) into the frequency-domain function F(s):
I need help with the TM computation step-by-step execution for the binary numbers 1101 and 11.  Formal Language Editor Tool can be used to execute it; Write it down the current state of the tape (including the head position) and indicate the current state of the TM at each step;

Chapter 12 Solutions

EBK STARTING OUT WITH PROGRAMMING LOGIC

Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781337671385
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT
Text book image
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage
Text book image
C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr
Text book image
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
Text book image
Microsoft Visual C#
Computer Science
ISBN:9781337102100
Author:Joyce, Farrell.
Publisher:Cengage Learning,
Text book image
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning