Trending ▼   ResFinder  

ISC Class XI Prelims 2024 : Computer Science (Lodha World School (LWS), Palava, Dombivili) : UNIT TEST

8 pages, 42 questions, 0 questions with responses, 0 total responses,    0    0
Sneha Shreeya Sanchana
  
+Fave Message
 Home > snehika >   F Also featured on: School Page

Formatting page ...

oRLD LODHA WORLDSCHOOL Near Khidkaleshwar Temple, KalyanShilphata Road, Dombivali East Palava, Maharashtra 421204,Ph. No. - 0251 6699588 LODHA WORLD SCHOOL - 2024 - 2025 Term Exam II Std XI Subject - Computer Science Maximum Marks: 70 Duration: 3Hours Name: Roll No: Date:20.02.2025 reading the paper. (Candiadates are allowed additional 15 minutes for only They must NOT start writing during this time.) in all. The paper is divided into two parts and has 11 questions questions. Part Iis compulsory and has twoquestions. Answer all Part Ilis divided into three sections: A, B and C. to While attempting Multiple Choice Questions in Part I, you are required write only ONE option as the answer. Each section in Part IIhas three questions. Any two questions have to be attempted from each section. The intended marks for questions are given in brackets []. PART I(20 Marks) Answer all questions. While answering questions in this Part, indicate briefly working and reasoning, wherever required. Question 1: i. What is the 2's complement of the number (0110),? b) (1010),: b) (1001)2 c) (1110)2 d) (1011)2 i. In a Hexadecimal number system 'B' represents the digit: a) 14 b) 12 c) 11 d) 13 ) used in mnodern number system is commonly octal The (A): Ii. Assertion write than computer architecture. read and to humans easier for Reasoning (R): Octal numbers are correct values. is the binary numbers, especially for large the Reason Reason are True and o a. Both the Asserticon and the explanation of the Assertion. ReaSon is not fhe are Tre but the Reason the and b. Both the Assertion Assertion. correct explanationof the the Reason is False C. The Assertion is True but the Reason is TrUe. d. The Assertion is False but rEuY) +25 (395)1o is number of the decimal number Octal equivalent The iv. a. (615)8 b. (713)8 c. (613)8 d. (565)s data store multiple values of the same Can arrays Java, In (A): Assertion V. type. can dynamically allocated, and their size Reasoning (R): Arrays in Java are be modified during runtime. True and the Reason is the correct a. Both the Assertion and the Reasonare explanation of the Assertion. but the Reason is not the b. Both the Assertion and the Reason are True correct explanation of the Assertion. False. C. The Assertion is True but the Reason is Reason is True. d. The Assertion is False but the like concat). vi. Assertion (A): The String class in Java provides methods substring), and toUpperCase(). string directly. Reason (R): These methods modify the original is the correct o a. Both the Assertion and the Reason are True and fhe Reason explanation of the Assertion. Reason is not the b. Both the Assertion and the Reasonare True but the correct explanation of the Assertion. False. c. The Assertion is True but the Reason is Reason is True. d. The Assertion is False but the for npropositions vii. In a truth table, how many rows are needed a) n? c) 2n d) n+1 10011I0 vii. Write the signed magnitude of (-14) 1o in the binary form. ix. Verify if. (~P VP) A 1=] number. X. Convert (7CE)16to adecimal Question 2: i. Write the Javaexpression for the following: x-(a5 + b)/Wab methods-> i. Write the return type of the following a) String getinitials(String fullName) b)double calculateAverage(int a, int b) (2 the some class. Give the output of of function method/ a is ii. The following value of 'n' is 6579. function perform) when the void perform(int n){ int s = 0, g: while (n >0){ if (n % 2 == 1){ remove the last n= 10; //If n is pdd, digit else { // Extract the last digit System.out.println("\ng= \f + g): g=n%10; S=S+ g: by dividing it by 5 n = 5; 1/Reduce n System.out.println("\n s= \ +s); when the program runse i) What will be printed process of fhe if-else statement. i) Explain the decision-making [2) iv, Afunction is used to reverse a given number. Complete the code by filling in?1?, 22, and ?32: class ReverseNumber int reverse(int num) int reverse = 0; while (num > 0) { int digit = ?1;//Extract last digit reverse=?2; // Update reverse number num = ?3; // Remove the last digit return reverse; (i) What is the expression or statement at ?1 (i) What is the expression or statement at 2? (ii) Whatis the expression orstatement at ?3? PART -I! (50 Marks) [Answer six questions in this part, choosing twoquestions from Section -A, two from Section -B andtwo from Section -CJ SECTION -A [Answer any two questions.] Question 3: Perform the following operations: a) 10110.101)2 =(?)s [2] b) (473)s = (?)2 (2] c] 1||01].<1); =(?)16 [2] [2] d) (]101)2 -(11)2 (using 1's complement) e) (1101)21)2 (2] Question 4: [5] a) The Principal of a school intends to select students for admission to clasS XI based on the following criteria: Student is of the same school and passed the class XBOard examination with more than 60% has marks. OR Student is of the same school and has passed the class X Board Examination with less than 60% marks but has taken active part in co-curricular activities. The inputs are: Inputs Students of the same school P Haspassed the class XI Board Examination with more than 60% marks. Has taken an active part in co-curricular activities. Output X: Denotes admission status [ 1indicates granted and 0 indicates refused in allthese cases.] Draw the truth table for the inputs and outputs. Derive the terms with conjunctive operators for each true value (1's) from the output column. Also, write apropositional expression by joining the terms with disjunction operators. b)Prove the following Booleanexpression with the help of a truth table: 121 AB + BC+ CA'= AB +CA' c) State and proveDe Morgan's theorem with the help ofa truth table. 13 QU stion 5: u) Define Half Adder. Write the expression and draw the logic diggram for a half-adder. bl Draw the logic circuit for the following Boolean expression: X= (A' +B) .(C+D' ) c) Show that the expression (p => q) = (-q=> p). [5] (3| SECTION -B [Answer any two questions.] the logic of the Each question should be written in such a way that it cleariy depicts and comments in the problem. This can be achieved by using mnemonic names program. Flowcharts and algorithms are not required. [10] Question 6: of the factorial of its digits is A Specialnumber is a number in which the sum 145 ). Thus, 145 is a Special equal to the number. Example: 145(1! + 4! + 5! = number is a. Special number. Design a class Special tocheck if the given number or not. below: Some of the members of the class are given Class name Special Data member/instance variable: int n To store number Member functions/methods: Special( ) void read|) int factorial(int x) boolean isSpecial( ) default constructor to accept the number recursive return the factorial of a number Using techniqve checks for the special number by invoking the function factoriai( )and returns true ifSpecial, othewise returns false void display() displays the result with an appropriate message the Constructor, void read(), int Specify the class Special,giving details of display(). void factorial(int), boolean isSpecial( ), and an object and call the member Define the main() function to create enable the task. function according to Question 7: (10] separated by a Write a program to accept a sentence. The words are to be sentence does not sinale blank space. Print an error message if fhe input terminate with .' Or '?'. We can assume that nO word in the sentence exceeds 15 characters. sO that we get a proper formatted output. Perform the following tasks: a) Convert the first letter of each word to uppercase. b) Find the number of vowels ond consonants in each word and display them with proper headings and words. Sample Input: God is great. Sample Output: God is Great. Vowels Word God Consonants 3 Great [10] Question 8: Aclass Composite contains a two-dimensional array of order [m xn]. The maximum value possible for both 'm' and 'n' is 20. Design a class Composite to fill the aray with the first (m xn) composite numbers in column-wise. The details of the members of the class are given below: Class name Composite Data member/instance variable: arr]) stores thecomposite numbers column-wise M integer to store the number of rOwS integer to store the number of columns Member functions/methods: Composite(int mm, int nn) to initialize the size of the matrix m=mmand n=nn int isComposite int p) void fill) returns 1if number is composite otherwise returns 0 void display( ) omposite numbers in column-wise. displays the array in a matrix form. to fillthe elements of the array with the first (m x n)c Specify the class Composite giving details of the constructor(int, int),. int isComposite(int), voidfill( ) andvoid display( ). Define amain( ) function to create an object and callthe functions accordingly to enable the task. Section-C [Answer anytwo questions.] Each program should be written in such a way that it clearly depicts the logic of the problem stepwise. This can be achieved by using in the program and pseudOcodes for algorithms. The comments mnemonic names or programs must be written in Java must be written in and the algorifhms general/standard form, wherever required/specified. (Flowcharts are not required.) uestion 9 [5] Write a method to caloulate andreturn the sum of digits of anumber 'n' Usinga recursive technique. The method declaration is as follows: int sumSq(int n) aueston' 10 a) Is an algorithnm integral part of a program? Explain. b) State any one difference between recursion and iteration? (2) c) What is prolog in artificial intelligence? d) Which statement comes automatically in each class of a user defined package? Question 11: a) Abinary file named "XYZ.DAT" contains the product code(pc). unit price(up), and quantity(q)for the number of items. Write amethod to accept a product code 'p' and check the availability of the product and display with an appropriate message. The method declaration is as follows: void findpro(int p) b) State any one difference befween binary file and text file *************** ****% ***k ** *******k**** [4]

Formatting page ...

Related ResPapers
ISC Class XI Prelims 2024 : Computer Science (Lodha World School (LWS), Palava, Dombivili) : UNIT TEST
by snehika 
ISC Class XI Prelims 2024 : Computer Science (Marias Day School (MDS), Howrah)
by rickthetopper 
ISC Class XI Prelims 2017 : Computer Science (Don Bosco School, Park Circus, Kolkata)
by yashvardhanjain 
ISC Class XI Prelims 2017 : Computer Science (Don Bosco School, Park Circus, Kolkata)
by yashvardhanjain 

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...

 

  Print intermediate debugging step

Show debugging info


 

 


© 2010 - 2025 ResPaper. Terms of ServiceContact Us Advertise with us

 

snehika chat