- 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) 2010
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
65
100%
Question type distribution
65questions
Multiple Choices
65
100%
Instructions
Computer Science & Information Technology (CS) 2010 – Instructions
Syllabus
Full Syllabus
Sample questions from this paper
Questions are selected across the paper subjects wherever the paper contains that variety.
2010 · Unclassified
Computer Science & Information Technology (CS) 2010
Q.1 – Q.25 carry one mark each.
Let G = (V, E) be a graph. Define ξ(G) = Σ ixdi, where ix is the number of vertices of degree d in G. If S and T are two different trees with ξ(S) = ξ(T), then
2010 · Unclassified
Computer Science & Information Technology (CS) 2010
Newton-Raphson method is used to compute a root of the equation x2 - 13 = 0 with 3.5 as the initial value. The approximation after one iteration is
2010 · Unclassified
Computer Science & Information Technology (CS) 2010
What is the possible number of reflexive relations on a set of 5 elements?
2010 · Unclassified
Computer Science & Information Technology (CS) 2010
Consider the set S = 1, ω, ω2, where ω and ω2 are cube roots of unity. If * denotes the multiplication operation, the structure (S, *) forms
2010 · Unclassified
Computer Science & Information Technology (CS) 2010
What is the value of lim (n → ∞) (1 - 1/n)n?
2010 · Unclassified
Computer Science & Information Technology (CS) 2010
The minterm expansion of f(P, Q, R) = PQ + QR + P̅R is