Good vs. Well, Bad vs. Badly

Good vs. Well, Bad vs. Badly Good vs. Well, Bad vs. Badly Good vs. Well, Bad vs. Badly By Maeve Maddox Do you cringe when you ask someone â€Å"How are you?† and the person replies, â€Å"I’m good†? Why? Perhaps, like me, you are expecting the response to be â€Å"I’m well, thank you,† and the â€Å"I’m good† offends your expectations. However, if your complaint is that good is an adjective and well is an adverb, you’re on thin ice. The fact that well is the adverbial form of good is irrelevant because in this expression, both good and well are being used as adjectives. Good and well function as more than one part of speech: The diner is noted for good food. (adjective) A true statesman is dedicated to the common good. (noun) You speak French well. (adverb) He was ill, but now he is well. (adjective) Life is like a well. (noun) As an adjective, well is usually used to mean â€Å"sound in health,† or â€Å"recovered from sickness.† An earlier sense of â€Å"prosperous† survives in the expressions â€Å"well to do,† and â€Å"well off.† One of the numerous meanings of good is â€Å"morally commendable, virtuous.† This definition is invoked by speakers who wish to ridicule the â€Å"I’m good† response. For example, in an episode of 30 Rock, Tracy Jordan corrects another character who has said â€Å"I’m good† this way: â€Å"Superman is good; you’re well.† Another meaning of good is â€Å"satisfactory, unimpaired, not depressed or dejected.† Although the â€Å"I’m good† response still strikes many ears as colloquial at best, it is not ungrammatical. Speakers who object to the usage are free to avoid it in their own speech, but they may wish to refrain from ridiculing its use in the speech of others. While we’re at it, this may be a good place to mention a common error with the adjective bad and its adverbial form badly. Here are some incorrect uses of badly from the web: Facebook makes us feel badly about ourselves. I think awards just make the other kids who didn’t get awards feel badly. Maybe her intention isn’t to make you feel badly, and you’re making yourself feel badly. I guess I just sometimes feel badly for my extrovert kids. These are all from commenters and amateur bloggers, but even professional writers fall into the error: People who go through life applying a measuring ruler against every situation judging its â€Å"fairness† will often feel badly and negative because of it. –John M. Grohol, Doctor of Psychology You must never feel badly about making mistakes† Norton Juster, The Phantom Tollbooth In each instance, the expression should be â€Å"feel bad,† not â€Å"feel badly.† Badly is an adverb. It must be used with a verb that expresses an action. Feel can be either a linking verb or an action verb, but when it is used in the sense of experiencing an emotion, it is a linking verb and takes an adjective to complete it: â€Å"I feel bad.† As an action verb, feel means â€Å"to handle† or â€Å"to touch.† For example, a person who â€Å"feels badly† would have trouble learning to read Braille. Want to improve your English in five minutes a day? Get a subscription and start receiving our writing tips and exercises daily! Keep learning! Browse the Grammar category, check our popular posts, or choose a related post below:25 Subordinating Conjunctions40 Fish Idioms10 Humorous, Derisive, or Slang Synonyms for â€Å"Leader† or â€Å"Official†

International finance Essay Example | Topics and Well Written Essays - 1500 words - 4

International finance - Essay Example On the other hand, appreciation of the domestic currency refers to increase in exchange rate brought about by forces of the market in the price of domestic currency in terms of a foreign currency. The need for foreign country’s currency in order to buy goods denominated in a foreign currency is reflected by demand for the foreign currency. In most cases, the selling country denominates its goods and services in terms of domestic currency hence importers from other countries will feel the need for the foreign currency in order to conduct the financial transaction. Foreign currency is supplied into the country when foreign currency is sold in order to carry out financial transactions that are denominated in home currency. It is the demand for and supply of a currency which yields an equilibrium position in the foreign exchange market. The equilibrium point being the point where there is an intersection between the upward sloping supply curve and the downward sloping demand curve (Koller, Goedhart and Wessels, 2010). A low value of foreign currency makes the demand for foreign currency on the foreign exchange market to increase whereas the demand for foreign goods increase due to its relatively cheaper price than domestic goods. On the other hand, a high value of foreign currency makes the demand for foreign currency on the foreign exchange market to decrease whereas the demand for foreign goods increase due to its relatively higher price than domestic goods (Needles, Powers and Crosson, 2010). Therefore, the question that arises is the cause of exchange rate revaluation and whether the depreciation or appreciation of an exchange rate can be predicted. This paper will rightly answer this questions by using a thorough discussion on the determination of exchange rate using the flexible price monetary model. The discussion will further explore the ability or inability of the model to explain the observed movements in foreign

Tesco Managing Capabilities Essay Example | Topics and Well Written Essays - 3750 words

Tesco Managing Capabilities - Essay Example Tesco was founded by Jack Cohen in 1919. It is listed on the London Stock Exchange and also is the component of FTSE100 Index. The company experienced a market capitalization of about  £24.4 billion by 15 January 2012. According to a retail analyst it has been revealed that Tesco is the most successful retail business round the globe. According to Tesco’s strategy the company uses its own brand products. The innovative technology usage has been Tesco’s core part for its expansion strategy (Wrigley, 2000). The Company is listed on London Stock Exchange with the symbol of TSCO. Tesco represents in UK the largest food and drink retail sector industry. It provides employment to more than three million people in manufacturing, retailing and primary production. Tesco’s largest market is in UK and the company banners under four main things that are Extra, Metro, Superstore and Express. Almost 40,000 food items and products and also the non food lines and the clothing are sold by the company. The annual sales in 2011/12 for Tesco were  £65.17bn. Out of this figure  £42.8bn were produced from UK and showed a rise of 5% and the online sales of UK rose by 10% in this time period. 3.0 Importance of capabilities and how they contribute to competitive advantage at Tesco. 3.1 Capabilities, Strategy, Competitive Advantage and RBV The competitive rivalry forces have lessened the margins of profit for the supermarket chains and also the suppliers. Famous loyalty card of Tesco known as Clubcard remains the mainly booming strategy for customer retention that considerably raises Tesco’s profitability. To retain the customer base Tesco meets the customer needs, customizes the service, ensures lower prices, helps in making better choices, continuous flow of in-store promotions. In grocery industry the substitute of need and the product for product concept is very common (Ritz, 2005). An accelerated development level has been fostered by this highly competitive market, this results in a situation for innovation for UK grocery retailers in order to maintaining and building market share. Innovation like this can be seen in the development of a range of trading formats, in reply to transformation in consumer behavior. The main market leaders respond by focusing again on the value and price, while also reinforcing the elements of value addition of the services they 3.2 3.2 Tesco Competitive Advantage As Tesco is giant retailer, so in order to get a sustainable competitive advantage they must follow any one of the three generic strategies mentioned ahead. Cost leadership is the first strategy that Tesco can use to get the lowest of all the costs in the same industry (Palmer, 2004). Cost leadership strategy is likely to be

PSY 365 Psychology of Diversity Essay Example | Topics and Well Written Essays - 750 words

PSY 365 Psychology of Diversity - Essay Example The hypothesis was that there were significant differences in these two influences on prosocial behavior according to age, and that gender differences would also emerge. 682 families participated in the study by answering questionnaires both from the parents and the teachers of the children. The sample was divided into children under 11 and those over 11 years. The results showed no significant difference in effect of genetics and environment according to gender. Individual differences in prosocial behavior emerged as children became adolescents, with environmental effect decreasing and genetics effect increasing. Although this study gathered data from the teachers, this data was only used to compare the ratings of parents with teachers as a way to confirm the level of prosocial behavior of the child. It was not used to compare the effect of shared (home) environment with unshared (school) environment. Two years later Knafo and Plomin (2006) also examined the effect of the environment and genetics on prosocial behavior in young children. This was a longitudinal study at ages 2, 3, 4 and 7 of a sample of 9,424 pairs of twins in the UK. The main hypothesis was that genetics and environment do not continue to affect behavior and that new influences emerge in later years. The study measured the level of prosocial behavior, the shared environment, the unshared environment and the genetic influences. The results of the study indicated that the shared environment had less effect as the children aged, but the genetics had a greater effect. The results also showed that the genetic effects account for both change and continuity in prosocial behavior but the nonshared environments effects account mainly for the changes in prosocial behavior. Although Knafo and Plomin only carried out their study to age 7, both studies found that genetic effects on prosocial behavior increased with age and that the biological influence of genetics increased whereas

Simulation Of Scheduling Algorithms

Simulation Of Scheduling Algorithms Abstract- In this term paper we have discuss simulation of scheduling algorithm. We have discuss various type of scheduling algorithm such as robin round, first comes first served, shortest job first, and etc. We also discuss its advantages and disadvantages. In this term paper we take some c programme based on this scheduling algorithm to understand properly. We also include some graphical representatiion of each scheduling. From which we can differentiate between each algorithm. Keywords- In this term paper we use some keyword Round Robin(RR), First Come First Serve (FCFS), Shortest Job First(SJF), Process Control Block (PCB), Shortest Time Remaining (SRT). INTRODUCTION Scheduling is a fundamental operating-system function. Whenever the CPU becomes idle, the operating system must select one of the processes in the ready queue to be executed. The selection process is carried out by the short-term scheduler. The scheduler selects from among the processes in memory that are ready to execute, and allocates the CPU to one of them. All processes in the ready queue are lined up waiting for a chance to run on the CPU. The records are generally the PCBs (Process Control Block) of the processes. Another important component involved in the CPU scheduling function is the dispatcher. The dispatcher is the module that gives control of the CPU to the processes selected by the short-term scheduler. This function involves: à ¢Ã¢â€š ¬Ã‚ ¢ Switching context à ¢Ã¢â€š ¬Ã‚ ¢ Jumping to the proper location in the user program to restart that program. Our goal is to simulate the process scheduling algorithms to get a more accurate evaluation on how choice of a particular scheduling algorithm can effect CPU utilization and how a scheduler decides when processors should be assigned, and to which processes. Different CPU scheduling algorithms have different properties and may favour one class of processes over another. We have programmed a model of the computer system and implemented scheduling algorithms using Software data structures which represent the major components of the system which we have discussed in this section. 2. PROPOSAL When system has a choice of processes to execute, it must have a strategy -called a Process Scheduling Policy-for deciding which process to run at a given time .A scheduling policy should attempt to satisfy certain performance criteria, such as maximizing: à ¢Ã¢â€š ¬Ã‚ ¢ Throughput à ¢Ã¢â€š ¬Ã‚ ¢ Latency à ¢Ã¢â€š ¬Ã‚ ¢ Preventing Indefinite postponement of Process à ¢Ã¢â€š ¬Ã‚ ¢ Maximizing Process Utilization It is the job of the scheduler or dispatcher to assign a processor to the selected process. In our project various Process Scheduling Algorithms that determine at runtime which process runs next .These algorithms decide when and for how long each process runs; they make choices about à ¢Ã¢â€š ¬Ã‚ ¢ Preemptibility à ¢Ã¢â€š ¬Ã‚ ¢ Priorities à ¢Ã¢â€š ¬Ã‚ ¢ Running time à ¢Ã¢â€š ¬Ã‚ ¢ Time-to-Completion à ¢Ã¢â€š ¬Ã‚ ¢ Fairness We will be simulating these Scheduling Algorithms and comparing them against various parameters mentioned above. BACKGROUND What is Process :-A process is the locus of control of a procedure in execution that is manifested by the existence of a data structure called Process Control Block. Each process has its own address space, which typically consists of Text region, Data region and Stack region. The Text region stores the code that the processor executes. The Data region stores the variables and dynamically allocated memory that the process uses during execution. The Stack region stores instructions and local variables for active procedure calls. The contents of the Stack grow as the process issues nested procedure calls and shrink as procedures return. 4.WHAT IS PROCESSOR SCHEDULING? -When a system as a choice of processes to execute, it must have a strategy for deciding which process to run at a given time. This strategy is known as Processor Scheduling Policy. Different process scheduling algorithms have different properties and may favor one class of processes over another. In choosing which algorithm to use in a particular situation, we compare the following characteristics to compare the algorithms. CPU Utilization -We want to keep the CPU as busy as possible. It ranges from 0 to 100%. In real systems it ranges from 40% to 90%. For the purpose of this simulation we have assumed that CPU utilization is 100%. Throughput -The work done by the CPU is directly proportional to the CPU utilization. The number of processes completed per unit time, called throughput, is the measure of work done by the CPU. Algorithms should try to maximize the throughput. Turnaround time- The time interval from submission of job to the completion of job is termed as the turnaround time. It includes waiting time of the process and the service time of the process. Waiting time -The amount of time process spent waiting in the ready queue is termed as Waiting time. Any algorithm does not affect the service time of the process but does affect the waiting time of the process. Waiting time should be kept to the minimum. Response time The time interval from the submission of the process to the ready queue until the process receives the first response is known as Response time. Response time should always be kept minimum. Besides the above features, a scheduling algorithm must also have the following properties: à ¢Ã¢â€š ¬Ã‚ ¢ Fairness à ¢Ã¢â€š ¬Ã‚ ¢ Predictability à ¢Ã¢â€š ¬Ã‚ ¢ Scalability 5. SIMULATION- In our simulation the ready queue has been programmed to serve the processes in the First in First out, Round Robin, Shortest Process first, Highest Response Ration Next and also Shortest Remaining time. The simulator has a variable representing a clock; as this variables value is increased, the simulator modifies the system state to reflect the activities of the devices, the processes, and the scheduler. Our system has a function called Process Ready which checks which processes are ready to enter the system depending on the current clock. Preemption is performed based on the current clock. If the next process in the ready queue should get the CPU the current process is pushed into the queue and the next process, based on how the priority of the processes is calculated in ready queue, is taken and given the CPU time. We call this in real systems as context switch .We will be providing this overhead a simple variable which we fill add to a process when it is preempted. The scheduler is an abstract class in which we have defined the basic components which are needed by the scheduler like ready queue .FIFO, RR, SPF, SRT and HRRN are the classes which extend this scheduler class and implement the ready queue based on specific scheduler. The data that we are using to drive the simulation is generated using a random-number generator. The generator is programmed to generate processes, CPU-burst times, Arrivals and Finish time. The process PCB in our simulation consists of following attributes: Process Id Process ServiceTime Process ArrivalTime Process FinishTime Process ResponseTime The same set of processes is feed into the scheduling algorithm to evaluate the algorithms effect on the processes and CPU. These are initialized for all the processes that we randomly generate .Once the process gets the CPU its service time gets updated and if the simulation performs a context switch which preempts the current running process and puts it at the back of the ready queue i.e. we save the PCB of the process. After this the first process in the ready queue is given the block .In the end the system outputs the Arrival Time, Service Time, Turn around Time, Waiting Time and Response Time for each process executed by the system. The output formats, the input and the Analysis using this simulation model are shown in the sections that follow: A simple Class Diagrame :- 6. SCHEDULING ALGORITHM A scheduling algorithm is the method by which threads, processes or data flows are given access to system resources (e.g. processor time, communications bandwidth). This is usually done to load balance a system effectively or achieve a target quality of service. The need for a scheduling algorithm arises from the requirement for most modern systems to perform multitasking (execute more than one process at a time) and multiplexing (transmit multiple flows simultaneously) Type of Scheduling algorithm Scheduling algorithm :- First Come First Serve (FCFS) Round Robin Shortest Job First Shortest Remaining Time Highest Response Ratio Next (HRRN) Fixed priority pre-emptive scheduling FIRST COME FIRST SERVE (FCFS) :- CPU scheduling deals with the problem of deciding which of the processes in the ready queue is to be allocated the CPU. There are many different CPU scheduling algorithms. By far the simplest CPU-scheduling algorithm is the first-come, first-served (FCFS) scheduling algorithm. With this scheme, the process that requests the CPU first is allocated the CPU first. The implementation of the FCFS policy is easily managed with a FIFO queue. When a process enters the ready queue, its PCB is linked onto the tail of the queue. When the CPU is free, it is allocated to the process at the head of the queue. The running process is then removed from the queue. The code for FCFS scheduling is simple to write and understand. The average waiting time under the FCFS policy, however, is often quite long. C- programming for this scheduling algorithm is given below. I only present the main part of the programme. /* Programme for FCFS*/ #include #include //Library for clearing the screen using namespace std; int cont, ctr; class FCFS{ //Class used for the simulation public: //public elements of the class void input(); void gantt(); protected: //protected elements of the class float wt, bt, arr, bt2; float awt; }; int main(){ //main function FCFS IT2B; cout cin>>ctr; if(ctr>=3ctr system(cls); IT2B.input(); //invocation }else{ cout cout cin>>cont; system(cls); main(); } return 0; } void FCFS::input() //input() function of class FCFS { wt=0; bt2=0; cout for(arr=1;arr cout>bt; cout bt2=bt+bt2; wt=bt2+wt; } awt=(wt-bt2)/ctr; cout cout cin>>cont; } /*void FCFS::gantt() { */ Limitations: In FCFS, average waiting time is quite longer. If we have a processor bound job (generally with longer service time) and other I/O bound jobs. And if, processor bound job is allocated the processor time, then it will hold the CPU. As a result, other I/O bound jobs will keep waiting in the ready queue and the I/O devices will remain idle. Like in the test cases we observed, process P3 despite having a very short service time had to wait for long till all the processes ahead of it ran to completion. Average Turn around Time: 12 Average Waiting Time: 7.2 Average Response Time: 7.2 6.2. ROUND ROBIN The round-robin (RR) scheduling algorithm is designed especially for time-sharing systems. It is similar to FCFS scheduling, but preemption is added to switch between processes. A small unit of time, called a time quantum or time slice, is defined. A time quantum is generally from 10 to 100 milliseconds. The ready queue is treated as a circular queue. The CPU scheduler goes around the ready queue, allocating the CPU to each process for a time interval of up to l time quantum. To implement RR scheduling, we keep the ready queue as a FIFO queue of processes. New processes are added to the tail of the ready queue. The CPU scheduler picks the first process from the ready queue, sets a timer to interrupt after l time quantum, and dispatches the process . C- programming for this scheduling algorithm is given below. I only present the main part of the programme. /* Programme for ROUND ROBIN*/ for(i=0;j { if(r[i]>0sp>=a[i]) { f=true; if(r[i] time=r[i]; else time=q; //schedule the process t[i]+=time,r[i]=time,order.push_back(i+1); if(r[i]==0) j++; for(k=0;k if(r[k]!=0k!=ia[k] if(!(a[k] w[k]+=sp+time-a[k],t[i]+=sp+timea[k]; else w[k]+=time,t[k]+=time; sp+=time; continue; } if(i==n-1) { if(!f) { int it; int diff=0; for(it=0;it if(sp { if(diff==0) diff=a[it]-sp; else if(diff>a[it]-sp) diff=a[it]sp; } sp+=diff; } f=false; } } OUTPUT:- Advantages:-Round Robin algorithm exhibits fairness. All the processes are treated equally and are given equal processor time. As compared to FCFS, the average waiting time is considerably reduced in Round Robin algorithm. Limitations: The performance of the system implementing Round Robin mainly depends upon the value of the quantum. If we set the quantum to very high value, then it will proceed as the FCFS. As a result the system performance will be sluggish. If we keep the quantum value low, more overhead will be produced because of frequent context switch .Round Robin with low quantum is generally suitable for the interactive system. However, to determine the optimal quantum time is a tedious task 6.3.SHORTEST JOB FIRST A different approach to CPU scheduling is the shortest-job-first (SJF) scheduling algorithm. This algorithm associates with each process the length of the processs next CPU burst. When the CPU is available, it is assigned to the process that has the smallest next CPU burst. If the next CPU bursts of two processes are the same, FCFS scheduling is used to break the tie. Note that a more appropriate term for this scheduling method would be the shortest-next-CPU-burst algorithm, because scheduling depends on the length of the next CPU burst of a process, rather than its total length. The SJF algorithm is a special case of the general priority scheduling algorithm. A priority is associated with each process, and the CPU is allocated to the process with the highest priority. Equal-priority processes are scheduled in FCFS order. An SJF algorithm is simply a priority algorithm where the priority (p) is the inverse of the (predicted) next CPU burst. The larger the CPU burst, the lower the pri ority, and vice versa. C- programming for this scheduling algorithm is given below. I only present the main part of the programme. /* Programme for SJF*/ #include #include #include void main() { char p[10][5],temp[5]; int tot=0,wt[10],pt[10],i,j,n,temp1; float avg=0; clrscr(); printf(enter no of processes:); scanf(%d,n); for(i=0;i { printf(enter process%d name:n,i+1); scanf(%s,p[i]); printf(enter process time); scanf(%d,pt[i]); } for(i=0;i { for(j=i+1;j { if(pt[i]>pt[j]) { temp1=pt[i]; pt[i]=pt[j]; pt[j]=temp1; strcpy(temp,p[i]); strcpy(p[i],p[j]); strcpy(p[j],temp); } } } wt[0]=0; for(i=1;i { wt[i]=wt[i-1]+et[i-1]; tot=tot+wt[i]; } avg=(float)tot/n; printf(p_namet P_timet w_timen); for(i=0;i printf(%st%dt%dn,p[i],et[i],wt[i]); printf(total waiting time=%dn avg waiting time=%f,tot,avg); getch(); } Output : Advantages: Shorter processes are given preference. If the ready queue contains Processor bound processes and some I/O bound processes, then the I/O bound will be given more preference. As a result the system throughput increases. Average waiting time of the processes decreases. Like in the test case, the process P3 waited for only 6 seconds compared to 10 seconds in RR and 16 seconds in FCFS. 6.4 .SHORTEST REMAINING TIME (SRT) This is the preemptive algorithm which acts on the principles of SPF. It gives preference to the processes with the smaller service time. If a process is using the process and in the mean time a new process arrives whose service time is less than the currently running, then it preempts the currently running process and gives processor control to the new process. This algorithm is no longer useful in todays operating systems. Advantages: It offers the minimum waiting time for the processes. Like the process P3, waited for 6 seconds before getting the processor time. Though this waiting time is equal to that in SPF. But being a preemptive algorithm, SRT scores over SPF by providing even lesser waiting time than the former. Average Turn around Time: 11 Average Waiting Time: 6.4 Average Response Time: 6 6.5 HIGHEST RESPONSE RATIO NEXT This algorithm corrects some of the weakness of the SPF. The SPF algorithm is biased towards the processes with short service time. This keeps the longer processes waiting in the ready queue for the longer time, despite of arriving in the ready queue before the short jobs. It is a non-preemptive scheduling algorithm in which the priority is the function of not only the service time but also of the time spent by the process waiting in the ready queue. Once the process obtains the control of the processor, it completes to completion. The priority is calculated by the formula Priority = (Waiting Time + Service Time)/Service Time In this algorithm too, short processes receive preference. But longer processes that have been waiting in the ready queue are also given the favorable treatment. 7.GRAPHICAL REPRESENTATION Turnaround Time Comparison Waiting time comparison Responce time comparison 8.CONCLUSION From the analysis of the algorithms, we have come up with the conclusion that RR has the best average response time and being the preemptive algorithm, it exhibits fairness. But however, performance of the RR algorithm depends heavily on the size of the quantum. On the one extreme is the time quantum is very large, RR algorithm is same as FCFS policy. But if the time quantum is fairly small, the RR will exhibit fairness but a considerable overhead gets added to the turnaround time due frequent context switch. This fact becomes clear from the RR average turnaround time reading is highest as compared to other algorithms. Hence we observed if majority of the processes are less then the time quantum, the RR will give better response time. Further, SPF has the least average turnaround time and average waiting time as compared to other algorithms. This shows that SPF is provably optimal, in that it gives the minimum average time in the set of processes by moving the short process before a long one. The waiting time of short process decreases more than the waiting time of the long process. Consequently the waiting time decreases. But this algorithm can only be used for systems which are interactive and thereby is biased to short processes and unfavorable to longer ones which may lead to indefinite postponement of longer processes. HRRN has approximately same average turnaround, waiting and response time. It overcomes the limitation of the SPF by giving favorable treatment to the processes waiting for a longer time, and thereby prevents indefinite postponement. SRT exhibits approximately same average response time, waiting time and turnaround time, and may seem to be an effective algorithm for interactive processes if the tasks performed before issuing I/O are short in duration. However, SRT determines priority based on the run time to completion, not the run time to I/O. Some interactive processes such as shell executes for the life time of the session, which would place the shell at the lowest priority level.

Biography of Rapper Rich Boy Essay -- essays research papers

Despite what it alludes to, Zone 4/Interscope Records rap signee Rich Boy insists his moniker is just a neighborhood nickname ("It doesn't stand for being rich or anything like that.") not a glimpse into his finances. Maybe so, but with the multifaceted talents that 21 year old Marece Richards possesses, his nom de plume will be even more fitting shortly with the release of his debut album, TBD? Born and raised in Mobile, Alabama, Rich Boy grew up in a typical hood upbringing with both positive and negative influences. "My dad all he did was work all day." His father owns a liquor store in the middle of the hood and it's where Rich Boy witnessed dope fiends, drive bys and all types of mischief first hand. "Instead of having role models, I looked up to drug dealers," he admits. "I'm hanging out and rolling with dope boys doing something I have no business doing," he says of those times before mentioning why he decided to fall back. "I don't want to get into all the shit I did [but] I ain’t ever made my momma cry before. Once I saw the impact my actions were having on her I decided to try something positive rather than being on the streets doing bullshit. My momma always did her part to keep me in church to balance me out even though I did make some wrong turns." This balance in his life allowed him to enroll at Tuskegee University as a mechanical engineering major. His first semester there is when his career commenced, but not as a rapper. "I heard a beat in the hallway when I was walking back to my dorm room, I stopped 'cause he had the door open," remembers Rich Boy of that fateful day. "I asked what CD was on and he said it was a beat he had just made. I was so shocked that I was like 'You got to show me how to do that.'" ... ...ich Boy. "I noticed a lot of girls throwing their life away chasing men for money. I felt I had to put some positive on the album, it couldn't be all about drugs, dope boys and cars." The album is bloated with intoxicating beats and production credits including Timberland, Kanye West, Polow, Jazze Pha, and Needlez to name a few. Overall, Rich Boy's album will offer a glimpse into all the experiences of making him who he is, while making sure your neck snaps to the beats and grooves. "Certain songs might tell you a little something about my upbringing. Certain songs might tell you how I relate to others life experiences. On the album I never get specific on all my dirt because I don't feel I need to talk about that. I want to put the spotlight on Mobile, and give the listeners an idea of what's going on here from a young black mans perspective." Listen up!

Precarious Condition of Primary Education Essay

The status of the primary education given in the ZP run schools of the backward districts of Dhule & Nandurbar is a big mess & the administrators of both the Zilla Parishads are seem to be at their wits end because of the irresponsible teachers, & negligent staff. The trouble is doubled recently because of the increasing number of drunkard teachers who hardly attend the school & whenever they turn up they come up in dead drunk state. There have been incidences where the frustrated villagers have locked up the school after seeing that the deputed teachers don’t attend the school for weeks, & if at all they attend the school turn by turn. The headmasters, the teachers & the staff of the schools are hand in gloves in the conspiracy of absence from the school & whenever the authorities pay a surprise visit they try to cover up the matter. The CEO of Dhule ZP, Deependrasingh Kushwah last week suspended the headmasters of two schools & issued show cause notices to the staff teachers of two schools on account of the serious discrepancies in the number of students dubiously enrolled & the actual number of the students in these schools. Many schools in the mountain area of these districts are single teacher schools because the staff appointed never joins the duty & if at all join it is only on the paper. The teachers use their political connections & also grease the palms of the responsible officers to cancel their transfers to unwanted places in the hilly terrains of Shirpur, Dhadgaon, Taloda, Akkalkuwa, Shahada Tehsils of Dhule & Nandurbar districts. The level of the education & the training of the teachers amongst the ZP run schools is another problem & one doubts if the teachers have really complied the eligibility criterion for the appointment as a teacher. Sometime back when he was a CEO of ZP Dhule, Purushottam Bhapkar inspected some of the ZP run schools & was surprised to see that the teachers could not spell the simple word †Week†, they could not write correctly the spellings of the weekdays, many could not count beyond 100 & were unable to remember the tables beyond 10. The increasing number of alcohol addicted teachers in ZP school is another menace in these schools these days & in a recent Nandurbar ZP meeting the sitting standing committee member & Nandurbar District BJP president Nagesh Padwi raised this serious issue & appealed the administration & the standing committee chairman Jipalsingh Rawal to take serious action against the teachers found drunk in the school. Such is the peril of the incidences of drunken teachers attending the school that the demand of keeping alcohol test kit in ZP schools is tabled in this meeting by the members. Nandurbar ZP has decided to go for Dress Code for the teachers in ZP school so that the misbehaving teacher could be noticed. There is a demand from the villagers & the parents of the students where these schools are, to keep a biometric instrument which will keep the record of the attendance of the teachers & staff so that the defaulters could be brought to books. The members of the standing committee also pointed out in this meeting that there are many schools running in the district only on paper & the authorities also have a record of such schools but because of the political influence, interference no action is taken on the teachers & the staff involved. The members of ZP, the administration claim that it is the teachers & staff of the school having the backing from the political leaders of the districts, is responsible for the rack & ruin of the education in these schools. Overall the situation of the primary education & the ambitious Sarva Shiksha Abhiyan Scheme of the government in ZP run schools of Dhule & Nandurbar Districts is really a weltering one. ———————————————————————————————-