what is dynamic memory allocation

hi everyone,
I have a hard time understanding structs, dynamic memory allocation, and linked list.
Please explain to me what is going on in the following code.

Also the question ask to me to continue writing the function so that it reads the numbers of an input array and create a linked list whose elements are NUMBERS. It said i should dynamically allocate the memory of each NUMBER INSTANCE.

The array used in this question is {4,9,22,45,89,100}.

thanks in advance.

(Note: this is not my homework.....its a test question im trying to study).

Code:

---

  struct number
{
        int a_number;
        struct number* next;
};

typedef struct number NUMBER;

NUMBER* load(int[] input_array, int size)
{
NUMBER* head = NULL;
        NUMBER* current = head;
        int i = 0;
    size = size -1;
        if(size>=0)  // here is the generation of the head node
        {
                head = (NUMBER*)malloc(sizeof(NUMBER));
                head->a_number = input_array[i++];
                head->next = NULL;
        }

---

Using malloc would be an example of dynamic memory allocation. In that regard, they simply want you to allocate enough memory to hold everything without allocating too much or too little.

how would i do that? because i am totally lost with this stuff.

Read your C book, if you have one. Also, google for C language tutorials. There are many of them on the net, including our forum's own.

As with any skill, you need to practice a great deal to become skilled at it, yourself. There is a huge difference between reading up on something, and being able to use it yourself, without errors.

It's not enough to read a student's try at programming for his assignment, and saying "Oh that's not very good". Keep on going with it, and ask yourself "How would I do it?", and then try it if it seems challenging.

Good luck!

the thing is im running out of time, my test is tomorrow. and i tried doing this already. this is what i came up but im getting segmentation fault error.

Code:

---

        while (i<=size)
        {
          current->a_number = input_array[i++];
          current = current->next;
      }
        return head;

---

Quote:

---

Originally Posted by dbzx

the thing is im running out of time, my test is tomorrow.

---

Then you've set yourself up for failure.

"I'm running out of time" reads as "I'm too lazy to bother learning to program, I just want a free pass".
Programming is not like singing - you can't fake it by lipsynching. You actually have to make the time to learn. It really isn't that hard to learn how to write a linked-list if you're committed to doing it.

Quote:

---

Originally Posted by iMalc

Programming is not like singing - you can't fake it by lipsynching.

---

Is this akin to the story involving the movie WarGames in which actor Matthew Broderick allegedly programmed the computer in the movie to type out all of the commands for him without error? ;)

Quote:

---

i am totally lost with this stuff.

---

I'm afraid what everyone else has said is true, regardless of how much people on this board help you. Nevertheless, here's a quick explanation:

You program basically needs to request resources from the operating system. There's a number of programs running, and the operating system needs to make sure each one has enough memory, and that they don't run into each other or have access to each other's resources (unless both programs explicitly set it up so that they can share resources).

When your program runs, it has a certain amount of space called the stack. It's already there for you, you don't need to do anything to get it. So if you need an integer, you say

Code:

---

int i = 0;

---

and 4 bytes of the stack space is assigned to the name 'i'. Then you can use the name i to do your operations. Your program can do this because the system knows what an 'int' is, and it already gave you enough space.

But let's say you need a complex structure that the OS has never heard of (like maybe... a family tree), and you don't know how big it is (what if you need to add or take away generations?) So you define a struct, that contains a person's name, their birth and death dates, and of course, pointers to their parents, and pointers to their children. If you don't understand pointers - you need to go learn about them - they're crucial.

So you defined a struct for your custom data type, and now you use malloc to allocate additional space in memory (more than what the OS already gave you). This is done on the 'heap'. Malloc returns a pointer with enough space for your struct. Then you can assign that pointer as a child or parent of an existing person. If you need to delete them, you "free" that pointer, and that lets the OS know that you no longer need the memory, and if needs be, it can be given to another program.

I hope that helps - but this is no substitution for having done it yourself. Programming concepts have to be learned long before a test so you have time to try it yourself and REALLY understand how it works.