Home > Computer & Internet > Computer science > Computer architecture & logic design > Assembly languages > Introduction to Boolean Algebra and Switching Circuits
7%
Introduction to Boolean Algebra and Switching Circuits

Introduction to Boolean Algebra and Switching Circuits

          
5
4
3
2
1

Out of Stock


Premium quality
Premium quality
Bookswagon upholds the quality by delivering untarnished books. Quality, services and satisfaction are everything for us!
Easy Return
Easy return
Not satisfied with this product! Keep it in original condition and packaging to avail easy return policy.
Certified product
Certified product
First impression is the last impression! Address the book’s certification page, ISBN, publisher’s name, copyright page and print quality.
Secure Checkout
Secure checkout
Security at its finest! Login, browse, purchase and pay, every step is safe and secured.
Money back guarantee
Money-back guarantee:
It’s all about customers! For any kind of bad experience with the product, get your actual amount back after returning the product.
On time delivery
On-time delivery
At your doorstep on time! Get this book delivered without any delay.
Notify me when this book is in stock
Add to Wishlist

About the Book

"Introduction to Boolean Algebra and Switching Circuits" together with printed exercises and answer key is available for home study and library learning centers. For more information email: wparkspublishing@aol.com In Boolean algebra: 1 + 1 = 1 and x + x = x. In elementary algebra the results differ: 1 + 1 = 2 and x + x = 2x. This programmed instruction text gives easy to understand explanations of major differences in symbol manipulation between the two algebras. This text contributes to STEM-based instruction. STEM is an acronym that includes education in the fields of science, technology, engineering, mathematics and computer science. These areas of knowledge help students learn to communicate better in mathematics and computer science using sets, numbers, logic and flowcharts and displaying the information in many ways."1 + 1 = 1 An Introduction to Boolean Algebra and Switching Circuits" was originally published by Williamsville Publishing Company as part of their popular "Tape 'n Text" "Computer Math Series." It has been expanded and republished as "Volume 3" in the series. The publisher is Hershey Books and is available on Amazon along with "Sets, Numbers and Flowcharts," "Computer Number Bases," and "Introduction to Logic."To receive a free catalog via email in a PDF file attachment with sample chapters from our books listed at www.wrparks.com send your request via email to wparkspublishing@aol.com. This paperback is intended for classroom teachers, students and reference for libraries. The material in the "Computer Math Series" was submitted for review in "The Mathematics Teacher" and received praise - "The development is well done." Because In elementary algebra 1 + 1 equals 2 and in Boolean algebra 1 + 1 equals 1, Boolean algebra is not isomorphic (similar) to elementary algebra. However, Boolean algebra is isomorphic to logic. Knowledge of Boolean algebra and logic are needed in our modern world in order to explain how computers are designed and operate at the most basic levels. The three main operators in Boolean algebra and switching circuits are directly related to logic. For example, in logic the Boolean algebra plus sign "+" means "OR" (disjunction) and the times sign ." " means "AND" ( conjunction ) and the prime mark or tilde " " means "NOT" (negation in logic). Logic symbols will be used mainly in "Introduction to Logic." In all volumes of the "Computer Mathematics Series" new information is presented in short sections with immediate testing. This form of personalized instruction is often used in online Internet-based courses for distance learning. A small amount of information is presented in each section before advancing to the next section. Exercises are listed after several sections followed by an answer key.
About the Author: William Parks, B.S., M.S., Ed.M., taught secondary level mathematics in private and public high schools in New York for five years. He taught community college mathematics and computer science for 25 years in New York, Tennessee, Maryland and Arizona. He was a computer science degree program developer at four colleges: SUNY Colleges at Buffalo and Fredonia, Elon University and D'Youville College. He was the technical editor for "Personal Computing" and "PC AI" magazines.


Best Sellers



Product Details
  • ISBN-13: 9780884930099
  • Publisher: William R. Parks
  • Publisher Imprint: William R. Parks
  • Height: 229 mm
  • No of Pages: 46
  • Series Title: Computer Math
  • Weight: 77 gr
  • ISBN-10: 0884930092
  • Publisher Date: 07 Mar 2014
  • Binding: Paperback
  • Language: English
  • Returnable: N
  • Spine Width: 3 mm
  • Width: 152 mm


Similar Products

How would you rate your experience shopping for books on Bookswagon?

Add Photo
Add Photo

Customer Reviews

REVIEWS           
Click Here To Be The First to Review this Product
Introduction to Boolean Algebra and Switching Circuits
William R. Parks -
Introduction to Boolean Algebra and Switching Circuits
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Introduction to Boolean Algebra and Switching Circuits

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book
    Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals



    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!