If you insert at the end of a list and take from the front, that's a queue.
If you insert at the front of a list and take from the front, that's a stack.

Don't undrstand it very well what you mean. A linked list, if it's that you mean by a "list", is just that, a linked list. Even excel uses that to implement its spreadsheets.

A list is a list - an ordered sequence of values. Use it for whatever you want. Two possible uses are to implement a stack or implement a queue, but you don't have to use them like that. For example Some list implementations (eg linked list) can grow or shrink to fit the amount of values, and efficiently support removing or adding values in the middle, and so may be a good substitute for an array in some applications.

Not always - it depends on the implementation of the list. For example a linked list has the same overhead for inserting an element in any specified position (indeed, if the implementation only keeps a ref to the head node then you have to search sequentially to get the end node, which gives it the highest overhead)

Write a C program that should create a 10 element array of random integers (0 to 9). The program should total all of the numbers in the odd positions of the array and compare them with the total of the numbers in the even positions of the array and indicate ...

Hi. so this is actually a continuation from another question of mineHere but i was advised to start a new thread as the original question was already answered.

This is the result of previous question answered :

I have a 2d matrix with dimension (3, n) called A, I want to calculate the normalization and cross product of two arrays (b,z) (see the code please) for each column (for the first column, then the second one and so on).
the function that I created to find the ...