My Cart
Your Cart 0

    Your cart is empty.

  • Total (Amount) ₹0.00
Exam Details

ISROComputer Science & Information Technology (CS) 2013

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 58 72.5%
Hard 18 22.5%
Easy 4 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
2013 · Unclassified
ISROComputer Science & Information Technology (CS) 2013
Let A (1:8, -5:5, -10:5) be a three dimensional Arrays. How many elements are there in the Arrays A?
A
1200
B
1408
C
33
D
33
2
2013 · Unclassified
ISROComputer Science & Information Technology (CS) 2013
The number of rotations required to insert a sequence of elements 9,6,5,8,7,10 into an empty AVL tree is?
A
0
B
1
C
1
D
3
E
4
3
2013 · Unclassified
ISROComputer Science & Information Technology (CS) 2013
Opportunistic reasoning is addressed by which of the following knowledge representation
A
Script
B
Blackboard
C
Blackboard
D
Logic Gate
E
Fuzzy Logic
4
2013 · Unclassified
ISROComputer Science & Information Technology (CS) 2013
The following steps in a linked list p = getnode() info (p) = 10 next (p) = list list = p result in which type of operation?
A
a pop operation in stack
B
removal of a node
C
inserting a node
D
removal of a node
5
2013 · Unclassified
ISROComputer Science & Information Technology (CS) 2013
Shift reduce parsing belongs to a class of
A
bottom up parsing
B
recursive parsing
C
recursive parsing
D
top down parsing
6
2013 · Unclassified
ISROComputer Science & Information Technology (CS) 2013
Which of the following productions eliminate left recursion in the productions given below: S → Aa | b A → Ac | Abd | ε
A
S → Aa | b, A→ bdA', A’ →A’c | A'ba | A | ε
B
S → Aa | b, A→A' , A' → cA' | bdA' | ε
C
S → Aa | b, A →A’c | A'd , A’ → bdA' | cA | ε
D
S → Aa | b, A →A’c | A'd , A’ → bdA' | cA | ε