During the classic period the court lifted the veil on a number of occasions - from the list below select the correct answers (you may choose more than one answer)

Group of answer choices

When groups of companies should be viewed as one single entity. (DHN Food Distributors)

Defendant set up a company to solicit customers he was prohibited from soliciting due to previous employment contract (Gilford Motor Co v Horne)

Setting up a company to avoid an estate contract (Jones v Lipman);

Setting up a company to force compulsory purchase of minority shareholdings (Re Bugle Press).

Dealing with the enemy (Daimler v Continential Tyre);

Lord Denning argued in DHN Food Distributors v Tower Hamlets that groups of companies should be viewed as one single entity.

Group of answer choices

True

False

The key question in the case of Adams v Cape Industries was ?

Group of answer choices

It is possible for a company to be held as a mere facade even though it was not originally set up as a sham.

The company was used for some impropriety unconnected to the corporate form.

If there was an existence of an agent-principal relationship.

Whether Cape, the parent company, had a presence in the US through it subsidiaries.

The three situations where the case of Adams v Cape limited veil lifting to are :-

1. Where the interpretation of a statute or document shows that the group of companies is to be treated as one;
2. Where a company is being used as a sham or mere facade;
3. Where there is no agent-principal relationship

Exercise 1: Write a C program that does the following tasks:

a. Declare a structure called StudRec with four components:

an int containing the StuId,

a string containing the StudName,

a string containing the MajorName,

b. Define typedef List to be a synonym for the type struct StudRec.

c. Declare a global variable array StudST[] of List.

d. Declare a global variable Ptr to be a pointer to List.

e. Write a C function (return pointer to List) that does the following. It accepts the StudST array and an N integer denoting the actual size of the array, read and fill N student details using structure, Dynamic Memory Allocation from the keyboard and return a pointer of List.

f. Declare a structure called Major with two components:

a string containing the MajorName,

an int NumSt containing the number of students in the Major,

g. Declare a global variable array MajorST[] of structure Major.

h. Write a C function that does the following. It accepts the MajorST array with 4 integer denoting the actual size of the array and update the array with 4 MajorName read from the keyboard and assign 0 to NumSt.

i. Write a C function that does the following. It accepts, as arguments, the StudST array (e) with N integer denoting the actual size of the array and the MajorST array (h). Using StudST, the function calculates the number of students in each major and updates the MajorST array by these numbers for each MajorName.

j. Compile and Run the previous statements in a main C file.

San Diego community college students

All San Diego college students

Adults in San Diego

Starbucks customers

Your choice!

Choose a population that you would plan to sample or survey. Your discussion board thread title should be "Sampling from ______". Some ideas for populations to take a sample from:

Mesa students

San Diego community college students

All San Diego college students

Adults in San Diego

Starbucks customers

Your choice!

Describe an perfect scenario sampling method: Describe in your own words one of the sampling methods learned in class and how it could be applied to your population - in this case, you can assume you will have access to things like a list of everyone living in San Diego.

Describe a realistic sampling method. Being that you don't actually have a list of all San Diego residents (or similar for your population), how would YOU go about trying to get a representative sample? No need to use any fancy terms or definitions here, just describe how you'd collect data from 100 people for your sample.

What are some limitations that will arise with your realistic scenario? Are there groups that might be left out?

Answer all of this in Approximately 150-200 words in length and well-written.

CAN SOMEONE PLEASE DO THIS QUESTION FOR ME.

You are given three files Main.Java, Student.Java, LinkedList.java. Student is completed for you and is only used to test the LinkedList with an object (we will pass in Student for the generic parameter of the list). Your mission is to implement LinkedList.java, but I highly recommend you do this in a piecewise fashion as outlined in the //TODO s in Main.java (This assignment is easy if you do it piecewise and traumatic if you don't). You can go down this description of the TODO's for a few additional hints. You can try to pass the test cases as you go through (they should be in order I think but sometimes the order gets scrambled when I create the test cases and there is no easy way to unscramble, so just be aware of that). Each test case includes the code of how I made it so you can try to do it in main if you are not passing a test case for some reason for further investigation For this assignment you can assume that each student in the list is unique (for all of the tests I do not add any duplicate students, we will deal with this case later, it's slightly more code but nothing too crazy)

MAIN.JAVA

import java.util.*;

class Main {

  public static void main(String[] args)

  {

    //TODO 1: Implement the private inner class Node in LinkedList

    //TODO 2: Here in Main,  Make a new LinkedList with the generic parameter of Student. Note that the constuctor in LinkedList is implemented for you. What does the constructor initialize the list to?

LinkedList<Student> myList= new LinkedList<Student>();

  //TODO 3: Define 5 Students, remember to invoke the constructor using the new command, make them all have different ID's

  //TODO 4: Implement addToFront and getLength in Linked List Add some of the students to the list using addToFront

  //print out the length run your program and make sure it equals the number of students before continuing

//TODO 5: Implement toString in Node and LinkedList. The Node toString should just print out the data field of the node. Note that toString is implemented in Student, so this should be easy-- creating a string out of the data should invoke the toString in Student (i.e. if I have a student instance named A saying String x= ""+A; will invoke A's toString. Alternatively you can explicitly call A.toString() from within Node (but understand why ""+A will work). Then implement toString in LinkedList. If one prints out a list with two students (Eugenio and Daniqua), with Danica added to the front first and Eugenio added second our list should look as follows head->name: Eugenio id: 700555555->name: Daniqua id: 700444444->null   note the spaces. Print out your list to ensure it works. //TODO 6: Implement addToEnd in LinkedList and then add another Student, but this time to the end, and print out the length (should be one more) and the list to ensure it added the student to the end.

//TODO 7: Implement removeFromFront in LinkedList and print out what is returned, should be the first student in the list. Then print out the length (should be one less than what you had previously). Finally print out the length to ensure it is correct using getLength

//TODO 8: Implement removeFromEnd in LinkedList and print out what is returned. it should be the student who was at the end of the list, furthermore print out the list and the length to ensure it has the right students in it. Note that this function is a bit more involved, you may need to use 3 references as you iterate through the list (think about why?). Make sure your algorithm will work with a list that is of length 1, length 2, length 3, and some big length like 5

    //TODO 9: Implement removeTarget in LinkedList. This should rely on the the Type T's equals. Remember our T, though it's generic, is guaranteed to have this function because it's guaranteed to be an object. In Student's case two students are equal if their student ID's are equal. Test removeTarget with a student in the list to ensure that removeTarget returns the right value when you test (and removes the actual student from the list when appropriate).

    ///TODO 10: Implement reverseList in LinkedList.  You need to reverse the list in place, i.e., with out allocating data into array.

  }

}

LINKEDLIST.JAVA

public class LinkedList <T>

{ //MUST IMPLEMENT ALL FUNCTIONS

  Node head;

     public LinkedList()

  {

    head=null;

   }

   public int getLength()

  {

    return 0;

  }

public void addToFront(T toAdd)

  {   

  }

   public void addToEnd(T toAdd)

  {

{

    public T removeFromFront()

  {

    return null;

     }

    public T removeFromEnd()

  {

    return null;

      }

public boolean removeTarget(T toRemove)

  {

    return true;

  }

public void reverseList(){

      }

public String toString()

  {

    return "";

  }

private class Node

  {

    private T data;

    private Node next;

    Node(T dataPassed, Node nextPassed)

    {

      data=dataPassed;

      next=nextPassed;

    }

public void setdata(T dataPassed)

    {

     data=dataPassed;

    }

    public T getdata()

    {

      return data;

    }

    public Node getnext()

    {

     return next;

    }

    public void setnext(Node passed)

    {

      next=passed;

    }

    public String toString()

    {

      return (""+data);

    }

  }

}

STUDENT.JAVA

public final class Student

{

private int schoolID;

   private String name;

public Student(String namePassed,int schoolIDPassed)

      {

      schoolID= schoolIDPassed;

                 name= namePassed;

            }

public int getSchoolID()

            {

                        return schoolID;

            }

public void setSchoolID(int schoolIDPassed)

            {

                        schoolID=schoolIDPassed;

            }

public String getName()

            {

                        return name;

            }

            public void setName(String namePassed)

            {

                        name=namePassed;

            }

            public boolean equals(Object toCompare)

            {

              Student temp= (Student) toCompare;

                        return(temp.getSchoolID()==schoolID);

            }

            public String toString()

            {

              String toReturn="name: "+name+" id: "+schoolID;

              return (toReturn);

            }

}

Create a description of a university course registration system. You should include features for students, faculty, and administrators. For example, students need to use the system to add and drop courses that they attend, faculty needs to add and drop courses that they offer and the Registrar needs to allocate and de-allocate resources for courses that are added or dropped. Each type of user also has to satisfy some constraints, such as how many courses they take (students), teach (faculty) or offer (Registrar) in a given term. You define "reasonable" constraints for each type of user (stakeholder). Your submission should follow following format: Section 1 -- Description of the university course registration system (1 paragraph) Section 2 -- Key Features that students need and constraints on students this system may consider Section 3 -- Key Features that faculty need and constraints on faculty this system may consider Section 4 -- Key Features that Registrars / Administrators need and constraints on registrar / administrators this system may consider For each user class, you can list 3 features and 3 constraints.

1) a. Write down a C++ program which will create a list (simple linear linked list) of nodes. Each node consists of two fields. The first field is a pointer to a structure that contains a student id (integer) and a gradepoint average (float). The second field is a link. The data are to be read from a text file. Your program should read a file of 10 students (with student id and grade point average) and test the function you wrote (by printing student’s information on screen).

b. Write the psudecode for the program

Write down a C program which will create a list (simple linear linked list) of nodes. Each node consists of two fields. The first field is a pointer to a structure that contains a student id (integer) and a grade-point average (float). The second field is a link. The data are to be read from a text file. Your program should read a file of 10 students (with student id and grade point average) and test the function you wrote (by printing student’s information on screen). (Please comment the codes)

Sample Selection Methods. You are interested in selecting a sample of 100 students on your campus to participate in a survey of the effects of coffee on students’ ability to comprehend material from a faculty member’s lecture. You have decided to limit your selection to business majors and have obtained a comprehensive list (ranked in descending order based on grade point average) of all business majors. This list is 22 pages long and contains the names of 2,200 business majors. Required: a. When selecting your sample, what precautions should you take to ensure a representative sample? b. Briefly describe how you might select the sample using each of the following methods: (1) unrestricted random selection, (2) systematic random selection, (3) haphazard selection, and (4) block selection. c. What are some of the advantages and disadvantages of using the selection methods described in part (b)?