1. What is a data structure?

• a) A programming language

• b) A collection of algorithms

• c) A way to store and organize data

• d) A type of computer hardware

2.What is the value of the postfix expression 6 3 2 4 + – *?

• a) 74

• b) -18

• c) 22

• d) 40

3. Which of the following is not the application of stack?

• a) Data Transfer between two asynchronous process

• b) Compiler Syntax Analyzer

• c) Tracking of local variables at run time

• d) A parentheses balancing program

4.The data structure required for Breadth First Traversal on a graph is?

• a) Array

• b) Stack

• c) Tree

• d) Queue

5.Which of the following application makes use of a circular linked list?

• a) Recursive function calls

• b) Undo operation in a text editor

• c) Implement Hash Tables

• d) Allocating CPU to resources

Which of the following is not the type of queue?

• a) Priority queue

• b) Circular queue

• c) Single ended queue

• d) Ordinary queue

7.What is the need for a circular queue?

• a) easier computations

• b) implement LIFO principle in queues

• c) effective usage of memory

• d) to delete elements based on priority

8.What will be the output of the following program?

main()

{

char str[]="san foundry";

int len = strlen(str);

int i;

for(i=0;i<len;i++)

push(str[i]); // pushes an element into stack

for(i=0;i<len;i++)

pop(); //pops an element from the stack

}

• a) yrdnuof nas

• b) foundry nas

• c) sanfoundry

• d) san foundry

8.The optimal data structure used to solve Tower of Hanoi is _________

• a) Tree

• b) Heap

• c) Priority queue

• d) Stack

9.What is the functionality of the following piece of code?

public void display()

{

if(size == 0)

System.out.println("underflow");

else

{

Node current = first;

while(current != null)

{

System.out.println(current.getEle());

current = current.getNext();

}

}

}

• a) display the list

• b) reverse the list

• c) reverse the list excluding top-of-the-stack-element

• d) display the list excluding top-of-the-stack-element