MARKS SET FOR THEORY (PAPER-I)

Maximum Marks: 100 TIME ALLOTED

Reading Time : 15 Minutes Writing Time : 3 Hours (excluding reading time)

PART - I (All three (3) questions are compulsory in this part)

Sl. No. Question No.1 (This covers the following) Truth Table Stating law(s) (if asked) Maximum Marks allotted Marks Distribution 1) Input combinations and name of law 2) Correct Output combinations 1 Mark 1 Mark

Simplification, Finding Compliments & Proving using laws Maxterms, Minterms, SOP & POS (farming expressions)

1) Working 2) Mentioning Laws 3) Correct Result

1 Mark Mark Mark

1) Correct Positioning 2) Correct Expressions

1 Mark 1 Mark

Definitions related to Boolean Algebra Logic Circuits using primary gates (AND, OR, NOT) and/or Universal gates Question No.2 (This covers the following) Memory address calculation Converting Infix expression to Postfix/Prefix Definitions from the entire syllabus and application(s) Simplification or proving Boolean expression using laws

1) Using correct Keywords of the definition 2) Example if asked

1 or 2 Marks 1 Mark 1 Mark 1 Mark

1) Drawing correct gates 2) Marking the output at each stage Marks Distribution 1) Working with correct formula 2) Correct result 1) Working with correct rules 2) Correct expression 1) Definition 2) Application (if asked) 1) Working 2) Mentioning Laws 3) Correct Result

Sl. No. 1

Maximum Marks allotted 2

1 Mark 1 Mark 1 Mark 1 Mark 1 Mark 1 Mark 1 Mark 1/2Mark 1/2Mark

www.javaforschool.com

Representation of Boolean expression using Universal gates or definitions from theory Question No.3 (It has two parts a and b)

1) Drawing correct gates 2) Marking the output at each stage OR 3) Definition(s) and Application Marks Distribution 1) Working/ Dry run 2) Correct result

1 Mark 1 Mark 2 Marks

Maximum Marks allotted 5

(a) Finding Output

3 Marks 2 Marks

(b) Fill the missing terms or question based on tree etc.

Each part carries 1 mark i.e. 1x5=5

5 Marks

PART-II
This part is divided into three sections (i.e. Section A, Section B, Section C) including choices

SECTION A (Attempt three question out of four)

Sl. No. Question No.4,5,6 & 7 (This covers the following) Maximum Marks allotted Marks Distribution 1) Correct K Map Table and labeling 2) Writing correct Minterms / Maxterms (i.e. Pairs, Quads and Octets) 3) Writing correct SOP/POS expression 4) Logic circuit for the expression with proper labeling at each stage
The above distribution is for part- a, the same is applicable for part-b also

2 Marks 1 Mark

Solving Boolean Expression or function using K-Maps divided into two parts (a & b) and each part carries 5 marks

5+5=10

1 Mark 1 Mark

Prepositional statements using 4 variables for generating truth table and writing the SOP/POS expression

10

1) Truth table with input and correct output combination 2) Writing correct SOP/POS expression 3) Reducing above SOP/POS expression using K- Maps i) Correct K Map Table and labeling ii) Writing correct Minterms/Maxterms (i.e. Pairs, Quads and Octets) iii) Writing correct SOP/POS expression iv) Logic circuit for the expression with proper labeling at each stage

4 Marks 1 Mark

2 Marks 1 Mark

1 Mark 1 Mark

www.javaforschool.com

Half Adder, Full Adder, Encoders , Decoders, Multiplexers

10

1) Definition with correct key words along with its uses 2) Truth table with input and correct output combination 3) Correct logic with labeling at each stage

2 Marks 4 Marks 4 Marks

SECTION B (Attempt two questions out of three)

Sl. No. Question No.8,9 &10 (This covers the following) Programming using classes, strings, arrays, object passing, object return and recursive technique Maximum Marks allotted Marks Distribution 1) Documentation 2) Correct Class declaration 3) Constructor(default and parameterized) 4) Function definitions 1 Mark 1 Mark 1 Mark 7 Marks

10

Programming using data files or using class only

10

1) Documentation 2) Correct Class declaration 3) Constructor(default and parameterized) 4) Function definitions or writing input and output buffers and read/write functions including other statements

1 Mark 1 Mark 1 Mark 7 Marks

SECTION C (Attempt two questions out of three)

Sl. No. Question No.11, 12 & 13 (This covers the following) Programming using Inheritance and data structure (stack, queue or dequeue) Maximum Marks allotted Marks Distribution 1) Documentation 2) Correct base and Divide class 3) Constructor(default and parameterized) 4) Function definitions 1 Mark 2 Marks 1 Mark 6 Marks

10

Algorithm, Complexity and Big O Notations

10

1) Step wise working (expected 45 steps) but the steps must be more then marks will be distributed accordingly 2) Finding complexity and final solution

1 Mark for each step. 7 Marks

www.javaforschool.com

MARKS SET FOR PRACTICAL (PAPER-II)

Maximum Marks: 100 TIME ALLOTED : THREE HOURS Planning Session : 60 to 90 Minutes Practical Session : 90 to 120 Minutes

There will be three questions in the question paper of which the candidate has to choose any one and do the following as given below for the chosen program. Sl. No. 1. Question Type Algorithm Maximum Marks allotted 10 Marks Distribution 1) Correct Input steps. 2) Correct Output steps. 1) Using remarks/comments in the program itself stating a brief description of the logic, formula if any. 1) Program with correct logic clearly depicting the algorithm. 2) Correct Output with proper documentation. 5 Marks 5 Marks

2.

Documentation/Mnemonic Names

10

10 Marks

3.

Planning i.e. writing the program on the answer script

15 Marks 5 Marks

20

4.

Lab session i.e. punching the program on the Computer system

20

1) Program typing on system without 15 Marks error. 2) Output using given format. 5 Marks 3) To take the print out/Hard copy of the program along with correct output. 1) The question based on program attempted and from syllabus also. 20 Marks

5.

Viva based on the logic of the question attempted Year work i.e. Practical file/Lab manual file

20

6.

20

1) Internal Assessment by the subject 10 Marks teacher. 2) External Assessment by the 10 Marks Visiting examiner.

Note :- If the candidates are given 1 hour during planning session then for the practical session 2 hours would be given and if during planning session 1 hours are given then for the practical session only 1 hours would be given. Sl. no. 1, 2, 3 would be covered during planning session in the examination hall within the given time. Sl. no. 4, 5 would be done in the computer lab within the given time.

www.javaforschool.com