- Total number of questions: 65
- 30 questions carry one mark each
- 35 questions carry two marks each
- Negative marking: 1/3 of the marks allotted to the question
- Use of calculator is allowed
- This is a proctored examination
- All other browser applications will be automatically closed
- After three warnings, the examination window will close automatically
Exam Details
Computer Science & Information Technology (CS) 2012
Review the key details, then start the test when you are ready. You can also open the full package to see related papers.
Questions
65
Duration
180 mins
Package
Computer Science & Information Technology (CS) - Previous Year Papers
Paper pattern & analysis
Filter this paper by subject, topic or subtopic. Every graph updates from the selected questions.
Topic distribution
Subtopic distribution
Difficulty distribution
65questions
Easy
64
98.5%
Hard
1
1.5%
Question type distribution
65questions
Multiple Choices
65
100%
Instructions
Computer Science & Information Technology (CS) 2012 – Instructions
Syllabus
Full Syllabus
Sample questions from this paper
Questions are selected across the paper subjects wherever the paper contains that variety.
2012 · Unclassified
Computer Science & Information Technology (CS) 2012
Q.1 – Q.25 carry one mark each.
Consider the following logical inferences. I1: If it rains then the cricket match will not be played. Inference: The cricket match was played. Inference: There was no rain. I2: If it rains then the cricket match will not be played. It did not rain. Inference: The cricket match was played. Which of the following is TRUE?
2012 · Unclassified
Computer Science & Information Technology (CS) 2012
Which of the following is TRUE?
2012 · Unclassified
Computer Science & Information Technology (CS) 2012
Program gives no output as it is erroneous
What will be the output of the following C program segment? char inChar = 'A'; switch (inChar) case 'A': printf ("Choice A"); case 'B': case 'C': printf ("Choice B"); case 'D': case 'E': default : printf ( " No Choice" );
2012 · Unclassified
Computer Science & Information Technology (CS) 2012
Assuming P ≠ NP, which of the following is TRUE?
2012 · Unclassified
Computer Science & Information Technology (CS) 2012
The worst case running time to search for an element in a balanced binary search tree with n2 elements is
2012 · Unclassified
Computer Science & Information Technology (CS) 2012
The truth table
| X | Y | f(X, Y) |
|---|---|---|
| 0 | 0 | 0 |
| 0 | 1 | 0 |
| 1 | 0 | 1 |
| 1 | 1 | 1 |