This project is divided into two parts.Part 1. You will be implementing a dictionary structure (storing pairs key/value), and reading the user input to manipulate the structure. The commands implemented in that stage are put, get, and del. It will be important not to leak any memory in these functions.Part 2. You will add two more commands: clr, which clears the dictionary, and siz, which prints the size of the dictionary. Again, clr will have to make sure not to leak any memory. You will also implement a destructor for your dictionary object. The dict.c file that the problems need to be solved is in the image given // Create a dictionary.dict_t* dict_create ();// Free a dictionary.void dict_destroy (dict_t* dic);// Put an element in a dictionary. key is case sensitive, val is a string. If// the key already exists, its value is updated. If val is NULL, the pair is// deleted.voiddict_put (dict_t* dic, const char* key, const char* val);// Return the value associated with key, or NULL if none.char* dict_get (const dict_t* dic, const char* key);// Delete the pair associated with key.void dict_del (dict_t* dic, const char* key);// Return the size of the dict.size_t dict_size (const dict_t* dic);// Delete all elements in a dictionary.void dict_clear (dict_t* dic);// Apply fun to each pair key/val; arg is an extra argument passed to fun.void dict_apply (const dict_t* dic, const dict_apply_fun_t fun, void* arg);

In this question we have to implement a dictionary structure in C programming language that can…

Answered: This project is divided into two parts.…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Concept explainers

Question

This project is divided into two parts.

Part 1. You will be implementing a dictionary structure (storing pairs key/value), and reading the user input to manipulate the structure. The commands implemented in that stage are put, get, and del. It will be important not to leak any memory in these functions.
Part 2. You will add two more commands: clr, which clears the dictionary, and siz, which prints the size of the dictionary. Again, clr will have to make sure not to leak any memory. You will also implement a destructor for your dictionary object.

The dict.c file that the problems need to be solved is in the image given

// Create a dictionary.
dict_t* dict_create ();
// Free a dictionary.
void dict_destroy (dict_t* dic);
// Put an element in a dictionary. key is case sensitive, val is a string. If
// the key already exists, its value is updated. If val is NULL, the pair is
// deleted.
void
dict_put (dict_t* dic, const char* key, const char* val);
// Return the value associated with key, or NULL if none.
char* dict_get (const dict_t* dic, const char* key);
// Delete the pair associated with key.
void dict_del (dict_t* dic, const char* key);
// Return the size of the dict.
size_t dict_size (const dict_t* dic);
// Delete all elements in a dictionary.
void dict_clear (dict_t* dic);
// Apply fun to each pair key/val; arg is an extra argument passed to fun.
void dict_apply (const dict_t* dic, const dict_apply_fun_t fun, void* arg);

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 3 steps with 3 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions