Home BCA/BTech JEE RAS RSCIT Blogs
Switch Language हिन्दी
BCA / B.Tech 11 min read

What is an Algorithm?

Quick Summary & Key Takeaways

  • • Subject Focus: Data Structure Notes in English (BCA / B.Tech Syllabus)
  • • Core Topic: What is an Algorithm? - General Topics
  • • Overview: What is an Algorithm in Data Structures: An algorithm is a definite and ordered process designed to solve a problem or execute a task. It is a sequence...
  • • Key Concepts: Algorithm kya hai, Definition characteristics types Hindi, Examples algorithm,What is an algorithm, Definition characteristics types, Examples algorithm

What is an Algorithm in Data Structures:


An algorithm is a definite and ordered process designed to solve a problem or execute a task. It is a sequence of steps that are followed to find a solution to a problem. In simple terms, it can be called a "step-by-step process" whose purpose is to achieve a specific goal or result.

Characteristics of an Algorithm:

  • Input: An algorithm must have at least one input.
  • Output: The result or output of the algorithm must be clear and well-defined.
  • Definiteness: Each step of the algorithm must be described clearly and precisely.
  • Finiteness: The algorithm must end after a finite amount of time.
  • Effectiveness: Each step of the algorithm must be simple and effectively implementable.

Types of Algorithms:

1. Brute Force Algorithm: A simple algorithm that checks all possible solutions to find the correct one. Examples: Linear Search, Bubble Sort.
2. Divide and Conquer Algorithm: The problem is divided into smaller parts, each part is solved, and then they are combined. Examples: Merge Sort, Quick Sort.
3. Greedy Algorithm: At each step, it chooses the option that seems best at the moment, i.e., it selects a "local optimal solution." Examples: Kruskal's Algorithm, Prim's Algorithm.
4. Backtracking Algorithm: A recursive algorithm that checks all possible solutions and backtracks if a choice turns out to be wrong. Examples: N-Queens problem, Sudoku solver.
5. Dynamic Programming Algorithm: Used when a problem can be divided into smaller subproblems, and the solutions to these subproblems can be reused in later steps. Examples: Fibonacci Series, Longest Common Subsequence.
6. Recursive Algorithm: A function calls itself repeatedly until the problem is solved. Examples: Factorial calculation, Fibonacci Series.
7. Graph Algorithm: Used to process graph structures. Examples: Depth First Search (DFS), Breadth First Search (BFS).

Frequently Asked Questions (FAQs)

What is an Algorithm in Data Structures: An algorithm is a definite and ordered process designed to solve a problem or execute a task.
Understanding What is an Algorithm? is fundamental to mastering Data Structure Notes in English. It covers crucial concepts, solved problems, and revision points essential for academic and entrance exam success.
You can read free solved examples, detailed explanations, and key formulas for What is an Algorithm? directly on the NotesMedia website or by downloading the NotesMedia App.

In this Chapter

What is an Algorithm?
Binary Tree Traversal (Data Structures)
Introduction to Data Structures
Linked List in Data Structures
Operations on a Linked List
Operations in Data Structures
Trees in Data Structures
Binary Trees in Data Structures
Full Binary Tree in Data Structures
Applications of Linked Lists
Main Uses of Linked List
Operations & Applications of Trees
Tree Algorithms
Memory Allocation in Data Structures
Operations & Applications of Memory Allocation
Expression Tree in Data Structures
Operations & Algorithms of Expression Trees
Applications of Expression Trees
Graphs in Data Structures
Pointers in Data Structures
Pointer Algorithms
Sorting in Data Structures
Searching in Data Structures
Searching Algorithms in Data Structures
Stacks in Data Structures
Stack Algorithms
Queues in Data Structures
Queue Algorithms
Arrays in Data Structures
Time Complexity
Space Complexity
Parameter and Argument Passing
Algorithm of Space Complexity
Algorithm of Time Complexity