Exercise 1- Checksum Background Material A checksum is an extra collection of bits added to some data in order to force it to satisfy a certain property. This property can then be used to quickly detect simple errors which may happen during communication. For example, when choosing student ID numbers, we ca first choose an initial set of digits any way we please, and then add digits to the end of the number in order to force the sum of the digits to be divisible by 11. By then verifying that this condition holds whenever we process data containing the ID, we equip ourselves with a basic sanity check. Implementation Task Write a function checksum :: Integral a => [a] -> Bool checksum = undefined that takes as input a list of numbers and checks that 1. The list is 8 elements long 2. The sum of the numbers is divisible by 11. The function should return True if both of these conditions are met, and False otherwise.
Exercise 1- Checksum Background Material A checksum is an extra collection of bits added to some data in order to force it to satisfy a certain property. This property can then be used to quickly detect simple errors which may happen during communication. For example, when choosing student ID numbers, we ca first choose an initial set of digits any way we please, and then add digits to the end of the number in order to force the sum of the digits to be divisible by 11. By then verifying that this condition holds whenever we process data containing the ID, we equip ourselves with a basic sanity check. Implementation Task Write a function checksum :: Integral a => [a] -> Bool checksum = undefined that takes as input a list of numbers and checks that 1. The list is 8 elements long 2. The sum of the numbers is divisible by 11. The function should return True if both of these conditions are met, and False otherwise.
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
Please explain the given solution for the question
Solution:
checksum :: Integral a => [a] -> Bool
checksum xs = (length xs == 8) && ((sum xs) `mod` 11 == 0)
![Exercise 1- Checksum
Background Material
A checksum is an extra collection of bits added to some data in order to force it to satisfy a certain property. This property can then be
used to quickly detect simple errors which may happen during communication. For example, when choosing student ID numbers, we can
first choose an initial set of digits any way we please, and then add digits to the end of the number in order to force the sum of the digits
to be divisible by 11. By then verifying that this condition holds whenever we process data containing the ID, we equip ourselves with a
basic sanity check.
Implementation Task
Write a function
checksum: Integral a => [a] -> Bool
checksum= undefined
that takes as input a list of numbers and checks that
1. The list is 8 elements long
2. The sum of the numbers is divisible by 11.
The function should return True if both of these conditions are met, and False otherwise.
Examples
*Main> checksum [8,3,2,3,8,7,0,2]
True
*Main> checksum [8,3,2,3,8,9,1,2]
False
*Main> checksum [4,5,8,2,4]
False](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fd0e1c77e-cbe4-40a2-8f0c-a5462bd32285%2Facf5f9bf-422d-4036-b723-2aa0c4083390%2Fv0t5rkk_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Exercise 1- Checksum
Background Material
A checksum is an extra collection of bits added to some data in order to force it to satisfy a certain property. This property can then be
used to quickly detect simple errors which may happen during communication. For example, when choosing student ID numbers, we can
first choose an initial set of digits any way we please, and then add digits to the end of the number in order to force the sum of the digits
to be divisible by 11. By then verifying that this condition holds whenever we process data containing the ID, we equip ourselves with a
basic sanity check.
Implementation Task
Write a function
checksum: Integral a => [a] -> Bool
checksum= undefined
that takes as input a list of numbers and checks that
1. The list is 8 elements long
2. The sum of the numbers is divisible by 11.
The function should return True if both of these conditions are met, and False otherwise.
Examples
*Main> checksum [8,3,2,3,8,7,0,2]
True
*Main> checksum [8,3,2,3,8,9,1,2]
False
*Main> checksum [4,5,8,2,4]
False
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.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 3 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