Write code to print the location of any alphabetic character in the 2-character string passCode. Each alphabetic character detected should print a separate statement followed by a newline. Ex: If passCode is "9a", output is: Alphabetic at 1 Hint: Use two if statements to check each of the two characters in the string, using Character.isLetter().

Write code to print the location of any alphabetic character in the 2-character string passCode. Each alphabetic character detected should print a separate statement followed by a newline. Ex: If passCode is "9a", output is: Alphabetic at 1 Hint: Use two if statements to check each of the two characters in the string, using Character.isLetter().

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

Similar questions

älazJI dim n(10),p(150) as string ä dzas dim n(10),p(150) as string la
This function returns the length of a string.a. lengthb. sizec. lend. lengthof
Q2- Write a program to find the value of A (use switch statement): A=x+b when k-1 A=x-b when k-2 A-x*b when k-3 A-x/b when k-4 Note: x,b.k are numbers entered by the user.
a)Create a string variable and assign to it your favorite color. b) Write Matlab code that prompts the user to guess your favorite color. After the user has had 3 attempts, the program displays the message "Incorrect. You run out of chances!" and stops.
Design an algorithm or function to find the longest substring which contains 2 unique characters in a given string. You may list steps or psuedo code. Example: In the string "abaacacaacda" return "aacacaac"
Complete this function that produces a string from the given string with all blank spaces removed. Use new to allocate the result. (It is the caller's responsibility to delete the returned string.) Don't modify the original string. strings.cpp #include using namespace std; 1 2 3 char* no_blanks (const char* str) { int len = strlen(str); 4 char * result = . . int j = 0; for (int i = { if (str[i] != '') { 8 %3D 0; i < len; i++) 10 11 12 13 14 } } 15 16 17 return result; } 18 19 CodeCheck Reset
Program 1: Find whether two given strings are permutations of each other Write a program to find whether two given strings are permutations of each other. A string str1 is a permutation of str2 if all the characters in str1 appear the same number of times in str2 and str2 is of the same length as str1. Input: Two strings S1 and S2Output:yes - if they satisfy given criteriano - otherwise Constraints:1 <= len(S1), len(S2) <= 100.Characters from ASCII range 0 to 127.White space will not be given in the string.
Check a character is present in string or not if yes then how many times else print 0 and you have to take string and character from user.