How to resolve the algorithm String case step by step in the TUSCRIPT programming language
Published on 12 May 2024 09:40 PM
How to resolve the algorithm String case step by step in the TUSCRIPT programming language
Table of Contents
Problem Statement
Take the string alphaBETA and demonstrate how to convert it to:
Use the default encoding of a string literal or plain ASCII if there is no string literal in your language. Note: In some languages alphabets toLower and toUpper is not reversable. Show any additional case conversion functions (e.g. swapping case, capitalizing the first letter, etc.) that may be included in the library of your language.
Let's start with the solution:
Step by Step solution about How to resolve the algorithm String case step by step in the TUSCRIPT programming language
Source code in the tuscript programming language
$$ MODE TUSCRIPT,{}
string="alphaBETA"
lowercase =EXCHANGE(string," {&a} {-0-} ")
uppercase1=EXCHANGE(string," {&a} {-0+} ")
uppercase2=CAPS (string)
PRINT lowercase
PRINT uppercase1
PRINT uppercase2
You may also check:How to resolve the algorithm Bitcoin/address validation step by step in the Mathematica / Wolfram Language programming language
You may also check:How to resolve the algorithm Closest-pair problem step by step in the Crystal programming language
You may also check:How to resolve the algorithm Cuban primes step by step in the Perl programming language
You may also check:How to resolve the algorithm Date format step by step in the Rust programming language
You may also check:How to resolve the algorithm Sorting algorithms/Cocktail sort step by step in the J programming language