Create a visualization of a hash table containing at least 10 items using one of the hash table collision techniques covered in this section. Fully describe the image and how the items came to be in their given positions.

Try to make it as simple as you can. Please provide the answers with some examples as fast as you can.

Linux

What is the i-node , and what is the major information stored in each node?

What is the difference between moving (mv) a file and copying (cp) a file?

Create a C++ program that creates instances of a Struct using an Array (you can choose the number of instances to create). You can also use either user input or an initialization list to initialize 3 peoples names. Make sure that the values stored in each member are printed to the screen.

You are called in for a job interview at a local diner where you will wait tables for extra cash to help pay your way through college. As you enter the diner, you overhear the manager denying an application to a woman who is considered by society to be overweight. Construct a short impromptu talk that you would have with the manager with regard to this situation.

Lubricants, Inc., produces a special kind of grease that is widely used by race car drivers. The grease is produced in two processing departments—Refining and Blending. Raw materials are introduced at various points in the Refining Department.

The following incomplete Work in Process account is available for the Refining Department for March:

The March 1 work in process inventory in the Refining Department consists of the following elements: materials, $7,100; direct labor, $3,300; and overhead, $21,300.

Costs incurred during March in the Blending Department were: materials used, $46,000; direct labor, $17,300; and overhead cost applied to production, $98,000.

Required:

1. Prepare journal entries to record the costs incurred in both the Refining Department and Blending Department during March. Key your entries to the items (a) through (g) below.

1. Raw materials used in production.
2. Direct labor costs incurred.
3. Manufacturing overhead costs incurred for the entire factory, $696,000. (Credit Accounts Payable.)
4. Manufacturing overhead was applied to production using a predetermined overhead rate.
5. Units that were complete with respect to processing in the Refining Department were transferred to the Blending Department, $672,000.
6. Units that were complete with respect to processing in the Blending Department were transferred to Finished Goods, $750,000.
7. Completed units were sold on account, $1,340,000. The Cost of Goods Sold was $640,000.

2. Post the journal entries from (1) above to T-accounts. The following account balances existed at the beginning of March. (The beginning balance in the Refining Department’s Work in Process is given in the T-account shown above.)

This question need to be solved using java coading :-

I. Input

   All input data are from a file "in.dat". The file contains a
sequence of infix form expressions, one per line. The character '$' 
is an end mark. For example, the following file has four infix form 
expressions:

   1 + 2 * 3 ^ ! ( 4 == 5 ) $
   3 * ( 6 - 4 * 5 + 1) + 2 ^ 2 ^ 3 $
   77 > ( 2 - 1 ) + 80 / 4 $
   ! ( 2 + 3 * 4 >= 10 % 6 ) && 20 != 30 || 45 / 5 == 3 * 3 $

Each expression is a sequence of tokens (i.e., constant integers,
operators, and end mark) separated by spaces. There is no variable.


II. Output

   Output data and related information are sent to the screen.
Your program should do the following for each expression:

   (1) printing the expression before it is manipulated;
   (2) showing the converted postfix form expression;
   (3) showing the expression tree;
   (4) printing the fully parenthesized infix form expression;
   (5) reporting the value of the expression.


III. Operators

   The following operators are considered. They are listed in the
decreasing order of precedence.

   Token            Operator            Associativity

    !               logical not         right-to-left
    ^               exponentiation      right-to-left
    *  /  %         multiplicative      left-to-right
    +  -            additive            left-to-right
    <  <=  >  >=    relational          left-to-right
    ==  !=          equality            left-to-right
    &&              logical and         left-to-right
    ||              logical or          left-to-right


IV. Other Requirements

   Since a large amount of information are to be displayed on the
screen, it is mandatory for your program to provide users a prompting
message such as

          Press <Enter> to continue ...

after each expression is processed, so that users have the chance to
check the output of your program carefully.


V. Algorithm: Infix_to_postfix conversion

  Input:  An infix form expression E = t1 t2 t3 ... $,
          which is a sequence of tokens.
  Output: The postfix form expression of E.

  Algorithm: 
  {
    do {
      get the next token t;
      case (t) {
         operand: place t onto the output;
                  break;
        operator: while (stack s is not empty
                    && stacktop(s) is not a left parenthesis)
                    && precedence(stacktop(s)) >= precedence(t)
                       // assuming left-to-right associativity, 
                       // not for the exponentiation operator ^, 
                       // which has right-to-left associativity 
                  {
                        pop(x,s);
                        place x onto the output;
                  }
                  push(t,s);
                  break;
               (: push(t,s);
                  break;
               ): while (stacktop(s) is not a left parenthesis) {
                      pop(x,s);
                      place x onto the output;
                  }
                  pop(x,s);
                  break;
        end mark: while (stack s is not empty) {
                      pop(x,s);
                      place x onto the output;
                  }
                  place the end mark onto the output;
                  break;
      }
    } while (t is not the end mark);
  }

This below is "in.dat file"

12 * 23 <= ( ( ( 3456 ) ) +    ( 6789 ) ) $ 1
4 ^ 3 - ( 2 + 4 * 15 ) - ( 90 / 3 != 30 ) $ 2
! ( 222 < 111 ) + 2 * 3 ^ ( 29 - 3 * 9 ) > 18 && 1234 == 1234 $ 1
( 2 * ( 62 % 5 ) ) ^ ( ( 4 - 2 ) ) - 2 ^ 2 ^ 2 $ 0
( ( 9 / ( 5 - 2 ) + 2 ) * ( 2 ^ 2 * 2 ) - 79 ) || ! ( 65432 > 54321 ) $ 1
( ( 9999 >= 8888 ) + 2 ) * ( 4 / ( 999 - 997 ) ) - 2 ^ ( 5 - 3 ) $ 2

Develop a C++ class called PrimeNumberGenerator. An object of this class will generate successive prime numbers on request. Think of the object as being similar to the digital tasbeeh counter. It has a reset button which makes the counter return to 0. There is also a button to get the next prime number. On the tasbeeh, pressing this button increments the current value of the counter. In your object, pressing this button would generate the next prime number for display. You’ll implement the reset button as a member function reset() and the other button as a function getNextPrime(). When an object is first created and the getNextPrime() function is called, it will return the first prime number, i.e., 2. Upon subsequent calls to the getNextPrime() function, the subsequent prime numbers will be returned. Define any others functions such as constructor and attributes that you need. According to Wikipedia: “a prime number is a natural number greater than 1, that has no positive divisors other than 1 and itself.”

Prove that the following language is context-free: L = { ω#x | ω^R is a substring of x and x, w ∈ {0,1}* } where ω^R is ω reversed.

TRUE OR FALSE? In pipe flow, if the Reynolds number is very large, then the friction factor depends only on the non dimensional pipe roughness.

Using affinity chromatography, you have attempted to purify an enzyme as a fusion protein that was expressed in E. coli. SDS-PAGE analysis shows that the eluted sample contains the enzyme and it appears to be very pure.

Briefly describe, in general terms, a method you could use to determine the concentration of the enzyme in the eluted sample. Describe the advantages and disadvantages of your approach.

Conclusion on Caterpillar Inc overall.

Effects of vietnam war on people's health and lives

Make a program that calculates the total of a retail sale. The program should ask the user for the following: the retail price of the item being purchased and the sales tax rate. Once the information has been entered, the program should calculate and display the following: the sales tax for the purchase and the total sale.

Vitex, Inc. manufactures a popular consumer product and it has provided the following data excerpts from its standard cost system:

*Applied to Work in Process during the period.

The company's manufacturing overhead cost is applied to production on the basis of direct labor-hours. All of the materials purchased during the period were used in production. Work in process inventories are insignificant and can be ignored.

Required:

1. How many units were produced last period?

2. How many pounds of direct material were purchased and used in production?

3. What was the actual cost per pound of material? (Round your answer to 2 decimal places.)

4. How many actual direct labor-hours were worked during the period?

5. What was the actual rate paid per direct labor-hour? (Round your answer to 2 decimal places.)

6. How much actual variable manufacturing overhead cost was incurred during the period?