Capital - Small = ?Code in C language main.c+Custom InputOutputTestsExecutions2. Capital - Small = ?1by Jemar Jude MarangaCE Run TestsGiven a string that's guaranteed to only have alphabetical and space characters,compute for the difference between the number of capital letters and theTest Casesnumber of small letters and the print that difference.O Test Case 1InputInputA single line containing a string.Enter SampleEnter SampleYourNo OutputOutputOutputExpected-7OutputA single line containing the difference-7O Test Case 2O Test Case 3O Test Case 4 HiddenO Test Case 5 HiddenO Test Case 6 Hidden

Find the required code in C given as below and output:

main.c 2. Capital - Small = ? by Jemar Jude Maranga Given a string that's guaranteed to only have alphabetical and space characters, compute for the difference between the number of capital letters and the number of small letters and the print that difference. Input A single line containing a string. Enter Sample Output A single line containing the difference -7

main.c 2. Capital - Small = ? by Jemar Jude Maranga Given a string that's guaranteed to only have alphabetical and space characters, compute for the difference between the number of capital letters and the number of small letters and the print that difference. Input A single line containing a string. Enter Sample Output A single line containing the difference -7

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Capital - Small = ?

Code in C language

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step 3

VIEW

Step by step

Solved in 3 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Section Test of Application... Note: You need to press "Final Submit" for your pr Given a string in which the same character occurs in many.consecutive character elements. Your task is to find the characters that have even frequency and are consecutive. Display the sum of every frequency count (For even frequency only). Example1: Input aaabbaccccdd Input String Output: Explanation: Input string "aabbaccccdd" contains 'a' 3 times, b' 2 times, again 'a' 1 time, 'c' 4 times, and 'd 2 times Here, the frequency of b.c and d is even and the frequency count is 2,4 and 2 respectively. Hence the output32-4-2%3D8 Example2: input: vdkkmmmnn Output Buns andur-
Create a string from two given strings by concatenating common characters of the given strings. Sample Input harry, hermione dean, tom Sample Output hrrhr Nothing in common. Again, you have lost your USIS password!! You went to the registrar office and requested for a new password. This time, you need to follow some rules to set your password. Otherwise, they won't change it. The rules are At least one lowercase letter At least one uppercase letter At least one digit (0-9) At least one special character (_ , $ , #, @) Your task is to find whether a given password follows all those rules. If it breaks any rule, you have to print Lowercase Missing, Uppercase Missing, Digit Missing or Special Missing respective to the missing case. For more than one rule break, print all the rules that were broken (order doesn't matter). If the password is ok, print OK. Sample Input ohMyBR@CU ohmybracu OhMyBR@CU20 Sample Output Digit missing Uppercase character missing,…
Lab Task 04: Include the methods in the file KMP_Implementation.txt in a complete Java program that prompts for and reads a text string and then a text pattern to search for in the text. It then displays the result of the search. Sample program runs: Enter the text: ABABСАВАВАВСАВАВСАВАВСАВАВКККАВАВСАВАВ Enter the pattern to search for: ABABCABAB Pattern found at these text starting indexes: 0 Enter the text: A KFUPM STUDENT Enter the pattern to search for: KFE Pattern not in text. 7 12 17 29
public static String pancakeScramble(String text) This nifty little problem is taken from the excellent Wolfram Challenges problem site where you can also see examples of what the result should be for various arguments. Given a text string, construct a new string by reversing its first two characters, then reversing the first three characters of that, and so on, until the last round where you reverse your entire current string
Determine if a string contain atleast 1 sandwich string. A sandwich string is a string with atleast 3 characters with first and last character being equal and the middle characters are all the same but not equal to the first and last characters. Print "True" if there is atleast one sandwich string, and False otherwise. Example: poooop - "True" holololaa - "True" Image - "False" Note: do not use def function in the program.
Create a program that will accept any stringthat the user wanted to input. The program will segregate and display the letters in odd-places(1st, 3rd, 5th, ...) and even-places(2nd, 4th, 6th, ....) of the string. For example, the input string is “ArraysAndStrings”, the program will display the letters in odd-place as “AryAdtig” and in even-place “rasnSrns”.(C Language)
Prompt for the user to enter their name. Print out their name forwards, backwards, vertically-forwards and vertically-backwards. You will need to declare a String variable, use Scanner to get input of a String, call a String method to isolate one letter and create a loop that traverses the name forwards and backwards. Sample Output: Enter your name: Florene Florene enerolF F l o r e n e e n e r o l F HINTS: Scanner input = new Scanner(System.in); String myName = input.nextLine(); // input is a Scanner object int len = myName.length() // len is the number of characters System.out.println (myName.substring(len-1, len)); // prints last letter I need help with coding the name "Pooja" vertically-forwards and vertically-backwards in java. If you could show me what codes to type in, that would be great. Thank you!
A. Which statement about regular expressions is correct? a. To find all occurrences of a matching substring for a regular expression, you must add thegflag. b. By default, pattern matching using regular expressions locates all matches in the searched string. c. To find all occurrences of a matching substring for a regular expression, you must add theiflag. d. The default behavior of a regular expression is modified by adding flags to the beginning of the expression. B. After the following JavaScript statements execute, the value ofcrayonsis["pink", "blue", "green"]. let crayons = ["pink", "purple"];crayons.shift();crayons.unshift("blue", "green"); Select one: True False
3. In a given string, there will be two uppercase letters in between some lowercase letters. Print the substring from the first uppercase letter to the last uppercase letter excluding them. If there are no letters in between them, print the word BLANK. It is guaranteed that there will be only two uppercase letters in the string. Sample Input baNgladEsh coDIng Sample Output glad BLANK
The countSubstring function will take two strings as parameters and will return an integer that is the count of how many times the substring (the second parameter) appears in the first string without overlapping with itself. This method will be case insensitive. For example: countSubstring(“catwoman loves cats”, “cat”) would return 2 countSubstring(“aaa nice”, “aa”) would return 1 because “aa” only appears once without overlapping itself. public static int countSubstring(String s, String x) { if (s.length() == 0 || x.length() == 0) return 1; if (s.length() == 1 || x.length() == 1){ if (s.substring(0,1).equals(x.substring(0,1))){ s.replaceFirst((x), " "); return 1 + countSubstring(s.substring(1), x); } else { return 0 + countSubstring(s.substring(1), x); } } return countSubstring(s.substring(0,1), x) + countSubstring(s.substring(1), x); } public class Main { public static void main(String[] args) { System.out.println(Recursion.countSubstring("catwoman loves cats","cat"));…
Read string integer value pairs from input until "Done" is read. For each string read: • If the following integer read is less than 40, output the string followed by ": low on stock". • Otherwise, output the string followed by ": well stocked". End each output with a newline. Ex: If the input is Oven 43 Curtain 7 Pillow 1 Done, then the output is: Oven: well stocked Curtain: low on stock Pillow: low on stock 1 #include 2 #include 3 using namespace std; 4 5 int main() { 6 7 8 9 10 } * Your code goes here */ return 0;
Write a program that asks the user to enter a string, and then converts that string to Morse code. Use hyphens for dashes and periods for dots. Morse Code Table Character Code Character Code Character Code Character Code space space 6 - . . . . G --. Q --.- comma --..-- 7 -- . . . H . . . . R .-. period .-.-.- 8 ---.. I .. S . . . question mark ..--.. 9 ----. J .--- T - 0 ----- A .- K -.- U ..- 1 .---- B - . . . L .-.. V . . . - 2 ..--- C -.-. M -- W .-- 3 . . . -- D -.. N -. X -..- 4 . . . .- E . O --- Y -.-- 5 . . . .. F ..-. P .--. Z --..