My Cart
Your Cart 0

    Your cart is empty.

  • Total (Amount) ₹0.00
Exam Details

Computer Science & Information Technology (CS) 2007

Review the key details, then start the test when you are ready. You can also open the full package to see related papers.

Questions 85
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 85 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 85 100%

Question type distribution

Multiple Choices 85 100%

Instructions

Computer Science & Information Technology (CS) 2007 – Instructions
  • Total number of questions: 85
  • 20 questions carry one mark each
  • 65 questions carry two marks each
  • Negative marking: 1/4 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
2007 · Unclassified
Computer Science & Information Technology (CS) 2007
Q.1 – Q.20 carry one mark each.

Consider the following two statements about the function f(x) = |x|: P. f(x) is continuous for all real values of x Q. f(x) is differentiable for all real values of x Which of the following is TRUE?

A
P is true and Q is false.
B
P is false and Q is true.
C
Both P and Q are true.
D
Both P and Q are false.
2
2007 · Unclassified
Computer Science & Information Technology (CS) 2007

Let S be a set of n elements. The number of ordered pairs in the largest and the smallest equivalence relations on S are

A
n and n
B
n² and n
C
n² and 0
D
n and 1
3
2007 · Unclassified
Computer Science & Information Technology (CS) 2007

What is the maximum number of different Boolean functions involving n Boolean variables?

A
n²
B
2ⁿ
C
2²ⁿ
D
2ⁿ²
4
2007 · Unclassified
Computer Science & Information Technology (CS) 2007

Let G be the non-planar graph with the minimum possible number of edges. Then G has

A
9 edges and 5 vertices
B
9 edges and 6 vertices
C
10 edges and 5 vertices
D
10 edges and 6 vertices
5
2007 · Unclassified
Computer Science & Information Technology (CS) 2007

Consider the DAG with V = 1,2,3,4,5,6, shown below.

Question diagram

Which of the following is NOT a topological ordering?
A
1 2 3 4 5 6
B
1 3 2 4 5 6
C
1 3 2 4 6 5
D
3 2 4 1 6 5
6
2007 · Unclassified
Computer Science & Information Technology (CS) 2007

Which of the following problems is undecidable?

A
Membership problem for CFGs.
B
Ambiguity problem for CFGs.
C
Finiteness problem for FSAs.
D
Equivalence problem for FSAs.