The following problem refers to strings in A, B, ..., Z.

Mathematics
Tutor: None Selected Time limit: 1 Day

Jun 21st, 2015

Thank you for the opportunity to help you with your question! the solution is as such:

the no of strings that begin with S can be shown as such: s_ _ _ .

now in these three blank spaces we can place any of  the 26 alphabets (A,B,C......Z) at each place, so the no. of ways using permutation is 26* 26*26=  17576

Please let me know if you need any clarification. I'm always happy to answer your questions.awaiting a positive feedback. thank you.
Jun 21st, 2015

Studypool's Notebank makes it easy to buy and sell old notes, study guides, reviews, etc.
Click to visit
The Notebank
...
Jun 21st, 2015
...
Jun 21st, 2015
Feb 26th, 2017
check_circle
Mark as Final Answer
check_circle
Unmark as Final Answer
check_circle
Final Answer

Secure Information

Content will be erased after question is completed.

check_circle
Final Answer