My Cart
Your Cart 0

    Your cart is empty.

  • Total (Amount) ₹0.00
Exam Details

Computer Science & Information Technology (CS) 2004

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 69 76.7%
Hard 11 12.2%
Easy 10 11.1%

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
2004 · Unclassified
Computer Science & Information Technology (CS) 2004
The goal of structured programming is to
A
Have well indented programs
B
Be able to infer the flow of control from the compiled code
C
Be able to infer the flow of control form the program text
D
Avoid the use of GOTO statements
2
2004 · Unclassified
Computer Science & Information Technology (CS) 2004
Consider the following C function void swap (int a, int b) { int temp; temp = a ; a = b ; b = temp ; } In order to exchange the values of two variables x and y.
A
call swap (x, y)
B
call swap (&x, &y)
C
swap (x,y) cannot be used as it does not return any value
D
swap (x,y) cannot be used as the parameters are passed by value
3
2004 · Unclassified
Computer Science & Information Technology (CS) 2004
A single array A[1..MAXSIZE] is used to implement two stacks. The two stacks grow from opposite ends of the array. Variables top1 and top 2 (top1< top 2) point to the location of the topmost element in each of the stacks. If the space is to be used efficiently, the condition for “stack full” is
A
(top1 = MAXSIZE/2) and (top2 = MAXSIZE/2+1)
B
top1 + top2 = MAXSIZE
C
(top1 = MAXSIZE/2) or (top2 = MAXSIZE)
D
top1 = top2 –1
4
2004 · Unclassified
Computer Science & Information Technology (CS) 2004
The following numbers are inserted into an empty binary search tree in the given order: 10, 1, 3, 5, 15, 12, 16. What is the height of the binary search tree (the height is the maximum distance of a leaf node from the root)?
A
2
B
3
C
6
D
4
5
2004 · Unclassified
Computer Science & Information Technology (CS) 2004
The best data structure to check whether an arithmetic expression has balanced parentheses is a
A
queue
B
stack
C
list
D
tree
6
2004 · Unclassified
Computer Science & Information Technology (CS) 2004
Level order traversal of a rooted tree can be done by starting from the root and performing
A
preorder traversal
B
in-order traversal
C
depth first search
D
breadth first search