Q1/A/ Fill in the Blanks. (10 marks) 1- Web browsers store the addresses of recently visited sites on ----- - 2- For modeling flow capacities in transportation networks, 3- Huffman Coding Algorithm...

Extracted text: Q1/A/ Fill in the Blanks. (10 marks) 1- Web browsers store the addresses of recently visited sites on ----- - 2- For modeling flow capacities in transportation networks, 3- Huffman Coding Algorithm can be implemented using 4- A graph 5- A graph has no loops and no multiple edges is called----. 6- data structure. data structure is used. ------ data structure. --is called a labeled graph. - are more complicated data structures and are derived from primitive data structures. 7- Each data structure must have - - and 8- is a way to represent the amount of time needed by the program to run till its completion. 9- The maximum number of possible children for every node in the tree is called