You are to write a C program that searches through the an array that contains a sequence of numbers in an and that a end with the number zero. That array should be declared and initialized exactly as follows in your program: int DNA[] = {1, 2, 4, 2, 2, 2, 1, 4, 4, 2, 3, 4, 4, 4, 2, 1, 4, 1, 3, 3, 2, 1, 3, 2, 1, 1, 2, 2, 2, 3, 4, 1, 3, 1, 2, 1, 4, 4, 4, 1, 1, 3, 1, 4, 2, 4, 4, 1, 4, 4, 1, 4, 4, 4, 4, 1, 1, 2, 3, 3, 3, 3, 4, 4, 3, 2, 3, 2, 3, 4, 3, 3, 4, 4, 1, 3, 3, 2, 1, 2, 3, 1, 2, 1, 3, 3, 2, 1, 4, 1, 4, 3, 4, 4, 4, 1, 2, 1, 3, 2, 0}; Your program should repeatedly ask the user for two things: the length of a search sequence, and the search sequence itself. The program should then search through the array “DNA” to find the starting element subscript (index) of all possible matching sequences. The elements of the search sequence may take on one of five characters: 1,2,3,4 and 5. The meaning of the ‘5’ character is that of wild card, i.e. it matches 1,2,3 and 4. The program should terminate when the length of the input sequence is zero or less. If the input search sequence contains a character other than 1 to 5, the program should report the error and terminate, as shown in the examples below. You can assume that only numbers will be input, i.e. no non-numeric characters. Your program must make use of at least two functions outside of the main function - one to read in the search string from the user, and one to do the actual searching. In the sample output examples that follow, the user input appears after the colon character (‘:’) and is followed by the enter key. (These are not displayed in bold as in previous labs) Note that there is a single space after the colon (:) in each output line.
You are to write a C program that searches through the an array that contains a sequence of numbers in an and that a end with the number zero. That array should be declared and initialized exactly as follows in your program: int DNA[] = {1, 2, 4, 2, 2, 2, 1, 4, 4, 2, 3, 4, 4, 4, 2, 1, 4, 1, 3, 3, 2, 1, 3, 2, 1, 1, 2, 2, 2, 3, 4, 1, 3, 1, 2, 1, 4, 4, 4, 1, 1, 3, 1, 4, 2, 4, 4, 1, 4, 4, 1, 4, 4, 4, 4, 1, 1, 2, 3, 3, 3, 3, 4, 4, 3, 2, 3, 2, 3, 4, 3, 3, 4, 4, 1, 3, 3, 2, 1, 2, 3, 1, 2, 1, 3, 3, 2, 1, 4, 1, 4, 3, 4, 4, 4, 1, 2, 1, 3, 2, 0}; Your program should repeatedly ask the user for two things: the length of a search sequence, and the search sequence itself. The program should then search through the array “DNA” to find the starting element subscript (index) of all possible matching sequences. The elements of the search sequence may take on one of five characters: 1,2,3,4 and 5. The meaning of the ‘5’ character is that of wild card, i.e. it matches 1,2,3 and 4. The program should terminate when the length of the input sequence is zero or less. If the input search sequence contains a character other than 1 to 5, the program should report the error and terminate, as shown in the examples below. You can assume that only numbers will be input, i.e. no non-numeric characters. Your program must make use of at least two functions outside of the main function - one to read in the search string from the user, and one to do the actual searching. In the sample output examples that follow, the user input appears after the colon character (‘:’) and is followed by the enter key. (These are not displayed in bold as in previous labs) Note that there is a single space after the colon (:) in each output line.
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
You are to write a C program that searches through the an array that contains a sequence of numbers in an and that a end with the number zero. That array should be declared and initialized exactly as follows in your program:
int DNA[] = {1, 2, 4, 2, 2, 2, 1, 4, 4, 2, 3, 4, 4, 4, 2, 1, 4,
1, 3, 3, 2, 1, 3, 2, 1, 1, 2, 2, 2, 3, 4, 1, 3, 1, 2, 1, 4,
4, 4, 1, 1, 3, 1, 4, 2, 4, 4, 1, 4, 4, 1, 4, 4, 4, 4, 1, 1,
2, 3, 3, 3, 3, 4, 4, 3, 2, 3, 2, 3, 4, 3, 3, 4, 4, 1, 3, 3,
2, 1, 2, 3, 1, 2, 1, 3, 3, 2, 1, 4, 1, 4, 3, 4, 4, 4, 1, 2,
1, 3, 2, 0};
int DNA[] = {1, 2, 4, 2, 2, 2, 1, 4, 4, 2, 3, 4, 4, 4, 2, 1, 4,
1, 3, 3, 2, 1, 3, 2, 1, 1, 2, 2, 2, 3, 4, 1, 3, 1, 2, 1, 4,
4, 4, 1, 1, 3, 1, 4, 2, 4, 4, 1, 4, 4, 1, 4, 4, 4, 4, 1, 1,
2, 3, 3, 3, 3, 4, 4, 3, 2, 3, 2, 3, 4, 3, 3, 4, 4, 1, 3, 3,
2, 1, 2, 3, 1, 2, 1, 3, 3, 2, 1, 4, 1, 4, 3, 4, 4, 4, 1, 2,
1, 3, 2, 0};
Your program should repeatedly ask the user for two things: the length of a search sequence, and the search sequence itself. The program should then search through the array “DNA” to find the starting element subscript (index) of all possible matching sequences. The elements of the search sequence may take on one of five characters: 1,2,3,4 and 5. The meaning of the ‘5’ character is that of wild card, i.e. it matches 1,2,3 and 4.
The program should terminate when the length of the input sequence is zero or less. If the input search sequence contains a character other than 1 to 5, the program should report the error and terminate, as shown in the examples below. You can assume that only numbers will be input, i.e. no non-numeric characters.
Your program must make use of at least two functions outside of the main function - one to read in the search string from the user, and one to do the actual searching.
In the sample output examples that follow, the user input appears after the colon character (‘:’) and is followed by the enter key. (These are not displayed in bold as in previous labs) Note that there is a single space after the colon (:) in each output line.
![Run 1
Enter length of DNA string to match: 4
Enter 4 characters (one of 12345) as a search string: 4222
Match of search string found at element 2
Enter length of DNA string to match: 3
Enter 3 characters (one of 12345) as a search string: 214
Match of search string found at element 5
Match of search
string
element 14
found at
found at element 34
Match of search string
Match of search string found at element 86
Enter length of DNA string to match: -1
Goodbye](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F46007a9e-bdad-438f-9786-6b6adf112cd8%2Fced9e4e7-261c-4f43-8b00-622f5897a4fd%2Favq6728_processed.png&w=3840&q=75)
Transcribed Image Text:Run 1
Enter length of DNA string to match: 4
Enter 4 characters (one of 12345) as a search string: 4222
Match of search string found at element 2
Enter length of DNA string to match: 3
Enter 3 characters (one of 12345) as a search string: 214
Match of search string found at element 5
Match of search
string
element 14
found at
found at element 34
Match of search string
Match of search string found at element 86
Enter length of DNA string to match: -1
Goodbye
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
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 with 2 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
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…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
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)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
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…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
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…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
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)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
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](https://www.bartleby.com/isbn_cover_images/9781337093422/9781337093422_smallCoverImage.gif)
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
![Prelude to Programming](https://www.bartleby.com/isbn_cover_images/9780133750423/9780133750423_smallCoverImage.jpg)
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
![Sc Business Data Communications and Networking, T…](https://www.bartleby.com/isbn_cover_images/9781119368830/9781119368830_smallCoverImage.gif)
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY