When producing a special bulletproof glass, dots (defects) may occur in the glass. The average number of dots per square centimeter is 0.2 The number of dots per unit area is poisson distributed.

please show calculations

tasks:

a) Determine the expected number of dots per square centimeter.  Round your answer to 2 decimal places.

b) Determine the standard deviation of the number of dots per square centimeter. Round your answer to 2 decimal places.

c) What is the probability that there is a maximum of 1 dot (s) per square centimeter? Round your answer to 4 decimal places

d) What is the probability that there are exactly 2 dot (s) if there is at least 1 dot (s) on one square centimeter? Round your answer to 4 decimal places

e) What is the probability that there are a maximum of 4 dot (s) on 10 square centimeters?  Round your answer to 4 decimal places

f)  What is the probability that there are exactly 7 dots if there are at least 4 dots (10 square centimeters)?  Round your answer to 4 decimal places

An airport limousine can accommodate up to four passengers on any one trip. The company will accept a maximum of six reservations for a trip, and a passenger must have a reservation. From previous records, 35% of all those making reservations do not appear for the trip. Answer the following questions, assuming independence wherever appropriate. (Round your answers to three decimal places.)

(b) If six reservations are made, what is the expected number of available places when the limousine departs?
places

(c) Suppose the probability distribution of the number of reservations made is given in the accompanying table.

Let X denote the number of passengers on a randomly selected trip. Obtain the probability mass function of X.

Please Use your keyboard (Don't use handwriting)

Stat

(1)

An insurance company believes that people can be divided into two classes: those who are an accident prone and those who are not. The company’s statistics show that an accident-prone person will have an accident at some time within a fixed 1-year period with probability .4, whereas this probability decreases to .2 for a person who is not accident-prone.
(i) If we assume that 30 percent of the population is accident prone, what is the probability that a new policyholder will have an accident within a year of purchasing a policy?
(ii) Suppose that a new policyholder has an accident within a year of purchasing a policy. What is the probability that he or she is accident-prone?

(2)

Two boxes containing marbles are placed on a table. The boxes are labeled B1 and B2. Box B1 contains 7 green marbles and 4 white marbles. Box B2 contains 3 green marbles and 10 yellow marbles. The boxes are arranged so that the probability of selecting box B1 is 1/3 and the probability of selecting box B2 is 2/3 FATIMAH is blindfolded and asked to select 3 marbles. She will win a color TV if she selects a green marble.
(i) What is the probability that FATIMAH will win the TV (that is, she will select a green marble)?
(ii) If FATIMAH wins the color TV, what is the probability that the green marble was selected from the first box?

(3)

One-half percent of the population has CORONA Virus. There is a test to detect CORONA. A positive test result is supposed to mean that you have CORONA but the test is not perfect. For people with CORONA, the test misses the diagnosis 2% of the times. And for the people without CORONA, the test incorrectly tells 3% of them that they have CORONA.
(i) What is the probability that a person picked at random will test positive?
(ii) What is the probability that you have CORONA given that your test comes back positive?

(4)

A device is composed of two components, A and B, subject to random failures. The components are connected in parallel and, consequently, the device is down only if both components are down. The two components are not independent. We estimate that the probability of:
a failure of component A is equal to 0.2;
a failure of component B is equal to 0.8 if component A is down;
a failure of component B is equal to 0.4 if component A is active.
(a)

Calculate the probability of a failure
(i) of component A if component B is down
(ii) of exactly one component
(b)

In order to increase the reliability of the device, a third component, C, is added in such a way that components A, B, and C are connected in parallel. The probability that component C breaks down is equal to 0.2, independently of the state (up or down) of components A and B. Given that the device is active, what is the
probability that component C is down?

A email application is an instance of a client-server model of computer networking.
T/F

Which of the following command is used to list out process details in Unix system.
mkdir process_a
ls -;a
bg
ps -l -u $(whoami)

Which of the file is used to sink the output of a process to Null.
/dev/null
/dev/tty
/dev
/dev/empty

What does a pipe operator do?
performs an OR operation
takes input form a file and fees as input to other command
it takes output of a command and feeds as input to other command
it takes input of a command and feds as input to other command

Which of the following command removes all files with three characters file extension ,except that ends with ".opt"?

rm *.*
rm *[opt]
rm *.[o][p][t]
rm *.[!o][!p][!t]

A command ${command-name} is used as a substitution command in shell.
T/F

Zombie are the processes whose parents have died.
T/F

Select a set whose all processes are a daemon processes.
mkdir, inetd,con,mysql
sendmail,inetd,con,ps
sendmail,ls,con,mysql
sendmail,inetd,con,mysql

Which of the following command is used to get process id of a process?
kill pid
pidof processname
ls -la
pid processname

Which of the following system call is used by a parent process to create a child process?
exec()
listen()
wait()
fork()

Which of the following is the parent process for all other processes (in options)?
init
shell
mysqld
system process

Which of the following is used to probe a network connectivity of a host?
ssh
telnet
ping
dig

Which of the following command is used to open a firewall for a port 'n'?
sudo ufw allow n/tcp
sudo fuw allow tcp n/tcp
sudo netstat -tupln ufw n/tcp
sudo ufw allow tcp/n

Which of the following method is used to upload a file to a ftp server?
get
lcd
upload
put

Which of the following file contains the hostnames and associated IP addresses in Unix system?
/etc/hostname
/etc/conf.d
/etc/hostnames
/etc/hosts

Vertebrates often reside on land and give live birth. Which of the following groups of mammals do not align with one (or more) of these descriptions?

Which chemical removes calcium from bone?

Ellie needs a data structure that can handle the following operations: push, pop, contains, remove, where contains(Item x) answers whether a given item is in the data structure and remove(Item x) removes the given item from the data structure. How can this be implemented efficiently?

You are going to set up a small shopping system, where you are going to implement a "shopping bag" subject to the following specifications:

• Each item that will be placed in the bag needs three pieces of data included: a descriptive name, an item code (2 letters followed by two numbers), and price (in US dollars).
• You will implement items as a separate class, where these three properties are private, and there are mutators and accessors for all three properties, as well as default, conversion and copy constructors.
• You will use the linked list implementation of a bag, and you can find the bag's source code here and the demonstration class here. (go to https://home.adelphi.edu/~siegfried/cs273/assignments/html for the links).
• There are 5 operations that you can do:
  • You can add an item to the bag (you need to give it a descriptivename, item code and price
  • You can remove one item from the bag and show whether there are any others of that item in the bag.
  • You can remove all of a type of item from the bag.
  • You show that you have the item and there are x of that item in the bag.
  • You can show all the items in the bag.

Make sure your code is well documented. Use the methods that are available in the Bag class.

Source code for Assignment #

/**
   An interface that describes the operations of a bag of objects.
   @author Frank M. Carrano
   @author Timothy M. Henry
   @version 4.1
*/
public interface BagInterface<T>
{
        /** Gets the current number of entries in this bag.
                 @return  The integer number of entries currently in the bag. */
        public int getCurrentSize();
        
        /** Sees whether this bag is empty.
                 @return  True if the bag is empty, or false if not. */
        public boolean isEmpty();
        
        /** Adds a new entry to this bag.
            @param newEntry  The object to be added as a new entry.
            @return  True if the addition is successful, or false if not. */
        public boolean add(T newEntry);

        /** Removes one unspecified entry from this bag, if possible.
       @return  Either the removed entry, if the removal.
                was successful, or null. */
        public T remove();
   
        /** Removes one occurrence of a given entry from this bag.
       @param anEntry  The entry to be removed.
       @return  True if the removal was successful, or false if not. */
   public boolean remove(T anEntry);
        
        /** Removes all entries from this bag. */
        public void clear();
        
        /** Counts the number of times a given entry appears in this bag.
                 @param anEntry  The entry to be counted.
                 @return  The number of times anEntry appears in the bag. */
        public int getFrequencyOf(T anEntry);
        
        /** Tests whether this bag contains a given entry.
                 @param anEntry  The entry to locate.
                 @return  True if the bag contains anEntry, or false if not. */
        public boolean contains(T anEntry);
   
        /** Retrieves all entries that are in this bag.
                 @return  A newly allocated array of all the entries in the bag.
                Note: If the bag is empty, the returned array is empty. */
        public T[] toArray();
//      public <T> T[] toArray();  // Alternate
//      public Object[] toArray(); // Alternate

   /** Creates a new bag that combines the contents of this bag
       and anotherBag.
       @param anotherBag  The bag that is to be added.
       @return  A combined bag. */
   //   public BagInterface<T> union(BagInterface<T> anotherBag);
   
   /** Creates a new bag that contains those objects that occur
       in both this bag and anotherBag.
       @param anotherBag  The bag that is to be compared.
       @return  A combined bag. */
   //   public BagInterface<T> intersection(BagInterface<T> anotherBag);
   
   /** Creates a new bag of objects that would be left in this bag
       after removing those that also occur in anotherBag.
       @param anotherBag  The bag that is to be removed.
       @return  A combined bag. */
   //   public BagInterface<T> difference(BagInterface<T> anotherBag);
} // end BagInterface
Bag Class
public final class LinkedBag<T> implements BagInterface<T>
{
        private Node firstNode;       // Reference to first node
        private int numberOfEntries;

        public LinkedBag()
        {
                firstNode = null;
      numberOfEntries = 0;
        } // end default constructor

        /** Sees whether this bag is empty.
            @return  True if this bag is empty, or false if not. */
        public boolean isEmpty() 
        {
                return numberOfEntries == 0;
        } // end isEmpty

        /** Gets the number of entries currently in this bag.
            @return  The integer number of entries currently in this bag. */
        public int getCurrentSize() 
        {
                return numberOfEntries;
        } // end getCurrentSize

        /** Adds a new entry to this bag.
            @param newEntry  The object to be added as a new entry
            @return  True if the addition is successful, or false if not. */
        public boolean add(T newEntry)                // OutOfMemoryError possible
        {
      // Add to beginning of chain:
                Node newNode = new Node(newEntry);
                newNode.next = firstNode; // Make new node reference rest of chain
                                // (firstNode is null if chain is empty)        
      firstNode = newNode;      // New node is at beginning of chain
                numberOfEntries++;
      
                return true;
        } // end add

        /** Retrieves all entries that are in this bag.
            @return  A newly allocated array of all the entries in this bag. */
        public T[] toArray()
        {
      // The cast is safe because the new array contains null entries
      @SuppressWarnings("unchecked")
      T[] result = (T[])new Object[numberOfEntries]; // Unchecked cast

      int index = 0;
      Node currentNode = firstNode;
      while ((index < numberOfEntries) && (currentNode != null))
      {
         result[index] = currentNode.data;
         index++;
         currentNode = currentNode.next;
      } // end while
        
                return result;
        } // end toArray

        /** Counts the number of times a given entry appears in this bag.
                 @param anEntry  The entry to be counted.
                 @return  The number of times anEntry appears in this bag. */
        public int getFrequencyOf(T anEntry) 
        {
                int frequency = 0;

      int counter = 0;
      Node currentNode = firstNode;
      while ((counter < numberOfEntries) && (currentNode != null))
      {
         if (anEntry.equals(currentNode.data))
         {
            frequency++;
         } // end if
         
         counter++;
         currentNode = currentNode.next;
      } // end while

                return frequency;
        } // end getFrequencyOf

        /** Tests whether this bag contains a given entry.
                 @param anEntry  The entry to locate.
                 @return  True if the bag contains anEntry, or false otherwise. */
        public boolean contains(T anEntry)
        {
      boolean found = false;
      Node currentNode = firstNode;
      
      while (!found && (currentNode != null))
      {
         if (anEntry.equals(currentNode.data))
            found = true;
         else
            currentNode = currentNode.next;
      } // end while    
      
      return found;
   } // end contains
   
        // Locates a given entry within this bag.
        // Returns a reference to the node containing the entry, if located,
        // or null otherwise.
        private Node getReferenceTo(T anEntry)
        {
                boolean found = false;
                Node currentNode = firstNode;
                
                while (!found && (currentNode != null))
                {
                        if (anEntry.equals(currentNode.data))
                                found = true;
                        else
                                currentNode = currentNode.next;
                } // end while
     
                return currentNode;
        } // end getReferenceTo

   /** Removes all entries from this bag. */
        public void clear() 
        {
                while (!isEmpty()) 
         remove();
        } // end clear
        
        /** Removes one unspecified entry from this bag, if possible.
       @return  Either the removed entry, if the removal
                was successful, or null. */
        public T remove()
        {
                T result = null;
      if (firstNode != null)
      {
         result = firstNode.data; 
         firstNode = firstNode.next; // Remove first node from chain
         numberOfEntries--;
      } // end if

                return result;
        } // end remove
        
        /** Removes one occurrence of a given entry from this bag, if possible.
       @param anEntry  The entry to be removed.
       @return  True if the removal was successful, or false otherwise. */
   public boolean remove(T anEntry) 
        {
                boolean result = false;
      Node nodeN = getReferenceTo(anEntry);
      
      if (nodeN != null)
      {
         nodeN.data = firstNode.data; // Replace located entry with entry in first node
         
         firstNode = firstNode.next;  // Remove first node
         numberOfEntries--;
         
         result = true;
      } // end if
         
                return result;
        } // end remove

        private class Node 
        {
          private T    data; // Entry in bag
          private Node next; // Link to next node

                private Node(T dataPortion)
                {
                        this(dataPortion, null);        
                } // end constructor
                
                private Node(T dataPortion, Node nextNode)
                {
                        data = dataPortion;
                        next = nextNode;        
                } // end constructor
        } // end Node
} // end LinkedBag

Given the following chemical equations:

I. CH₄ ​​ + 2O₂ ​​ → CO₂ + 2H₂​​O (1.25 L of CH₄ with density = 0.656 g/L)

II. 6CO₂ + 6H₂​​O → C₆​​H₁₂​​O₆ (7.25 g of CO₂ ​​)

Which equation will have the highest number of carbon atoms produced based on the information given next to each chemical equation?

A. I

B. II

Sam worked for a major bank for nearly four decades. Though a number of co-workers were over 40, Sam was the oldest and most productive member of his department, earning the highest salary. When the bank engaged in a reduction in force (RIF), Sam was only one terminated from his department. If Sam sued for ADEA violations what would be the likely outcome?

You roll a six- sided die. Find the probability of each of the following scenarios
a. Rolling a 6 or a number greater than 3
b. Rolling a number less than 5 or an even number
c. Rolling a 2 or an odd number