DataStructure Quiz -1

Which of the following is not the application of stack?

• Data Transfer between two asynchronous process

• Compiler Syntax Analyzer

• Tracking of local variables at run time

• A parentheses balancing program

The data structure required to check whether an expression contains a balanced parenthesis is?

• Queue

• Stack

• Tree

• Array

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

What is a data structure?

• A programming language
  

• A collection of algorithms

• A way to store and organize data

• A type of computer hardware
  View Answer

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

• a)74
  

• b) -18
  

• c) 22
  

• d) 40

The prefix form of A-B/ (C * D ^ E) is?

• a) -A/B*C^DE
  

• b) -A/BC*^DE
  

• c) -ABCD*^DE
  

• d) -/*^ACBDE

Which data structure is needed to convert infix notation to postfix notation?

• a)Tree

• Branch
  

• c) Stack
  

• d) Queue

What are the disadvantages of arrays?

• a) Index value of an array can be negative
  

• b) Elements are sequentially accessed
  

• c) Data structure like queue or stack cannot be implemented
  

• d) There are chances of wastage of memory space if elements inserted in an array are lesser than the allocated size

1. #include <stdio.h>  

2. int main()  

3. {  

4.    int arr[5]={10,20,30,40,50};  

5.    printf("%d", arr[5]);  

6.   

7.     return 0;  

8. }  

• 1. Garbage value

• 1. 10

• 1. 50

• 1. None of the above

1. Which of the following is not the correct statement for a stack data structure?

   1. 
      

• 1. Arrays can be used to implement the stack

• 1. Stack follows FIFO

• 1. Elements are stored in a sequential manner

• 1. Top of the stack contains the last inserted element