DataStructures

1. 1. 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

2. 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

3. 3. Which of the following statement(s) about stack data structure is/are NOT correct?

• a) Top of the Stack always contain the new node

• b) Stack is the FIFO data structure

• c) Null link is present in the last node at the bottom of the stack

• d) Linked List are used for implementing Stacks

4. 4. Which of the following is not the type of queue?

• a) Priority queue

• b) Circular queue

• c) Single ended queue

• d) Ordinary queue

5.What will be the output?

import java.util.*;

class Main

{

public static void main(String args[])

{

String str="Technical";

Stack<Character> s=new Stack<>();

for(int i=0;i<str.length();i++)

{

char c=str.charAt(i);

s.push(c);

}

s.pop();

s.peek();

s.pop();

System.out.println(s);

}

}

• [T, e, c, h, n, i, c]

• [T, e, c, h, n, i, c, a]

• [T, e, c, h, n, i]

• [T, e, c, h, n, i, c, a, l]

6. 6. What will be the output?

public class Main

{

public static void main(String args[])

{

int []arr = {1,2,3,4,5};

System.out.println(arr[4]);

System.out.println(arr[5]);

}

}

• a)

  4

  5

• b) ArrayIndexOutOfBoundsException

  5

• c) ArrayIndexOutOfBoundsException

• d)

  5

  ArrayIndexOutOfBoundsException

8. 8. Which of the real world scenarios would you associate with a stack data structure?

• a) offer services based on the priority of the customer

• b) piling up of the chairs one after the other

• c) people standing a line to be serviced at a counter

• d) tatkal ticket booking in IRCTC

9. 9. An error is thrown if the character '\n' pushed into the stack

• a) true

• b) false

10. 9. Consider the following operation performed on a stack of size 5.

    Push(1);

11. Pop();

12. Push(2);

13. Push(3);

14. Pop();

15. Push(4);

16. Pop();

17. Pop();

18. Push(5);

19. After the completion of all operation, the number of elements present in stack is?

• a) 1

• b) 2

• c) 3

• d) 4

10. 10. If the elements “A”, “B”, “C” and “D” are placed in a stack and are deleted one at a time, what is the order of removal?

• a) ABCD

• b) DCBA

• c) DCAB

• d) ABDC