DS Q-1-2024 Batch

Which of the follwoing is a linear Data Strcuture

• Stack

• Array

• Queue

• Linked List

Binary Search Eelements are always in __________________

• Ascending Order

• Descending Order

• Either in Ascending Order or Descending Order

• Random Order

Which of the follwoing is a Primitive Data Structure

• float

• Tree

• Queue

• Linked List

A liner Data Strcutre contains ______________

• any number of adjacent elkkements

• At most 2 adjacent elements

• only one 1 adjacent element

• Only 3 adjacent elements

How to calculate Mid point in Binary Search

• mid=low+hihg/2

• mid=(low+high)/2

• mid=high/2

• mid=(low+high)

Which of the follwoing search technique is Best for more number of elements

• Linear

• Binary

• Either linear or Binary

• neither Linear nor Binary

What is the best case time complexity of Linear Search

• O(1)

• O(n²)

• O(n)

• O(logn)

What are the basic Data Structure Operations

• insert

• delete

• update

• sort

• search

In Binary Search the key element is found at second half then what are the updated values of 'low' and 'high'

• low=0,

  high=mid-1

• low=mid+1

  high=n-1

• low=n-1,

  high=mid+1

• No change in low and high

How can you define a Search in DS

• it is the process of arranging elements either in ascending order or descending order

• iti s the process to find out an element is present in given list of items.

• It is the process to delete an elment and replace an element

• Search is not related to Data structures