My Cart
Your Cart 0

    Your cart is empty.

  • Total (Amount) ₹0.00
Exam Details

Computer Science & Information Technology (CS) 2006

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 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 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

Medium 72 84.7%
Hard 11 12.9%
Easy 2 2.4%

Question type distribution

Multiple Choices 85 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
2006 · Unclassified
Computer Science & Information Technology (CS) 2006
Consider the polynomial The minimum number of multiplications needed to evaluate p on an input x is:
A
3
B
6
C
9
D
4
2
2006 · Unclassified
Computer Science & Information Technology (CS) 2006
Let X, Y, Z be sets of sizes x, y and z respectively. Let W = X × Y and E be the set of all subsets of W. The number of functions from Z to E is:
A
B
C
D
3
2006 · Unclassified
Computer Science & Information Technology (CS) 2006
The set {1, 2, 3, 5, 7, 8, 9} under multiplication modulo 10 is not a group. Given below are four plausible reasons. Which one of them is false?
A
It is not closed
B
2 does not have an inverse
C
3 does not have an inverse
D
8 does not have an inverse
4
2006 · Unclassified
Computer Science & Information Technology (CS) 2006
A relation R is defined on ordered pairs of integers as follows: (x, y) R(u, v) if x < u and y > v. Then R is:
A
Neither a Partial Order nor an Equivalence Relation
B
A Total Order
C
An Equivalence Relation
D
A Partial Order but not a Total Order
5
2006 · Unclassified
Computer Science & Information Technology (CS) 2006
For which one of the following reasons does Internet Protocol (IP) use the time to-live (TTL) field in the IP datagram header?
A
Ensure packets reach destination within that time
B
Discard packets that reach later than that time
C
Prevent packets from looping indefinitely
D
Limit the time for which a packet gets queued in intermediate routers.
6
2006 · Unclassified
Computer Science & Information Technology (CS) 2006
Consider three CPU-intensive processes, which require 10, 20 and 30 time units and arrive at times 0, 2 and 6, respectively. How many context switches are needed if the operating system implements a shortest remaining time first scheduling algorithm? Do not count the context switches at time zero and at the end.
A
1
B
2
C
4
D
3