0% found this document useful (0 votes)
52 views4 pages

ClassX1 Annual

The document is an examination paper for Class XI Computer Science at St. Thomas' Church School, Howrah, for the academic year 2020-2021. It consists of two parts: Part I, which is compulsory and contains questions on logic and programming concepts, and Part II, which requires students to answer six questions from three sections covering various topics in computer science. The exam duration is 3 hours, and the total marks are 70.

Uploaded by

purbashakolley
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
52 views4 pages

ClassX1 Annual

The document is an examination paper for Class XI Computer Science at St. Thomas' Church School, Howrah, for the academic year 2020-2021. It consists of two parts: Part I, which is compulsory and contains questions on logic and programming concepts, and Part II, which requires students to answer six questions from three sections covering various topics in computer science. The exam duration is 3 hours, and the total marks are 70.

Uploaded by

purbashakolley
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

St.

Thomas’ Church School, Howrah


Annual Examination 2020-2021
Subject: Computer Science (theory)
Class: XI ( Section – B )
Time: 3 hrs. Full Marks: 70
--------------------------------------------------------------------------------------------------------------------------------------
Answer all questions in Part I(compulsory) and six questions from Part II, choosing two questions
from Section – A, two from Section – B and two from Section – C.

All working, including rough work, should be done on the same sheet as the
rest of the answer.
The intended marks for questions or parts of questions are given in brackets [ ].
--------------------------------------------------------------------------------------------------------------------------------------
Part – I (20 marks)
Answer all questions
While answering questions in this part, indicate briefly your working and reasoning, wherever required.

Question 1:
a) State the Commutative law and prove it with the help of a truth table. [2]
b) Verify the following proposition with the help of a truth table: [2]
( P ^ Q) V ( P ^ ~ Q)=P
c) If(~P=>Q) then write its: [2]
i) Inverse
ii) Converse
d) State the law represented by the following proposition and prove it with the help of a truth table.
P V P=P [2]
e) Draw the logic diagram and truth table for a two input XNOR gate. [2]

Question 2:
a) What are the Wrapper classes? Give any two examples. [2]
b) What is exception handling? [2]
c) Differentiate between a constructor and a method of a class. [2]
d) Define the term ‘wff’’ in proposition logic. Give one example. [2]
e) Convert the following arithmetic expression into Java statement. [2]
Z=(X5 – Y4) / XY

Part – II (50 marks)


Answer six questions in this part, choosing two questions from
Section A, two from Section B and two from section C

Section – A
Answer any two questions

Question 3:
a) The following is a part of some class which checks if a positive integer is a Palindrome number by
returning true or false.(A number is said to be a palindrome if the reverse of the number is equal to
the original number) The function does not use the modulus (%) operator to extract digit. There are
some places in the code marked by ?1?, ?2?, ?3?, ?4?, ?5? which may be replaced by a
statement/expression so that the function works properly.
boolean Palindrome(int n)
{
int rev=?1?;
int num=N;
while(num>0)
{
int f=num/10;
int s=?2?;
int digit=num-?3?;
rev= ?4? + digit;
num/=?5?;
}
if( rev=N)
return true;
else
return false;
}

What are the statement or expression at ?1?, ?2?, ?3?, ?4?, ?5? [5]

b) Reduce the following Boolean expression:


[5]
[( p + q ).( q + p )] + q + pq

Question 4: Perform the following conversions: [2+2+2+2+2]


i) 0.37510 to octal
ii) 10.0001012 to decimal
iii) 10101110.0101112 to hexadecimal
iv) 56.0816 to decimal
v) Find the one’s complement representation of -13.

Question 5: [5+3+2]
a) Define full Adder. Write the expression and draw the logic diagram for a full Adder.
b) Find out the equivalent expression for (p  q) + (p => q), without having any conditional or Bi-
conditional.
c) Draw the logic circuits of NOT operation using NAND logic.

Section – B
Answer any two questions
Use mnemonic names and comments in the program
(Flowcharts and Algorithms are not required)
The programs must be written in Java

Question 6: [10]
Design a class Wordwise to separate words from a sentence and find the
frequency of the vowels in each word. Some of the members of the class are given
below.

Class name : Wordwise


Instance variables
Str : to store a sentence
Member functions / methods:
Wordwise() : default constructor
void readsent() : to accept a sentence and convert it to
lowercase.
int freq_vowel (String S) : returns the frequency of vowels in the
parameterized String S.
void arrange() : displays each word in a sentence in a
separate line along with the frequency of
vowels for each word by invoking the
function freq_vowel.

Question 7: [10]
A class ArrayMax contains a square matrix which finds the smallest element in each row. Some
of the members of the class are given below:

Class name : ArrayMax


Instance variables/Data members :
a[ ] [ ] : array to store integer elements
m : to store the order of the matrix
Member functions / methods:
Arraymax(int mm) : parameterized constructor to initialize the
data member m=mm and to declare the
array.
void readarray() : to accept the array elements
void small() : finds and displays the smallest element in
each row.
void display() : displays the array elements in the matrix
form.
Define the main() function to create an object and call functions accordingly to enable the task.

Question 8: [10]
Write a program which has the following members.

Class Name : Security_wages


Data Members/Instance Variables:
N : Number of employees
r : Rate per hour
n[ ], w[ ], h[ ] : to store the names, hours worked and
wages earned by the employees
Member functions/methods:
void get() : to accept the number of employees.
void accept() : to enter the names, works worked
void calculate() : Calculates the wages of each employee
based on the following criteria
Hours Rate
For first 40 hours r per hour
For next 20 hours 1.50 x r per hour
For further hours 2.00 x r per four

void display() : Prints the name, hours worked and wages


of each employee.
Section – C
Answer any two questions
Use mnemonic names and comments in the program (Flowchart and algorithms are not required)

Question 9: [5]
Roll no and percentage marks of some students are stored in file stu.dat. Open the file in input mode and
display roll no and marks of only those students who have scored more than 75% marks.

Question 10: [2+1+2]


a) How is Augmented Reality different from Virtual Reality.
b) What do you understand by firewall?
c) What are intellectual property rights?

Question 11: [5]


Write a method to calculate and return the power value. e.g., ab
using recursive technique.
The method declaration is as follows
private long pow(int m, int n)

-----------------------------
Number of copies: 65

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy