My Cart
Your Cart 0

    Your cart is empty.

  • Total (Amount) ₹0.00
Exam Details

Computer Science & Information Technology (CS) 2013 [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.

Explore previous papers
Showing all 65 questions in this paper.

Subject distribution

No subject classification is available.

Topic distribution

No topic classification is available.

Subtopic distribution

No subtopic classification is available.

Difficulty distribution

Easy 63 96.9%
Hard 2 3.1%

Question type distribution

Multiple Choices 63 96.9%
Fill in the blanks 2 3.1%

Instructions

Computer Science & Information Technology (CS) 2013 [Session 2] – Instructions
  • 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

Syllabus

Full Syllabus

Sample questions from this paper

Questions are selected across the paper subjects wherever the paper contains that variety.

1
2013 · Unclassified
Computer Science & Information Technology (CS) 2013 [Session 2]
Q.1 – Q.25 carry one mark each.

Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is 1/2. What is the expected number of unordered cycles of length three?

A
1/8
B
1
C
7
D
8
2
2013 · Unclassified
Computer Science & Information Technology (CS) 2013 [Session 2]

Which of the following statements is/are TRUE for undirected graphs? P: Number of odd degree vertices is even. Q: Sum of degrees of all vertices is even.

A
P only
B
Q only
C
Both P and Q
D
Neither P nor Q
3
2013 · Unclassified
Computer Science & Information Technology (CS) 2013 [Session 2]

Function f is known at the following points:

x0.00.30.60.91.21.51.82.12.42.73.0
f(x)0.00.090.360.811.442.253.244.415.767.299.00
The value of ∫03 f(x) dx computed using the trapezoidal rule is
A
8.983
B
9.003
C
9.017
D
9.045
4
2013 · Unclassified
Computer Science & Information Technology (CS) 2013 [Session 2]

Which one of the following functions is continuous at x = 3?

A
f(x) = x/2 if x = 3, x + 3 if x ≠ 3
B
f(x) = x²/4 if x = 3, 8 - x if x ≠ 3
C
f(x) = x + 3 if x < 3, x - 3 if x ≥ 3
D
f(x) = x² - 1 if x ≠ 3, -27 if x = 3
5
2013 · Unclassified
Computer Science & Information Technology (CS) 2013 [Session 2]

Which one of the following expressions does NOT represent exclusive NOR of x and y?

A
x ⊕ x ⊕ y
B
x ⊕ y ⊕ y
C
x ⊕ y
D
x ⊕ y ⊕ y
6
2013 · Unclassified
Computer Science & Information Technology (CS) 2013 [Session 2]

In a k-way set associative cache, the cache is divided into v sets, each of which consists of k lines. The lines of a set are placed in sequence one after another. The lines in set s are sequenced before the lines in set (s+1). The main memory blocks are numbered 0 onwards. The main memory block numbered j must be mapped to any one of the cache lines from

A
(j mod v) * k to (j mod v) * k + (k - 1)
B
(j mod v) to (j mod v) + (k - 1)
C
(j mod k) to (j mod k) + (v - 1)
D
(j mod k) * v to (j mod k) * v + (v - 1)