Explore BrainMass
Share

# Boolean Algebra

Boolean Algebra is a sub-discipline of algebra which deals with the truth values of specific variables. These truth variables can either be true or false, which are usually denoted in Boolean Algebra as 1 and 0 respectively. Instead of the traditional arithmetic operations seen in Elementary Algebra, Boolean Algebra is mainly concerned with three types of operations: conjunction (and), disjunction (or) and negation (not).

Conjunction is denoted as ∧

Disjunction is denoted as ∨

Negation is denoted as ¬

These operations do not behave like normal arithmetic operations. In Boolean Algebra 1+1 does not equal 2. Instead 1+1 may equal 0, with the + sign being the symbol for another Boolean Operation XOR. Thus, it can be seen that Boolean Algebra stands apart from the realm of Elementary Algebra – as it has its own set of rules and principles.

Boolean Algebra is prevalent in the study of electrical circuits, as a two valued Boolean algebra can be used to describe the operations of a two-valued electrical switching circuit. Thus, it can be seen that understanding Boolean Algebra is crucial for the modern study of Computer Science, Programming, Statistics and Digital Circuits.

### K-Map mimimization

Draw a Karnaugh map (K-map) for the function below and then solve using the Karnaugh map (K-map) you have designed. For each K-map provide ALL SOLUTIONS AVAILABLE by finding all of the EPI and PI groupings and applying the rules for them: This means the K-Map steps for solutions and NOT the Boolean Algebra steps as some tried on

### The solution gives detailed explanations on writting an ABEL program for a combinational logic function with five input bits N4-N0) representing an integer between 0 and 31 and two outputs M3 and M5 to indicate if the number is a multiple of 3 or 5. And my complete is included in the answer also.

Write an ABEL program for a combinational logic function with five input bits N4-N0) representing an integer between 0 and 31 and two outputs M3 and M5 to indicate if the number is a multiple of 3 or 5.

### Boolean Algebra with Conjunction and Disjunction

Please explain Boolean algebra with conjunction and disjunction as case studies.

### Reflexive, Symmetric, Transitive and Boolean products

1. Determine if the relation R on the set of all real numbers is reflexive, symmetric, antisymmetric, and/or transitive where (x,y) R if and only if x = 1. a. reflexive b. symmetric c. antisymmetric d. transitive 2. Find the Boolean product of the two matrices: [ 0 1 0 ] [ 0 1 0 ]

### Boolean Matrix: Airline Flights

Assume the Boolean matrix below is MR, and that MR represents the relation R where R represents the connecting flights that an airline have between four cities: a,b,c,d. The 1 in row a column b means there is a flight from city a to city b. In general, there is a 1 in row x, column y if and only if there is a connecting flight b

### Solving Boolean Algebra Equations

Let B = {0, 1} be a Boolean algebra and let f: B3 &#8594;B be the Boolean function such that f(0, 0, 0) = f(1, 0, 0) = f(0, 0, 1) = 1 and f(x, y, z) = 0 for all other (x, y, z) in B3. a) Write f in disjunctive normal form and in conjunctive normal form. b) Give the truth table of f? (the complement of f). c) Give f

### Calculations with Isomorphic Groups

Complete 3-18 and 3-19. Exercise 3-18. Prove that if two groups are isomorphic and if an element of g of one corresponds to the element h of the other under the isomorphism, then g^-1 corresponds to h^-1. Exercise 3-19. Write the four-group as permutation group. Write the octic group as a group of permutation expressed as

### Free Boolean Algebra

Please help answer the following question. Using your knowledge of free objects in a category, give a definition of a free Boolean algebra B on a set D. How these compare to free Boolean rings?

### Boolean Ring Question

Let R be a Boolean ring and let X be the set all maximal ideals of R. Put a topology on X by taking sets of the form Dr = {M ∈ X | r ∈/ M}, r is in R, as a basis for the open topology. Since the ideals are prime, Dr ∩ Ds = Drs, making the collection closed under finite intersections. Show that X is a Boolean space. Hint on

### Abstract Algebra - Boolean ring

A ring R is called a Boolean ring if a^2=a for all a?R. Let R=P(X)be the power set of X. Define addition and multiplication in R as follows: a+b=(a?b^')?(a^'?b) a×b=a?b Show that (R,+,*) is a Boolean ring.

### Control Systems Problem

A process involves moving speed, load weight, and rate of loading in a conveyor system. The variables are provided as high (1) and low (0) levels for digital control. An alarm should be initiated whenever any of the following occur: a. speed is low; both weight and load rater are high b. speed is high; load rate is low Fi

### Boolean Matrix Questions

Assume the Boolean matrix below is MR and that MR represents the relation R where R represents the connecting flights that an airline has between 4 cities: a, b, c, and d. so there is a 1 in row x column y iff there is a connecting flight between (from) city x and (to)city y That is, the rows of the matrix represent the cities o

### Boolean Algebra and Digital Logic for simple digital circuits

For this module you will design some simple digital circuits based on Boolean expressions. Draw circuits that implement the following Boolean expressions using some combination of AND, OR, NOT, NAND, and NOR gates. (I recommend you draw your circuits on white paper with black pen, scan the images, and paste them into your Word

### Boolean Algebra and Digital Logic

See attached file. Read the required material on Boolean Algebra and circuit design in the Background Information, and complete the problems below. You can locate additional material on the Web (Google "Boolean algebra" , "logic circuits" and "logic gates." if you need further explanations. 1. Convert the following bi

### Boolean Algebra and Karnaugh Mapping

** Please see the attached file for the complete problem description ** Hello, I am struggling with the questions in the attached PDF on Boolean and Karnaugh Mapping. Not sure of the correct sequences to get the answers on questions d i ii iii iv v and e. Could you please show full step by step working and final answer

### Make the given Java class thread safe.

The following class public class HardwareData { private boolean value = false; public HardwareData(boolean value) { this.value = value; } public boolean get() { return value; } public void set(boolean newValue) { value = newValue; } public boolean getAndSet(boolean newValue) {

### Boolean Function/Logic Diagrams/Truth Table !

Consider the Boolean function: F = b'c' + a'bc' A. Represent F using a truth table B. Represent F using a logic diagram that closely matches the algebraic expression (Use only AND gates, OR gates, and inverters). C. Represent F using a logic diagram that contains NAND gates only. Explain how you arrived at your answer.

### Boolean Algebra and circuit design

2. Convert the following decimal numbers to their binary, octal, and hexadecimal equivalents a. 16 b. 32 c. 48 d. 80 3. Do the following work and answer the following questions: a. Explain the relationship between an AND gate and a NAND gate in terms of Boolean Algebra and draw truth tables

### Boolean Function Multiplexer and External Gates.

Implement the following boolean function with a 4x1 multiplexer and external gates. Connect inputs A and B to the selection lines. The input requirements for the four data lines will be a function of variables C and D. These values are obtained by expressing F as a function of C and D for each of the four cases AB = 00, 01, 10 a

### Logic Circuits for Boolean Expressions

1. Using Boolean algebra, reduce the following Boolean expression to its simplest form and implement it using your method of choice. F = A'B'D + ABC' + AB'CD + BC + A'CD + BCD 2. Using a Karnaugh map (K-map), reduce the following Boolean to its simplest form and implement it using SOP (Sum of Products) F = B'C'D + B'D +

### History of Mathematical Happenings

Choose a time in history (pre-20th century) that is of interest to you. It can be any time from ancient Egypt to the American Civil War. Next, visit the following site and choose the link that covers the time period you chose: http://www-groups.dcs.st-and.ac.uk/history/Chronology/index.html Select two of the events listed

### truth table for Boolean Algebra

Construct the truth table of (x y)^ (x¬Y). Is this a contradiction?

### Rules of Products

How many rows are there for any logical expression? containing: (i) Two (logical) variables? Why is the solution 2^2 ? What would be an example of this? Determine the number of different (that is nonequivalent) Boolean functions (logical expressions) containing: (ii) Two Variables? Why is the Solution 2^2^² ? What would b

### Descrete Math multiple choice

Note: Please see attachment for full details. 3. A grammar that has no restrictions on production is called a: A) phrase-structure grammar. B) context-sensitive grammar. C) context-free grammar. D) regular grammar. 5. A Karnaugh map for 6 variables will have __________ squares. A) 16 B) 32 C) 64 D)

### Draw a Combinational Circuit for a Boolean Expression

Digital information can be represented through the use of Boolean algebra, which is an important concept to study if one wishes to understand how computers work. First: I am given an assignment on drawing a combinational circuit that directly implements Boolean expression for F(x, y, z)= xz + (xy + z'). Second: In my

### Using de Morgan's law to complement boolean expression

Using de Morgan's Law, write an expression for the complement of F if F(x, y, z) = xy + x'z + yz' .

### BNF Grammar for Boolean Expressions

A) Create a BNF grammar that describes simple Boolean expressions of the form var AND var var OR var where var is one of the symbols w, x, y, and z. B) Modify your grammar from part (a) so that the Boolean expressions can be of the form expr AND expr expr OR expr where expr is either a simple variable (w, x, y,

### Boolean Algebra

Boolean Algebra Homework Help Required Translating formal propositions ¬ = not &#8707; =there exists &#8744; = or &#8801; equivalent &#8704;= for all &#8658; =implies &#8743; = and &#8660; if and only if (a)An argument to show that two propositions are equivale

### Turing machines for Bitwise and Boolean NOT operations

Give Turing machines for bitwise and boolean NOT operations under following restrictions. - only single tape deterministic turing machines can be used. - The input and output alpahbets should consist of {0,1}* only (and the empty cell symbol #}.

### Simplifying Boolean Equations

Simplify the following to their simplest form showing each step you take: D3 =Q3 Q2 Q1 + Q3 Q2 Q1 D2 = Q3 Q2 Q1 + Q3 Q2 Q1 D1 = Q3 Q1 + Q2 Q1