New Semester Started Get 50% OFF Study Help! --h --m --s Claim Now

Question Answers

Textbooks

Find textbooks, questions and answers

Oops, something went wrong!

Change your search query and then try again

Result Not Found

Books FREE
Study Help
Tutors
AI Study Planner NEW
Sell Books

Search
Sign In
Register

study help
business
logic functions and equations

Logic Functions And Equations Examples And Exercises 1st Edition Bernd Steinbach ,Christian Posthoff - Solutions

1 Find all solution vectors of the equation f(x) = g(x) by means of set operations.Let f(x1, x2, x3, x4, x5)=((((x1 ↓ x2) ↓ x3) ↓ x4) ↓ x5), g(x1, x2, x3, x4, x5)=((((x1|x2)|x3)|x4)|x5).
Exercise 3.2 (Partial Solutions). For the given functions f(x) and g(x) of Exercise 3.1 consider the sets f0, g0, f1 und g1 and build (by set operations)(f0 ∩ g0) ∪ (f1 ∩ g1). What can be said about this set and its complement?
5 Compare this set with the solution set of f(x1, x2, x3, x4, x5) ∼ g(x1, x2, x3, x4, x5) = 1. Let f(x1, x2, x3, x4, x5) = x2x3x4 ∨ x2x3x5 ∨x1x3x5, g(x1, x2, x3, x4, x5) = (x2 ⊕ x3).
4 Compare this set with the solution set of f(x1, x2, x3, x4, x5) ∼ g(x1, x2, x3, x4, x5) = 0. Let f(x1, x2, x3, x4, x5) = x2x3x4 ∨ x2x3x5 ∨x1x3x5, g(x1, x2, x3, x4, x5) = (x2 ⊕ x3).
Compare this set with the solution set of f(x1, x2, x3, x4, x5)⊕g(x1, x2, x3, x4, x5) = 1. Let f(x1, x2, x3, x4, x5) = x2x3x4 ∨ x2x3x5 ∨x1x3x5, g(x1, x2, x3, x4, x5) = (x2 ⊕ x3).
2 Compare this set with the solution set of f(x1, x2, x3, x4, x5)⊕g(x1, x2, x3, x4, x5) = 0. Let f(x1, x2, x3, x4, x5) = x2x3x4 ∨ x2x3x5 ∨x1x3x5, g(x1, x2, x3, x4, x5) = (x2 ⊕ x3).
Let f(x1, x2, x3, x4, x5) = x2x3x4 ∨ x2x3x5 ∨x1x3x5, g(x1, x2, x3, x4, x5) = (x2 ⊕ x3).1 Find all solution vectors of the equation f(x) = g(x).
A graph G is given by means of the adjacency matrix M:This adjacency matrix describes a graph with 10 nodes. The element M1,2 = 1 describes an edge from node 1 to node 2 etc. By the way, this graph is supposed to be a difficult example for coloring questions, it is called Birkhoff’s Diamond.1
Let be given the following graph by its adjacency matrix:1 Draw a sketch of this graph.2 Design a Boolean model of the problem of extended Hamiltonian graphs and fit it into a PRP.3 Execute the PRP in the XBOOLE Monitor in order to find all Hamiltonian paths for the given graph. How many
Exercise 7.1 (Structural Model – System of Logic Equations). Create a system of logic equations as structural model of the combinatorial circuit shown as schematic diagram in Fig. 7.1. Prepare this system of equations as PRP so that it can be used later on for an analysis task. It is helpful to
Exercise 7.2 (Structural Model – Set of Local Lists of Phases). Create a set of local lists of phases as structural model of the combinatorial circuit shown as schematic diagram in Fig. 7.1. Prepare this set of local lists of phases as PRP such that it can be used later on for an analysis task.
Exercise 7.3 (Structural Model – TVL in a Certain Form). Assume the circuit structure in Fig. 7.1 may by transformed into a two level AND-OR structure such that the conjunctions of the disjunctive form are built by the AND-gates connected directly with an OR-gate. Describe the associated
Exercise 7.4 (Behavioral Model – Explicit Equation System – System Function of a Completely Specified Circuit). The behavior of a circuit is given by the equation system (7.1),Calculate a minimized system function F(x, y). Practical tasks:1 Prepare a Boolean space and attach the input and
Exercise 7.5 (Behavioral Model – System of Function TVLs of a Completely Specified Circuit). Separate the system function of Exercise 7.4 into a system of function TVLs using formula (7.56) of [18]. Practical tasks:1 Load the TVL system of Exercise 7.4.2 Prepare solutions of the simple equations
1 Prepare a Boolean space and attach the input and output variables in a convenient order. Verify that the system function F(x, y) (7.2) describes an incompletely specified function.F(x, y)=((x1x2(x3 ⊕ x4)y ∨ x3x4(x5 ⊕ x6)y ∨ x1x7y∨ x1x2x6x7) ⊕ x6) ∨ (x3 ⊕ x4)x6 ∨ x3x4x5∨
2 Solve (7.2). Verify that the system function F(x, y) (7.2) describes an incompletely specified function.F(x, y)=((x1x2(x3 ⊕ x4)y ∨ x3x4(x5 ⊕ x6)y ∨ x1x7y∨ x1x2x6x7) ⊕ x6) ∨ (x3 ⊕ x4)x6 ∨ x3x4x5∨ x1x3x6x7 ∨ x1x2(x3 ⊕ x4)x6x7. (7.2)Calculate all three associated mark
3 Prepare solutions of the simple equations y = 1. Verify that the system function F(x, y) (7.2) describes an incompletely specified function.F(x, y)=((x1x2(x3 ⊕ x4)y ∨ x3x4(x5 ⊕ x6)y ∨ x1x7y∨ x1x2x6x7) ⊕ x6) ∨ (x3 ⊕ x4)x6 ∨ x3x4x5∨ x1x3x6x7 ∨ x1x2(x3 ⊕ x4)x6x7.
4 Calculate the mark function fϕ(x) of the don’t-care set based on formula(7.24) of [18]. Verify that the system function F(x, y) (7.2) describes an incompletely specified function.F(x, y)=((x1x2(x3 ⊕ x4)y ∨ x3x4(x5 ⊕ x6)y ∨ x1x7y∨ x1x2x6x7) ⊕ x6) ∨ (x3 ⊕ x4)x6 ∨ x3x4x5∨
5 Calculate the mark function fq(x) of the ON-set based on formula (7.25)of [18]. Verify that the system function F(x, y) (7.2) describes an incompletely specified function.F(x, y)=((x1x2(x3 ⊕ x4)y ∨ x3x4(x5 ⊕ x6)y ∨ x1x7y∨ x1x2x6x7) ⊕ x6) ∨ (x3 ⊕ x4)x6 ∨ x3x4x5∨ x1x3x6x7 ∨
6 Calculate the mark function fr(x) of the OFF-set based on the formula(7.25) of [18]. Verify that the system function F(x, y) (7.2) describes an incompletely specified function.F(x, y)=((x1x2(x3 ⊕ x4)y ∨ x3x4(x5 ⊕ x6)y ∨ x1x7y∨ x1x2x6x7) ⊕ x6) ∨ (x3 ⊕ x4)x6 ∨ x3x4x5∨ x1x3x6x7
7 Verify whether the three mark functions are pairwisely disjoint and cover the Boolean space completely. Verify that the system function F(x, y) (7.2) describes an incompletely specified function.F(x, y)=((x1x2(x3 ⊕ x4)y ∨ x3x4(x5 ⊕ x6)y ∨ x1x7y∨ x1x2x6x7) ⊕ x6) ∨ (x3 ⊕ x4)x6 ∨
8 How many functions includes the characteristic function set FC(x) which is specified by the calculated mark functions? Verify that the system function F(x, y) (7.2) describes an incompletely specified function.F(x, y)=((x1x2(x3 ⊕ x4)y ∨ x3x4(x5 ⊕ x6)y ∨ x1x7y∨ x1x2x6x7) ⊕ x6) ∨ (x3
9 Calculate the system function using the mark functions fq(x) and fr(x)based on formula (7.21) of [18] and verify the result. Verify that the system function F(x, y) (7.2) describes an incompletely specified function.F(x, y)=((x1x2(x3 ⊕ x4)y ∨ x3x4(x5 ⊕ x6)y ∨ x1x7y∨ x1x2x6x7) ⊕ x6)
10 Calculate the system function using the mark functions fϕ(x) and fr(x)based on formula (7.22) of [18] and verify the result. Verify that the system function F(x, y) (7.2) describes an incompletely specified function.F(x, y)=((x1x2(x3 ⊕ x4)y ∨ x3x4(x5 ⊕ x6)y ∨ x1x7y∨ x1x2x6x7) ⊕ x6)
11 Calculate the system function using the mark functions fq(x) and fϕ(x)based on formula (7.23) of [18] and verify the result. Verify that the system function F(x, y) (7.2) describes an incompletely specified function.F(x, y)=((x1x2(x3 ⊕ x4)y ∨ x3x4(x5 ⊕ x6)y ∨ x1x7y∨ x1x2x6x7) ⊕ x6)
Exercise 7.7 (Behavior of a Combinatorial Circuit Based on a System of Logic Equations). Calculate the behavior of the circuit given in Fig. 7.1.Use the system of logic equations prepared in Exercise 7.1 as structural model. Practical tasks:1 The output y depends on 6 inputs. How many phases
Exercise 7.8 (Behavior of a Combinatorial Circuit Based on a Set of Local Lists of Phases). Calculate the behavior of the circuit given in Fig. 7.1.Use the set of local lists of phases prepared in Exercise 7.2 as structural model and verify whether the calculated behavior coincides with the result
Exercise 7.9 (Input-Output Behavior of a Combinatorial Circuit). Calculate the input-output behavior of the circuit given in Fig. 7.1. Minimize the result to an orthogonal TVL. Practical tasks:1 Which operation of the Boolean differential calculus calculates the list of phases of the
Exercise 7.10 (Simulation Based on a Global List of Phases). Execute several simulations of a modified circuit created from the circuit structure in Fig. 7.1. The circuit is extended such that additional outputs y2, y3, and y4 are introduced which are connected with the outputs of the gates g20,
Exercise 7.11 (Don’t-Care Function Defined by the Outputs of a Global List of Phases). Calculate both the output pattern of the circuit modified in Exercise 7.10 and the don’t-care function caused by this circuit for a successor circuit. Practical tasks:1 Load the TVL system of Exercise 7.10.2
Exercise 7.12 (Independence of a Function Regarding Variables). Analyze whether the functions y1(x) and y2(x) calculated in Task 3 of Exercise 7.5 really depend on the variables (x1, x2, x3, x4, x5, x6) and simplify these functions if possible. Practical tasks:1 Load the TVL system of Exercise 7.5.
Exercise 7.13 (Realizability of a System Function). Check whether the system functions of Exercises 7.5 and 7.6 are realizable. Practical tasks:1 Load the TVL system of Exercise 7.5. This TVL system includes the system function F(x, y1, y2) as object number 1 and the VT y1, y2 as object number
Exercise 7.14 (Unique Solution of a System Function with Regard to an Output). From Exercise 7.13 it is known that the system functions of Exercises 7.5 and 7.6 are realizable. Check whether these system functions have unique solutions with regard to their outputs. Practical tasks:1 Load the TVL
Exercise 7.15 (Independence of an Incompletely Specified Function Regarding Variables). Analyze whether all functions represented by the system function F(x, y) specified in Exercise 7.6 really depend on the variables(x1, x2, x3, x4, x5, x6, x7). Find all functions described by F(x, y) that depend
Exercise 7.16 (Verify Whether a Combinatorial Circuit Exists for a System Function). Verify whether the system function calculated in Exercise 7.9 can be realized as combinatorial circuit. If that is possible, then calculate the logic function y = f(x). Practical tasks:1 Load the final TVL system
Exercise 7.17 (Prime Conjunctions of a Logic Function). Create all prime conjunctions of the function of Fig. 7.4b) on page 172 calculated in Exercise 7.16 that can be built by restriction of the given ternary vectors.Collect each found prime conjunction only once. Practical tasks:1 Load the final
Exercise 7.18 (Completeness of the Simple Set of Prime Conjunctions).Verify whether the 8 prime conjunctions calculated in Exercise 7.17, see Fig. 7.4 c), cover the function of Fig. 7.4b) and whether all these prime conjunctions are necessary to cover this function. Practical tasks:1 Substantiate
Exercise 7.19 (Additional Prime Conjunctions Based on the Consensus Law). Extend the set of prime conjunctions of Fig. 7.4c) based on the consensus law. Take for this search all combinations of the given 8 prime conjunctions into account. Only such consensus conjunctions that cannot be absorbed by
Exercise 7.20 (Complete Check for Additional Prime Conjunctions Based on the Consensus Law). Check based on the result of Exercise 7.19 whether there are additional prime conjunctions and add them, if found, to the set of prime conjunctions. This check can be restricted such that only the 6 prime
Exercise 7.21 (Essential Prime Conjunctions). Detect all essential prime conjunctions based on the set of all prime conjunctions given in Fig. 7.7 a).Practical tasks:1 Load the final TVL system of Exercise 7.20.2 Prepare a PRP that finds all essential prime conjunctions out of the set of all 14
Exercise 7.22 (All Minimal Disjunctive Forms). Create the sets of all minimal disjunctive forms based on the set of all prime conjunctions given in Fig. 7.7a) for the function given in Fig. 7.4 b). Evaluate these sets with regard to the number of required prime conjunctions. Enumerate the shortest
Exercise 7.23 (Technology Mapping). All minimal disjunctive forms were calculated in Exercise 7.22 based on the function that is given by the circuit of Fig. 7.1. Does this circuit realize a minimal disjunctive form, or is it possible to simplify this circuit? Create a circuit structure for one of
Exercise 7.24 (Strong Elementary Bi-Decomposition of the Completely Specified Function y = f(x)). Check for each pair of variables whether a bi-decomposition with regard to the OR-, AND- and EXOR-operation exists for the function of Fig. 7.1. Practical tasks:1 Load the final TVL system of Exercise
Exercise 7.25 (Complete EXOR-Bi-Decomposition). Check whether an extended complete EXOR-bi-decomposition based on the two pairs of variables found in Exercise 7.24 exists. Calculate the decomposition functions of the complete EXOR-bi-decomposition. Practical tasks:1 Load the TVL system e73dec1.sdt
Exercise 7.26 (Strong Elementary Bi-Decomposition of the Completely Specified Function g1(x)). Check for each pair of variables whether for the function g1(x) of Fig. 7.10a) on page 182 exists a bi-decomposition with regard to the OR-, AND- and EXOR-operation. Practical tasks:1 Load the TVL system
Exercise 7.27 (Weak OR-Bi-Decomposition of the Completely Specified Function g1(x)). Check for each variable whether for the function g1(x) of Fig. 7.10a) on page 182 exists a weak bi-decomposition with regard to the OR- and AND-operation. If possible, create a ISF of g2. Practical tasks:1 Load the
Exercise 7.28 (Elementary Bi-Decomposition of the Incompletely Specified Function g2q(x), g2r(x)). Check for each pair of variables whether for the incompletely specified function with the mark function g2q(x) and g2r(x) calculated in Task 6 of Exercise 7.27 a bi-decomposition with regard to the
Exercise 7.29 (Complete Bi-Decomposition of the Incompletely Specified Function g2q(x), g2r(x)). Check, based on the allowed pairs of variables found for all types of bi-decompositions in Exercise 7.24, whether extended complete bi-decompositions exist for the incompletely specified function with
Exercise 7.30 (Complete Bi-Decomposition of the Incompletely Specified Function h3q(x), h3r(x)). Check first for each pair of variables whether for the incompletely specified function with the mark functions h3q(x) and h3r(x) calculated in Task 14 of Exercise 7.29 exists a bi-decomposition with
Exercise 7.31 (Calculate the Realized Functions h3(x), g2(x), and the Incompletely Specified Function h2q(x), h2r(x) That Must Be Decomposed).Calculate the mark functions h2q(x), h2r(x) of the weak OR-bidecomposition selected in Exercise 7.27. This calculation requires first the output function
Exercise 7.32 (Complete Bi-Decomposition of h2(x)). Execute the bidecomposition of the completely specified h2(x) = h2q(x) which depends on the variables (x2, x3, x4) and verify the result. Practical tasks:1 Load the TVL system e73dec6.sdt of Exercise 7.31. This TVL system includes the function
Exercise 7.33 (Complete Bi-Decomposition of h1(x)). Verify whether an AND-bi-decomposition h1(x) shown in Fig. 7.10b) with regard to([x2, x3, x4], [x5, x6]) exists and calculate allowed decomposition functions.xPractical tasks:1 Load the TVL system e73dec7.sdt of Exercise 7.32. This TVL system
Exercise 7.34 (Complete Bi-Decomposition of h6(x)). Check first for each pair of variables whether a bi-decomposition exists with regard to the OR-, AND- and EXOR-operation for the function h6(x). Extend the found elementary bi-decompositions to complete bi-decompositions. Select the best existing
Exercise 7.35 (Technology Mapping and Verification). Draw the circuit structure calculated by bi-decompositions in Exercises 7.24 . . . 7.34. Verify whether the decomposition structure realizes the given basic function of Fig. 7.1. Compare both the required numbers of gates and the depth of the
Exercise 7.36 (Test Pattern Calculated for a Sensible Path). Calculate all test patterns for the selected sensible path x2 − g7 − h6 − h1 − y in the circuit of Fig. 7.16 on page 190 designed in Section 3. using the bidecomposition.Practical tasks:1 Load the TVL system e73dec9.sdt of
Exercise 7.37 (Restriction of the Sensible Path Method). Calculate all test patterns for the selected sensible path x2 − g4 − h3 − g2 − g1 − y in the circuit of Fig. 7.16 on page 190 designed in Section 3. using the bi-decomposition. Practical tasks:1 Load the TVL system e73dec9.sdt of
Exercise 7.38 (Test Pattern Calculated for a Sensible Point Using the Detailed Method). Calculate all test patterns for the sensible point h3 in the circuit of Fig. 7.16 on page 190 designed in Section 3. using the bidecomposition.Use (7.146) . . . (7.149) of [18] and the equation system of
Exercise 7.39 (Test Patterns Calculated for a Sensible Point Using the List of Error Phases). Calculate all test patterns for the sensible point h3 in the circuit of Fig. 7.16 on page 190 designed in Section 3. using the bidecomposition.Use (7.150) of [18] and the equation system of Exercise 7.35,
Exercise 7.40 (Test Pattern Calculated for a Sensible Point of a Local Branch). Calculate all test patterns for the sensible point nx4 in the circuit of Fig. 7.16 on page 190 designed in Section 3. using the bi-decomposition.Use (7.152) . . . (7.156) of [18] and the equation system of Exercise
Exercise 7.41 (Test Pattern for the Path x2 − g4 − h3 − g2 − g1 − y Based on Bi-Decomposition Results). Calculate all test patterns for the path x2−g4−h3−g2−g1−y in the circuit of Fig. 7.16 on page 190 designed in Section 3. using the bi-decomposition. Use the equations (7.157)
Exercise 7.42 (Test Pattern for the Sensible Point of a Redundant Variable). Calculate all test patterns for the sensible point x5 of the gate g11 in the circuit of Fig. 7.1 on page 136 and evaluate the result. Use(7.150) and (7.152) . . . (7.154) of [18] and the equation system created in Exercise
• When was the last time you felt that you were at cross-purposes when you discussed a system?
• When was the last time you felt that you were discussing the same issue over and over again?
• When was the last time you wished that the consensus you reached during a discussion had been recorded?
Which activities can you think of from the view of the passenger? How would you try to freshen up your memory?
• What steps are involved in working with the IT system? To answer this question we have to observe the actor's work with the IT system. What does the actor do with the IT system? What does he or she enter? What does the IT system display? What does the interaction look like? Here, it is
• Which information is the use case meant to provide to the actor? If information should be displayed, a query event is sent to the IT system. The information from the use case diagram is not sufficient to understand use cases. The flow of interaction that stands behind a use case has to be
• Which information is meant to be stored, modified, or deleted in the IT system? If information should be changed, a mutation event is sent to the IT system. The information from the use case diagram is not sufficient to understand use cases. The flow of interaction that stands behind a use case
Determine interfaces—Between which IT systems should communication take place?
Identify involved systems—Which IT systems exchange information?
Identify activities and control flow—What has to be done and who is responsible for it?
Exercise 8.18 (Complete Circuit Design of the Extended Control for a Road Work Traffic Light). Design the sequential circuit of an extended control for a road work traffic light and verify the result of the synthesis. Use the same method as applied in the previous exercises. The behavioral model is
Exercise 8.17 (Complete Circuit Design of the Simple Control for a Road Work Traffic Light). Design the sequential circuit of a simple control for a road work traffic light and verify the result of the synthesis. Use the same method as applied in the previous exercises. The behavioral model is
Exercise 8.16 (Technology Mapping and Verification). Draw both the graph that describes the behavior of the sequential circuit and the circuit structure calculated in Exercises 8.12 . . . 8.15. Verify whether the behavior of the designed structure is covered by the allowed behavior defined in
Exercise 8.15 (Output Functions y1 and y2). Calculate output functions y1 and y2 of the non-deterministic finite-state machine restricted in Exercise 8.14. Restrict the behavior of the finite-state machine regarding the selected output functions y1 and y2, respectively. Practical tasks:1 Load the
Exercise 8.14 (Controlling Function d3). The memory function sf3 of the non-deterministic finite-state machine restricted in Exercise 8.13 shall be realized by a D-flip-flop. Calculate the controlling function d3 taking into consideration the freedom of the non-deterministic specified
Exercise 8.13 (Controlling Functions d2 and v2). The memory function sf2 of the non-deterministic finite-state machine restricted in Exercise 8.12 shall be realized by a DV -flip-flop. Calculate the controlling functions d2 and v2 taking into consideration the freedom of the non-deterministic
Exercise 8.12 (Controlling Functions j1 and k1). The memory function sf1 of the non-deterministic finite-state machine defined in Exercise 8.11 shall be realized by a JK-flip-flop. Calculate the controlling functions j1 and k1 taking into consideration the freedom of the specified non-deterministic
Exercise 8.11 (Definition of a Non-deterministic Finite-state Machine).Define the allowed behavior of a non-deterministic finite-state machine by means of a global list of phases. In the 6 states (s1, s2, s3) equal to (000),(100), (110), (010), (011), and (001) the deterministic behavior must be
Exercise 8.10 (Check of the Realizability of a Finite-state Machine –Extended Traffic Light). Analyze the realizability of the finite-state machine for the extended road work traffic lights defined in Exercises 8.2. Detailed information about this finite-state machine is given in the mentioned
Exercise 8.9 (Check of the Realizability of a Finite-State Machine –Simple Traffic Light). Analyze the realizability of the finite-state machine for the simple road work traffic lights defined in Exercises 8.1. Detailed information about this finite-state machine is given in the mentioned
Exercise 8.8 (Verification of the Realizability of a Finite-State Machine Specified by a Sequential Circuit). Analyze the realizability of several finite-state machines. Detailed information about the finite-state machines to be analyzed are given in Exercises 8.7. Practical tasks:1 Load the final
Exercise 8.7 (Partial Behavior of a Sequential Circuit). Calculate several partial behaviors of the sequential circuit of Fig. 8.2. The global list of phases of this finite-state machine is available as object 7 in the solution of Exercise 8.5. This solution includes additionally variable tuples
Exercise 8.6 (Behavior of a Sequential Circuit Based on a Set of Local Lists of Phases). Calculate the behavior of the circuit given in Fig. 8.2.Use the set of local lists of phases prepared in Exercise 8.4 as structural model and verify whether the calculated behavior coincides with the result of
Exercise 8.5 (Behavior of a Sequential Circuit Based on a System of Logic Equations). Calculate the behavior of the sequential circuit given in Fig. 8.2. Use the system of logic equations prepared in Exercise 8.3 as structural model. Practical tasks:1 What type of finite-state machine is given by
2 Store the TVL system as e8104.sdt for later use. Create a set of local lists of phases as structural model for the sequential circuit given in Fig. 8.2. This set of local lists of phases will be used later on in combination with the PRP of Exercise 8.3
1 Prepare a PRP that creates a set of local lists of phases for all switching elements of the sequential circuit given in Fig. 8.2. Use the object numbers larger than 10 so that this PRP can used in combination with the PRP of Exercise 8.3. Create a set of local lists of phases as structural model
Exercise 8.3 (Structural Model – System of Equations). Figure 8.2 describes the structure of a finite-state machine using three types of flip-flops and AND-, OR-, and EXOR-gates. Create a system of logic equations as structural model for this sequential circuit. Add information about the meaning
Exercise 8.2 (Behavioral Model – Extended Traffic Light – Graph –List of Phases). Create a behavioral model of a finite-state machine for the traffic light that extends the model of Fig. 8.1. Two input variables(x1, x2) allow to control the extended traffic light. If x1 = 0, the traffic light
Exercise 8.1 (Behavioral Model – Simple Traffic Light – List of Phases).Figure 8.1 describes the behavior of a simple traffic light that can be used to control a road work, where three periods of time are required to pass the distance to be in work and yellow phases are included for security
Exercise 6.16 (Sudoku). On a board of 9×9 fields the following values are given: (1, 5):5, (1, 9):2, (2, 4):6, (2, 9):9, (3, 2):1, (3, 3):8, (3, 4):4, (4, 2):2,(4, 3):3, (4, 5):7, (5, 3):5, (5, 5):6, (5, 7):2, (6, 7):6, (6, 8):4, (7, 6):2, (7, 7):8,(7, 8):5, (8, 1):9, (8, 6):1, (9, 1):7, and (9,
Exercise 6.15 (Bridges in K¨onigsberg). As can be seen in Fig. 6.1 there were seven bridges, two from point a (the north side of a river) to point b(an island in the middle of the river), two from point d (on the south side of the river) to point b (on the island). After the island the river
Exercise 6.14 (Simple Eulerian Path). Let be given a graph with four nodesa, b, c and d and edges between a andb, b andc, c andd, d and a as well as b and d.1 Draw a sketch of this graph.2 Find a Boolean model for this problem.3 Find all Eulerian paths.4 How the graph must change by adding or
Exercise 6.13 (Knight on the Chess Board). Place a knight on any selected field of the chessboard 6 × 6 and find a path of the knight that returns to the selected field and uses other fields only once. If not all fields are used then repeat the same procedure starting form a new unused
4 How many different positions of the queens are possible altogether with two pawns on any field of an (8 × 8)-board? (The n + k-problem). n+1 queens and one pawn should be placed on an n × n chess board such that no queen attacks any other queen.
3 How many such positions for 10 queens with two pawns on the fields(4, 4) and (5, 5) of an (8 × 8)-board are possible? (The n + k-problem). n+1 queens and one pawn should be placed on an n × n chess board such that no queen attacks any other queen.
2 How many different positions of the queens are possible altogether with one pawn on any field of an (8 × 8)-board? (The n + k-problem). n+1 queens and one pawn should be placed on an n × n chess board such that no queen attacks any other queen.
1 How many such positions for 9 queens with the pawn on the field (4, 4)of an (8 × 8)-board are possible? (The n + k-problem). n+1 queens and one pawn should be placed on an n × n chess board such that no queen attacks any other queen.
Exercise 6.9 (Fairy Chess). Find all combinations of a maximum number of Cardinals on a very small board 3 × 3 and for larger boards as well.
Exercise 6.8 (The Queens’ Problem). Find a binary model for the problem and answer the following questions.1 Prepare a PRP that describes all possibilities to place eight queens on a chessboard 8 × 8 in such a way that no queen attacks another one.2 How many solutions exist for this problem?3

Showing 2300 - 2400 of 2473

First
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25

Step by Step Answers

Services

Sitemap
Fun
Definitions
Become Tutor
Used Textbooks
Study Help Categories
Recent Questions
Expert Questions
Campus Wear
Sell Your Books

Company Info

Security
Copyrights
Privacy Policy
Terms & Conditions
SolutionInn Fee
Scholarship
Online Quiz
Give Feedback, Get Rewards

Get In Touch

About Us
Contact Us
Career
Jobs
FAQ
Student Discount
Campus Ambassador

Secure Payment

Download Our App

© 2026 SolutionInn. All Rights Reserved