My Cart
Your Cart 0

    Your cart is empty.

  • Total (Amount) ₹0.00
Exam Details

Computer Science & Information Technology (CS) 2005

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 74 82.2%
Hard 11 12.2%
Easy 5 5.6%

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
2005 · Unclassified
Computer Science & Information Technology (CS) 2005
What does the following C-statement declare? int (* f) (int *);
A
A function that takes an integer pointer as argument and returns an integer
B
A function that takes an integer as argument and returns an integer pointer
C
A pointer to a function that takes as integer pointer as argument and returns an integer
D
A function that takes an integer pointer as argument and returns a function pointer
2
2005 · Unclassified
Computer Science & Information Technology (CS) 2005
An Abstract Data Type (ADT) is
A
same as an abstract class
B
a data type that cannot be instantiated
C
a data type for which only the operations defined on it can be used, but none else
D
all of the above
3
2005 · Unclassified
Computer Science & Information Technology (CS) 2005
A common property of logic programming languages and functional languages is
A
both are procedural languages
B
both are based on 1-calculus
C
both are declarative
D
both use Horn-clauses
4
2005 · Unclassified
Computer Science & Information Technology (CS) 2005
Which one of the following are essential features of an object-oriented programming language? Abstraction and encapsulation Strictly-typedness Type-safe property coupled with sub-type rule Polymorphism in the presence of inheritance
A
(i) and (ii) only
B
(i) and (iv) only
C
(i), (iii) and (iv) only
D
(i), (ii) and (iv) only
5
2005 · Unclassified
Computer Science & Information Technology (CS) 2005
A program P reads in 500 integers in the range (0, 100) representing the scores of 500 students. It then prints the frequency of each score above 50. What would be the best way for P to store the frequencies?
A
An array of 50 numbers
B
An array of 500 numbers
C
A dynamically allocated array of 550 numbers
D
An array of 100 numbers
6
2005 · Unclassified
Computer Science & Information Technology (CS) 2005
An undirected graph C has n nodes. Its adjacency matrix is given by an n × n square matrix whose (i) diagonal elements are 0’s, and (ii) non-diagonal elements are l’s. Which one of the following is TRUE?
A
Graph G has no minimum spanning tree (MST)
B
Graph G has a unique MST of cost n–1
C
Graph G has multiple distinct MSTs, each of cost n–1
D
Graph G has multiple spanning trees of different costs