Insert the names of 12 months in an AVL tree. Treat the month names as dictionary words, NOT as position of month. For instance, January as a month comes before February, but the word ‘February’ comes before ‘January’ in English dictionary. Show each step of insertion and rotation.

Match the terms in the hlookup syntax with their explanation. a. lookup value b. data table c. row index d. mode 1. name of the table that contains the value 2. specifies if an exact match must be found 3. value to be searched 4. name of the row that contains the value

You need a reliable network for about twenty-five computers that will be distributed across a large building. it is important that the network be relatively cheap. which topology should you use?

In deadlock avoidance using banker’s algorithm, what would be the consequence(s) of: (i) a process declaring its maximum need as maximum possible for each resource. in other words, if a resource a has 5 instances, then each process declares its maximum need as 5. (ii) a process declaring its minimum needs as maximum needs. for example, a process may need 2-5 instances of resource a. but it declares its maximum need as 2.