Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>Once you allocate memory for a node (using malloc) you should be able to do sizeof(yourDataType). So to get the total size of the linked list you traverse the list and get the count of nodes:</p> <pre><code>Total Size Of Linked List = SizeOf(One Node) * Count Of Nodes </code></pre> <p>For instance:</p> <pre><code>int getCountOfList() { Node* temp = head; //assign a temp node to the head of the list int count=0; while(temp) { count++; temp = temp-&gt;next; //move to next node } return count; } </code></pre> <p>Then you take that count and multiply by size:</p> <p>size = getCountOfList * sizeof(mydatatype);</p> <p><strong>This will give you the size of the actual linked list but becareful as the linked list node has pointer elements which in and of themselves can allocate memory as well. This will need to be accounted for...</strong></p> <p>For instance, one of those char* elements within the node could malloc some more space and use up some memory.</p> <p>If you actually need the entire size of the list including allocated elements for all other char* pointers for example, you simply:</p> <p>1)Traverse the list and look into each node</p> <p>2)For each node you check if the elements of each node point to any other allocation (for instance char* data may allocate 50 characters to store). If it isn't null you get the length of the string + 1 (for terminating char) and you multiply that by sizeof(char) (for this example)</p> <p>3)You do that for each node and store that size, then move to next node</p> <p>4)You take the SUM of all of these char* (in this case) for each node and accumulate for the entire list.</p> <p>5)Once you have that simply add this sum that will give you the size of all nodes.</p> <p>Then total size becomes:</p> <pre><code>SizeOfAllNode + (SizeOf(dataType) * CountOfNodes) </code></pre>
    singulars
    1. This table or related slice is empty.
    1. POTotal size of a linked list in C
      singulars
      1. PTQuestion
    1. PTAnswer
    1. USJonH
    1. USJonH
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    3. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    1. COAssuming she doesn't need to add the string lengths of the char* members inside the nodes, which isn't clear to me from the question.
      singulars
      1. PO
      1. USDuck
    2. CO@Duck - I had put that in bold.
      singulars
      1. PO
      1. USJonH
    3. COIt's generally not a good idea to post exact code for homework questions as it doesn't really help the OP.
      singulars
      1. PO
      1. USMehrdad Afshari
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload