Boolean expression

BOOLEAN EXPRESSION

·         A boolean expression is an expression in a programming language that produce a boolean value when evaluated i.e. one of true or false 
·         A boolean expression may be composed of a combination of boolean constats true or false ,Boolean-typed variables ,Boolean value operators and boolean valued functions
·         Most programming languages have the boolean operators OR , AND and  NOT ,in C and some newer languages .
Examples :
·         The expression "5>3" is evaluated as true.
·         The expression "3>5" is evaluated as false.
·         "5>=3" and "3<=5" are equivalent boolean expression ,both of which are evaluated as  true.
·         Of course, most Boolean expression will contain atleast one variable (x>3),and often more (x>y).
 Evaluation:-
An expression in a programming language is a combination of one or language is a combination of one or more explicit values ,constant, variables ,operators, and functions that programming language interupt and compute to produce another value .This process as for mathematical Expression ,is called evaluation .
In simple settings ,the resulting value is usually  one of various primiptive types, such as numerical, string and logical in more elaborate settings , it can be an arbitrary complex datatype
In functional programming the resulting values are often functions or expressions which can themselves be further evaluated .
For example:-
2+3  is an arithmetic and programming expression which evaluates to 5.
A variable is an expression because it denotes a value in memory so y+6  is an expression .
An example of a relational expression is4!=4Which evaluates  to false.

Compiler Design

EasyExamNotes.com covered following topics in Compiler Design.

Python Programming ↓ 👆
Java Programming ↓ 👆
JAVA EasyExamNotes.com covered following topics in these notes.
JAVA Programs
Principles of Programming Languages ↓ 👆
Principles of Programming Languages
EasyExamNotes.com covered following topics in these notes.

Practicals:
Previous years solved papers:
A list of Video lectures References:
  1. Sebesta,”Concept of programming Language”, Pearson Edu 
  2. Louden, “Programming Languages: Principles & Practices” , Cengage Learning 
  3. Tucker, “Programming Languages: Principles and paradigms “, Tata McGraw –Hill. 
  4. E Horowitz, "Programming Languages", 2nd Edition, Addison Wesley

    Computer Organization and Architecture ↓ 👆

    Computer Organization and Architecture 

    EasyExamNotes.com covered following topics in these notes.

    1. Structure of desktop computers
    2. Logic gates
    3. Register organization
    4. Bus structure
    5. Addressing modes
    6. Register transfer language
    7. Direct mapping numericals
    8. Register in Assembly Language Programming
    9. Arrays in Assembly Language Programming

    References:

    1. William stalling ,“Computer Architecture and Organization” PHI
    2. Morris Mano , “Computer System Organization ”PHI

    Computer Network ↓ 👆
    Computer Network

    EasyExamNotes.com covered following topics in these notes.
    1. Data Link Layer
    2. Framing
    3. Byte count framing method
    4. Flag bytes with byte stuffing framing method
    5. Flag bits with bit stuffing framing method
    6. Physical layer coding violations framing method
    7. Error control in data link layer
    8. Stop and Wait scheme
    9. Sliding Window Protocol
    10. One bit sliding window protocol
    11. A protocol Using Go-Back-N
    12. Selective repeat protocol
    13. Application layer
    References:
    1. Andrew S. Tanenbaum, David J. Wetherall, “Computer Networks” Pearson Education.
    2. Douglas E Comer, “Internetworking with TCP/IP Principles, Protocols, And Architecture",Pearson Education
    3. KavehPahlavan, Prashant Krishnamurthy, “Networking Fundamentals”, Wiley Publication.
    4. Ying-Dar Lin, Ren-Hung Hwang, Fred Baker, “Computer Networks: An Open Source Approach”, McGraw Hill.