XII COMPUTER SCIENCE EM TEST 4

JavaScript isn't enabled in your browser, so this file can't be opened. Enable and reload.

4. ALGORITHMIC STRATEGIES - one mark questions :

Prepared by S. Saminathan , GHSS - MUKHASAPARUR

https://sites.google.com/view/tn-computer-science/home

NAME *

SCHOOL *

GHSS - MUKHASAPARUR

OTHERS

1. The word comes from the name of a Persian mathematician Abu Ja’far Mohammed ibn-i Musa al Khowarizmi is called *

1 point

flowchart

flow

algorithm

syntax

2. From the following sorting algorithms which algorithm needs the minimum number of swaps? *

1 point

All the above

Bubble sort

Insertion sort

Selection sort

3. Two main measures for the efficiency of an algorithm are
*

1 point

Time and space

Data and space

Processor and memory

Complexity and capacity

4. The complexity of linear search algorithm is *

1 point

O(n)

O(n2)

O(log n)

O(n log n)

5. From the following sorting algorithms which has the lowest worst case complexity?
*

1 point

Bubble sort

Quick sort

Selection sort

Merge sort

6. Which of the following is not a stable sorting algorithm? *

1 point

Selection sort

Merge sort

Insertion sort

Bubble sort

7. Time complexity of bubble sort in best case is *

1 point

θ(n2)

θ(n(log)2)

θ(n)

θ(nlogn)

8. The Θ notation in asymptotic evaluation represents
*

1 point

Base case

Worst case

NULL case

Average case

9. If a problem can be broken into sub problems which are reused several times, the problem possesses which property? *

1 point

Memoization

Overlapping subproblems

Greedy

Optimal substructure

10. In dynamic programming, the technique of storing the previously calculated values is called ? *

1 point

Memoization

Saving value property

Mapping

Storing value property

Submit

Clear form

Never submit passwords through Google Forms.

This content is neither created nor endorsed by Google. Report Abuse - Terms of Service - Privacy Policy

Forms