My Cart
Your Cart 0

    Your cart is empty.

  • Total (Amount) ₹0.00
Exam Details

Computer Science & Information Technology (CS) 2003

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

Questions 90
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 90 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 68 75.6%
Hard 18 20%
Easy 4 4.4%

Question type distribution

Multiple Choices 90 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
2003 · Unclassified
Computer Science & Information Technology (CS) 2003
Consider the following C function. float f,(float x, int y) { float p, s; int i; for (s =1,p =1,i =1; i < y; i + +) { p * = x / i; s + = p; } return s; } For large values of y, the return value of the function f best approximates
A
xy
B
ex
C
xx
D
ln(1+x)
2
2003 · Unclassified
Computer Science & Information Technology (CS) 2003
Assume the following C variable declaration int * A[10], B[10][10]; Of the following expressions I. A[2] II. A[2][3] III. B[1] IV. B[2][3] which will not give compile-time errors if used as left hand sides of assignment statements in a C program?
A
I, II, and IV only
B
II and IV only
C
IV only
D
II, III, and IV only
3
2003 · Unclassified
Computer Science & Information Technology (CS) 2003
Let P(E) denote the probability of the event E. Given P(A) = 1, the values of P(A|B) and P(B|A) respectively are
A
B
C
D
4
2003 · Unclassified
Computer Science & Information Technology (CS) 2003
Let A be a sequence of 8 distinct integers sorted in ascending order. How many distinct pairs of sequences, B and C are there such that (i) each is sorted in ascending order, (ii) B has 5 and C has 3 elements, and (iii) the result of merging B and C gives A?
A
2
B
30
C
56
D
256
5
2003 · Unclassified
Computer Science & Information Technology (CS) 2003
n couples are invited to a party with the condition that every husband should be accompanied by his wife. However, a wife need not be accompanied by her husband. The number of different gatherings possible at the party is
A
B
C
D
6
2003 · Unclassified
Computer Science & Information Technology (CS) 2003
Let T (n) be the number of different binary search trees on n distinct elements. Then where x is
A
n – k + 1
B
n – k
C
n – k – 2
D
n – k – 1