Let ?V be the set of vectors in ?2R2 with the following definition of addition and scalar multiplication:
Addition: [?1?2]⊕[?1?2]=[0?2+?2][x1x2]⊕[y1y2]=[0x2+y2]
Scalar Multiplication: ?⊙[?1?2]=[0??2]α⊙[x1x2]=[0αx2]
Determine which of the Vector Space Axioms are satisfied.

A1. ?⊕?=?⊕?x⊕y=y⊕x for any ?x and ?y in ?V
? YES NO

A2. (?⊕?)⊕?=?⊕(?⊕?)(x⊕y)⊕z=x⊕(y⊕z) for any ?,?x,y and ?z in ?V
? YES NO

A3. There exists an element 00 in ?V such that ?⊕0=?x⊕0=x for each ?∈?x∈V
? YES NO

A4. For each ?∈?x∈V, there exists an element  −?−x in ?V such that ?⊕(−?)=0x⊕(−x)=0
? YES NO

A5.  ?⊙(?⊕?)=(?⊙?)⊕(?⊙?)α⊙(x⊕y)=(α⊙x)⊕(α⊙y) for each scalar ?α and any ?x and ?y ?V
? YES NO

A6. (?+?)⊙?=(?⊙?)⊕(?⊙?)(α+β)⊙x=(α⊙x)⊕(β⊙x) for any scalars ?α and  ?β and any ?∈?x∈V
? YES NO

A7. (??)⊙?=?⊙(?⊙?)(αβ)⊙x=α⊙(β⊙x) for any scalars ?α and  ?β and any ?∈?x∈V
? YES NO

A8. 1⊙?=?1⊙x=x for all ?∈?x∈V
? YES NO

I am having problems with :

If 6 is selected, then you will get an employee pay amount from the user. This will be a double. Only allow them to enter one pay amount and then display the main menu again.

AND:

if 2 is selected you will promt the user for a grade (double) from 0-100. Only allow them to enter one grade and then display the main menu again

The project:

Create a project called P03. Inside of P03 you’re going to have four classes: 1) EntrySystem.java...

(3 bookmarks)

Create a project called P03. Inside of P03 you’re going to have four classes:
1) EntrySystem.java (which will contain your main method)

2) Person.java which will be your super class will have the following properties:
first name (string)
last name (string)
id number (string)
phone (string)
street address (string)
city (string)
state (string)
zip (string)

3) Student.java will inherit from Person and will have the following additional properties:
major (string)
grades (Arraylist of doubles)
advisor (string)

Student will also have a method called displayStudent() which will display all of the students information as well as their GPA in a neatly formatted way

. 4) Employee.java will inherit from Person and will have the following additional properties:
department (string)
supervisor (string)
paychecks (ArrayList of doubles)

Employee will also have a method called displayEmployee() which will display all of the employees information as well as their pay average and pay total in a neatly formatted way. You can also add and use the HelperClass.java.
You'll create two interfaces:
PayrollInterface.java with the following methods:
AddCheckAmount(double check)
GetPayTotal()
GetPayAverage()

GradesInterface.java with the following methods:
AddNumericalGrade(double grade)
CalculateGPA()

you will use Student to create an ArrayList of Student Java Objects called students, and Employee to create an ArrayList of Employee Java Objects called employees.

In EntrySystem.java you’ll have a menu with the following options:
1) Add a Student
2) Add a Student Grade
3) View All Students
4) Clear all Students
5) Add an Employee
6) Add an Employee Pay Amount
7) View All Employees
8) Clear All Employees
9) Exit
If 1 is selected,you will prompt the user for each field of the Student class to enter. You will validate strings to make sure they are not empty. You will validate ints and doubles to make sure they are proper ints and doubles. You will then add the Student Object to an ArrayList called students, returning the user back to the menu. Feel free to use the Helper Class we've been working with.

HELP
If 2 is selected you will promt the user for a grade (double) from 0-100. Only allow them to enter one grade and then display the main menu again.

If 3 is selected, you will display the list of students in a neatly formatted way by looping through students and calling displayStudent() for each. If there are no students entered, then tell the user this.

If 4 is selected, you will clear the students ArrayList.

If 5 is selected, then you will prompt the user for each field to enter for the Employee class. You will validate strings to make sure they are not empty. You will validate doubles to make sure they are proper doubles.

HELP
If 6 is selected, then you will get an employee pay amount from the user. This will be a double. Only allow them to enter one pay amount and then display the main menu again.

If 7 is selected, you will display the list of employees in a neatly formatted way calling displayEmployee() for each. If there are no employees, then tell the user this.

If 8 is selected, you will clear the employees ArrayList.

When 9 is selected, you will exit the program.

HELP PLEASE

Below is a piece of an article which discusses one of thee many disputes which can come about when patients seek organ donation. it deals with a little girl named Sarah who desperately needed a double lung transplant but due to certain policies almost lost the opportunity to obtain it.

"Sarah’s family and the family of another cystic fibrosis patient at the same hospital challenged transplant policy that made children under 12 wait for pediatric lungs to become available or be offered lungs donated by adults only after adolescents and adults on the waiting list had been considered. They said pediatric lungs are rarely donated. The family challenged this policy and had Sarah placed on the adult donor list. Sarah’s aunt, Sharon Ruddock, said the donor lungs came in through normal channels as a result of being on the adult donor list. It was a direct result of the ruling that allowed her to be put on the adult list,” Ruddock said. “It was not pediatric lungs, she would have never gotten these lungs otherwise.” Before the ruling, Ruddock said, Sarah was “very close to the end. Maybe a week. Maybe two.”

You may read the full article at: http://www.nj.com/south/index.ssf/2013/06/philadelphia_girl_at_center_of.html

Students what do you think of policies such as the one above being in place which make children wait on another list separate from adults and adolescents giving them preference to organ donations?

A database schema consisting of three relations STUDENT, COURSE, and STAFF is created as follows:

CREATE TABLE STUDENT (STU_ID CHAR(4),

STUDENT_NAME CHAR(20),

ADDRESS CHAR(20),

BIRTHDATE DATE,

GENDER CHAR(6));

CREATE TABLE COURSE (COURSE_ID CHAR(6),

COURSE_TITLE CHAR(20),

STAFF_ID CHAR(3),

SECTION NUMBER(2));

CREATE TABLE STAFF (STAFF_ID CHAR(3),

STAFF_NAME CHAR(20),

GENDER CHAR(6),

DEPARTMENT CHAR(20),

BOSS_ID CHAR(3)

SALARY NUMBER(8,2));

Write down SQL statement for each query below:

1) Find out the information of staff members who are female and earn either below $5,000 or above $30,000. [5 marks] 2) List all staff members who are not in the Accounting nor the History department. [5 marks] 3) List all students whose name contains the substring "JONES". List the females before the males in chronological order (by birthdate). [6 marks] 4) List all the courses taught by Raymond J. JOHNSON. [6 marks] 5) Find the names of all staff members who earn more than their bosses. [8 marks] 6) List all staff members who are either in the same department as Amy Dancer or Jack Nelson. [8 marks] 7) Find the names of the staff members who make more money than every member of the Accounting department. [7 marks] 8) Find the average salary for each department with more than one staff member. [5 marks]

1(a) If ut − kuxx = f, vt − kvxx = g, f ≤ g, and u ≤ v at x = 0, x = l and t = 0, prove that u ≤ v for 0 ≤ x ≤ l, 0 ≤ t < ∞.

(b) If vt − vxx ≥ cos x for −π/2 ≤ x ≤ π/2, 0 < t < ∞, and if v(−π/2, t) ≥ 0, v(π/2, t) ≥ 0 and v(x, 0) ≥ cos x, use part (a) to show that v(x, t) ≥ (1 − e −t ) cos x.

This question is in reference to BFS and DFS for data structures and algorithms

Consider a graph algorithm with a growth function on V and E: f(V, E). How would you convert f(V,E) to f'(V) such that f(V,E)=O(g(n))=f(V)? (That is, convert a growth function of two variables to be of one variable in such a way that the Big-Oh bound for the one variable function will hold for the two variable function.) Explain the steps in creating f', and explain why your idea works.

Let G be a connected graph and let e be a cut edge in G. Let K be the subgraph of G defined by:

V(K) = V(G) and

E(K) = E(G) - {e}

Prove that K has exactly two connected components. First prove that e cannot be a loop. Thus the endpoint set of e is of the form {v,w}, where v ≠ w. If ṽ∈V(K), prove that either there is a path in K from v to ṽ, or there is a path in K from w to ṽ

1. Design, Develop and Implement the following operations on Singly Linked List (SLL) with a single field data

a.   Create a SLL for N Data by using front insertion.

b.   Display the status of SLL and count the number of nodes in it

c.   Perform Insertion and Deletion at End of SLL

d.   Perform Insertion at the third position.

e.    Delete the element at the Front of SLL

f.     Perform Deletion at second position of SLL

g.     Display the content.

2. Design, Develop and Implement a menu driven Program in Java for the following operations on Singly

Linked List (SLL) of Student Data with the fields: USN, Name, Branch, Sem, PhNo

a.   Create a SLL of N Students Data by using front insertion.

b.   Display the status of SLL and count the number of nodes in it

c.   Perform Insertion and Deletion at End of SLL

d.   Perform Insertion and Deletion at Front of SLL

e.     Display the content.

3. Design, Develop and Implement a Singly Linked List (SLL) with a single string field name using the class Linked List

1. Create a SLL for N Data by using front insertion
2. Insert an element at position first, 3 and last.
3. Delete an element from first, 3 and last.
4. Display the content

4. Design, Develop and Implement a Circular Linked List (CLL) with a single field data
   1. Create a CLL for N Data by using front insertion
   2. Display the content.

5. Design, Develop and Implement a Doubly Linked List (DLL) with a single field data

a.    Create a DLL for N Data by using front insertion.

b.   Perform Insertion and Deletion at End of DLL

d.   Perform Insertion at the third position.

e.     Delete the element in the Front of SLL

f.     Perform Deletion at second position of SLL

g.     Display the content.

Java Language

Add a recursive method to the program shown in the previous section that states
how many nodes does the stack have.

Code:

class Stack {

protected Node top;

Stack() {

top = null; }

boolean isEmpty() {

return( top == null); }

void push(int v) {

Node tempPointer;

tempPointer = new Node(v);

tempPointer.nextNode = top;

top = tempPointer; }

int pop() {

int tempValue;

tempValue = top.value;

top = top.nextNode;

return tempValue; }

void printStack() {

Node aPointer = top;

String tempString = "";

while (aPointer != null) {

tempString = tempString + aPointer.value + "\n";

aPointer = aPointer.nextNode; }

System.out.println(tempString); }

boolean hasValue(int v) {

if (top.value == v) {

return true; }

else {

return hasValueSubList(top,v);

}

}

boolean hasValueSubList(Node ptr, int v) {

if (ptr.nextNode == null) {

return false; }

else if (ptr.nextNode.value == v) {

return true; }

else {

return hasValueSubList(ptr.nextNode,v);

}

}

}

class Node {

int value;

Node nextNode;

Node(int v, Node n) {

value = v;

nextNode = n;

}

Node (int v) {

this(v,null);

}

}

public class StackWithLinkedList2{

public static void main(String[] args){

int popValue;

Stack myStack = new Stack();

myStack.push(5);

myStack.push(7);

myStack.push(9);

System.out.println(myStack.hasValue(11));

}

}

System.out.println(myStack.hasValue(11));

}

}

Java Language

Add a recursive method to the program shown in the previous section that allows remove the last node from the stack.

Code:

class Stack {

protected Node top;

Stack() {

top = null; }

boolean isEmpty() {

return( top == null); }

void push(int v) {

Node tempPointer;

tempPointer = new Node(v);

tempPointer.nextNode = top;

top = tempPointer; }

int pop() {

int tempValue;

tempValue = top.value;

top = top.nextNode;

return tempValue; }

void printStack() {

Node aPointer = top;

String tempString = "";

while (aPointer != null) {

tempString = tempString + aPointer.value + "\n";

aPointer = aPointer.nextNode; }

System.out.println(tempString); }

boolean hasValue(int v) {

if (top.value == v) {

return true; }

else {

return hasValueSubList(top,v);

}

}

boolean hasValueSubList(Node ptr, int v) {

if (ptr.nextNode == null) {

return false; }

else if (ptr.nextNode.value == v) {

return true; }

else {

return hasValueSubList(ptr.nextNode,v);

}

}

}

class Node {

int value;

Node nextNode;

Node(int v, Node n) {

value = v;

nextNode = n;

}

Node (int v) {

this(v,null);

}

}

public class StackWithLinkedList2{

public static void main(String[] args){

int popValue;

Stack myStack = new Stack();

myStack.push(5);

myStack.push(7);

myStack.push(9);

System.out.println(myStack.hasValue(11));

}

}

System.out.println(myStack.hasValue(11)); } }

System.out.println(myStack.hasValue(11)); } } System.out.println(myStack.hasValue(11)); } }