Page 13 - Computer science 868 Class 12
P. 13
CONTENTS
01 Boolean Algebra 13
1.1 Propositional Logic 1.2 Truth Values
1.3 Symbols or Connectives 1.4 Well-Formed Formulas, Premises and Syllogism
1.5 Converse, Inverse and Contrapositive 1.6 Precedence of the Connectives
1.7 Equivalence Propositional Laws 1.8 Tautology, Contradiction and Contingency
1.9 Boolean Algebra
1.10 Maxterm, Minterm, Sum of Product and Product of Sum
1.11 Derivation of a Boolean Expression from Multiple Logical Statements
1.12 Introduction to Karnaugh Maps 1.13 Formation of Groups by Overlapping
1.14 Grouping by Map Rolling 1.15 Redundant Groups
02 Computer Hardware 64
2.1 Fundamental Gates or Basic Logic Gates 2.2 Universal Gates
2.3 Half Adder and Full Adder 2.4 Encoder
2.5 Decoder 2.6 Multiplexer
03 Implementation of Algorithms to Solve Problems 100
3.1 Introduction 3.2 Algorithm
3.3 Pseudocodes and Flowchart 3.4 Computational Complexity and Big O Notation
3.5 Some Standard Algorithms
04 Programming in Java 125
4.1 Procedure-Oriented Programming Language 4.2 Object-Oriented Programming Language
4.3 Components of Object-Oriented Programming
4.4 Basic Principles of OOP 4.5 History of Java
4.6 Types of Java Programming 4.7 Java Compilation Process
4.8 Different Libraries Used in Java 4.9 Java Reserved Words
4.10 Comments 4.11 Advantages and Disadvantages of Java
4.12 Basic input/output Using Scanner and Printer Classes from JDK
05 Primitive Values, Wrapper Classes, Types and Casting 142
5.1 Data Types 5.2 Arithmetical Expressions
5.3 Type Casting 5.4 Wrapper Class
06 Variables and Expressions 152
6.1 Keywords 6.2 Literals
6.3 Identifiers 6.4 Special Symbols
6.5 Operators
07 Statements and Scope 175
7.1 Sequential Statements 7.2 Conditional Statements
7.3 Iterative Statements 7.4 Jump Statements
7.5 Scope of the Variables
08 Methods 225
8.1 Built-in Method 8.2 User-Defined Method
8.3 Different Parts of a Method 8.4 Different Types of Methods
8.5 Calling Function 8.6 Defining a Method

