انت هنا الان : شبكة جامعة بابل > موقع الكلية > نظام التعليم الالكتروني > مشاهدة المحاضرة
الكلية كلية تكنولوجيا المعلومات
القسم قسم البرامجيات
المرحلة 1
أستاذ المادة صفا سعد عباس المرعب
30/12/2018 18:56:31
Boolean Logical Operations A Boolean logical operator is an operator used to perform Boolean logic upon two Boolean expressions. Boolean logical operators return Boolean results (true or false) and take Boolean values as operands. While performing Boolean logic, the expression on the left is evaluated, followed by the expression on the right. The two expressions are finally evaluated in the context of the Boolean logical operator between them. Boolean logical operators can be used to test or adjust the value of a Boolean variable. The result of the expression using these operators can be used in conditional statements to control the program flow through the code. Boolean Operators are used to connect and define the relationship between your search terms. When searching electronic databases, you can use Boolean operators to either narrow or broaden your record sets. The three Boolean operators are AND, OR and NOT. AND (&) Use AND to narrow your search: all of your search terms will present in the retrieved records. OR ( | ) Use OR to broaden your search by connecting two or more synonyms. NOT Use NOT to exclude term(s) from your search results. It is vital to understand the difference between the & and && operators when they are used in an expression where two conditions have to be evaluated. While the & operator always executes both conditions, && does not execute the second on failure of the first. The || operator works similar to && by skipping the conditions after the first, if the first condition is true. Hence, && and || (referred to as conditional logical operators) are called short circuit operators. The | and || operators (and & and && operators) are not interchangeable since they operate differently. The main operations of Boolean algebra are the conjunction and denoted as ?, the disjunction or denoted as ?, and the negation not denoted as ¬ . Boolean algebra has been fundamental in the development of digital electronics, and is provided for in all modern programming languages. It is also used in set theory and statistics.
المادة المعروضة اعلاه هي مدخل الى المحاضرة المرفوعة بواسطة استاذ(ة) المادة . وقد تبدو لك غير متكاملة . حيث يضع استاذ المادة في بعض الاحيان فقط الجزء الاول من المحاضرة من اجل الاطلاع على ما ستقوم بتحميله لاحقا . في نظام التعليم الالكتروني نوفر هذه الخدمة لكي نبقيك على اطلاع حول محتوى الملف الذي ستقوم بتحميله .
|