My Cart
Your Cart 0

    Your cart is empty.

  • Total (Amount) ₹0.00
Exam Details

ISROComputer Science & Information Technology (CS) 2016

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

Questions 80
Duration 180 mins
Package GATE & PSU 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 80 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

Medium 62 77.5%
Easy 12 15%
Hard 6 7.5%

Question type distribution

Multiple Choices 80 100%

Instructions

Demo Instruction

Syllabus

Sample

Sample questions from this paper

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

1
2016 · Unclassified
ISROComputer Science & Information Technology (CS) 2016
Which of the following is true?
A
√3 + √7 = √10
B
√3 + √7 ≤ √10
C
√3 + √7 < √10
D
√3 + √7 > √10
2
2016 · Unclassified
ISROComputer Science & Information Technology (CS) 2016
What is the sum of infinity of the series, 3+6x2+9x4+12x6+….given |x|<1?
A
3/(1+x2)
B
3/(1+x2)2
C
3/(1-x2)2
D
3/(1-x2)
3
2016 · Unclassified
ISROComputer Science & Information Technology (CS) 2016
Limx->0 ( √1+x - √1-x ) / x is given by
A
0
B
-1
C
1
D
2025-01-02 13:30:00
4
2016 · Unclassified
ISROComputer Science & Information Technology (CS) 2016
If (G, .) is a group such that (ab)-1 = a-1b-1, ∀a, b ε G, then G is an
A
Commutative semi group
B
Abelian group
C
none of these
D
non Abelian group
5
2016 · Unclassified
ISROComputer Science & Information Technology (CS) 2016
A given connected graph G is a Euler Graph if and only if all vertices of G are of:
A
Same degree
B
Even degree
C
different degree
D
odd degree
6
2016 · Unclassified
ISROComputer Science & Information Technology (CS) 2016
The maximum number of edges in a n-node undirected graph without self loops is
A
n2
B
n(n-1)/2
C
n(n+1)/2
D
n-1