EXAMRADAR

For Solo Learner Computer science
  • Home
  • CS Core Subjects
    • Cyber Security
    • Data structure
    • Data Communication
    • DBMS
    • Computer Architecture
    • Microprocessor
    • 8086
    • Operating System
    • Digital Electronics
  • Programming
    • C Programming
    • C++ Programming
    • Advanced Java
  • MCQ Sets
  • Online Tests
  • Que and Ans
  • Blogs
    • Educations
    • Technology
  • Write for Us

Data Structure – Design and analysis of Divide and Conquer Algorithms

Home » Computer Science tutorials and study notes » Data structure Tutorials » Data Structure – Design and analysis of Divide and Conquer Algorithms

DIVIDE AND CONQUER ALGORITHM

In this approach ,we solve a problem recursively by applying 3 steps

  1. DIVIDE-break the problem into several sub problems of smaller size.
  2. CONQUER-solve the problem recursively
  3. COMBINE-combine these solutions to create a solution to the original problem.

 
You may be interested in:
Data Structures and Algorithms – MCQs.
Data Structures and Algorithms Online Tests
 
 

Previous

Data Structure – Algorithm Dynamic Programming

Next

Data Structure – Kruskal’s Algorithm

TABLE OF CONTENTS

  • Data structure – Overview

  • Data Structure – Algorithms

  • Data Structure – Overview of Recursion

  • Data Structure – Differences between recursion and iteration

  • Data Structure – Algorithm Asymptotic Analysis

  • Data Structure – Basic Concepts of Complexity Classes – P-NP-NP-HARD-NP-Complete

  • Data Structure – Linked Lists

  • Data Structure – Linked List Concepts

  • Data Structure – Single Linked List In Brief

  • Data Structure – Array based linked lists

  • Data Structure – Double Linked List

  • Data Structure – Circular Single Linked List

  • Data Structure – Circular Double Linked List Concept in brief

  • Data Structure – Comparison of Linked List Variations

  • Data Structure – Stack Overview

  • Data Structure – Algebraic Expressions InFix PostFix Prefix Expressions

  • Data Structure – Queue Overview

  • Data Structure – Circular Queue

  • Data Structure – Deque Overview

  • Data Structure – Priority Queue

  • Data Structure – Binary Trees

  • Data Structure – Binary Tree Traversal Techniques : Inorder-Preorder-Postorder-Levelorder

  • Data Structure – Threaded Binary Tree

  • Concept Binary Search Tree

  • Data Structure – General Trees (m-ary tree)

  • Data Structure – Converting a m-ary tree (general tree) to a binary tree

  • Data Structure – Search and Traversal Techniques for m-ary trees

  • Data Structure – Graphs

  • Data Structure – Minimum Spanning Tree (MST)

  • Data Structure – Traversing a Graph BFT DFT

  • Data Structure – Concept of Searching and Sorting

  • Data Structure – Concept of Linear Search

  • Data Structure – Concept of Binary Search

  • Data Structure – Concept of Bubble Sort

  • Data Structure – Concept of Selection Sort

  • Data Structure – Quick Sort

  • Data Structure – Priority Queue, Heap and Heap Sort

  • Data Structure – Algorithm Design Greedy Approach

  • Data Structure – Dijkstra’s shortest-path algorithm

  • Data Structure – Algorithm Dynamic Programming

  • Data Structure – Design and analysis of Divide and Conquer Algorithms

  • Data Structure – Kruskal’s Algorithm

  • Data Structure – Prim’s Algorithm-minimal cost spanning tree

If you have any Questions regarding this free Computer Science tutorials ,Short Questions and Answers,Multiple choice Questions And Answers-MCQ sets,Online Test/Quiz,Short Study Notes don’t hesitate to contact us via Facebook,or through our website.Email us at [email protected] We love to get feedback and we will do our best to make you happy.

Copyright © 2023 | ExamRadar. | Contact Us | Copyright || Terms of Use || Privacy Policy

GUEST POSTING AND WRITING FOR US