Computer Science (Theory) Set 1 2021-2022 ISC (Commerce) Class 12 Question Paper Solution

Advertisements
Computer Science (Theory) [Set 1]
Marks: 35 CISCE
ISC (Commerce)
ISC (Arts)
ISC (Science)

Academic Year: 2021-2022
Date: April 2022
Duration: 1h30m
Advertisements

Note :

  1. Candidates are allowed an additional 10 minutes for only reading the paper.
  2. They must NOT start writing during this time.
  3. Answer all questions in Section A, Section B and Section C.
  4. While answering questions in Sections A and B, working and reasoning may be indicated briefly
  5. The intended marks for questions or parts of questions are given in brackets. [ ]
  6. All working, including rough work, should be done on the same sheet as the rest of the answers.
  7. Each program should be written in such a way that it clearly depicts the logic of the problem.
  8. This can be achieved by using mnemonic names and comments in the program.
  9. (Flowcharts and Algorithms are not required.)
  10. The programs must be written in Java.

SECTION - A
[7]1
[1]1.i

The keyword used by a class to acquire the properties of an interface is:

import

implements

extends

include

Concept: Basic Data Structures (Stack, Queue, Dequeue)
Chapter: [0.13] Data Structures
[1]1.ii

The ability of an object to take many forms is known as ______.

inheritance

data abstraction

overriding

polymorphism

Concept: Subclass Polymorphism and Dynamic Binding
Chapter: [0.12] Inheritance and Polymorphism
[1]1.iii
int Toy(int n)
{ return (n<=0)? 1: n%10 + Toy(n/10); }

With reference to the program code given above, what will the function Toy() return when the value of n = 56?

65

12

651

11

Concept: Structured Data Types - Arrays (Single and Multi-dimensional), Strings
Chapter: [0.1] Arrays, Strings
[1]1.iv

Write the statement in Java to extract the word “MISS” from the word “SUBMISSION”.

Concept: Example Algorithms that Use Structured Data Types (E.G. Searching, Finding Maximum/Minimum, Sorting Techniques, Solving Systems of Linear Equations, Substring, Concatenation, Length, Access to Char in String, Etc.)
Chapter: [0.1] Arrays, Strings
[1]1.v

State the principle by which the stack data structure works.

Concept: Basic Data Structures (Stack, Queue, Dequeue)
Chapter: [0.13] Data Structures
[1]1.vi

What is the output of the statement given below?

System.out.print("FAN" + ("AUTOMATIC".charAt(5) ) );
Concept: Example Algorithms that Use Structured Data Types (E.G. Searching, Finding Maximum/Minimum, Sorting Techniques, Solving Systems of Linear Equations, Substring, Concatenation, Length, Access to Char in String, Etc.)
Chapter: [0.1] Arrays, Strings
Advertisements
[1]1.vii

Give one reason, why iteration is better than recursion.

Concept: Concept of Recursion
Chapter: [0.11] Recursion
SECTION - B
[2]2

Differentiate between direct recursion and indirect recursion.

Concept: Concept of Recursion
Chapter: [0.11] Recursion
[2]3

Convert the following infix notation to postfix notation:

A * (B + C / D ) – E / F 
Concept: Conversion of Infix to Prefix and Post Fix Notations
Chapter: [0.13] Data Structures
[4]4
[2]4.i

Answer the following question on the diagram of a Binary Tree given below:

State the degree of the nodes C and G. Also, state the level of these nodes when the root is at level 0.

Concept: Recursive Data Structures - Single Linked List (Algorithm and Programming), Binary Trees, Tree Traversals (Conceptual)
Chapter: [0.13] Data Structures
[2]4.ii

Answer the following question on the diagram of a Binary Tree given below:

Write the pre-order and post-order traversal of the above tree structure.

Concept: Recursive Data Structures - Single Linked List (Algorithm and Programming), Binary Trees, Tree Traversals (Conceptual)
Chapter: [0.13] Data Structures
SECTION - C
[6]5
Advertisements
[6]5.i

Design a class Check which checks whether a word is a palindrome or not.

(Palindrome words are those which spell the same from either ends).

Example: MADAM, LEVEL etc.

The details of the members of the class are given below:

Class name Check
Data members/instance variables:
wrd stores a word
len to store the length of the word
Methods/Member functions:
Check( ) default constructor
void acceptword( ) to accept the word
boolean palindrome( ) checks and returns ‘true’ if the word is a palindrome otherwise returns ‘false’
void display( ) displays the word along with an appropriate message

Specify the class Check giving details of the constructor, void acceptword( ), boolean palindrome( ) and void display( ). Define the main( ) function to create an object and call the functions accordingly to enable the task.

Concept: Basic Input/Output Using Scanner and Printer Classes from JDK
Chapter: [0.1] Arrays, Strings
OR
[6]5.ii

Design a class Toggle which toggles a word by converting all upper case alphabets to lower case and vice versa.

Example: The word “mOTivATe” becomes “MotIVatE”

The details of the members of the class are given below:

Class name Toggle
Data members/instance variables:
str stores a word
newstr stores the toggled word
len to store the length of the word
Methods/Member functions:
Toggle( ) default constructor
void readword( ) to accept the word
void toggle( ) converts the upper case alphabets to lower case and all lower case alphabets to upper case and stores it in newstr
void display( ) displays the original word along with the toggled word

Specify the class Toggle giving details of the constructor, void readword( ), void toggle( ) and void display( ). Define the main( ) function to create an object and call the functions accordingly to enable the task.

Concept: Basic Input/Output Using Scanner and Printer Classes from JDK
Chapter: [0.1] Arrays, Strings
[6]6
[6]6.i

A class Fibo has been defined to generate the Fibonacci series 0, 1, 1, 2, 3, 5, 8, 13, ……. (Fibonacci series are those in which the sum of the previous two terms is equal to the next term).

Some of the members of the class are given below:

Class name Fibo
Data member/instance variable:
start integer to store the start value
end integer to store the end value
Member functions/methods:
Fibo( ) default constructor
void read( ) to accept the numbers
int fibo(int n) return the nth term of a Fibonacci series using recursive technique
void display( ) displays the Fibonacci series from start to end by invoking the function fibo()

Specify the class Fibo, giving details of the Constructor, void read( ), int fibo(int), and void display( ). Define the main() function to create an object and call the functions accordingly to enable the task.

Concept: Simple Recursive Functions (e.g. Factorial, GCD, Binary Search, Conversion of Representations of Numbers Between Different Bases)
Chapter: [0.11] Recursion
OR
[6]6.ii

A class Gcd has been defined to find the Greatest Common Divisor of two integer numbers. Some of the members of the class are given below:

Class name Gcd
Data member/instance variable:
num1 integer to store the first number
num2 integer to store the second number
Member functions/methods:
Gcd( ) default constructor
void accept( ) to accept the numbers
int gcd(int x,int y) return the GCD of the two numbers x and y using recursive technique
void display( ) displays the result with an appropriate message

Specify the class Gcd, giving details of the Constructor, void accept( ), int gcd(int,int), and void display( ). Define the main() function to create an object and call the functions accordingly to enable the task.

Concept: Simple Recursive Functions (e.g. Factorial, GCD, Binary Search, Conversion of Representations of Numbers Between Different Bases)
Chapter: [0.11] Recursion
[4]7

A super class Godown has been defined to store the details of the stock of a retail store. Define a subclass Update to store the details of the items purchased with the new rate and update the stock. Some of the members of both the classes are given below:

Class name Godown
Data members/instance variables:
item to store the name of the item
qty to store the quantity of an item in stock
rate to store the unit price of an item
amt to store the net value of the item in stock
Member functions/methods:
Godown(…) parameterized constructor to assign value to the data members
void display( ) to display the stock details

 

Class name Update
Data members/instance variables:
pur_qty to store the purchase quantity
pur_rate to store the unit price of the purchased item
Member functions/methods:
Update(…) parameterized constructor to assign values to the data members of both the classes
void update( ) to update the stock by adding the previous quantity by the purchased quantity and replace the rate of the item if there is a difference in the purchase rate. Also update the current stock value as:
(quantity * unit price)
void display( ) to display the stock details before and after updating

Assume that the super class Godown has been defined. Using the concept of inheritance, specify the class Update giving details of the constructor, void update ( ) and void display( ).

The super class, main function and algorithm need NOT be written.

Concept: Member Access in Derived Classes
Chapter: [0.12] Inheritance and Polymorphism
[4]8

A Queue is a linear data structure in which the operations are performed based on FIFO (First In First Out).

Define a class Queue with the following details:

Class name Queue
Data member/instance variable:
dat[ ] array to hold the integer elements
cap stores the maximum capacity of the queue
front to point the index of the front
rear to point the index of the rear
Member functions/methods:
Queue(int max) constructor to initialize the data member cap = max, front = rear = 0 and create the integer array
void add_dat(int v) to add integers from the rear index if possible else display the message(“Queue full”)
int pop_dat( ) to remove and return elements from front, if any, else returns -999
void display() to display elements of the queue

Specify the class Queue giving the details of void add_dat(int) and int pop_dat( ). Assume that the other functions have been defined.

The main( ) function and algorithm need NOT be written.

Concept: Basic Data Structures (Stack, Queue, Dequeue)
Chapter: [0.13] Data Structures

Submit Question Paper

Help us maintain new question papers on Shaalaa.com, so we can continue to help students




only jpg, png and pdf files

CISCE previous year question papers Class 12 Computer Science (Theory) with solutions 2021 - 2022

     CISCE Class 12 question paper solution is key to score more marks in final exams. Students who have used our past year paper solution have significantly improved in speed and boosted their confidence to solve any question in the examination. Our CISCE Class 12 question paper 2022 serve as a catalyst to prepare for your Computer Science (Theory) board examination.
     Previous year Question paper for CISCE Class 12 -2022 is solved by experts. Solved question papers gives you the chance to check yourself after your mock test.
     By referring the question paper Solutions for Computer Science (Theory), you can scale your preparation level and work on your weak areas. It will also help the candidates in developing the time-management skills. Practice makes perfect, and there is no better way to practice than to attempt previous year question paper solutions of CISCE Class 12.

How CISCE Class 12 Question Paper solutions Help Students ?
• Question paper solutions for Computer Science (Theory) will helps students to prepare for exam.
• Question paper with answer will boost students confidence in exam time and also give you an idea About the important questions and topics to be prepared for the board exam.
• For finding solution of question papers no need to refer so multiple sources like textbook or guides.
Share
Notifications



      Forgot password?
Use app×