Skip to content
  • Categories
  • Recent
  • Tags
  • Popular
  • World
  • Users
  • Groups
Skins
  • Light
  • Cerulean
  • Cosmo
  • Flatly
  • Journal
  • Litera
  • Lumen
  • Lux
  • Materia
  • Minty
  • Morph
  • Pulse
  • Sandstone
  • Simplex
  • Sketchy
  • Spacelab
  • United
  • Yeti
  • Zephyr
  • Dark
  • Cyborg
  • Darkly
  • Quartz
  • Slate
  • Solar
  • Superhero
  • Vapor

  • Default (No Skin)
  • No Skin
Collapse
Code Project
  1. Home
  2. General Programming
  3. C / C++ / MFC
  4. CS Data Struct

CS Data Struct

Scheduled Pinned Locked Moved C / C++ / MFC
data-structures
3 Posts 3 Posters 0 Views 1 Watching
  • Oldest to Newest
  • Newest to Oldest
  • Most Votes
Reply
  • Reply as topic
Log in to reply
This topic has been deleted. Only users with topic management privileges can see it.
  • U Offline
    U Offline
    User 11252959
    wrote on last edited by
    #1

    We are storing a list of student info, (id number, First name and Last name) using a link list. The ID is the key field. Your program should implement a linked list using arrays. Your program should process the following operations. 1) Add an item to the linked list
ex. 1 254 John Smith 2) Print the linked list in logical order
ex. 2 3) Print the physical order of the linked list including list, avail and next.
ex. 3 4) Print a count of how many items are in the linked list.
ex. 4 Bonus (you must get 1-4 working before attempting 5)
5) Delete an item from the linked list
ex. 5 254 I started it off as so

    #include
    using namespace std;
    struct studenttype

    L CPalliniC 2 Replies Last reply
    0
    • U User 11252959

      We are storing a list of student info, (id number, First name and Last name) using a link list. The ID is the key field. Your program should implement a linked list using arrays. Your program should process the following operations. 1) Add an item to the linked list
ex. 1 254 John Smith 2) Print the linked list in logical order
ex. 2 3) Print the physical order of the linked list including list, avail and next.
ex. 3 4) Print a count of how many items are in the linked list.
ex. 4 Bonus (you must get 1-4 working before attempting 5)
5) Delete an item from the linked list
ex. 5 254 I started it off as so

      #include
      using namespace std;
      struct studenttype

      L Offline
      L Offline
      Lost User
      wrote on last edited by
      #2

      Member 11287228 wrote:

      Your program

      That means you are expected to write it.

      1 Reply Last reply
      0
      • U User 11252959

        We are storing a list of student info, (id number, First name and Last name) using a link list. The ID is the key field. Your program should implement a linked list using arrays. Your program should process the following operations. 1) Add an item to the linked list
ex. 1 254 John Smith 2) Print the linked list in logical order
ex. 2 3) Print the physical order of the linked list including list, avail and next.
ex. 3 4) Print a count of how many items are in the linked list.
ex. 4 Bonus (you must get 1-4 working before attempting 5)
5) Delete an item from the linked list
ex. 5 254 I started it off as so

        #include
        using namespace std;
        struct studenttype

        CPalliniC Offline
        CPalliniC Offline
        CPallini
        wrote on last edited by
        #3

        Quote:

        I started it off as so #include using namespace std; struct studenttype

        Well, it looks promising.

        THESE PEOPLE REALLY BOTHER ME!! How can they know what you should do without knowing what you want done?!?! -- C++ FQA Lite

        In testa che avete, signor di Ceprano?

        1 Reply Last reply
        0
        Reply
        • Reply as topic
        Log in to reply
        • Oldest to Newest
        • Newest to Oldest
        • Most Votes


        • Login

        • Don't have an account? Register

        • Login or register to search.
        • First post
          Last post
        0
        • Categories
        • Recent
        • Tags
        • Popular
        • World
        • Users
        • Groups