- 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) 2013 [Session 1]
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) 2013 [Session 1] – Instructions
Syllabus
Full Syllabus
Sample questions from this paper
Questions are selected across the paper subjects wherever the paper contains that variety.
2013 · Unclassified
Computer Science & Information Technology (CS) 2013 [Session 1]
Q.1 – Q.25 carry one mark each.
A binary operation ⊕ on a set of integers is defined as x ⊕ y = x2 + y2. Which one of the following statements is TRUE about ⊕?
2013 · Unclassified
Computer Science & Information Technology (CS) 2013 [Session 1]
Suppose ρ is the number of cars per minute passing through a certain road junction between 5 PM and 6 PM, and ρ has a Poisson distribution with mean 3. What is the probability of observing fewer than 3 cars during any given minute in this interval?
2013 · Unclassified
Computer Science & Information Technology (CS) 2013 [Session 1]
Which one of the following does NOT equal
A
B
C
D
2013 · Unclassified
Computer Science & Information Technology (CS) 2013 [Session 1]
The smallest integer that can be represented by an 8-bit number in 2’s complement form is
2013 · Unclassified
Computer Science & Information Technology (CS) 2013 [Session 1]
In the following truth table, V = 1 if and only if the input is valid.
| Inputs | Outputs | |||
|---|---|---|---|---|
| D0 | D1 | D2 | X | V |
| 0 | 0 | 0 | X | 1 |
| 0 | 0 | 1 | X | 0 |
| 0 | 1 | 0 | X | 0 |
| 0 | 1 | 1 | X | 0 |
| 1 | X | X | 0 | 1 |
| X | 1 | 1 | 1 | 0 |
What function does the truth table represent?
2013 · Unclassified
Computer Science & Information Technology (CS) 2013 [Session 1]
Which one of the following is the tightest upper bound that represents the number of swaps required to sort n numbers using selection sort?