Programming In C, 3rd Edition

Dynamic Memory Allocation and Linked List 637

1 . Singly Linked list uses random searching method.

2 . calloc(m,n) = m*malloc(n)

3 . malloc(8); it will allocate the memory of size

8 bytes and initialize it with 0.

4. calloc(4,4); it will allocate 4 blocks of mem-

ory with 4 bytes each and also initialize it with 0.

5. Doubly linked list moves in forward and/or back-

ward direction.

6. free() function releases the memory reference

on invocation.

7. The link list is self referential structure.

III Find out the bugs from the programs given below:

1 .

#include<alloc.h>

void main()

{

int *a;

a=malloc(sizeof(int),2); ...