Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
De Morgan's Laws
Continuing with the relationship between ∧ and ∨, we can also use De Morgan's Law to rearrange sentences involving negation in conjunction with these connectives. Actually, there are 2 equivalences which taken as a pair are called De Morgan's Law:
¬(P ∧Q) ≡ ¬P ∨¬Q
¬ (P ∨ Q) ≡ ¬P ∧ ¬Q
These are essential rules and it is good spending some time thinking regarding why they are true.
Contraposition
The contraposition equivalence is following:
P -> Q ≡ ¬Q -> ¬P
At first, this can seem a little strange because it seem that we have said nothing in the first sentence regarding ¬Q, soin the second sentence how can we infer anything from it? However, imagine we know that P implies Q, and we saying that Q was false. In this case, if we were to imply that P was true because we know that P implies Q, we also know that Q is true. But Q was false .So we cannot possibly denote that P is true, which means that we ought to imply that P is false (because we are in propositional logic, so P might be either true or false). This argument shows that we may replace the first sentence by the second one, and it is left as aworkout to construct a similar argument for the vice-versa part of this equivalence.
Q. Explain High performance of Instruction execution? High performance of Instruction execution: While mapping of HLL to machine instruction the compiler favours relatively sim
Q. Explain about of Unicode? This is a newer International standard for character representation. Unicode offers a unique code for each character irrespective of Program, platf
What is Indexed addressing The location of data is calculated as sum of an address specified by one of previous methods, and value of an index register. This allows an array of
What are the "field" and "chain" Statements? The FIELD and CHAIN flow logic statements let you Program your own checks. FIELD and CHAIN tell the system which fields you are ch
Q. Explain about Registers? A register is a group of flip-flops that store binary information and gates that controls when and how information is transferred to register. An n-
Name the popular security measures A number of security products covering a broad range of methods are available in the market. Most popular of all the security measures are th
Q. Define COM Programs? A COM (Command) program is binary image of a machine language program. It is loaded in memory at the lowest available segment address. Program code star
Design a serial 2’s complementer with a shift register and a flip-flop
Define main memory and auxiliary memory? The memory unit that communicates directly with the cpu is known as main memory [RAM].Devices that give backup storage are known as aux
Explain the Design Procedure for Flip Flop? The design procedure as follows. 1) Acquire the clear description of the desired flip flop X. 2) Acquire the present state- next
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +1-415-670-9521
Phone: +1-415-670-9521
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd