The purpose of this work is to study the classification and construction of (k,3)-arcs in the projective plane PG(2,7). We found that there are two (5,3)-arcs, four (6,3)-arcs, six (7,3)arcs, six (8,3)-arcs, seven (9,3)-arcs, six (10,3)-arcs and six (11,3)-arcs.         All of these arcs are incomplete.         The number of distinct (12,3)-arcs are six, two of them are complete.         There are four distinct (13,3)-arcs, two of them are complete and one (14,3)-arc which is incomplete.         There exists one complete (15,3)-arc.
 

  In this work, we construct and classify the projectively distinct (k,3)-arcs in PG(2,9), where k ≥ 5, and prove that the complete (k,3)-arcs do not exist, where 5 ≤ k ≤ 13. We found that the maximum complete (k,3)-arc in PG(2,q) is the (16,3)-arc and the minimum complete (k,3)-arc in PG(2,q) is the (14,3)-arc. Moreover, we found the complete (k,3)-arcs between them.

            The article describes a certain computation method of -arcs to construct the number of distinct -arcs in  for . In this method, a new approach employed to compute the number of -arcs and the number of distinct arcs respectively. This approach is based on choosing the number of inequivalent classes } of -secant distributions that is the number of 4-secant, 3-secant, 2-secant, 1-secant and 0-secant in each process. The maximum size of -arc that has been constructed by this method is . The new method is a new tool to deal with the programming difficulties that sometimes may lead to programming problems represented by the increasing number of arcs. It is essential to reduce the established number of -arcs in each cons

    In this work, we construct complete (K, n)-arcs in the projective plane over Galois field GF (11), where 12 2 ≤ ≤ n  ,by using geometrical method (using the union of some maximum(k,2)- Arcs , we found (12,2)-arc, (19,3)-arc , (29,4)-arc, (38,5)-arc , (47,6)-arc, (58,7)-arc, (68,6)-arc, (81,9)-arc, (96,10)-arc, (109,11)-arc, (133,12)-arc, all of them are complete arc in PG(2, 11) over GF(11).  

       In this thesis, some sets of subspaces of projective plane PG(2,q) over Galois field GF(q) and the relations between them by some theorems and examples can be shown.
 

  5-(mercapto-1,3,4-thiadiazole-2yl)α,α-(diphenyl)methanol have been synthesized by ring closer of potassium xanthate[which  have been prepared by reaction of benzilic acid hydrazide with carbon disulphide in potassium hydroxide] using conc.sulphuric acid at (0-5)°C scheme(I).       Their characterization was carried out from T.L.C, M.P, FT.IR and 1H-NMR.

Aniline and its derivatives are common contaminants in various wastewaters and represent a serious worry for societies health and a challenge to ecologists due to their dangers effects on to the human health.

ZSM-5 zeolite was prepared from locally available materials (kaolin and rice husk) for adsorption of aniline from synthetic wastewater. Characterization of the prepared zsm-5, kinetics and thermodynamic of the adsorption process were investigated.

The characterization results of the prepared zsm-5 zeolite showed that the surface area was 270.1 m²/g and pore volume 0.21828 cm³/g. The silica to alumina ratio (Si/Al) was 166. 47 and the sodium content was 11 wt. %. The atomic force microscope (AFM)

        The purpose of this paper is to give the definition of projective 3-space PG(3,q) over Galois field GF(q), q = p^m for some prime number p and some integer m.

        Also, the definition of the plane in PG(3,q) is given and state the principle of duality.

        Moreover some theorems in PG(3,q) are proved.

MDS code is a linear code that achieves equality in the Singleton bound, and projective MDS (PG-MDS) is MDS code with independents property of any two columns of its generator matrix.   In this paper, elementary methods for modifying a PG-MDS code of dimensions 2, 3, as extending and lengthening, in order to find new incomplete PG-MDS codes have been used over . Also, two complete PG-MDS codes over  of length  and 28 have been found.