Hey Guys Welcome to CSE Study247

In this page provide youData Structure-Algorithm MCQs Which is very useful of Many Exam Like semester , ISRO, DRDO, Banking , Railway etc.

### Data Structure

A data structure is **a specialized format for organizing, processing, retrieving and storing data**. There are several basic and advanced types of data structures, all designed to arrange data to suit a specific purpose. Data structures make it easy for users to access and work with the data they need in appropriate ways.

Q.1 When an algorithm is written in the form of any programming language it becomes a ?

Q.2 Which of the following is/are correct ?

Q.3 This characteristic often draws the line between what is feasible and what is impossible .

Q.4 What is the time complexity of insertion sort in best case?

Q.5 The average case complexity of Insertion Sort is ?

Q.6 Which of the following is possible with an array in c language ?

Q.7 Which of the following sorting algorithms has the lowest worst case complexity

Q.8 A technique for direct search is

Q.9 The worst case time complexity of the nondeterministic dynamic knapsack algorithm is ?

Q.10 Which of the following shows the correct relationship?

Q.11 Notation provides an asymptotic

Q.12 What is the lower bound for any comparison sort?

Q.13 Which is not the property of Quick sort

Q.14 Recursive algorithms are based on ?

Q.15 What do you call the selected keys in the quick sort method ?

Q.16 The time complexity for recurrent relation T(n)=2T(n/2)+n is

**MAKAUT 2017**

Q.17 The sorting method which is used for external sort is

Q.18 The time complexity of the non-deterministic algorithm is always

Q.19 The time complexity of heap sort in the worst case is

Q.20 Worst case efficiency of binary search is

1. Official Telegram | Click Here |

2. Telegram For CSE MCQs | Click Here |

3. You Tube | Click Here |