You may use gates with two or more inputs. (b) Reduce X(C, D, F, G) using Karnaugh’s Map.ĭraw the logic gate diagram for the reduced POS expression for X (C, D, F, G ) using AND and OR gate. (a) Draw the truth table for the inputs and outputs given above and write the POS expression for X(C, D, F, G). Output: X – Denotes the win/draw criteria (In all of the above cases 1 indicates yes and 0 indicates no) If Goalkeeper and Defenders perform well but the Centre players do not perform well. If the Centre and Forward players perform well but Defenders do not perform well. (a) F(A, B, C, D) = Σ (0, 2, 4, 5, 8, 9, 10, 12, 13)Ī Football Association coach analyzes the criteria for a win/draw of his team depending on the following conditions: Assume that the variables and their complements are available as inputs. (ii) Draw the logic gate diagram of the reduced expression. (i) Reduce the above expression by using 4-variable K-Map, showing the various groups (i.e. (iii) What is being computed by unknown (int n)? Īnswer seven questions in this part, choosing three questions from Section A, two from Section B and two from Section C. (ii) What will be returned by unknown(6)? (i) What will be returned by unknown(5)? Answer the given questions along with dry run / working, int unknown (int n) (b) The following function is a part of some class. What will be the output of the function Recur () when the value of n is equal to 10. (a) The following function Recur is a part of some class. (ii) FileReader / DatalnputStream/ InputStream/ FilelnputStream (d) (i) FileOutputStream/DataOutputStream/FileWriter/OutputStream Step 2: if top >= capacity then OVERFLOW, Exit Throws: This clause is used to indicate the exception that are not handled by the method. (a) Throw: This clause is used to explicitly raise a exception within the program, the statement would throw new exception. If the base address at M is 1840, determine the address at M when the matrix is stored in Row Major Wise. (e) A square matrix M of size 10 is stored in the memory’ with each element requiring 4 bytes of storage. (c) Write the algorithm for push operation (to add elements) in an array based stack. (b) Convert the following infix notation to its postfix form: (a) Differentiate between throw and throws with respect to exception handling. This is done by changing AND’s to OR’s and vice-versa, 0’s to Fs and vice-versa, complements remain unchanged. (a) To every Boolean equation there exists another equation which is dual to the previous equation. (c) Convert the following cardinal form of expression into its canonical form: (b) Minimize the expression using Boolean laws: While answering questions in this Part, indicate briefly your working and reasoning, wherever required. ISC Computer Science Previous Year Question Paper 2013 Solved for Class 12
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |