- 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) 2017 [Session 2]
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
45
69.2%
Hard
20
30.8%
Question type distribution
65questions
Multiple Choices
45
69.2%
Fill in the blanks
20
30.8%
Instructions
Computer Science & Information Technology (CS) 2017 [Session 2] – Instructions
Syllabus
Full Syllabus
Sample questions from this paper
Questions are selected across the paper subjects wherever the paper contains that variety.
2017 · Unclassified
Computer Science & Information Technology (CS) 2017 [Session 2]
Q.1 – Q.5 carry one mark each.
The representation of the value of a 16-bit unsigned integer X in hexadecimal number system is BCA9. The representation of the value of X in octal number system is
2017 · Unclassified
Computer Science & Information Technology (CS) 2017 [Session 2]
Correct : 1 Wrong : -0.33
(A) P → (ii), Q → (iv), R → (i), S → (iii) (B) P → (ii), Q → (i), R → (iv), S → (iii) (C) P → (ii), Q → (iv), R → (iii), S → (i) (D) P → (iii), Q → (iv), R → (ii), S → (i)
Match the following:
| (P) static char var; | (i) Sequence of memory locations to store addresses |
| (Q) m = malloc(10); m = NULL; | (ii) A variable located in data section of memory |
| (R) char *ptr[10]; | (iii) Request to allocate a CPU register to store data |
| (S) register int var1; | (iv) A lost memory which cannot be freed |
Write your response
2017 · Unclassified
Computer Science & Information Technology (CS) 2017 [Session 2]
Correct : 1 Wrong : -0.33
(A) P → (iii), Q → (iv), R → (i), S → (ii) (B) P → (i), Q → (ii), R → (iii), S → (iv) (C) P → (ii), Q → (iv), R → (iii), S → (i) (D) P → (iii), Q → (ii), R → (iv), S → (i)
Match the algorithms with their time complexities:
| Algorithm | Time complexity |
|---|---|
| (P) Towers of Hanoi with n disks | (i) θ(n2) |
| (Q) Binary search given n sorted numbers | (ii) θ(n log n) |
| (R) Heap sort given n numbers at the worst case | (iii) θ(2n) |
| (S) Addition of two n × n matrices | (iv) θ(log n) |
Write your response
2017 · Unclassified
Computer Science & Information Technology (CS) 2017 [Session 2]
Correct : 1 Wrong : -0.33
Let L1, L2 be any two context-free languages and R be any regular language. Then which of the following is/are CORRECT?
I. L1 ∪ L2 is context-free. II. L1 is context-free. III. L1 − R is context-free. IV. L1 ∩ L2 is context-free.
2017 · Unclassified
Computer Science & Information Technology (CS) 2017 [Session 2]
Correct : 1 Wrong : -0.33
Match the following according to input (from the left column) to the compiler phase (in the right column) that processes it:
| (P) Syntax tree | (i) Code generator |
| (Q) Character stream | (ii) Syntax analyzer |
| (R) Intermediate representation | (iii) Semantic analyzer |
| (S) Token stream | (iv) Lexical analyzer |
2017 · Unclassified
Computer Science & Information Technology (CS) 2017 [Session 2]
Q.6 – Q.10 carry two marks each.
Which of the following statements about parser is/are CORRECT?
I. Canonical LR is more powerful than SLR. II. SLR is more powerful than LALR. III. SLR is more powerful than Canonical LR.