- 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 3]
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
53
81.5%
Hard
12
18.5%
Question type distribution
65questions
Multiple Choices
53
81.5%
Fill in the blanks
12
18.5%
Instructions
Computer Science & Information Technology (CS) 2013 [Session 3] – 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 3]
Q.1 – Q.25 carry one mark each.
Using public key cryptography, X adds a digital signature σ to message M, encrypts , and sends it to Y, where it is decrypted. Which one of the following sequences of keys is used for the operations?
2013 · Unclassified
Computer Science & Information Technology (CS) 2013 [Session 3]
Match the problem domains in GROUP I with the solution technologies in GROUP II.
| GROUP I | GROUP II |
|---|---|
| (P) Service oriented computing | (1) Interoperability |
| (Q) Heterogeneous communicating systems | (2) BPMN |
| (R) Information representation | (3) Publish-find-bind |
| (S) Process description | (4) XML |
Write your response
2013 · Unclassified
Computer Science & Information Technology (CS) 2013 [Session 3]
A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (the lowest priority). The scheduler re-evaluates the process priorities every T time units and decides the next process to schedule. Which one of the following is TRUE if the processes have no I/O operations and all arrive at time zero?
2013 · Unclassified
Computer Science & Information Technology (CS) 2013 [Session 3]
What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon- and unit-production (i.e., of type A → ε and A → a) to parse a string with n tokens?
2013 · Unclassified
Computer Science & Information Technology (CS) 2013 [Session 3]
Consider the languages L1 = Φ and L2 = a. Which one of the following represents L1 ∪ L2*?
2013 · Unclassified
Computer Science & Information Technology (CS) 2013 [Session 3]
Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary search tree of n nodes?