Advantages And Down sides Of UTILIZING A Pointer Computer Technology Essay

Write benefits and drawbacks of using pointer. The way the concept of tips is useful in the execution of data structures?

A pointer allows a function or a program to gain access to a variable beyond your preview function or a program, using pointer program can gain access to any recollection location in the computer's memory space.

2)since using come back declaration a function can only just pass back a single value to the dialling function, pointers allows a function to cross back several value by writing them into memory space locations that are accessible to contacting function.

3)Usage of pointer boosts makes this program execution faster

4)using suggestions, arrays and constructions can be managed in more efficient way.

5) without pointers it'll be impossible to generate complex data buildings such as associated list, trees and shrubs, and graphs.

Disadvantages of ideas:-

1)we can access the restricted recollection area.

2) Suggestions require one additional dereference, and therefore the final code must read the variable's pointer from storage area, then browse the variable from the pointed-to storage area. That is slower than reading the value directly from ram.

3). If sufficient recollection is not available during runtime for the storage space of pointers, this program may crash

When arranging up data ststructures like lists, queues and trees and shrubs, it is necessary to have suggestions to help control how the structure is executed and controlled. Suggestions and Structures can be used to build data constructions that expand and reduce during execution illustrations stack queues, trees etc. While pointer has been used to store the address of your variable, it more properly pertains to data set ups whose user interface explicitly allows the pointer to be manipulated as a ram address. Because suggestions allow basically unprotected usage of storage addresses.

2). Elaborate the concept of "Fixed block storage allocation" and "Buddy system" in powerful storage management.


Fixed block storage area allocation:- This is actually the simplest storage maintenance method. Here each block is of the same size. The scale depends upon the system manager. Here the ram manager maintain a pointer ' AVAIL' which points a list of non contiguous storage area blocks.

A consumer program communicate with the memory administrator by means of two function GETNODE(NODE) and RETURNNODE(PTR). The procedure GETNODE is to get a memory block to store data of type NODE. This process when invoked by a program returns a pointer to first stop in the pool of restorage. The AVAIL then issues to the next stop. If avail=NULL this implies no more memory space is designed for allocation. Similarly whenever a memory stop is no more required it could be returned to the recollection bank through a procedure Come back NODE().

Buddy system:- It is the another storage management system which restricts how big is blocks to some fixed group of sizes. These blocks of limited sizes are looked after in a linked list. Every time a obtain a block of size N comes, the number M the smallest of the set sizes but equal to or greatest than N, is determined and a block of size M is allocated if available on the list. If not available then a much larger stop if available is split into two sub-blocks known a s buddies. Each of them are also of set sizes and the procedure is repeated until a block of size M is produced. for example, if k=1 and Fo=8, then the stop sizes are 8, 16, 32, 64, 128, . That's, the stop sizes are successive powers of 2; and the friend system based on such resolved sizes is called binary pal system.

3. )Differentiate between static storage allocation and powerful memory allocation. Illustrate various storage area management functions


In circumstance of static safe-keeping management scheme, the web amount of storage required for various data for a program is allocated prior to the starting of the execution of an application once ram is allocated, it neither can be lengthened nor can be returned to the memory space bank for the use of other programs at exactly the same time. Alternatively dynamic storage area management techniques allows user to allocate and deallocate as per necessity during the execution of programs.

The static storage allocation is simple to use and productive from execution point of view. Here all factors those are necessary for a program is allocated during compile time this is the reason why static storage area allocation is a compile time phenomena. In such a each subprogram/subroutine of an application is compiled separately and the area required for them is reserved till the execution of this program. Alternatively dynamic storage area allocation, space for memory factors is allocated dynamically that is as per the current demand during the execution. When a subprogram is invoked space for this is allocated and space is returned when the subprogram completes its execution. Thus, the area necessary to run an application is not set as with static allocation, somewhat it ranges as program execute.

Various storage area management functions:-

1)malloc():-The malloc function dynamically allocates storage area from heap. The prototype for malloc() function is

Void *malloc(size_t size);

2)calloc():- The calloc() function dynamically allocates memory automatically initializes the recollection to zeroes. The prototype for calloc() function is

Void *calloc(size_t nitems, size_t size);

It requires two arguments. The first debate is the amount of elements and the second argument is the size of each aspect.

3) realloc():- The realloc() function changes the size of recently dynamically allocated ram with malloc(), calloc(), realloc() functions. The prototype for realloc() function is

Void *realloc(void *block, size_t size);

It calls for two debate. the first discussion is the pointer to the original object and the second debate is the new size of the object.

4. )Write different ways to manage records in memory

Sol. ) Since details may contain non homogeneous data, the components of a record can't be stored within an array. Some encoding dialects such as PASCAL and COBOL do have record set ups included in the words.

Suppose a programming language does not have available the hierarchical set ups that exist in PASCAL and COBOL. Supposing the record contains non homogeneous data, the record may need to be stored in specific variables, one for each of its elementary data items. On the other hand one needs to store a whole file of details, such a file may be stored in ram as a assortment of arrays that is, where elements in several arrays with the same subscript owned by the same record.


1. )Demonstrate the utilization of selection of pointers and suggestions to a array

Sol. )

An array of pointers is the fact for eg if we have array of 10 int ideas ie int *a[10] then each component whatever is stored in array are pointed by guidelines. here we will have ten tips. In pointer to an array for eg int(*a)[10] here all the elements that is all the ten elements are pointed by an individual pointer.

int *a[10]:-array of tips.

consider one array int b[10]=1, 2, 3, 4, 5, 6, 7, 8, 9, 0;so

elements will be stored in addresses. now this address are

stored in array of pointers. thats

int *a[10]=b+0, b+1, b+2, b+3, b+4, b+5, b+6, b+7, b+8, b+9;means a+0=address of value 1 is the first aspect of int

*a[](first factor of int b[10])and so forth.

while int(*a)[10]:-here a can be an pointer to a wide range containing 10


suppose int b[10];

then a=&b[10];

this will give aspect of int b[10] array thats b[0];and so on but in case of two dimensional array first we have to allocate platform address of respected one dimensional array and foundation address of element of one dimensional array then only we can use pointer to a wide range.

Give example showing the utilization of very good pointer and dangling pointer problems

Sol. )

A very good pointer uses both the portion and the offset address to point to a spot in memory The very far pointer can indicate any location in memory. . Far hints have a size of 4 bytes. They store both the segment and the offset of the address the pointer is referencing. A significantly pointer has an address selection of 0 - 1M bytes. A very far pointer can be incremented and or decremented Only the offset of the pointer is really incremented or decremented. The segment is never incremented by the arithmetic providers. Alternatively Dangling pointers will be the pointers that not point tao a valid thing of the correct type. The following tips occur when an thing is deleted or deallocated, without modifting the value of the pointer so that pointer stll points to the memory location of deallocated memory. As the system may reallocate the previously freed memory to another process, if the initial program then derefrences the dangling pointer, ends in bugs or errors as the ram may contain completely different data.

Consider the next example

char *cp = NULL;

char c;

cp = &c;

/* cp is currently a dangling pointer */

Solution to dangling pointer

char *cp = malloc ( A_CONST );

free ( cp ); /* cp now becomes a dangling pointer */

cp = NULL; /* cp is no more dangling */

Differentiate between associated list and arrays in terms of representations, traversal and searching.

Sol. )

1)In case there is array traversing is used browsing all elements within an array while to traverse an individual connected list we indicate to go to every node in the list starting from first node to previous node.

2). Searching procedure within an array is put on search an component interest within an array. It is a process of finding the location of given aspect within an array. The search is reported to be successful if the given factor is found. there are two types of search operation

Linear search

Binary search

If the array elements are in random order the other have to make use of linear search approach if the array elements are sorted then it surpasses choose binary search strategy. While in case of linked list only linear searching is possible. This is one of the restriction of associated lists as there is absolutely no way to find the located area of the middle factor of the list.

can we perform binary search in associated list, if no then demonstrate the reason.

Sol. )

No, we cannot perform binary search in associated list since there is no way

Of indexing the center component in the list. Having a sorted linear array we can apply a binary search whose running time is proportional to log2n. On the other hand a binary search algorithm can't be applied to a sorted associated list, since there is absolutely no way of indexing the center factor in the list. This property is one of the key drawbacks in using a linked list as a data composition.

Also We Can Offer!

Other services that we offer

If you don’t see the necessary subject, paper type, or topic in our list of available services and examples, don’t worry! We have a number of other academic disciplines to suit the needs of anyone who visits this website looking for help.

How to ...

We made your life easier with putting together a big number of articles and guidelines on how to plan and write different types of assignments (Essay, Research Paper, Dissertation etc)