download Mastguru Android App

Question Detail

Deletion from one end and insertion from other end is

  • stack
  • branch
  • tree
  • queue

Answer: Option D

Similar Questions :

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

  • linear list
  • tree
  • stack
  • queue

Answer: Option C

2. The complexity of Bubble sort algorithm is

  • O(n)
  • O(log n)
  • O(n2)
  • O(n log n)

Answer: Option C

3. How many divisions are there in COBOL language

  • Two
  • Three
  • Four
  • Five

Answer: Option C

4. Merge sort uses

  • Divide and conquer strategy
  • Backtracking approach
  • Heuristic search
  • Greedy approach

Answer: Option A

5. The complexity of Binary search algorithm is

  • O(n)
  • O(log n)
  • O(n2)
  • O(n log n)

Answer: Option B

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