Diamond (हीरा)

Rectangle (आयत)

Circle (वृत्त)

Arrow (तीर)

Input/Output

Process

Decision

Connector

A type of programming language

A step-by-step procedure to solve a problem

A type of flowchart

A mathematical formula

Greedy Algorithm

Divide and Conquer Algorithm

Genetic Algorithm

Flowchart Algorithm

Parallelogram (समानांतर चतुर्भुज)

Rectangle (आयत)

Diamond (हीरा)

Circle (वृत्त)

Backtracking Algorithm

Recursive Algorithm

Iterative Algorithm

Dynamic Programming

Debugging the code

Understanding the problem

Drawing a flowchart

Testing the solution

Bubble Sort

Merge Sort

Linear Search

Breadth-First Search

Input/Output

Yes/No Decision

Process Step

End

Using arrows to form a cycle

Using a parallelogram

Using multiple diamonds

Using ovals

Greedy Algorithm

Dynamic Programming

Brute Force Algorithm

Backtracking

n * (n + 1)

n * (n - 1)

(n * (n + 1)) / 2

n^2

Finiteness

Feasibility

Accuracy

Infinite Loops

Connector (चक्र)

Diamond (हीरा)

Rectangle (आयत)

Oval (अंडाकार)

Bubble Sort

Quick Sort

Selection Sort

Insertion Sort

O(n)

O(n^2)

O(1)

O(log n)

Always finds the globally optimal solution

Makes a locally optimal choice at each step

Uses dynamic programming

Backtracks to find the solution

Rectangle (आयत)

Parallelogram (समानांतर चतुर्भुज)

Oval (अंडाकार)

Diamond (हीरा)

Quick Sort

Dijkstra's Algorithm

Merge Sort

Binary Search

It must be efficient

It must terminate after a finite number of steps

It must give multiple outputs

It must not have any condition

Adding two numbers

Printing a document

Making a decision

Reading a file

Flowchart Tracing

Dry Run

Debugging

Simulation

An algorithm that calls itself

An algorithm that loops indefinitely

An algorithm that solves problems iteratively

An algorithm with multiple exit points

Positive

Negative

Zero

Error

Binary Search

Linear Search

Quick Sort

Merge Sort

Requires less memory

Simplifies problem-solving

Increases runtime efficiency

Reduces decision-making

Dynamic Programming

Greedy Algorithm

Divide and Conquer

Backtracking

Fibonacci series using recursion

Summing numbers from 1 to 100 using a loop

Tower of Hanoi

Binary Search

To represent input/output

To indicate the flow of control

To connect different pages

To show decisions

O(n^2)

O(log n)

O(1)

O(n)

Finds the minimum value in an array

Finds the maximum value in an array

Sorts the array

Calculates the sum of elements in the array

Rectangle (आयत)

Oval (अंडाकार)

Diamond (हीरा)

Parallelogram (समानांतर चतुर्भुज)

Recursive algorithms are faster

Iterative algorithms are more memory efficient

Recursive algorithms use loops, and iterative use functions

There is no difference

Quick Sort

Merge Sort

Bubble Sort

Insertion Sort (when the array is already sorted)

An algorithm that works step by step sequentially

An algorithm that solves problems by exploring all possibilities and backtracking to find the correct solution

An algorithm that works on overlapping subproblems

An algorithm that divides the problem into smaller parts

Designing programs

Debugging algorithms

Writing pseudocode

Representing algorithms visually

Check the middle element

Divide the array into two equal halves

Compare the key with the smallest element

Compare the key with the largest element

Iterative Algorithm

Backtracking Algorithm

Recursive Algorithm

Divide and Conquer Algorithm

Analyze the problem

Write the code directly

Create a flowchart

Test the algorithm

Connector

Input/Output

Process

Decision

Prim’s Algorithm

Merge Sort

Binary Search

Breadth-First Search

Testing

Implementing

Analyzing

Creating a flowchart

Iterative

Recursive

Both a and b

None of the above

Divide and Conquer

Greedy Algorithm

Dynamic Programming

Both b and c

Define problem → Plan solution → Write code → Test

Plan solution → Define problem → Test → Write code

Define problem → Plan solution → Test → Write code

Write code → Test → Plan solution → Define problem

Diamond

Parallelogram

Rectangle

Circle

To solve the problem efficiently

To debug errors

To create a visual design

To replace programming languages

To connect inputs and outputs

To link different parts of a flowchart

To make decisions

To represent processes

Depth First Search (DFS)

Breadth First Search (BFS)

Dijkstra's Algorithm

Prim's Algorithm