Data Structure & Algorithm

In this blog, you will learn all about the uniform-search and inform-search. Uninformed Search Methods An  uninformed  search is a searching technique that has no additional information about the distance from the current state to the goal. so it is also called blind search. Search without information. Use no knowledge. Time-consuming More complexity. Types are DFS, BFS and UCS. ▪ informed Search Methods Informed Search is another technique that has additional information about the estimate distance from the current state to the goal. Uses knowledge to find the steps to the solution.  This information are also called Heuristic h(n).             Search with information. Use knowledge. Quick solution. less complexity. Types are A*, heuristic DFS, and CSP ▪ types of Uninformed Search Methods 1.Depth First Search The algorithm starts at the root node (selecting...

Pending..... Data types    Abstract Data Type:  A data type that is defined by a programmer according to the point of view of the user. Abstract Data type is not defined by programming language this is a data type which we define according to our need Primitive and Non-Primitive Data Structure. Primitive.  Primitive is the most basic data types available within the Programing language. There are some examples:  boolean , byte,  char , short,  int , long,  float  and  double . These types serve as the building blocks of data manipulation in a programming language.  Non-Primitive. The data which is a collection of other data types( primitive or non-primitive) is known as the non-primitive data structure. .