Data Structure-Algorithm MCQs

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 ?

ANSWER= (D) Program


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

ANSWER= (D) All of these


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

ANSWER= (B) Performance


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

ANSWER= (A) O(n)


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

ANSWER= (B) O(n2)


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

ANSWER= (A) Dynamic allocation


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

ANSWER= (C) Merge sort


Q.8 A technique for direct search is

ANSWER= (D) Hashing


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

ANSWER= (C) O(n)


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

ANSWER= (D) O(log(n) ) < O(n)


Q.11 Notation provides an asymptotic

ANSWER= (A) Upper bound


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

ANSWER= (C) 0(nlogn)


Q.13 Which is not the property of Quick sort

ANSWER= (D) Online


Q.14 Recursive algorithms are based on ?

ANSWER= (B) Bottom up approach


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

ANSWER= (C) Pivot key


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

    MAKAUT 2017

ANSWER= (C) 0(nlogn)


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

ANSWER= (D) Radix sort


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

ANSWER= (B) Less than deterministic algorithm


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

ANSWER= (C) O(nlogn)


Q.20 Worst case efficiency of binary search is

ANSWER= (A) log2 n+1

1. Official Telegram Click Here
2. Telegram For CSE MCQs Click Here
3. You TubeClick Here
error: Content is protected !!