25 views

Uploaded by Jayna

mcq for design and analysis of algorithm

mcq for design and analysis of algorithm

© All Rights Reserved

- ICP Assignments.doc
- Www Thelearningpoint Net Computer Science Data Structures Qu
- BESU CSE Syllabus
- Big-O Algorithm Complexity Cheat Sheet
- Data Clustering Using the Bees Algorithm
- 01 Ab Initio Basics
- Maple 9 Advanced Programming Guide.pdf
- Dev.Mag - 03
- Questions on Data Structure
- Cole Parallel Mergesort SIAM 1988
- Baidu Sort 2014
- 06CSL58ADAManual
- Chapter 1
- Question Bank
- ozsort-2010
- Arrays Technical Document
- Wk 13 L2
- Computing Iceberg Queries Efficiently
- Ice Berg Query
- Me608 Final Project Sterba Li

You are on page 1of 8

B. Item is not in the array at all

C. Item is the last element in the array

D. Item is the last element in the array or item is not there at all

efficient.

A. Merge

B. Heap

C. Selection

D. Bubble

the number n of items to be sorter.

A. average time

B. running time

C. average-case complexity

D. case-complexity

B. requirement of sorted array is expensive when a lot of insertion and

deletions are needed

C. there must be a mechanism to access middle element directly

D. binary search algorithm is not efficient when the data elements more than

1500.

A. when item is somewhere in the middle of the array

B. when item is not the array at all

C. when item is the last element in the array

D. Item is the last element in the array or item is not there at all

A. sorted linked list

B. sorted binary trees

C. sorted linear array

D. pointer array

A. O(n)

B. O(logn)

C. O(n2)

D. O(n logn)

A. Simple algorithm which require the order of n2 comparisons to sort n

items.

B. Sophisticated algorithms that require the O(nlog2n) comparisons to sort

items.

C. Both of the above

D. None of the above

A. O(n)

B. O(logn)

C. O(n2)

D. O(n logn)

i) Internal sorting are applied when the entire collection if data to be sorted

is small enough that the sorting can take place within main memory.

ii) The time required to read or write is considered to be significant in

evaluating the performance of internal sorting.

A. i-True, ii-True

B. i-True, ii-False

C. i-False, ii-True

D. i-False, ii-False

A. O(n)

B. O(logn)

C. O(n2)

D. O(n logn)

yields a larger sorted order list.

A. Insertion

B. Extraction

C. Selection

D. Distribution

13) ............order is the best possible for array sorting algorithm which sorts

n item.

A. O(n logn)

B. O(n2)

C. O(n+logn)

D. O(logn)

14) ......... is rearranging pairs of elements which are out of order, until no

such pairs remain.

A. Insertion

B. Exchange

C. Selection

D. Distribution

A. Radix sort

B. Insertion

C. Heap

D. Quick

16) Which of the following sorting algorithm is of divide and conquer type?

A. Bubble sort

B. Insertion sort

C. Merge sort

D. Selection sort

total number of elements.

A. Heap

B. Insertion

C. Bubble

D. Quick

18) Which of the following sorting algorithm is of priority queue sorting type?

A. Bubble sort

B. Insertion sort

C. Merge sort

D. Selection sort

19) Which of the following is not the required condition for binary search

algorithm?

A. The list must be sorted

B. There should be the direct access to the middle element in any sub list

C. There must be mechanism to delete and/or insert elements in list.

D. Number values should only be present

A. quick sort

B. tree sort

C. heap sort

D. bubble sort

Answers:

1) D. Item is the last element in the array or item is not there at all

2) C. Selection

3) B. running time

4) D. binary search algorithm is not efficient when the data elements more

than 1500.

5) A. when item is somewhere in the middle of the array

6) D. pointer array

7) A. O(n)

8) C. Both of the above

9) C. O(n2)

10) B. i-True, ii-False

11) D. O(n logn)

12)

13)

14)

15)

16)

17)

18)

19)

20)

A. Insertion

C. O(n+logn)

B. Exchange

A. Radix sort

C. Merge sort

B. Insertion

D. Selection sort

C. There must be mechanism to delete and/or insert elements in list.

A. quick sort

- ICP Assignments.docUploaded bykjislam
- Www Thelearningpoint Net Computer Science Data Structures QuUploaded byNapster
- BESU CSE SyllabusUploaded byManojit
- Big-O Algorithm Complexity Cheat SheetUploaded bysmallik3
- Data Clustering Using the Bees AlgorithmUploaded byPedro Pablo Burrola Chávez
- 01 Ab Initio BasicsUploaded bySahil Ahamed
- Maple 9 Advanced Programming Guide.pdfUploaded byAnonymous 7lnR7Qkss
- Dev.Mag - 03Uploaded bygeorgpiorczynski
- Questions on Data StructureUploaded bySai Siva
- Cole Parallel Mergesort SIAM 1988Uploaded bydrakseh
- Baidu Sort 2014Uploaded byPingkai Liu
- 06CSL58ADAManualUploaded byVinothkanna Gopalpillai Devarajan
- Chapter 1Uploaded byJustA Dummy
- Question BankUploaded byAnkit Kumar
- ozsort-2010Uploaded bymanuelq9
- Arrays Technical DocumentUploaded bydsamuel5733
- Wk 13 L2Uploaded byrizvi098
- Computing Iceberg Queries EfficientlyUploaded byanon-775312
- Ice Berg QueryUploaded byPreetpal Singh
- Me608 Final Project Sterba LiUploaded byferroburak
- Priority QueuesUploaded bysonal
- The Importance of AlgorithmsUploaded bypiratelohit5265
- Parallel DatabaseUploaded bySameer Memon
- KMeansExampleUploaded byRandima Hettiarachchi
- TrialUploaded byurusan donya
- daa_unit-IIUploaded byThink and grow rich
- 10.1.1.132Uploaded byA'am Chayank Phiphie
- Ch-3Uploaded bymenber
- CIRRELT-2007-41 - BOX PACKING.pdfUploaded byAlexandru Dutuc
- slides18-parallelism.pdfUploaded by252966576

- atsp-aaai93-sympUploaded byAlexey Solodovnikov
- Hw1Uploaded byaditya_dhananjay
- 409 Lecture 13 Laws of QsUploaded by김기범
- Chomsky Normal FormUploaded byGopal K Verma
- Ex407Uploaded byNg Chun Hiu
- Class 23 Finishing StacksUploaded byAhmed Qazi
- C-T Systems Laplace Transform…Solving Differential EquationsUploaded byhamza abdo mohamoud
- CholeSkyUploaded bynavri_nalhad
- fpl-mcq (1)Uploaded byDeepak Rana
- Chapter 8 Manual OgataUploaded byKalim Ullah
- HomeWork 2 - 20111003Uploaded byguru2411
- ArticleUploaded bymariumamna
- 4.0 Classification Methodologies RUploaded byDionie Wilson Diestro
- The Quay Crane Scheduling ProblemUploaded byTijana Mladenovic
- Matlab 6 AyushUploaded bySushil Kumar
- Map Coloring WP2.pdfUploaded bySamuel Waweru
- Treatment of Missing ValuesUploaded byManasKPathak
- A Speech-And-Speaker Identification System Feature Extraction, Description, And Classification of Speech-Signal ImageUploaded byAashita Irani
- r05410205 Advanced Control SystemsUploaded byShashidhar Kasthala
- steg2Uploaded byRavi Banothu
- LABEX3_DFTUploaded bydangvuduong
- Final Fall00Uploaded bychemchemha
- 03-DecisionAnalysis.pptUploaded byAilin Winoto
- Adaptive_Control_TutorialUploaded bym2kam21
- Gvp Mtech AdminUploaded bybhanuprasaddurga
- A BOOTSTRAP APPROACH FOR IMPROVING LOGISTIC REGRESSION PERFORMANCE IN IMBALANCED DATA SETSUploaded byGlobal Research and Development Services
- Inventory ControlUploaded bydiikn290
- pid-loop-tuning-tips-pocket-guide.pdfUploaded bygudapati9
- Combining of Random Forest Estimates Using LSboost for Stock Market Index PredictionUploaded byJames Liu
- Car Plate Recognition by Neural Networks and Image Processing Using Integration of WaveletsUploaded byjamal fathi