A sparse ruler of reach N is complete if it is possible to measure all distances between 1 and N by taking the differences between two marks. For instance [0,1,3] is complete because the pairs (0, 1), (1,3), and (0, 3) yield distances of 1, 2, and 3 respectively. (Note that the pair of marks do not need to be consecutive.) On the other hand, [0,1,4] is not complete as there is no way to measure a distance of 2. (d) Write a function is myrulercomplete (my ruler) which takes as input a list representing a sparse ruler of reach N and returns True if it complete and False otherwise. Hint: Create a list of all differences between entries in the ruler. The loop through the values 1, ..., N testing whether they are in the list of differences. (Remember, the line of code k in mylist will return True or False.)

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

An ordinary ruler is a straight piece of wood where distances 0, 1, 2 . . . , N are marked, for some N ≥ 1. A sparse ruler (or simply a ruler ) is an ordinary ruler from which some of the numbers 1, . . . , N −1 may have been deleted. The number of marks on the ruler is its order and the value N is its reach. Here, we will represent a ruler as a Python list of strictly increasing integers starting with 0. For instance [0,1,3,7] is a ruler of order 4 and reach 7.

could you please help me answer this in python , the part in bold explains what they mean by ruler here 

A sparse ruler of reach N is complete if it is possible to measure all distances between 1 and N by taking
the differences between two marks. For instance [0,1,3] is complete because the pairs (0, 1), (1,3), and
(0, 3) yield distances of 1, 2, and 3 respectively. (Note that the pair of marks do not need to be consecutive.)
On the other hand, [0,1,4] is not complete as there is no way to measure a distance of 2.
(d) Write a function ismyrulercomplete (myruler) which takes as input a list representing a sparse
ruler of reach N and returns True if it is complete and False otherwise.
· · · ·
Hint: Create a list of all differences between entries in the ruler. The loop through the values 1, . N
testing whether they are in the list of differences. (Remember, the line of code k in mylist will return
True or False.)
Transcribed Image Text:A sparse ruler of reach N is complete if it is possible to measure all distances between 1 and N by taking the differences between two marks. For instance [0,1,3] is complete because the pairs (0, 1), (1,3), and (0, 3) yield distances of 1, 2, and 3 respectively. (Note that the pair of marks do not need to be consecutive.) On the other hand, [0,1,4] is not complete as there is no way to measure a distance of 2. (d) Write a function ismyrulercomplete (myruler) which takes as input a list representing a sparse ruler of reach N and returns True if it is complete and False otherwise. · · · · Hint: Create a list of all differences between entries in the ruler. The loop through the values 1, . N testing whether they are in the list of differences. (Remember, the line of code k in mylist will return True or False.)
Expert Solution
steps

Step by step

Solved in 4 steps with 2 images

Blurred answer
Knowledge Booster
Counting Sort
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education