CBSE, ICSE, ISC, HSC, SSC Board and School Question Papers
ISC Class 12 Computer Applications Previous Year Board and Sample Prelim Question Papers
ISC Class 12 Computer Science
Computer Science is the study of conceptual foundation of information and computation, along with their practical knowledge and application on computers. Computer along with the internet has proven to be the most powerful device existing in the world. The subject is practical and interdisciplinary in nature, while it has some major characteristics of an academic discipline. Computer Science in not a static field, it grows and develops continually with changes in technological advances.
ISC Class 12 Computer Science is a very high scoring subject. The students can score excellent marks in the subject just by following the questions and solutions. The students need to be clear with not only class 12 concepts but even 11th class concepts. They need to practice lots of questions on programming, they need to learn the definitions and memorise them and last but not the least they need to practice sample papers, previous year board question papers and school prelim question papers for giving them an idea on different type of questions in the exam.
The aim of TestPaperz is to provide intense practice to the students, so students are well aware of the types of questions asked in the board exam and are prepared for them. We have aggregated various previous year question papers, sample papers and school prelim papers which can be downloaded for free. Click below to download:
ISC Class 12 Computer Science consists of two papers. Paper I is the theory paper of 70 marks having a duration of 3 hours and Paper II is practical of 30 marks having a duration of 3 hours. The syllabus* includes:
First: Boolean Algebra
Propositional logic, truth values and interpretation of well formed formulae (wff), well-formed formulae, satisfiable, unsatisfiable and valid formulae, truth tables. Equivalence laws and their usage in simplifying wffs. Binary valued quantities; Basic postulates of Boolean algebra; truth tables; operations AND, OR and NOT.
Basic theorems of Boolean algebra (e.g. Duality, commutativity, associativity, distributivity, idempotence, operations with 0 and 1, involution, absorption, complements), reducing Boolean expressions to sum of products and product of sums forms, De Morgan’s theorem and its applications, Karnaugh maps (up to four variables).
Second: Computer Hardware
Elementary logic gates (NOT, AND, NAND, OR, XOR, NOR, XNOR) and their use in circuits.
Applications of Boolean algebra and logic gates to full adders, half adders, decoders, encoders, multiplexers, NOR, NAND as universal gates.
SECTION B: The programming element in the syllabus attempts to give practical knowledge to the students. It enables students at algorithmic problem solving instead of rote learning. Students can use any development environment: such as Eclipse, BlueJ, Netbeans etc. BlueJ is recommended because it’s simple and easy to use.
Third: Implementation of algorithms to solve problems
The students are given lab assignments in the computer lab along with the lectures. Programming assignments should be done such that each assignment covers one major topic. Sufficiently challenging assignment problems should be designed. Students must design algorithm, address correctness issues, implement and execute it in Java. The algorithm should be debugged f necessary.
Fourth: Programming in Java (Class XI Sections B and C review)
Items fourth to thirteenth should be introduced simultaneously along with classes and their definitions.
Objects as data (attributes) + behavior (methods); object as an instance of a class. Constructors,
Real world programming analysis through examples in terms of classes and objects.
Basic input/output using Scanner and Printer classes from JDK; input/output exceptions. Tokens in an input stream, extracting tokens from an input stream (String Tokenizer class), concept of whitespace.
Sixth: Primitive values, wrapper classes, types and casting
Primitive values and types: byte, short, int, double, char, long, float, Boolean. Class as mechanism for user defined types. Class as type of the object. Corresponding wrapper classes for each primitive type. Changing types through user defined casting. Automatic type coercion for some primitive types.
Seventh: Variables, expressions
Variables as names for values; named constants, expressions (logical and arithmetic) and their evaluation (associativity, operators, precedence). Assignment operation; difference between right hand side and left hand side of an assignment.
Eighth: Statements, scope
Statement; Conditional (if, if-else-if, if- else, ternary operator, switch case), , looping (while, for, do-while, break, continue); visibility and scope of variables, grouping statements in blocks.
Methods (as abstractions for complex user defined operations on objects), formal and actual arguments in methods, different behaviour of primitive arguments and object arguments. Static method and variables. The this variable. Examples of using methods for algorithmic problem solving (finding roots of algebraic equations, number problems etc.).
Tenth: Arrays, strings
Structured data types –arrays (single and multi-dimensional), strings, address calculations. Example algorithms that use structured data types (e.g. finding maximum/minimum, searching, solving systems of linear equations, sorting techniques, substring, concatenation, access to char in string, length, etc.).
Concept of recursion, recursive methods – simple ones (e.g. binary search, factorial, GCD, conversion of representations of numbers between different bases).
Twelfth: Inheritance. Interfaces and polymorphism
Inheritance, super and derived classes; member access in derived classes; methods in subclasses and redefinition of variables; abstract classes; base and derived classes, protected visibility; class Object. Dynamic binding and Subclass polymorphism.
Interfaces in Java; interfaces for user defined implementation of behavior; implementing interfaces through a class.
Thirteenth: Data structures
Basic data structures (queue, stack, dequeue), implementation directly through classes; definition through an interface & multiple implementation by interface implementation. Conversion of Infix to Postfix and Prefix notations.
Single linked list (Algorithm and programming), tree traversals (Conceptual), binary trees.
Fourteenth: Complexity and big O notation
Concept of input size; Concrete computational complexity; estimating complexity in terms of methods; importance of dominant term; Constants worst, average and best case.
*For detailed and exact syllabus please refer to CISCE Website
Download ISC Class 12 other subjects Question papers absolutely free by clicking below: