Advertisements
Online Mock Tests
Chapters
2: Data Abstraction
3: Scoping
▶ 4: Algorithmic Strategies
5: Python - Variables and Operators
6: Control Structures
7: Python functions
8: Strings and String manipulation
9: Lists, Tuples, Sets and Dictionary
10: Python Classes and objects
11: Database Concepts
12: Structured Query Language (SQL)
13: Python and CSV files
14: Importing C++ programs in Python
15: Data manipulation through SQL
16: Data visualization using pyplot: line chart, pie chart and bar chart
![Samacheer Kalvi solutions for Computer Science [English] Class 12 TN Board chapter 4 - Algorithmic Strategies - Shaalaa.com](/images/computer-science-english-class-12-tn-board_6:5f2b1b2038084cf381bfa42c826a928c.jpg "Samacheer Kalvi solutions for Computer Science [English] Class 12 TN Board chapter 4 - Algorithmic Strategies")
Advertisements
Solutions for Chapter 4: Algorithmic Strategies
Below listed, you can find solutions for Chapter 4 of Tamil Nadu Board of Secondary Education Samacheer Kalvi for Computer Science [English] Class 12 TN Board.
Samacheer Kalvi solutions for Computer Science [English] Class 12 TN Board 4 Algorithmic Strategies Evaluation [Pages 43 - 45]
Part I - Choose the best answer: (1 Marks)
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
From the following sorting algorithms which algorithm needs the minimum number of swaps?
Bubble sort
Quicksort
Merge sort
Selection sort
Two main measures for the efficiency of an algorithm are ______
Processor and memory
Complexity and capacity
Time and space
Data and space
The complexity of linear search algorithm is ______
O(n)
O(log n)
O(n2)
O(n log n)
From the following sorting algorithms which has the lowest worst-case complexity?
Bubble sort
Quicksort
Merge sort
Selection sort
Which of the following is not a stable sorting algorithm?
Insertion sort
Selection sort
Bubble sort
Merge sort
The time complexity of bubble sort in the best case is ______
θ (n)
θ (nlogn)
θ (n2)
θ (n(logn) 2)
The Θ notation in asymptotic evaluation represents ______
Base case
Average case
Worst case
NULL case
If a problem can be broken into subproblems that are reused several times, the problem possesses which property?
Overlapping subproblems
Optimal substructure
Memoization
Greedy
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)
What is an Algorithm?
Define Pseudo code.
Who is an Algorist?
What is Sorting?
What is searching? Write its types.
Part III - Answer the following questions (3 Marks)
List the characteristics of an algorithm.
Discuss Algorithmic complexity and its types.
What are the factors that influence time and space complexity?
Write a note on Asymptotic notation.
What do you understand by Dynamic programming?
Part IV - Answer the following questions (5 Marks)
Explain the characteristics of an algorithm.
Discuss Linear search algorithm.
What is Binary search? Discuss with example.
Explain the Bubble sort algorithm with an example.
Explain the concept of Dynamic programming with suitable examples.
Solutions for 4: Algorithmic Strategies
Samacheer Kalvi solutions for Computer Science [English] Class 12 TN Board chapter 4 - Algorithmic Strategies
Shaalaa.com has the Tamil Nadu Board of Secondary Education Mathematics Computer Science [English] Class 12 TN Board Tamil Nadu Board of Secondary Education solutions in a manner that help students grasp basic concepts better and faster. The detailed, step-by-step solutions will help you understand the concepts better and clarify any confusion. Samacheer Kalvi solutions for Mathematics Computer Science [English] Class 12 TN Board Tamil Nadu Board of Secondary Education 4 (Algorithmic Strategies) include all questions with answers and detailed explanations. This will clear students' doubts about questions and improve their application skills while preparing for board exams.
Further, we at Shaalaa.com provide such solutions so students can prepare for written exams. Samacheer Kalvi textbook solutions can be a core help for self-study and provide excellent self-help guidance for students.
Concepts covered in Computer Science [English] Class 12 TN Board chapter 4 Algorithmic Strategies are Introduction to Algorithmic Strategies, Complexity of an Algorithm, Efficiency of an Algorithm, Searching in Data Structure, Sorting in Data Structure, Dynamic Programming.
Using Samacheer Kalvi Computer Science [English] Class 12 TN Board solutions Algorithmic Strategies exercise by students is an easy way to prepare for the exams, as they involve solutions arranged chapter-wise and also page-wise. The questions involved in Samacheer Kalvi Solutions are essential questions that can be asked in the final exam. Maximum Tamil Nadu Board of Secondary Education Computer Science [English] Class 12 TN Board students prefer Samacheer Kalvi Textbook Solutions to score more in exams.
Get the free view of Chapter 4, Algorithmic Strategies Computer Science [English] Class 12 TN Board additional questions for Mathematics Computer Science [English] Class 12 TN Board Tamil Nadu Board of Secondary Education, and you can use Shaalaa.com to keep it handy for your exam preparation.
