Linked lists and structures in C : C

May 10, 2008 03:39pm pdt

1. Infinity08 225,571
2. evilrix 121,501
3. jkr 67,934
4. ozo 48,235
5. josgood 26,525
6. itsmeand... 22,659
7. jaime_ol... 18,880
8. Kdo 18,780
9. sunnycoder 17,740
10. fridom 15,943
11. Gurudenis 7,180
12. hielo 6,200
13. duncan_roe 5,600
14. ravenpl 5,590
15. PaulCaswell 5,372

1. sunnycoder 804,283
2. Infinity08 758,430
3. Kdo 745,278
4. jkr 678,696
5. ozo 390,543
6. grg99 296,356
7. PaulCaswell 295,931
8. brettmjo... 182,528
9. jaime_ol... 174,552
10. ankuratvb 157,866
11. evilrix 151,366
12. itsmeand... 151,125
13. fridom 146,547
14. imladris 137,967
15. cwwkie 129,383

01.06.2008 at 12:43PM PST, ID: 23062352

	[x] Attachment Details

[x]

The Solution Rating System

With so many solutions, how can you tell which solutions are most likely to help you and which ones are not? To provide you with a tool to use, we rate our solutions based on various elements that most accurately determine if a solution is a quality solution. To explain what factors affect the solution rating, here are the elements we take into consideration when formulating our solution rating.

The Grade of the Solution
The Zone Rank of the Expert Providing the Solution
The Number of Author and Expert Comments
The Number of Experts Contributing
The Feedback of the Community

Your Input Matters
Because of the way the system is set up, the most important variable in this equation is you. As a member of Experts Exchange, you are able to cast your vote on the quality of the solutions in regard to how complete, accurate, helpful and easy to understand each solution is. When you provide your feedback, each rating is adjusted accordingly. So, if you see a solution that has a poor rating that you think is a good solution, let us know by rating it. As you do, the rating will be adjusted and will become more accurate for other members of our site.

If you have any suggestions that you would like to make for our rating system, please ask a question in the Suggestions Zone of Community Support.

Thank you!

8.4

Linked lists and structures in C

Zone: C Programming Language

Tags: C

Hello all.

I'm working on an assignment, and I'm stumped yet again. The goal is to create a structure that has one variable called 'value' and one pointer to a list (making it a linked list). It should individually prompt for 5 values and store them in the linked list. After the 5 inputs, it should print the current contents of the list, and finally prompt the user to add one more value. The contents of the list should then be printed again.

I'm pretty sure I'm on the right track, but it's the adding of 1 more value that screws me up. I have the numbers together... but I think I'm needing one more stored variable so they don't all jumble together.

Here is what I have so far:

         
           
             1:
2:
3:
4:
5:
6:
7:
8:
9:
10:
11:
12:
13:
14:
15:
16:
17:
18:
19:
20:
21:
22:
23:
24:
25:
26:
27:
28:
29:
30:
31:
32:
33:
34:
35:

           
           
             #include <stdio.h>
#include <stdlib.h>
 
int main()
{
    int i, last;
    int *value;
    value = (int *) malloc(5 * sizeof(int));
 
        printf("\n\n** You will be asked to enter 5 whole numbers... **\n\n");
 
    for(i = 0; i < 5; i++)
 
    {
        printf("Enter any whole number (%d of 5): ", i+1);
        scanf("%d", &value[i]);
    }
 
    printf("\nSo far, you've entered the following numbers: \n\n");
 
    for (i = 0; i < 5; i++)
        printf("%d, ", value[i]);
    
        printf("\n\nPlease enter one more value: ");
        scanf("%d", &last);
 
        printf("\n\nOkay! Here are the numbers you have given: \n");
 
    for (i = 0; i < 5; i++)
        printf("%d, %d", value[i], last);
 
    printf("\n\n");
    
    return 0;
}

           
         

Start your free trial to view this solution

Question Stats

Zone: Programming

Question Asked By: Graftex

Solution Provided By: itsmeandnobodyelse

Participating Experts: 4

Solution Grade: A

Translate:

Loading Advertisement...

Microsoft

Internet Protocols
Applications

Development
OS

Hardware
Windows Security

Apple

Operating Systems
Hardware

Programming
Networking

Software

Internet

Search Engines
File Sharing
WebTrends / Stats
Spy / Ad Blockers

Web Browsers
New Net Users
Web Development
Chat / IM

Anti Spam
Web Servers
Anti-Virus
Email Clients

Gamers

Tips
Online / MMORPG
Puzzle
Emulators

Action / Adventure
Role Playing
Consoles
Game Programming

Strategy
Sports
Misc
Computer Games

Digital Living

Hardware
New Net Users
New Users

Software
Digital Music
Gaming World

Home Security
Apple
Networking Hardware

Virus & Spyware

Vulnerabilities
IDS
Encryption
Anti-Virus

Operating Systems Security
Software Firewalls
WebApplications
Cell Phones

Operating Systems
Internet
Hardware Firewalls

Hardware

Handhelds / PDAs
Displays / Monitors
Components
Networking Hardware

Peripherals
Laptops/Notebooks
Storage
Servers

Desktops
New Users
Misc
Apple

Software

System Utilities
Industry Specific
Network Management
Photos / Graphics
Page Layout
VMWare
Misc
Web Development

OS
CYGWIN
Voice Recognition
Message Queue
Quality Assurance
Security
Firewalls
MultiMedia Applications

Development
Database
Office / Productivity
Business Management
OS/2 Apps
Server Software
Internet / Email

ITPro

OS
Storage
Encryption
Operating Systems Security
Apple Hardware
Laptops & Notebooks
Servers
Networking Hardware
Peripherals

Devices
Displays / Monitors
WebTrends / Stats
Search Engines
Firewalls
WebApplications
IDS
Vulnerabilities
Email Clients

File Sharing
Spy / Ad Blockers
Web Browsers
Web Servers
Networking
Anti-Virus
Chat / IM
Anti Spam

Developer

Web Servers
Web Browsers
Game Programming
Dev Tools
Industry Specific
Office / Productivity

Database
CYGWIN
Web Development
Search Engines
File Sharing
WebTrends / Stats

Programming
Content Management
Application Servers
Protocols

Storage

Removable Backup Media
Storage Technology
Servers

Grid
Remote Access
Backup / Restore

Misc
Hard Drives

Miscellaneous
Security
Development
Linux
VMWare

MainFrame OS
Unix
Apple
OS / 2
AS / 400

BeOS
Microsoft
VMS / OpenVMS

Database

Oracle
Miscellaneous
MySQL
Software
Sybase
Contact Management
PostgreSQL
Data Manipulation
Clarion
InterSystems Cache

Siebel
MUMPS
OLAP
SQLBase
SAS
GIS & GPS
4GL
Berkeley DB
DB2
Informix

Interbase / Firebird
FoxPro
Reporting
LDAP
Filemaker Pro
MS SQL Server
dBase
MS Access

Security

Misc
Web Browsers
Software Firewalls
Operating Systems Security
File Sharing

Spy / Ad Blockers
Vulnerabilities
WebApplications
IDS
Anti-Virus

Encryption
Anti Spam
Email Clients
VPN
Chat / IM

Programming

Editors IDEs
Installation
Handhelds / PDAs
Multimedia Programming
System / Kernel

Algorithms
Game
Signal Processing
Project Management
Open Source

Database
Misc
Languages
Processor Platforms
Theory

Web Development

Scripting
Blogs
Web Servers
Software
Search Engines
Web Graphics
Images

Internet Marketing
Images and Photos
Components
Document Imaging
Web Languages/Standards
Illustration
WebApplications

Fonts
WebTrends / Stats
Authoring
Digital Camera Software
Miscellaneous

Networking

Protocols
Apple Networking
Network Management
Message Queue
Application Servers
Content Management
File Servers
Email Servers
Misc
Java Editors & IDEs

Wireless
Networking Hardware
Backup / Restore
System Utilities
ISPs & Hosting
Web Servers
Storage Technology
Removable Backup Media
Servers
Broadband

Grid
OS / 2
Novell Netware
Unix Networking
Windows Networking
Security
Telecommunications
Operating Systems
Linux Networking

Other

Community Advisor
Lounge
Community Support
New Net Users

Philosophy / Religion
Math / Science
Miscellaneous
URLs

Expert Lounge
Politics
Puzzles / Riddles

Community Support

Suggestions
New to EE
New Topics
Community Advisor

CleanUp
Announcements
General

Feedback
Input
EE Bugs

01.06.2008 at 12:51PM PST, ID: 20595542

Rank: Sage

Infinity08:

You're not using a linked list right now.

A linked list consists of nodes :

typedef struct Node {
int value; /* <--- the value of the node */
struct Node *next; /* <--- pointer to the next node in the linked list */
} Node;

So, for each value, you create a Node (using malloc or calloc), and then attach it to the end of the linked list using the 'next' pointer of the current last node.

This is just a quick overview ... I'll let you play with it a bit. If you have any questions, feel free to ask.

01.06.2008 at 12:51PM PST, ID: 20595543

Rank: Wizard

ozo:

//what you have is not linked list, but it looks like you want
for (i = 0; i < 5; i++)
printf("%d, ", value[i]);
printf("%d\n ", last);

01.06.2008 at 12:52PM PST, ID: 20595546

Rank: Sage

Infinity08:

For more information on structs, check this tutorial :

http://www.cplusplus.com/doc/tutorial/structures.html

Assisted Solution

01.07.2008 at 09:37PM PST, ID: 20606217

murugesandins:

A sample program using structure for linked list at:
http://www.geocities.com/mukeshgct/technical/C/linear_linked_list.html

01.08.2008 at 04:31AM PST, ID: 20607915

Rank: Guru

itsmeandnobodyelse:

>>>> A linked list consists of nodes :

Though you can take the root node of a linked list as an alias for the 'linked list' I would recommend against it. Better use two structures like that:

/* make the C compiler happy */
typedef struct Node Node;
typedef struct LinkedList LinkedList;

struct Node
{
int data;
Node * next;
};

struct LinkedList
{
Node * head;
Node * tail;
};

The above has the advantage that the 'LinkedList' contains the head node and the tail node. With the latter you easily can insert new data at the end:

void insertItem(LinkedList * list, int data)
{
Node * node = (Node*)malloc(sizeof(Node));
node->data = data;
node->next = NULL;
if (list->head == NULL)
list->head = list->tail = node;
else
list->tail = node;
}

To implement a linked list in C you should add functions 'createList', 'removeList', 'removeItem' similar to the insertItem.

Regards, Alex

Accepted Solution

01.08.2008 at 04:33AM PST, ID: 20607922

Rank: Guru

itsmeandnobodyelse:

>>>> else
>>>> list->tail = node;

I forgot to make the 'link'

....
else
{
list->tail = list->tail->next = node;
}

20080236-EE-VQP-29 / EE_QW_2_20070628