NURTURE INTERNATIONAL SCHOOL

Barra-2, Kanpur
(Affiliated to CISCE, New Delhi)
Worksheet
Class: IX Sub: Computer Application
Topic - Java Date :
Answer the following questions:

Q 1. What is JVM?
Q 2. What is byte code?
Q 3. Explain the compilation process of Java Program?
Q 4. Explain the five characteristics of Java?
Q 5. Explain the following terms
i. Character Set
ii. Variables
iii. Keywords
iv. Types of Data Types
Q 6. What is Polymorphism in OOPs Concept?
Q 7. What is Data Abstraction in OOPs Concept?
Q 8. What is Encapsulation in OOPs Concept?
Q 9. What is Inheritance in OOPs Concept?
Q 10. Explain types of Inheritance in details with their diagrammatic representation.
 NURTURE INTERNATIONAL SCHOOL
Barra-2, Kanpur
(Affiliated to CISCE, New Delhi)
Worksheet
Class: X Sub: Computer Application
Topic - Java Date :
Answer the following questions:

Q 1. What is Primitive Data type?

Q 2. What is Byte Code?
Q 3. Explain the Java Compilation Process?
Q 4. Explain term Token in detail with their types?
Q 5. Explain the following terms
i. Character Set
ii. Variables
iii. Compiler
iv. Types of Data Types
v. JVM
Q 6. What is Polymorphism in OOPs Concept?
Q 7. What is Data Abstraction in OOPs Concept?
Q 8. Explain the term Operator Precedence?
Q 9. What is Inheritance in OOPs Concept?
Q 10. Write a program:
a. Addition of two decimal number entered by user.
b. To check for even or odd number , entered by user.
c. To compare three number to find the smallest ones ,entered by the user.
 NURTURE INTERNATIONAL SCHOOL
Barra-2, Kanpur
(Affiliated to CISCE, New Delhi)
Worksheet
Class: XII Sub: Computer Science
Topic – Boolean Algebra and Computer Hardware Date :
Answer the following questions:

Q 1. Given the Boolean function F(x, y, z) =∑ (1, 3, 4, 5, 6, 7). Reduce it using

Karnaugh’s map
Q 2. Given the Boolean function F(x, y, z) =π (0, 1, 2,3, 4, 6,). Reduce it using
Karnaugh’s map
Q 3. Simplify using laws of Boolean Algebra : x . y + x’. z + y’. z
Q 4. Explain the term Tautology and Contradictions
Q 5. Prove that ( X + X’ ) is a tautology and ( X . X’ ) is a contradiction.
Q 6. Explain the following term :
a. Full adder with logic circuit
b. Multiplexer and draw mux for 8 x 1.
c. Encoder with logic circuit.
Q 7. State the Principle of Duality. Write the dual of (P+Q’).R.1 = P.R + Q’R.
Q 8. Using truth table verify: (~p => q) ^ p = (p ^ ~q) v (p ^ q)
Q 9. State and prove the absorption law algebraically.
Q 10. Given F= A’B + (C’ + E) (D+F’). Find F’.