Share
Explore BrainMass

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.

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

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

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

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

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 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

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

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)

Boolean Algebra

Boolean Algebra Homework Help Required Translating formal propositions ¬ = not ∃ =there exists ∨ = or ≡ equivalent ∀= for all ⇒ =implies ∧ = and ⇔ if and only if (a)An argument to show that two propositions are equivale

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

Boolean Algebra Simplification

What are the steps for simplifying boolean algebraic expression such as A = S * T + V * W + R + S + T What would be the simplest form of the above and how do you know it is the simplest.

Boolean Functions and Logic Gates

Part A: Express the Boolean function F(w,x,y,z) in sum-of-products form Part B: Use Boolean algebra (and the Boolean equalities) or the Karnaugh map to simplify the Boolean expression. Part C: Draw the logic diagram for the simplified circuit using AND, OR, and NOT logic gates if each logic gate can have at most two inpu

Boolean Algebra : Gates, Truth Tables and Logic Operations

(See attached file for full problem description) --- For question #1, just use the example to show how to solve a problem like it is. 1. Gates Implement the 1 bit full adder using only: 1. 2 input NAND gates 2. 2 input NOR gates. 2. Boolean Functions Using the laws of Boolean algebra, minimize the number of opera

Boolean Rings, Homomorphisms, Isomorphisms and Idempotents

1)Let X={1,2,...,n}and let R be the Boolean ring of all subsets of X. Define f_i:R->Z_2 by f_i(a)=[1] iff i is in a.Show each f_i is a homomorphism and thus f=(f_1,...,f_n):R->Z_2*Z_2*...*Z_2 is a ring homomorphism.Show f is an isomorphism. 2)If T is any ring,an element e of T is called an idempotent provided e^2=e.The el

Boolean expression and logic circuit

1. Consider the circuit below (see attachment for the circuit diagram) a. Write the boolean expression for it. Please show all the steps and explain your development with your own words. b. Draw the respective truth table. Please show all the steps and explain your development with your own words. c. Directly from the t

Boolean Algebra and Digital Logic

Boolean Algebra and Digital Logic 1. Convert the following binary numbers to their decimal equivalents a. 1101 b. 0011 c. 11100111 d. 10101011 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 fol