download Mastguru Android App

Question Detail

Which data structure is needed to convert infix notations to postfix notations

  • linear list
  • tree
  • stack
  • queue

Answer: Option C

Similar Questions :

1. Sort which compares adjacent elements in a list and switches where necessary is

  • Insertion sort
  • Heap sort
  • Quick sort
  • Bubble sort

Answer: Option D

2. Which data structure is needed to convert infix notations to postfix notations

  • linear list
  • tree
  • stack
  • queue

Answer: Option C

3. Which sorting method is slowest

  • Quick sort
  • Heap sort
  • Shell sort
  • Bubble sort

Answer: Option D

4. A graph with one or more edges is at least

  • 1-chromatic
  • 2-chromatic
  • 3-chromatic
  • 4-chromatic

Answer: Option B

5. Which of the following name does not relate to stacks

  • FIFO lists
  • LIFO list
  • Piles
  • Push-down lists

Answer: Option A

Read more from - Data Structure Questions Answers - Chapter 1
Post a comment

    Mastguru Youtube Channel

    Videos @mastguru

    Free useful videos - Subscribe Mastguru
     

    Get Free Current Affairs and Govt Jobs Alerts in your mailbox

    To Appreciate Our Effort, Please Like Us

    Quantitative Aptitude
    English Aptitude
    Reasoning Aptitude
    Computer Awareness
    General Knowledge
    Current Affairs
    IT Officer Aptitude
    Programming Aptitude
    Latest Govt Jobs