Create a program that converts numbers to characters, C/C++ Programming

Assignment Help:

People sometimes give their phone numbers using one or more alphabetic characters. Create a program that converts the alphabetic characters to their corresponding numbers. For example an entry of NUMBER1 or number1 should return 686-2371. Assume only a 7-charcter entry can be input. Your output should be in the format XXX-XXXX. Below is the translation table from alphabet to number.

ABC: 2

DEF: 3

GHI: 4

JKL: 5

MNO: 6

PQRS: 7

TUV: 8

WXYZ: 9

Related Discussions:- Create a program that converts numbers to characters

Explain syntax rules for writing constructor functions, Syntax rules for wr...

Syntax rules for writing constructor functions Its name must be similar as that of the class to which it belongs. It is declared with no return type (not even void). Ho

Developing programs in the c++ programming language., I. COURSE DESCRIPTION...

I. COURSE DESCRIPTION Develops a working knowledge of object-oriented concepts in areas of classes, inheritance, data structures, error handling, templates and file processing.

Least cost method, c program to implement least cost method

c program to implement least cost method

Minimum shelf, #At a shop of marbles, packs of marbles are prepared. Packet...

#At a shop of marbles, packs of marbles are prepared. Packets are named A, B, C, D, E …….. All packets are kept in a VERTICAL SHELF in random order. Any numbers of packets with the

Luminous jewels polishing necklace, 1.jewels can only be removed for polish...

1.jewels can only be removed for polishing from either end of the necklace. 2.cost of polishing=sitting number*colour value of jewels.

Linear iterative process, (a) Write a recursive procedure (digits n) that c...

(a) Write a recursive procedure (digits n) that computes the number of digits in the integer n using a linear recursive process. For example, (digits 42) should return 2 and (digit

Write the recursive bisection root finding function, Rewrite the recursive...

Rewrite the recursive bisection root finding function from lecture to be iterative (using a while loop). The function declaration should be root = bisectIter(f,a,b,tol). The input

#rotation, #write code for rotation in c

#write code for rotation in c

Derived data type, Derived Data Type: Array is derived data type to sto...

Derived Data Type: Array is derived data type to store large collection of data of only one data type. int mark[100]; char names[25]; Function: will be discussed early

Stone Game - Remove Last, #include int main() { int T; ...

#include int main() { int T; int N; int i; scanf("%d",&T)

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages