Just after transplanting, the vegetable has difficulty in nutrients uptake. To explore the effect of different fertilization on spring cabbage (Brassica oleracea L. var. capitata) production and fertilizer use efficiencies, this experiment consisting of six treatments was implemented and divided into three groups: 1) no fertilizer (NF) and vegetable planting fertilizer (VPF); 2) conventional fe...

The inherent problems associated with inorganic fertilizer such as scarcity and high cost informed the invention of cocoa pod husk based organic fertilizer. The impact of the fertilizer on cocoa output is hereby investigated in this study. The study was conducted in Cross-River State, Nigeria and purposive random sampling technique was used to select fifty cocoa farmers including the user and n...

Soil physicochemical properties, soil microbial biomass and bacterial community structures in a rice-wheat cropping system subjected to different fertilizer regimes were investigated in two seasons (June and October). All fertilizer regimes increased the soil microbial biomass carbon and nitrogen. Both fertilizer regime and time had a significant effect on soil physicochemical properties and ba...

Rice (Oryza sativa L.) grown on a clay soil in a direct-seeded, delayed-flood system as used in the southern U.S. requires 30 to 60 lb/acre more nitrogen (N) fertilizer to achieve maximal grain yields compared to rice grown on silt loam soils. Seasonal N fertilizer accumulation studies are almost non-existent for rice grown on clay soils. Therefore, a two-year field study was conducted to evalu...

Let e be an edge of a G connecting the vertices u and v. Define two sets N1 (e | G) and N2(e |G) as N1(e | G)= {xV(G) d(x,u) d(x,v)} and N2(e | G)= {xV(G) d(x,v) d(x,u) }.The number of elements of N1(e | G) and N2(e | G) are denoted by n1(e | G) and n2(e | G) , respectively. The Szeged index of the graph G is defined as Sz(G) ( ) ( ) 1 2 n e G n e G e E    . In this paper we compute th...

(d) Suppose list1 contains N1 elements and list2 contains N2 elements. The first while loop is executed O(N1) times. The body of this loop takes O(N1) since GetNextItem takes O(1) and InsertItem takes O(N1). So, the complexity of the first loop is O(N1N1). The second while loop is executed O(N2) times. The body of that loop takes O(N1+N2) time since GetNextItem takes O(1), RetrieveItem takes O(...