The operation of a photographic lightmeter.

Question

Want to see the full answer?

Answer 1

Question

Chapter 21, Problem 25QAP

To determine

To explain:

The operation of a photographic lightmeter.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

4 Part 1: get, put, del 4.2 User interface (main.c) The main function will contain the main loop of your program and should behave like this: 1. Create an empty dictionary 2. Print ">" on the standard output (this is important). 3. Read the command from the user; the first three characters are the command name, then a space, then the arguments, and a newline character \n. 4. If the command is unknown, exit. 5. If end-of-file was read (EOF), destroy the dictionary and exit. 6. Otherwise, execute the corresponding command and go back to 2. To read from the standard input, you will be using the stream reading functions from the standard library, with stream being stdin, a variable defined in : • int fgetc (FILE* stream): read one character of the given stream. This returns the constant EOF on end of file. • char* fgets (char* s, int size, FILE* stream): read in at most one less than size chars from stream and stores them into the buffer pointed to by or a newline. If a newline is read, it…

6.1.1 dict_apply This function has the (nontrivial) type: void dict_apply (const dict_t* dict, const dict_apply_fun_t fun, void* arg); For each pair key/value in dict, it will call the function fun with arguments (key, value, arg). This is a type of "for each" loop (or map), showing that C is well capable of using advanced programming concepts, albeit with a somewhat contrived syntax. The type dict_apply_fun_t is the interesting part here: typedef void (*dict_apply_fun_t) (const char* key, const char* val, void* arg); This defines a type dict_apply_fun_t as "pointer to a function that returns void and takes two arguments of type const char* and one of type void* (untyped pointer)". Indeed, functions have addresses (more on that in Ch. 7), so one can talk about pointers to functions. To call the function pointed at by fun, one can use a normal function-call syntax (fun (key, value, arg)) or dereference the pointer first ((*fun) (key, value, arg))-this is a matter of taste. In the…

7 Bonus Part For extra bonus point, you can implement a data structure that is more efficient than (double) linked lists. Linked lists have terrible performances: when searching for an element that is no in the dictionary you need to go through all pairs key/value. Tweaking your dict_put to ensure that the list is always sorted by keys does provide a speedup, but of only 30%, which is still much too slow. By sorted here, we mean according to the return value of strcmp(3). Indeed, this function does more than just checking whether two strings are equal: • If strcmp (a, b) 0, then a would appear after b in a real-life dictionary. You can score most bonus points with a simple binary search tree based on this order. The idea is to have a binary tree where each node stores a pair key/value. The nodes to the left of a given node contain keys that are smaller, while the nodes to the right contain keys that are greater (according to the order given by strcmp(3)). To search for a key, we start…