See More
Popular Forum

MBA (4887) B.Tech (1769) Engineering (1486) Class 12 (1030) Study Abroad (1004) Computer Science and Engineering (988) Business Management Studies (865) BBA (846) Diploma (746) CAT (651) B.Com (648) B.Sc (643) JEE Mains (618) Mechanical Engineering (574) Exam (525) India (462) Career (452) All Time Q&A (439) Mass Communication (427) BCA (417) Science (384) Computers & IT (Non-Engg) (383) Medicine & Health Sciences (381) Hotel Management (373) Civil Engineering (353) MCA (349) Tuteehub Top Questions (348) Distance (340) Colleges in India (334)
See More

How can i implement hash table that contains singly linked lists inside it`s items?

General Tech Bugs & Fixes

Max. 2000 characters



( 6 months ago )


I write my coursework which theme is system of testing. Its meaning is that the user will be able to pass other sets of tests and write their own tests. Firstly i need to create data types of my program.

I come up with hash table which will store tests-items that constain test topic and singly linked lists of questions and answers.

Here my datatypes, but i don`t know how to connect it with each other.

#include <string>

/* One test set */
class Testlist {

    struct node {
        string question;
        string answers[4];
        node *next;


    /* num - marker of the question or one of the answers */
    void Addquestion(string name, int num); 


class Test: public Testlist {
    /* maximum number of tests */
    static const int tablesize = 100;

    /* Member of the hash-table */
    struct item {
        string testname; /* Test name */
        Testlist *set; /* Set of questions and answers to them */
        Test *next;

    /* Hash table of tests */
    item *testtable[NHASH];

    unsigned int hash(string key);
    void AddItem(string name, int create);


How can i work with next pointer of singly linked list in this case? Please explain me how can i implement it correctly.

what's your interest