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.
1
Question No.1 (This covers the following)
Truth Table Stating law(s) (if asked)
Maximum Marks allotted
2
Marks Distribution
1) Input combinations and name of law 2) Correct Output combinations
1 Mark
1 Mark ൗ Mark ൗ Mark
1 Mark
2
Simplification, Finding Compliments & Proving using laws
2
1) Working 2) Mentioning Laws 3) Correct Result
3
Maxterms, Minterms, SOP & POS (farming expressions)
2
1) Correct Positioning 2) Correct Expressions
1 Mark 1 Mark
4
Definitions related to Boolean Algebra
2
1) Using correct Keywords of the definition 2) Example if asked
1 or 2 Marks 1 Mark
2
1) Drawing correct gates 2) Marking the output at each stage
1 Mark 1 Mark
5
Sl. No.
Logic Circuits using primary gates (AND, OR, NOT) and/or Universal gates Question No.2 (This covers the following)
1
Memory address calculation
2
Converting Infix expression to Postfix/Prefix
3
Definitions from the entire syllabus and application(s)
4
Simplification or proving Boolean expression using laws
Maximum Marks allotted
Marks Distribution
2
1) Working with correct formula 2) Correct result
2
1) Working with correct rules 2) Correct expression
2
1) Definition 2) Application (if asked)
2
1) Working 2) Mentioning Laws 3) Correct Result
© www.javaforschool.com www.javaforschool.com
1 Mark 1 Mark 1 Mark 1 Mark 1 Mark 1 Mark 1 Mark 1/2Mark 1/2Mark
5
Representation of Boolean expression using Universal gates or definitions from theory
2
Question No.3 (It has two parts ‘a’ and ’b’)
1
1) Drawing correct gates 2) Marking the output at each stage OR 3) Definition(s) and Application
Maximum Marks allotted
1 Mark 1 Mark 2 Marks
Marks Distribution
(a) Finding Output
5
1) Working/ Dry run 2) Correct result
3 Marks 2 Marks
(b) Fill the missing terms or question based on tree etc.
5
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.
1
Question No.4,5,6 & 7 (This covers the following)
Solving Boolean Expression or function using K-Maps divided into two parts (a & b) and each part carries 5 marks
Maximum Marks allotted
5+5=10
Marks Distribution
1) Correct K –Map Table and labeling 2) Writing correct Minterms / Maxterms (i.e. Pairs, Quads and Octets) 3) Writing correct SO P/POS expression 4) Logic circuit for the expression with proper labeling at each stage
2 Marks 1 Mark
1 Mark 1 Mark
The above distribution is for part part- a , the same is applicable for part-b part-b also
2
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 SO P/POS expression iv) Logic circuit for the expression with proper labeling at each stage
© www.javaforschool.com www.javaforschool.com
4 Marks 1 Mark
2 Marks 1 Mark
1 Mark 1 Mark
3
Half Adder, Full Adder, Encoders , Decoders, Multiplexers
10
1) Definition with correct 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.
1
2
Question No.8,9 &10 (This covers the following)
Programming using classes, strings, arrays, object passing, object return and recursive technique
Programming using data files or using class only
Maximum Marks allotted
10
10
Marks Distribution
1) Documentation 2) Correct Class declaration 3) Constructor(default and parameterized) 4) Function definitions
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
1 Mark 1 Mark 1 Mark 7 Marks
SECTION C (Attempt two questions out of three) Sl. No.
1
2
Question No.11, 12 & 13 (This covers the following)
Programming using Inheritance and data structure (stack, queue or dequeue)
Algorithm, Complexity and Big ’O’ Notations
Maximum Marks allotted
10
10
Marks Distribution
1) Documentation 2) Correct base and Divide class 3) Constructor(default and parameterized) 4) Function definitions
1 Mark 2 Marks 1 Mark
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.
© www.javaforschool.com www.javaforschool.com
6 Marks
7 Marks
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.
Question Type
Maximum Marks allotted
Marks Distribution
10
1) Correct Input steps. 2) Correct Output steps.
5 Marks 5 Marks
10
1) Using remarks/comments in the program itself stating a brief description of the logic, formula if any.
10 Marks
20
1) Program with correct logic clearly depicting the algorithm. 2) Correct Output with proper documentation.
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.
5.
Viva based on the logic of the question attempted
20
1) The question based on program attempted and from syllabus also.
20
1) Internal Assessment by the subject 10 Marks teacher. 2) External Assessment by the 10 Marks Visiting examiner.
1.
Algorithm
2.
Documentation/Mnemonic Names
3.
Planning i.e. writing the program on the answer script
6.
Year work i.e. Practical file/Lab manual file
15 Marks 5 Marks
20 Marks
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 www.javaforschool.com
