My Cart
Your Cart 0

    Your cart is empty.

  • Total (Amount) ₹0.00
Exam Details

ISROComputer Science & Information Technology (CS) 2014

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 54 67.5%
Hard 24 30%
Easy 2 2.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
2014 · Unclassified
ISROComputer Science & Information Technology (CS) 2014
Consider a 33 MHz CPU based system. What is the number of wait states required if it is interfaced with a 60ns memory? Assume a maximum of 10ns delay for additional circuitry like buffering and decoding.
A
0
B
1
C
2
D
3
2
2014 · Unclassified
ISROComputer Science & Information Technology (CS) 2014
The number of states required by a Finite State Machine, to simulate the behavior of a computer with a memory capable of storing 'm' words, with each word being 'n' bits long is
A
m x 2n
B
2m+n
C
2mn
D
m+n
3
2014 · Unclassified
ISROComputer Science & Information Technology (CS) 2014
What is the output of the following C program? #include #define SQR(x) x*xint main() { int a; int b=4; a = SQR(b+2); printf("%d\n",a); return 0; }
A
14
B
18
C
20
D
36
4
2014 · Unclassified
ISROComputer Science & Information Technology (CS) 2014
Consider the following pseudo-code while (m < n) if (x > y) and (a < b) then a = a+1 y = y-l end if m = m+l end while What is the cyclomatic complexity of the above pseudo-code?
A
2
B
3
C
4
D
5
5
2014 · Unclassified
ISROComputer Science & Information Technology (CS) 2014
What is the number of steps required to derive the string ((() ()) ()) for the following grammar. SSS S (S) S
A
10
B
12
C
16
D
15
6
2014 · Unclassified
ISROComputer Science & Information Technology (CS) 2014
The process of modifying IP address information in IP packet headers while in transit across a traffic routing device is called
A
Port address translation (PAT)
B
Network address translation (NAT)
C
Port mapping
D
Address mapping