12th Computer Science Chapter- 4 Onemarks Online Test

Question 1: The word comes from the name of a persian mathematician abu jafar Mohammed ibn-i musa al khowarizmi is called?

A) Flowchart

B) Flow

C) Algorithm

D) Syntax

Question 2: From the following sorting algorithms which algorithm needs minimum number of swaps?

A) Bubble sort

B) Insertion sort

C) Selection sort

D) All the above

Question 3: Two main measures for the efficiency of an algorithm are

A) Processor and memory

B) Complexity and capacity

C) Time and space

D) Data and space

Question 4: The algorithm that yields expected output for a valid input is called as

A) Algorithmic solution

B) Algorithmic outcomes

C) Algorithmic problem

D) Algorithmic coding

Question 5: Which of the following is used to describe the worst case of an algorithm?

A) Big A

B) Big S

C)Big W

D) Big O

Question 6:Big Ω is the reverse of

A) Big O

B) Big θ

C) Big A

D)Big S

Question 7:Binary search is also called as

A) Linear search

B) Sequential search

C) Random search

D)Half-interval search

Question 8 :The θ notation in asymptotic evaluation represents

A) Base case

B) Average case

C) Worst case

D) NULL case

Question 9: If a problem can broken into subproblems which are reused several times,the problem possess which property?

A) Overlapping subproblem

B) Optimal structure

C) Memoizasion

D) Greedy

Question 10: In dynamic programming,the technique of storing the previously calculated values is called?

A) Saving value property

B) Storing value property

C) Memoization

D) Mapping

Report Card

Total Questions Attempted: 0

Correct Answers: 0

Wrong Answers: 0

Percentage: 0%