Similarly, the Space complexity of an algorithm quantifies the amount of space or memory taken by an algorithm to run as a function of the length of the input. The time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the length of the input. While analyzing an algorithm, we mostly consider time complexity and space complexity. (d) Big ‘O’ notation is a particular tool for assessing algorithm efficiency and is used to describe the performance or complexity of an algorithm. In other words, we can wrap a primitive value into a wrapper class object. When we create an object to a wrapper class, it contains a field and in this field, we can store primitive data types. (a) A Wrapper class is a class whose object wraps or contains primitive data types. (e) What is exceptional handling? Also, state the purpose of finally block in a try-catch statement. State the two factors which determine the complexity of an algorithm. (c) Convert the following infix notation to postfix form: If the base address at A is 1500 and the address of A is 1608, determine the order of the matrix when it is stored in Column Major Wise. (b) A matrix A is stored in the memory with each element requiring 4 bytes of storage. (a) What are the Wrapper classes? Give any two examples. ((X + Y’).(Y’ + Z))’ = (X + Y’)’ + (Y’+ Z)’Īgain applying De-Morgan’s theorem, we haveĪgain applying the principle of duality, we have = A + B’ (a) Commutative law states that the interchanging of the order of operands in a Boolean equation does not change its result. (d) Verify the following proposition with the help of a truth table: (b) Convert the following expression into its canonical POS form:

(a) State the Commutative law and prove it with the help of a truth table. While answering questions in this Part, indicate briefly your working and reasoning, wherever required. The intended marks for questions or parts of questions are given in brackets.All working, including rough work, should be done on the same sheet as the rest of the answer.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.They must NOT start writing during this time.Candidates are allowed additional 15 minutes for only reading the paper.ISC Computer Science Previous Year Question Paper 2018 Solved for Class 12

Format papier de infix pro