3. A safe is locked by a combination of of four binary digits (that is, 0 or 1), but the owner has forgotten the combination. The safe is designed in such a way that no matter how many digits have been pressed, if the correct combination of three digits is pressed at any point, then the safe automatically opens (there is no "enter" key). Our goal is to find the minimum number of digits that one needs to key in in order to guarantee that the safe opens. In other words, we wish to find the smallest possible length of a binary sequence containing every four-digit sequence in it. (a) Create a digraph whose vertex set consists of three-digit binary sequences. From each vertex labelled ryz, there is one outgoing edge (labelled 0) leading to vertex yz0, and another outgoing edge (labelled 1) leading to vertex yzl.

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

attached below

3. A safe is locked by a combination of of four binary digits (that is, 0 or 1), but the
owner has forgotten the combination. The safe is designed in such a way that no
matter how many digits have been pressed, if the correct combination of three digits
is pressed at any point, then the safe automatically opens (there is no "enter" key).
Our goal is to find the minimum number of digits that one needs to key in in order to
guarantee that the safe opens. In other words, we wish to find the smallest possible
length of a binary sequence containing every four-digit sequence in it.
(a) Create a digraph whose vertex set consists of three-digit binary sequences. From
each vertex labelled æyz, there is one outgoing edge (labelled 0) leading to vertex
yz0, and another outgoing edge (labelled 1) leading to vertex yzl.
(b) Explain why every edge represents a four digit sequence and why an Eulerian
tour of this graph represents the desired sequence of keystrokes.
(c) Find the minimum number of digits that one needs to key in to guarantee that
the safe opens.
Transcribed Image Text:3. A safe is locked by a combination of of four binary digits (that is, 0 or 1), but the owner has forgotten the combination. The safe is designed in such a way that no matter how many digits have been pressed, if the correct combination of three digits is pressed at any point, then the safe automatically opens (there is no "enter" key). Our goal is to find the minimum number of digits that one needs to key in in order to guarantee that the safe opens. In other words, we wish to find the smallest possible length of a binary sequence containing every four-digit sequence in it. (a) Create a digraph whose vertex set consists of three-digit binary sequences. From each vertex labelled æyz, there is one outgoing edge (labelled 0) leading to vertex yz0, and another outgoing edge (labelled 1) leading to vertex yzl. (b) Explain why every edge represents a four digit sequence and why an Eulerian tour of this graph represents the desired sequence of keystrokes. (c) Find the minimum number of digits that one needs to key in to guarantee that the safe opens.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Intelligent Machines
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