10-BooleanLogic - Chapter X Boolean Logic Chapter X Topics...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
Chapter X Boolean Logic Chapter X Topics 10.1 Introduction 10.2 What is a Boolean Statement? 10.3 Boolean Operators 10.4 Truth Tables 10.5 Laws of Boolean Algebra 10.6 Venn Diagrams & Boolean Algebra 10.7 Sample Boolean Problems 10.8 The Boolean Data Type 10.9 Boolean Logic Exercises Chapter X Boolean Logic 501
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
10.1 Introduction This chapter will be a departure from the usual format. There are only a few programs in this chapter, and they are at the very end. There is more . . . this chapter hardly mentions Java and again, only at the end of the chapter. You are probably surprised because at this stage, in all likelihood, you thought you were learning programming in Java. Perhaps this is a good time to set the record straight. Whether you are taking regular Computer Science I, AP Computer Science I, Pre-AP Computer Science, or College Prep Computer Science, you are in this course to learn computer science . A major component of introductory computer science is to learn the logic and problem solving skills that are part of programming. Programming is a very major and large focus of introductory computer science. However, it is a subset. There are concepts to be learned that are not necessarily programming. Java is one more step down. You need to learn programming and the current language used in AP Computer Science and Computer Science I is Java. In other words, you are not taking a class in Java. You are taking a class in computer science. This course has a major component, which is programming. The language used to teach the programming component is Java. In this chapter we will investigate Boolean Logic concepts. The information in this chapter will be very beneficial in understanding control structures. In an earlier chapter you were introduced to control structures. In the next chapter you will look at control structures again, and discover that there are many complex situations that can easily cause confusion. A good understanding of Boolean Logic will help tremendously in writing program code that is logically correct. On the other hand, a weak --- or no understanding --- about Boolean principles can cause program problems without a clue why the program executed incorrectly. A century ago there was a mathematician, George Boole , who took statements and wrote them in a precise format, such that a statement is always true or false . He founded a branch of mathematics called Boolean Algebra . Statements that are either true or false are called Boolean statements. The conditions you used with selection and repetition in the last chapter were all Boolean statements. This chapter could very well be called Boolean Algebra, but I personally prefer the title Boolean Logic. The biggest reason is that many concepts that students have learned in Algebra do not apply to Boolean Algebra. It is too easy for students to think that Boolean Algebra is a branch of Algebra, which is not true. It is a branch of mathematics. At any rate, the title matters very little. Let us get down
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Page1 / 34

10-BooleanLogic - Chapter X Boolean Logic Chapter X Topics...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online