My Cart
Your Cart 0

    Your cart is empty.

  • Total (Amount) ₹0.00
Exam Details

ISROComputer Science & Information Technology (CS) 2011

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 57 71.3%
Hard 15 18.8%
Easy 8 10%

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
2011 · Unclassified
ISROComputer Science & Information Technology (CS) 2011
The encoding technique used to transmit the signal in giga ethernet technology over fiber optic medium is
A
Differential manchester encoding
B
Non Return to zero
C
Non Return to zero
D
8B/1 OB encoding
E
None of these
2
2011 · Unclassified
ISROComputer Science & Information Technology (CS) 2011
Which of the following is an unsupervised neural network
A
RBS
B
Hopfield
C
Hopfield
D
Kohonen
E
DBS
3
2011 · Unclassified
ISROComputer Science & Information Technology (CS) 2011
In compiler terminology, reduction in strength means
A
Replacing run time computation by compile time computation
B
Removing loop invariant computation
C
Removing loop invariant computation
D
Replacing a costly operation by a relatively cheaper one
E
Other than given options
4
2011 · Unclassified
ISROComputer Science & Information Technology (CS) 2011
The following table shows the processes in the ready queue and time required for each process for completing its job.
Process
Time(ms)
P1
10
P2
5
P3
20
P4
8
P5
15
If round robin scheduling with 5ms is used what is the average waiting time of the processes in the queue?
A
27 ms
B
26.2 ms
C
27.5 ms
D
27.5 ms
5
2011 · Unclassified
ISROComputer Science & Information Technology (CS) 2011
MOV [BX], AL type of data addressing is called
A
Register addressing
B
Immediate addressing
C
Register indirect addressing
D
Immediate addressing
6
2011 · Unclassified
ISROComputer Science & Information Technology (CS) 2011
Evaluate (X⊕Y)⊕Y
A
All 1's
B
All 0's
C
X
D
All 0's