Log onto the Internet and use a search engine to find three Web sites that can be models for the new site. (At least one should sell sporting goods.) For each site you selected, list the URLs in your document. Tell why you chose them. Navigate to the three sites you choose and take notes about at least three things you like and don’t like about the sites.

Answer:

In Java:

import java.util.*;  

public class Main{

   public static void main(String[] args) {

       Map<String, String> students = new HashMap<>();

       students.put("STUD1", "Student 1 Name");

       students.put("STUD2", "Student 2 Name");

       students.put("STUD3", "Student 3 Name");

       students.put("STUD4", "Student 4 Name");

       for(Map.Entry m:students.entrySet()){  

           System.out.println(m.getKey()+" - "+m.getValue());    }  

}}

Explanation:

This creates the map named students

       Map<String, String> students = new HashMap<>();

The next four lines populates the map with the ID and name of the 4 students

       students.put("STUD1", "Student 1 Name");

       students.put("STUD2", "Student 2 Name");

       students.put("STUD3", "Student 3 Name");

       students.put("STUD4", "Student 4 Name");

This iterates through the map

       for(Map.Entry m:students.entrySet()){  

This prints the details of each student

           System.out.println(m.getKey()+" - "+m.getValue());    }  

Answer:

Following are the responses to these question:

Explanation:

The cache size is 2n words whenever the address bit number is n then So, because cache size is 216 words, its number of address bits required for that  cache is 16 because the recollection is relational 2, there is 2 type for each set. Its cache has 32 blocks, so overall sets are as follows:

[tex]\text{Total Number of sets raluired}= \frac{\text{Number of blocks}}{Associativity}[/tex]

                                               [tex]=\frac{32}{2}\\\\ =16\\\\= 2^4 \ sets[/tex]

The set bits required also are 4. Therefore.

Every other block has 8 words, 23 words, so the field of the word requires 3 bits.

For both the tag field, the remaining portion bits are essential. The bytes in the tag field are calculated as follows:

Bits number in the field tag =Address Bits Total number-Set bits number number-Number of bits of words

=16-4-3

= 9 bit

The number of bits inside the individual fields is therefore as follows:

Tag field: 8 bits Tag field

Fieldset: 4 bits

Field Word:3 bits

Answer:

Explanation:

I run an online e-commerce store and lately its been very difficult keeping track of customer detail, incoming orders, keyword generation etc. One solution that I thought about would be an application that controls all of that for me. In order to accomplish this I would first need to design and create a GUI that contains all of the necessary buttons and displays for the information. Then I would need to code a webscraper using Python to grab all of the data from e-commerce store as soon as it becomes available, organize it, and display it within the GUI.

Answer:

True

Explanation:

Both HLOOKUP and VLOOKUP are excel functions used for searching through tables for a specified lookup value to either get an exact or approximate match. The VLOOK and HLOOKUP functions have identical syntax which only differs with the HLOOKUP requiring the row index number to search through the rows while, VLOOKUP requires the column index number to search through the columns. Other than this difference, the other syntax values are the same.

VLOOKUP(lookup_value, table_array, col_index_num, [range_lookup])

HLOOKUP(lookup_value, table_array, row_index_num, [range_lookup])