Tamil Nadu Board of Secondary EducationHSC Science Class 12th

# Tamil Nadu Board Samacheer Kalvi solutions for Class 12th Computer Science Answers Guide chapter 4 - Algorithmic Strategies [Latest edition]

## Chapter 4: Algorithmic Strategies

Evaluation
Evaluation [Pages 43 - 45]

### Tamil Nadu Board Samacheer Kalvi solutions for Class 12th Computer Science Answers Guide Chapter 4 Algorithmic Strategies Evaluation [Pages 43 - 45]

#### Part I - Choose the best answer: (1 Marks)

Evaluation | Q 1. | Page 43

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

• Flowchart

• Flow

• Algorithm

• Syntax

Evaluation | Q 2. | Page 43

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

• Bubble sort

• Quicksort

• Merge sort

• Selection sort

Evaluation | Q 3. | Page 43

Two main measures for the efficiency of an algorithm are ______

• Processor and memory

• Complexity and capacity

• Time and space

• Data and space

Evaluation | Q 4. | Page 43

The complexity of linear search algorithm is ______

• O(n)

• O(log n)

• O(n2)

• O(n log n)

Evaluation | Q 5. | Page 43

From the following sorting algorithms which has the lowest worst-case complexity?

• Bubble sort

• Quicksort

• Merge sort

• Selection sort

Evaluation | Q 6. | Page 44

Which of the following is not a stable sorting algorithm?

• Insertion sort

• Selection sort

• Bubble sort

• Merge sort

Evaluation | Q 7. | Page 44

The time complexity of bubble sort in the best case is ______

• θ (n)

• θ (nlogn)

• θ (n2)

• θ (n(logn) 2)

Evaluation | Q 8. | Page 44

The Θ notation in asymptotic evaluation represents ______

• Base case

• Average case

• Worst case

• NULL case

Evaluation | Q 9. | Page 44

If a problem can be broken into subproblems that are reused several times, the problem possesses which property?

• Overlapping subproblems

• Optimal substructure

• Memoization

• Greedy

Evaluation | Q 10. | Page 44

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

• Saving value property

• Storing value property

• Memoization

• Mapping

#### Part II - Answer the following questions (2 Marks)

Evaluation | Q 1. | Page 44

What is an Algorithm?

Evaluation | Q 2. | Page 44

Define Pseudo code.

Evaluation | Q 3. | Page 44

Who is an Algorist?

Evaluation | Q 4. | Page 44

What is Sorting?

Evaluation | Q 5. | Page 44

What is searching? Write its types.

#### Part III - Answer the following questions (3 Marks)

Evaluation | Q 1. | Page 44

List the characteristics of an algorithm.

Evaluation | Q 2. | Page 44

Discuss Algorithmic complexity and its types.

Evaluation | Q 3. | Page 44

What are the factors that influence time and space complexity?

Evaluation | Q 4. | Page 44

Write a note on Asymptotic notation.

Evaluation | Q 5. | Page 44

What do you understand by Dynamic programming?

#### Part IV - Answer the following questions (5 Marks)

Evaluation | Q 1. | Page 45

Explain the characteristics of an algorithm.

Evaluation | Q 2. | Page 45

Discuss Linear search algorithm.

Evaluation | Q 3. | Page 45

What is Binary search? Discuss with example.

Evaluation | Q 4. | Page 45

Explain the Bubble sort algorithm with an example.

Evaluation | Q 5. | Page 45

Explain the concept of Dynamic programming with suitable examples.

Evaluation

## Tamil Nadu Board Samacheer Kalvi solutions for Class 12th Computer Science Answers Guide chapter 4 - Algorithmic Strategies

Tamil Nadu Board Samacheer Kalvi solutions for Class 12th Computer Science Answers Guide chapter 4 (Algorithmic Strategies) include all questions with solution and detail explanation. This will clear students doubts about any question and improve application skills while preparing for board exams. The detailed, step-by-step solutions will help you understand the concepts better and clear your confusions, if any. Shaalaa.com has the Tamil Nadu Board of Secondary Education Class 12th Computer Science Answers Guide solutions in a manner that help students grasp basic concepts better and faster.

Further, we at Shaalaa.com provide such solutions so that students can prepare for written exams. Tamil Nadu Board Samacheer Kalvi textbook solutions can be a core help for self-study and acts as a perfect self-help guidance for students.

Concepts covered in Class 12th Computer Science Answers Guide chapter 4 Algorithmic Strategies are Introduction to Algorithmic Strategies, Complexity of an Algorithm, Efficiency of an Algorithm, Algorithm for Searching Techniques, Sorting Techniques, Dynamic Programming.

Using Tamil Nadu Board Samacheer Kalvi Class 12th solutions Algorithmic Strategies exercise by students are an easy way to prepare for the exams, as they involve solutions arranged chapter-wise also page wise. The questions involved in Tamil Nadu Board Samacheer Kalvi Solutions are important questions that can be asked in the final exam. Maximum students of Tamil Nadu Board of Secondary Education Class 12th prefer Tamil Nadu Board Samacheer Kalvi Textbook Solutions to score more in exam.

Get the free view of chapter 4 Algorithmic Strategies Class 12th extra questions for Class 12th Computer Science Answers Guide and can use Shaalaa.com to keep it handy for your exam preparation