Process Step 1: For every unique vowel of a name, you need to get the first index of that vowel from the original string. Step 2: For each vowel index you get from step 1, you will get the unique consonant from that position. if the index is out of scope of the consonant array, ignore that vowel index. Step 3: For each unique consonant that you get from step 2, you need to get the first index of that consonant from the original string. Step 4: Get the value of indexception by adding all index you get from step 3.
Process Step 1: For every unique vowel of a name, you need to get the first index of that vowel from the original string. Step 2: For each vowel index you get from step 1, you will get the unique consonant from that position. if the index is out of scope of the consonant array, ignore that vowel index. Step 3: For each unique consonant that you get from step 2, you need to get the first index of that consonant from the original string. Step 4: Get the value of indexception by adding all index you get from step 3.
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
using Phython langugae
![1. Scenario
I want to create an INDEXCEPTION value of the unique vowels and unique consonants that the
name that was given to you can create.
Input
A string of the name that was GIVEN TO YOU. CASE SENSITIVE.
Process
Step 1: For every unique vowel of a name, you need to get the first index of that vowel from the
original string.
Step 2: For each vowel index you get from step 1, you will get the unique consonant from that
position. if the index is out of scope of the consonant array, ignore that vowel index.
Step 3: For each unique consonant that you get from step 2, you need to get the first index of
that consonant from the original string.
Step 4: Get the value of indexception by adding all index you get from step 3.
Output
TO BE DISPLAYED
- 2 lists that consists of unique vowels and unique consonants
- The vowel, the vowel index, the consonant, the consonant index
FINAL OUTPUT
- The total indexception value of the name that was given to you.
SAMPLE
Input
- "Marc Reinhard Canlas Ballon"
Output
Name: Marc Reinhard Canlas Ballon
Vowels: ['a', 'e', 'i', 'o']
Consonants: ['M', 'r, 'c', 'R', 'n', 'h', 'd', 'C, 'T', 's', 'B']
Vowel a : 1, Consonant r:2
Vowel e: 6, Consonant d: 12
Vowel i: 7, Consonant C: 14
Vowel o: 25, No consonant associated
Indexception Total: 28](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fba78c633-c5c9-47f8-9c10-49231027206a%2F8495715c-841c-4eb5-88d0-3bb6b3e602fc%2Fttnw8oh_processed.jpeg&w=3840&q=75)
Transcribed Image Text:1. Scenario
I want to create an INDEXCEPTION value of the unique vowels and unique consonants that the
name that was given to you can create.
Input
A string of the name that was GIVEN TO YOU. CASE SENSITIVE.
Process
Step 1: For every unique vowel of a name, you need to get the first index of that vowel from the
original string.
Step 2: For each vowel index you get from step 1, you will get the unique consonant from that
position. if the index is out of scope of the consonant array, ignore that vowel index.
Step 3: For each unique consonant that you get from step 2, you need to get the first index of
that consonant from the original string.
Step 4: Get the value of indexception by adding all index you get from step 3.
Output
TO BE DISPLAYED
- 2 lists that consists of unique vowels and unique consonants
- The vowel, the vowel index, the consonant, the consonant index
FINAL OUTPUT
- The total indexception value of the name that was given to you.
SAMPLE
Input
- "Marc Reinhard Canlas Ballon"
Output
Name: Marc Reinhard Canlas Ballon
Vowels: ['a', 'e', 'i', 'o']
Consonants: ['M', 'r, 'c', 'R', 'n', 'h', 'd', 'C, 'T', 's', 'B']
Vowel a : 1, Consonant r:2
Vowel e: 6, Consonant d: 12
Vowel i: 7, Consonant C: 14
Vowel o: 25, No consonant associated
Indexception Total: 28
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY