Alpha Geek

(8)

$10/per page/Negotiable

About Alpha Geek

Levels Tought:
University

Expertise:
Accounting,Algebra See all
Accounting,Algebra,Architecture and Design,Art & Design,Biology,Business & Finance,Calculus,Chemistry,Communications,Computer Science,Environmental science,Essay writing,Programming,Social Science,Statistics Hide all
Teaching Since: Apr 2017
Last Sign in: 371 Weeks Ago, 3 Days Ago
Questions Answered: 9562
Tutorials Posted: 9559

Education

  • bachelor in business administration
    Polytechnic State University Sanluis
    Jan-2006 - Nov-2010

  • CPA
    Polytechnic State University
    Jan-2012 - Nov-2016

Experience

  • Professor
    Harvard Square Academy (HS2)
    Mar-2012 - Present

Category > Programming Posted 29 May 2017 My Price 3.00

Write a complete program using two arrays, upper and lower to keep the upper

Write a complete program using two arrays, upper and lower to keep the upper

and lower alphabet respectively.

Ask the user to enter string example:

This is a test from Jupiter. Soon you will see who is from Jupiter!!! May be Dr. D.

Your program should parse the string and keep track of number of alphabet. Both arrays are indexed from 0 to 25. The logical way to do this is to use upper[0] to

Count the number of A????1AA????1, and upper[1] to count number of A????1BA????1 and so on. Likewise

for the lower array.

Output should look like:

A: 0            a:2

B: 0              b:0

A????1.

Answers

Alpha Geek
(8)
Status NEW Posted 29 May 2017 09:05 AM My Price 3.00

-----------

Attachments

file 1496050408-Answer.docx preview (23 words )
#-----------inc-----------lud-----------e &-----------amp-----------;lt-----------;st-----------dio-----------.h&-----------amp-----------;gt-----------; -----------#in-----------clu-----------de -----------&am-----------p;l-----------t;s-----------tdl-----------ib.-----------h&a-----------mp;-----------gt;----------- i-----------nt -----------mai-----------n()----------- {----------- i-----------nt -----------upp-----------er[-----------26]-----------,lo-----------wer-----------[26-----------]; ----------- in-----------t i-----------; -----------for-----------(i=-----------0;i-----------&am-----------p;l-----------t;2-----------6;i-----------++)----------- u-----------ppe-----------r[i-----------]=l-----------owe-----------r[i-----------]=0-----------; -----------cha-----------r c-----------; -----------pri-----------ntf-----------(&q-----------uot-----------;En-----------ter----------- a -----------str-----------ing-----------:\n-----------&qu-----------ot;-----------); ----------- wh-----------ile-----------((c-----------=ge-----------tch-----------ar(-----------))!-----------='\-----------n')----------- {----------- i-----------f(c-----------&am-----------p;g-----------t;=-----------'a'----------- &a-----------mp;-----------amp-----------;&a-----------mp;-----------amp-----------; c-----------&am-----------p;l-----------t;=-----------'z'-----------) -----------{ l-----------owe-----------r[c------------'a-----------']+-----------+; -----------} -----------els-----------e i-----------f(c-----------&am-----------p;g-----------t;=-----------'A'----------- &a-----------mp;-----------amp-----------;&a-----------mp;-----------amp-----------; c-----------&am-----------p;l-----------t;=-----------'Z'-----------) -----------{ u-----------ppe-----------r[c------------'A-----------']+-----------+; -----------} -----------} -----------pri-----------ntf-----------(&q-----------uot-----------;\n-----------Cha-----------rac-----------ter-----------s C-----------oun-----------ted-----------\n&-----------quo-----------t;)-----------;
Not Rated(0)