There are many methods of searching large amount of data to find one particular piece of information. Such as find name of person in record of mobile. Certain methods of organizing data make the search process more efficient the objective of these methods is to find the element with least cost (least time). Binary search algorithm is faster than sequential and other commonly used search algorithms. This research develops binary search algorithm by using new structure called Triple, structure in this structure data are represented as triple. It consists of three locations (1-Top, 2-Left, and 3-Right) Binary search algorithm divide the search interval in half, this process makes the maximum number of comparisons (Average case com

The aim of this paper is to present a weak form of -light functions by using -open set which is -light function, and to offer new concepts of disconnected spaces and totally disconnected spaces. The relation between them have been studied. Also, a new form of -totally disconnected and inversely -totally disconnected function have been defined, some examples and facts was submitted.

The class of quasi semi -convex functions and pseudo semi -convex functions are presented in this paper by combining the class of -convex functions with the class of quasi semi -convex functions and pseudo semi -convex functions, respectively. Various non-trivial examples are introduced to illustrate the new functions and show their relationships with -convex functions recently introduced in the literature. Different general properties and characteristics of this class of functions are established. In addition, some optimality properties of generalized non-linear optimization problems are discussed. In this generalized optimization problems, we used, as the objective function, quasi semi -convex (respectively, strictly quasi semi -convex

In this thesis, we introduced the simply* compact spaces which are defined over simply* open set, and study relation between the simply* separation axioms and the compactness were studied and study a new types of functions known as αS^(M* )- irresolte , αS^(M* )- continuous and R S^(M* )- continuous, which are defined between two topological spaces. On the other hand we use the class of soft simply open set to define a new types of separation axioms in soft topological spaces and we introduce the concept of soft simply compactness and study it. We explain and discuss some new concepts in soft topological spaces such as soft simply separated, soft simply disjoint, soft simply division, soft simply limit point and we define soft simply c

The last decade of this 20th century provides a wide spread of applications of one of the computer techniques, which is called Fuzzy Logic. This technique depends mainly on the fuzzy set theory, which is considered as a general domain with respect to the conventional set theory. This paper presents in initiative the fuzzy sets theory and fuzzy logic as a complete mathematics system. Here it was explained the concept of fuzzy set and defined the operations of fuzzy logic. It contains eleven operations beside the other operations which related to fuzzy algebra. Such search is considered as an enhancement for supporting the others waiting search activities in this field.

     The primary purpose of this subject is to define new games in ideal spaces via set. The relationships between games that provided and the winning and losing strategy for any player were elucidated.

We introduce some new generalizations of some definitions which are, supra closure converge to a point, supra closure directed toward a set, almost supra converges to a set, almost supra cluster point, a set supra H-closed relative, supra closure continuous functions, supra weakly continuous functions, supra compact functions, supra rigid a set, almost supra closed functions and supra perfect functions. And we state and prove several results concerning it

This paper consist some new generalizations of some definitions such: j-ω-closure converge to a point,  j-ω-closure directed toward a set, almost  j-ω-converges to a set, almost  j-ω-cluster point, a set  j-ω-H-closed relative, j-ω-closure continuous mappings, j-ω-weakly continuous mappings, j-ω-compact mappings, j-ω-rigid a set, almost j-ω-closed mappings and  j-ω-perfect mappings. Also, we prove several results concerning it, where j ÃŽ{q, δ,a, pre, b, b}.

     The objective of this paper is to show modern class of open sets which is an -open. Some functions via this concept were studied and the relationships such as continuous function strongly -continuous function -irresolute function -continuous function.

 An edge dominating set    of a graph  is said to be an odd (even) sum degree edge dominating set (osded (esded) - set) of G if the sum of the degree of all edges in X is an odd (even) number. The odd (even) sum degree edge domination number  is the minimum cardinality taken over all odd (even) sum degree edge dominating sets of G and is defined as zero if no such odd (even) sum degree edge dominating set exists in G. In this paper, the odd (even) sum degree domination concept is extended on the co-dominating set E-T of a graph G, where T is an edge dominating set of G.  The corresponding parameters co-odd (even) sum degree edge dominating set, co-odd (even) sum degree edge domination number and co-odd (even) sum degree edge domin