6. Write an introduction (about 100 words) to an essay on a subject from your own discipline.

6. Organising the Main Body

!The structure of the main body depends on the length of the essay and the subject of study.

Longer essays may include the following sections:

Experimental set-up – a technical description of the organisation of an experiment.

Methods – how the research was carried out.

Findings/results – what was discovered by the research/experiment.

Case study – a description of an example of the topic being researched.

Discussion – an examination of the issues and the writer’s verdict.

!Inside the main body, ideas need to be presented in the most logical fashion, linked together to form a coherent argument. It is useful to mark the beginning of new paragraphs or the introduction of new subjects with special phrases.

To introduce a new paragraph/topic:	To add information inside a paragraph:
The main/chief factor/issue is ... Turning to the subject of … Moving on to the question of … Another important area is ... ………… must also be examined Even if… It is wise to think…	a) Firstly, ... The first point ... In the first place ... b) Secondly, ... Next, .... Then, ... In addition … Moreover …, On the other hand,… Also,… Similarly,… c) Finally, ... Lastly,...

7. Complete with suitable phrases the following extract from an essay on ‘Data structure’.

_________ there are no terms with zero coefficients in a polynomial or no zero elements in a matrix, an advantage of the linked list representation is that we don’t need to know in advance how big the objects that we’ll be processing are. This is a significant advantage that makes linked structures preferable in many situations. _________, the links themselves can consume a significant part of the available space, a disadvantage in some situations_________, access to individual elements in linked structures is much more restricted than in arrays.

We’ll see examples of the use of these data structures in various algorithms, and we’ll see more complicated data structures that involve more constraints on the elements in an array or more pointers in a linked representation. _________, multidimensional arrays can be defined which use multiple indices to access individual items. _________, we’ll encounter many “multidimensional” linked structures with more than one pointer per node. The tradeoffs between competing structures are usually complicated, and different structures turn out to be appropriate for different situations.

When possible _________of the data and the specific operations to be performed on it as an abstract data structure which can be realized in several ways. _________, the abstract data structure for polynomials in the examples above is the set of coefficients: a user providing input to one of the programs above need not know whether a linked list or an array is being used. Modern programming systems have sophisticated mechanisms which make it possible to change representations easily, even in large, tightly integrated systems.