Jazz and Poetry free essay sample

There are many different types of music in the world, and each one Is deferent because of certain characteristics that help to make that genre stand apart from all the others. One of these genres Is Jazz. Jazz Is a type of music that was created mainly by black Americans during the early twentieth century, and is a combination of American and African tribal music.There are many different characteristics that set Jazz apart from every other kind of music, but there are three main distinctions; the first is its particular combination of rhythm, melody and harmony, second is the butte differences that make every Jazz player almost instantly recognizable and finally Is the way that Jazz players Interact and react with their surroundings, they do not simply play a designated set of notes. The flirt characteristic that helps to make Jazz so different from other genres of music is the rhythm, melody and harmony. We will write a custom essay sample on Jazz and Poetry or any similar topic specifically for you Do Not WasteYour Time HIRE WRITER Only 13.90 / page Not only do these apply to the music of the Jazz era though, these same rhythms can be found in some of the poetry of that time. One of the poems that demonstrates a particular rhyme Is T. S. Elites The Love Song of J. Alfred Froufrou. In this Eliot does not stick to a common rhyme scheme Like some of the more simple poems. He does use end-rhyme, but It does not alternate for every line, sometimes there are two or three lines that have no rhyme between two lines that do. It is because of this unorthodox rhyme scheme that his poem relates to the seemingly random rhythms of Jazz music. Another poem that shows harmony similar to that of Jazz is The Tropics in New York by Claude McKay. In this he uses a simple end-rhyme scheme, and alternates with each line. But the way he has written the poem It seems to flow endlessly, not causing the mind to drift or to become confused. These are only two out of the thousands of poems that display the first characteristic of Jazz music. The next attribute of Jazz music is the subtle differences that musicians would put in that would make each player distinguishable from the next. One poet who demonstrated this quality greatly was Longs Hughes.Hughes was one of the most prolific and successful African-American poets of the 1 asss. In each one of his poems e would display his great pride for his heritage, as well as his displeasure with the oppression he witnessed. One of his poems that greatly illustrates this quality is Refugee in America. In this poem he speaks of sweet and wonderful words like Freedom, and how he thinks about it every day. He goes on to say that there are words like Liberty that nearly make him cry. This shows his great resentment of the oppression of his race.Another one of his poems that shows his strong pride for his heritage Is The Negro Speaks of Rivers. In this poem Hughes Illustrates how his race has been around for thousands of years and has known rivers all across the globe. By this he is stating that his race has been everywhere and will continue to last, just as the rivers of the world. But that is not the last trait that spans across both the music and literature of that era. The way that the musicians would flow almost randomly throughout the music, reacting to the audience, as well as their band mates, and not simply playing a single, designated set of notes.One of the first examples that comes to mind is William Carols Williams The Great Figure. This poem seems to make almost no sense, and have no reason for being written. It is the simple story of a fire truck going through the city on a rainy day. There were not too many styles of music, or literature, which produced poems as seemingly random, yet meaningful as the Jazz era. Another example of this is by the poet Hilled Doolittle, who is actually said to be the creator of the Images style of poetry. In Doolittle poem Heat she speaks of a wind that is miming through to cool down the heat.

Avoid Beginning a Sentence with With

Avoid Beginning a Sentence with With Avoid Beginning a Sentence with â€Å"With† Avoid Beginning a Sentence with â€Å"With† By Mark Nichol Sentences (and clauses) that begin with with are doomed to be weak. The following sentences suffer from this affliction; discussions describe how to improve the sentence, and revisions demonstrate the solutions. 1. With a quarter-billion-dollar industry possible, there is a real possibility of supporting the community with something other than an economy based on a nearby prison. To strengthen this sentence, simply delete with, slightly alter the main clause and present it as a parenthetical phrase, and close the sentence with a verb to transform what was originally a subordinate clause into the main clause: â€Å"A potential quarter-billion-dollar industry, and a real possibility of supporting the community with something other than an economy based on a nearby prison, awaits.† 2. With almost one in three residents below the poverty line, the business of mass incarceration has had mixed effects on the community for twenty-five years. With the promise of good jobs, four prisons opened. With a 10 percent tax on potential cultivation revenue, the company has the chance to make more money in a year than it would off the prison industry in two centuries at the current rate. All three sentences in this paragraph start with with. As in the previous example, convert the introductory subordinate clause in the first sentence into a main clause, and insert a conjunction to change the main clause to a subordinate one: â€Å"Almost one in three residents lives below the poverty line, so the business of mass incarceration has had mixed effects on the community for twenty-five years.† For the second and third sentences, simply substitute a stronger word or phrase for with: â€Å"Based on the promise of good jobs, four prisons opened. Thanks to a 10 percent tax on potential cultivation revenue, the company has the chance to make more money in a year than it would off the prison industry in two centuries at the current rate.† 3. A company can adopt a standardized approach or an internal models approach, with the former generally leading to much higher capital charges and the latter requiring regulatory approval. Here, a subordinate clause headed by with ends rather than begins the sentence. In this case, simply omit the word and alter the form of the verbs that follow, then set the clause- now a main rather than subordinate clause- off with a semicolon or a period (and insert a comma to divide the two independent clauses within it): â€Å"A company can adopt a standardized approach or an internal models approach; the former generally leads to much higher capital charges, and the latter requires regulatory approval.† 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 General category, check our popular posts, or choose a related post below:Grammar Test 145 Synonyms for â€Å"Old† and â€Å"Old-Fashioned†One "L" or Two?

Knee Injury Medical Treatment Case Study Example | Topics and Well Written Essays - 500 words

Knee Injury Medical Treatment - Case Study Example SH: the patient is the first born in a family of three siblings. Lives with the parents and two brothers. She is in college and is a sportswoman has been playing football since elementary schools, it has become her hobby as well as the reason she obtained a scholarship in the college. Her mother is a nurse while the father works as lecturer at a local college.O/E: The patient appears to be in pain (Davies et al. 2011, p.8). The knee appears deformed. The patella bone is visible towards the inner side of the thigh, medial and superiorly to the knee joint. Cannot move the affected leg which have started to swell around the knee joint. She is literary guarding any attempt to touch the affected leg.ROM: There is intense pain in each movement of the knee joint affected by the injury. Active: Flexion- Intense and unbearable painExtension: intense pain Abduction-, intense painAdduction- intense painMedial Rotation- intense painPassive: Flexion- intense painExtension- intense painAbduction- intense painAdduction- pain free movementMedial Rotation- intense painResistive: intense painExtension- intense painAbduction- intense painMedial Rotation- intense painPhysical assessment shows no other abnormality.Impression: Total Right knee-cap dislocation.Plan: Immobilise the knee joint. Prepare for x-ray to identify the position of the patella. Apply strong anti-inflammatory agents to reduce swelling.

Tourism and economic developement policy Essay Example | Topics and Well Written Essays - 2750 words

Tourism and economic developement policy - Essay Example ensive and extensive research article essentially and fundamentally delves deep into the advantages and challenges of the bottom up approach to tourism development in influencing and strengthening the economic growth of the region. The historical and geographic context of tourism development is also traversed in this study, consequently with in depth research into the socioeconomic and governmental involvement and significance and the overall efficacy and benefit of sustainable tourism. In this context the study is concentrated on one of the most promising emerging economies – India specifically its state of West Bengal. Dating back to the Roman Empire, the rich and the prosperous community only could afford to visit places to enrich experiences, to splurge in luxury and leisure, Baiae being one such seashore vacation place. â€Å"Tourism† was coined in 1811 and â€Å"tourist† by 1840. Whereas in 1936 the â€Å"tourists† were elaborately demarcated by the then ‘League of Nations’ as one journeying outside of country for a minimum of twenty-four hours – which was modified by the United Nations at the end of World War II in 1945 and conceived tourism as which expanded for the time period of maximum six months. The concept of eco-tourism was initiated in 1989. In the present scenario tourism is deemed to be the most rapidly evolving and vastly expanding global business with an approximate growth rate of 4 percent to 5 per cent per annum which is responsible for 10% of global gross domestic product (WTO). The advanced as well as emerging nations have attracted an enormous influx of foreign tourists with an estimate of 760 million in 2004 and another 1.6 billion anticipated by the World Tourism Organization (WTO 2005a) by the year 2020. With globalization and open-door policies being implemented world wide, more and more emerging and advancing nations are becoming the hot tourists’ hot attractions since 1950 at which time there was a record influx of 25 million

Historical Analysis Of Leather In India Research Paper

Historical Analysis Of Leather In India - Research Paper Example Sankar, an eminent expert on leather technology at the Oxford University, says that the industry releases harmful effluents and chemicals that pollute rivers and other water bodies (86). Moreover, much of this waste is released in a solid form that cannot be absorbed or disposed off effectively and is therefore contributing to the pollution of the environment. The Indian leather industry is composed of both established manufacturers as well as thousands of cottage industries engaged in the production of various types of leather. In 2010, the industry processed over 65 million animal hides and over 160 million skins to produce leather of various types and quality (Kaul 108). In fact, the latter constitute over three-fifths of the total industrial output. While leather production has existed in India for thousands of years, the modern practice of leather production were introduced by the British rules in the mid-nineteenth century. Over 60% of the industry’s output constitutes h ides and skins. Other leather products manufactured by these industries include leather garments, suitcases, belts and shoes (Kaul 95). Sawhney, a noted professor on Leather Technology at the Jawaharlal Nehru Technological University in Hyderabad, India states that there are more than 2300 tanneries in the country with a combined turnover of $7.5 billion and are primarily concentrated in the states of Uttar Pradesh, Tamil Nadu, Maharashtra and West Bengal (109). The industry exports most of its produce mainly to the western countries, Japan and Australia. The following figure shows the growth of the leather industry in India over the last 50 years. The information in this graphic is of importance as it highlights the gradual growth of the industry, its relative contribution to the national GDP and the extent to which the sector has come to dominate leather production in the global market. Fig. 1. Growth of the leather industry in India 1951-2007. Source: Sawhney, The new face of environmental management in India, 2008. While India remains a top exporter of leather, it has fallen behind Pakistan and Argentina in annua l output due to several factors. India has the highest population of cattle and enjoys lower labor costs that are essential for leather production. Such conditions would make one believe that India holds a distinct advantage when it comes to manufacturing leather (Sahasranaman 46). However, despite having the basic raw material required for the manufacture of leather, the Indian leather industry suffers from adequate technology and financial incentives required to operate the industries in a clean and pollution-free manner. Further, Indian leather manufacturers are driven by the incentive to keep costs at the very minimum and look upon treating effluents or utilizing cleaner techniques as additional expenditure (Sahasranamam 50). The presence of favorable conditions combined with the present inability of Indian leather manufacturers in coping with global demand has forced them to adopt cheaper and quicker means of production to enhance output volumes. Such pressures have however com e at the expense of the environment. In fact, Jenkins says that tanneries depend on as many as 700 different chemicals to treat and process animal hides, most of which are water insoluble and capable of rendering land and water toxic and unfit for human use (65). For instance, most leather companies situated near the banks of the Ganges River have simply preferred to dump their wastes directly into the river. These effluents contain large

Role Of Data Structures In Programming Languages

Role Of Data Structures In Programming Languages In computer science, a data structure is a particular way of storing and organizing data in a computer so that it can be used efficiently. It is also known as the logical or mathematical model of a particular organization of data. Data structures are generally based on the ability of a computer to fetch and store data at any place in its memory, specified by an address a bit string that can be itself stored in memory and manipulated by the program. Thus the record and array data structures are based on computing the addresses of data items with arithmetic operations; while the linked data structures are based on storing addresses of data items within the structure itself. Many data structures use both principles, sometimes combined in non-trivial ways Choice of particular data model depends on 2 considerations:- It must be rich enough in structure to mirror the actual relationships of the data in real world. Structure should be simple enough that one can effectively process the data when necessary. Classification of data structure Primitive and Non-primitive : primitive data structures are basic data structure and are directly operated upon machine instructions.Example Integer,character. Non-primitive data structures are derived data structure from the primitive data structures.Example Structure,union,array. Homogeneous and heterogeneous : In homogeneous data structures all the elements will be of same type.Example array. In heterogeneous data structure the elements are of different types.Example structure. Static and Dynamic data structures :In some data structures memory is allocated at the time of compilation such data structures are known as static data structures . If the allocation of memory is at run-time then such data structures are known as Dynamic data structures.Functions such as malloc, calloc,etc.. are used for run-time memory allocation. Linear and Non-linear data structures : Linear data structure maintain a linear relationship between its elements and whose elements form a sequence and every element in structure has unique predecessor and successor. Example array. Non-linear data structures does not maintain hierarichal relationship between the elements. Example tree Some Data Structures And Their role in Programming Languages Stack In computer science, a stack is a last in, first out (LIFO) data structure. History The stack was first proposed in 1955, and then patented in 1957, by the German Friedrich L. Bauer. The same concept was developed independently, at around the same time, by the Australian Charles Leonard Hamblin.. Operations on stacks A stack can have any abstract data type as an element, but is characterized by only two fundamental operations: push and pop. The push operation adds to the top of the list, hiding any items already on the stack, or initializing the stack if it is empty. The pop operation removes an item from the top of the list, and returns this value to the caller. A pop either reveals previously concealed items, or results in an empty list. Simple representation of a stack A stack is a restricted data structure, because only a small number of operations are performed on it. The nature of the pop and push operations also means that stack elements have a natural order. Elements are removed from the stack in the reverse order to the order of their addition: therefore, the lower elements are typically those that have been in the list the longest. In modern computer languages, the stack is usually implemented with more operations than just push and pop. Some implementations have a function which returns the current length of the stack. Another typical helper operation top (also known as peek) can return the current top element of the stack without removing it. Basic architecture of a stack Role of stacks in programming languages Languages such as Adobe PostScript are also designed around language-defined stacks that are directly visible to and manipulated by the programmer. C++s Standard Template Library provides a stack templated class which is restricted to only push/pop operations. Javas library contains a stack class that is a specialization of vectorthis could be considered a design flaw, since the inherited get() method from vector ignores the LIFO constraint of the stack. The simple model provided in a stack-oriented programming language allows expressions and programs to be interpreted simply and theoretically evaluated much more quickly, since no syntax analysis needs to be done, only lexical analysis. The way programs are written lends itself well to being interpreted by machines, which is why PostScript suits printers well for its use. However, the slightly artificial way of writing PostScript programs can result in an initial barrier to understanding the PostScript language and other stack-oriented programming languages. Whilst the capability of shadowing by overriding inbuilt and other definitions can make things difficult to debug and irresponsible usage of this feature can result in unpredictable behaviour it can make certain functionality much simpler. For example, in PostScript usage, the showpage operator can be overridden with a custom one that applies a certain style to the page, instead of having to define a custom operator or to repeat code to generate the style. Implementation In most high level languages, a stack can be easily implemented through an array. What identifies the data structure as a stack in either case is not the implementation but the interface: the user is only allowed to pop or push items onto the array or linked list, with few other helper operations. The following will demonstrate both implementations, using C. Array The array implementation aims to create an array where the first element (usually at the zero-offset) is the bottom. That is, array[0] is the first element pushed onto the stack and the last element popped off. The program must keep track of the size, or the length of the stack. The stack itself can therefore be effectively implemented as a two-element structure in C: typedef struct { int size; int items[STACKSIZE]; } STACK; The push() operation is used both to initialize the stack, and to store values to it. It is responsible for inserting (copying) the value into the ps->items[] array and for incrementing the element counter (ps->size). In a responsible C implementation, it is also necessary to check whether the array is already full to prevent an overrun. void push(STACK *ps, int x) { if (ps->size == STACKSIZE) { fputs(Error: stack overflown, stderr); abort(); } else ps->items[ps->size++] = x; } The pop() operation is responsible for removing a value from the stack, and decrementing the value of ps->size. A responsible C implementation will also need to check that the array is not already empty. int pop(STACK *ps) { if (ps->size == 0){ fputs(Error: stack underflown, stderr); abort(); } else return ps->items[ps->size]; } Procedures A procedure in a stack-based programming language is treated as a data object in its own right. In PostScript, procedures are denoted between { and }. For example, in PostScript syntax, { dup mul } represents an anonymous procedure to duplicate what is on the top of the stack and then multiply the result a squaring procedure. Since procedures are treated as simple data objects, we can define names with procedures, and when they are retrieved, they are executed directly. Dictionaries provide a means of controlling scoping, as well as storing of definitions. Since data objects are stored in the top-most dictionary, an unexpected capability arises quite naturally: when looking up a definition from a dictionary, the topmost dictionary is checked, then the next, and so on. If we define a procedure that has the same name as another already defined in a different dictionary, the local one will be called. Anatomy of some typical procedures Procedures often take arguments. They are handled by the procedure in a very specific way, different from that of other programming languages. Let us examine a Fibonacci number program in PostScript: /fib { dup dup 1 eq exch 0 eq or not { dup 1 sub fib exch 2 sub fib add } if } def We use a recursive definition, and do so on the stack. The Fibonacci number function takes one argument. We first test whether it is 1 or 0. Let us decompose each of the programs key steps, reflecting the stack. Assume we calculate F(4). stack: 4 dup stack: 4 4 dup stack: 4 4 4 1 eq stack: false 4 4 exch stack: 4 false 4 0 eq stack: false false 4 or stack: false 4 not stack: true 4 Since the expression evaluates to true, the inner procedure is evaluated. stack: 4 dup stack: 4 4 1 sub stack: 3 4 fib (we recurse here) stack: F(3) 4 exch stack: 4 F(3) 2 sub stack: 2 F(3) fib (we recurse here) stack: F(2) F(3) add stack: F(2)+F(3) which is the result we wanted. This procedure does not use named variables, purely the stack. We can create named variables by using the /a exch def construct. For example, {/n exch def n n mul} is a square procedure with a named variable n. Assume that /sq {/n exch def n n mul} def and 3 sq is called. Let us analyse this procedure. stack: 3 /n exch stack: /n 3 def stack: empty (it has been defined) n stack: 3 n stack: 3 3 mul stack: 9 which is the result we wanted. Expression evaluation and syntax parsing Calculators employing reverse Polish notation use a stack structure to hold values. Expressions can be represented in prefix, postfix or infix notations. Conversion from one form of the expression to another form may be accomplished using a stack. Many compilers use a stack for parsing the syntax of expressions, program blocks etc. before translating into low level code. Most of the programming languages are context free languages allowing them to be parsed with stack based machines. Example in C #include int main() { int a[100], i; printf(To pop enter -1n); for(i = 0;;) { printf(Push ); scanf(%d, a[i]); if(a[i] == -1) { if(i == 0) { printf(Underflown); } else { printf(pop = %dn, a[i]); } } else { i++; } } } Runtime memory management A number of programming languages are stack oriented, meaning they define most basic operations (adding two numbers, printing a character) as taking their arguments from the stack, and placing any return values back on the stack. For example, Postscript has a return stack and an operand stack, and also has a graphics state stack and a dictionary stack. Forth uses two stacks, one for argument passing and one for subroutine return addresses. The use of a return stack is extremely commonplace, but the somewhat unusual use of an argument stack for a human-readable programming language is the reason Forth is referred to as a stack based language. Almost all computer runtime memory environments use a special stack (the call stack) to hold information about procedure/function calling and nesting in order to switch to the context of the called function and restore to the caller function when the calling finishes. They follow a runtime protocol between caller and callee to save arguments and return value on the stack. Stacks are an important way of supporting nested or recursive function calls. This type of stack is used implicitly by the compiler to support CALL and RETURN statements (or their equivalents) and is not manipulated directly by the programmer. Some programming languages use the stack to store data that is local to a procedure. Space for local data items is allocated from the stack when the procedure is entered, and is deallocated when the procedure exits. The C programming language is typically implemented in this way. Using the same stack for both data and procedure calls has important security implications (see below) of which a programmer must be aware in order to avoid introducing serious security bugs into a program. Linked Lists In computer science, a linked list is a data structure that consists of a sequence of data records such that in each record there is a field that contains a reference(i.e., a link) to the next record in the sequence. A linked list whose nodes contain two fields: an integer value and a link to the next node Linked lists can be implemented in most languages. Languages such as Lisp and Scheme have the data structure built in, along with operations to access the linked list. Procedural languages, such as C, or object-oriented languages, such as C++ and JAVA, typically rely on mutable references to create linked lists. History Linked lists were developed in 1955-56 by Allen Newell, Cliff Shaw and Herbert Simon at RAND Corporation as the primary data structure for their Information Processing Language. Role of linked lists in programming languages Many programming languages such as Lisp and Scheme have singly linked lists built in. In many functional languages. In languages that support Abstract Data types or templates, linked list ADTs or templates are available for building linked lists. In other languages, linked lists are typically built using references together with records. Here is a complete example in C: #include /* for printf */ #include /* for malloc */ typedef struct node { int data; struct node *next; /* pointer to next element in list */ } LLIST; LLIST *list_add(LLIST **p, int i); void list_remove(LLIST **p); LLIST **list_search(LLIST **n, int i); void list_print(LLIST *n); LLIST *list_add(LLIST **p, int i) { if (p == NULL) return NULL; LLIST *n = malloc(sizeof(LLIST)); if (n == NULL) return NULL; n->next = *p; /* the previous element (*p) now becomes the next element */ *p = n; /* add new empty element to the front (head) of the list */ n->data = i; return *p; } void list_remove(LLIST **p) /* remove head */ { if (p != NULL *p != NULL) { LLIST *n = *p; *p = (*p)->next; free(n); } } LLIST **list_search(LLIST **n, int i) { if (n == NULL) return NULL; while (*n != NULL) { if ((*n)->data == i) { return n; } n = (*n)->next; } return NULL; } void list_print(LLIST *n) { if (n == NULL) { printf(list is emptyn); } while (n != NULL) { printf(print %p %p %dn, n, n->next, n->data); n = n->next; } } int main(void) { LLIST *n = NULL; list_add(n, 0); /* list: 0 */ list_add(n, 1); /* list: 1 0 */ list_add(n, 2); /* list: 2 1 0 */ list_add(n, 3); /* list: 3 2 1 0 */ list_add(n, 4); /* list: 4 3 2 1 0 */ list_print(n); list_remove(n); /* remove first (4) */ list_remove(n->next); /* remove new second (2) */ list_remove(list_search(n, 1)); /* remove cell containing 1 (first) */ list_remove(n->next); /* remove second to last node (0) */ list_remove(n); /* remove last (3) */ list_print(n); return 0; Queue A queue is a particular kind of collection in which the entities in the collection are kept in order and the principal (or only) operations on the collection are the addition of entities to the rear terminal position and removal of entities from the front terminal position. This makes the queue a First In First Out. In a FIFO data structure, the first element added to the queue will be the first one to be removed. This is equivalent to the requirement that whenever an element is added, all elements that were added before have to be removed before the new element can be invoked. A queue is an example of a linear data structure. Representation of a Queue Example C Program #include int main(){ int a[100],i,j; printf(To DQueue Enter -1n); for(i=0;;){ printf(NQueue ); scanf(%d,a[i]); if(a[i]==0) break; if(a[i]==-1){ a[i]=0; if(i==0){ printf(Wrongn); continue; } printf(DQueue = %dn,a[0]); for(j=0;j a[j]=a[j+1]; i; } else i++; } for(j=0;j printf(%d ,a[j]); return 0; }

Quest for The Dream in Black Girl Lost and Makes Me Wanna Holler :: Comparison Compare Contrast Essays

Quest for "The Dream" in Black Girl Lost and Makes Me Wanna Holler      Ã‚  Ã‚  Ã‚  Ã‚  Ã‚   Donald Goines Black Girl Lost (1973) and Nathan McCall's Makes Me Wanna Holler (1994) are two works written by male authors who have first hand knowledge about the African American experience. A difference between the two works is that McCalls story is an autobiography of his life growing up in the streets/ghetto and Goines is a fictional story about growing up in the streets/ghetto, but from a young black female perspective. Although Goines Black Girl Lost is not an autobiography, he and McCall share similar struggles and hardships in their backgrounds that give them the motivation to write about the black experience. Both authors have been praised for the "realism" in their writing (Lamb 1997,OCAAL 1997). Goines has been specifically recognized by critic Greg Goode, for his "ghetto realism" w/o glamorization (OCAAL 1997).    Black Girl Lost (Goines 1973) and Makes Me Wanna Holler (McCall 1994), both give a voice to the African American minority. The African American and minority themes: "The Dream" and "Choice / Self Determination" are very significant in the two texts. The right choices have to be made and one must continue to have self- determination in order to reach "The Dream". In the two texts, both characters make plenty of good and bad choices and continuously try to have self- determination in order to achieve "The Dream", but their choices and determination led the characters to very different places. There are three variables that may not cause, but can contribute to the African American not being able to achieve "The Dream" by causing conflict in their choices and self- determination. The three variables are: family and friend environments, individual needs and anxieties, and low motivation among minority members. Some of the variables are causes and consequences of prejudice & discrimination (Marger 1997).    The environment that people are surrounded by can have an enormous effect on their actions or circumstances that they are in. Therefore, the first variable to compare and contrast in the two texts is the Family and Friends Environment. In Black Girl Lost (1973), Goines has his main character, Sandra, being the only child of a single parent home were her mother is constantly drinking, entertaining different men, partying and never taking the responsibility for herself or her daughter. They hardly ever eat or have any money.