Describe the status of the N, Z, C, and V flags of the CPSR after each of the following:
(a) ldr r1, =0xffffffff
ldr r2, =0x00000001
add r0, r1, r2
(b) ldr r1, =0xffffffff
ldr r2, =0x00000001
cmn r1, r2
(c) ldr r1, =0xffffffff
ldr r2, =0x00000001
adds r0, r1, r2
(d) ldr r1, =0xffffffff
ldr r2, =0x00000001
addeq r0, r1, r2
(e) ldr r1, =0x7fffffff
ldr r2, =0x7fffffff
adds r0, r1, r2

Issue # 2 - A V-belt from a 10 in. Diameter spindle pulley that rotates at 1800 rpm, to a 36 in. Diameter flat pulley. The wheelbase is 40 "and the throat angle is 40o. The friction coefficient between the belt and the grooved pulley is 0.2 and with the flat pulley it is also 0.2. The cross section of the straps is a trapezoid with parallel sides of 1.5 "and 0.75", with a height between them of 1 ". The weight of this belt is 0.04 lbf / in3, and the maximum allowable tension on each belt is 200 lbf. Determine: a) How many straps are needed. b) The Torque applied in the transmission, c) The Transmitted power. Note: Consider locating the center of gravity of the belt cross section in order to correct the actual pulley diameter as the band on the splined pulley is slightly outward.)

write the code based on this pseudocode

//Create Class any name (ex: aQ)
//Declaring private integer array empty one ex: name arrQ[]
//Declare private integers front, rear, size and len (example, but you call any other names)

//Write constructors
Called public and same name of the class (parameters integer n)
Inside Declare where:
size is equal to n
len is equal to zero
arrQ is equal to new integer[size]
front is equal minus 1
rear is equal minus 1

//Declare function to check if Queue is empty
In this public you should declare boolean (any name you want)
Which return front is equal minus 1

//Declare function to check if queue is full
Called public boolean (any name you want)
which
return front is equal to zero and rear is equal to size minus 1

// Declare function to get the size of the queue
Should be public integer (any name to get size)
which
return len

//Declare function to check the front element of the queue

Should be public integer peek
then
condition
if (call method that you created above to check if is empty)
//then you can write:
throw new NoSuchElementException("Underflow Exception");
then
return name of your array that you declared in first line [front]


//Declare function to insert an element to the queue
Create public void insert or enque with parameters integer i
then condition
if rear is equal minus 1
front is equal to zero
rear is equal to zero
name of array[rear] is equal to i

//else if rear plus 1 is greater equal to size
//you can write:
throw new IndexOutOfBoundsException("Overflow Exception");
else if rear plus 1 is less then size
name of array[increment rear] is equal to i
increment len

//Declare function to remove front element from the queue
Create public integer remove or deque
then condition
if to call method that you created above to check if is empty
//then you can write:
throw new IndexOutOfBoundsException("Overflow Exception");

// condition else
decrement len
declare variable integer (any name, ex: element) which is equal to name of array[front]
condition if front is equal to rear
front equal minus 1
rear equal minus 1
condition else
increment front
and
return element
//Declare function to display the queue
Should be public void display
then
sys.out.print Queue:
condition if len is equal to zero
sys.out.print no values



//then just:
return
then create for loop where i equal to front and i is less equal rear and increment i
then:
sys.out.print name of array[i] + " "


//Scanner scan = new Scanner(System.in);

System.out.println("Enter the Size of Queue ");
int n = scan.nextInt();
/* creating object of class aQ */
aQ q = new aQ(n);

char ch;
do{
System.out.println("\n Queue Menu");
System.out.println("1. Insert Value”);
System.out.println("2. Remove Value”);
System.out.println("3. Peek");
System.out.println("4. Check if is empty");
System.out.println("5. Check if is full");
System.out.println("6. Check the size of Queue”);
int choice = scan.nextInt();
switch (choice)

for java

for java. create code from this pseudo

step 1. reate Class any name (ex: aQ)

step 2. Declaring private integer array empty one ex: name arrQ

step 3. Declare private integers front, rear, size and len (example, but you call any other names)

step 4Write constructors
   Called public and same name of the class (parameters integer n)
   Inside Declare where:
   size is equal to n
   len is equal to zero
   arrQ is equal to new integer[size]
   front is equal minus 1
   rear is equal minus 1
  
step 5. Declare function to check if Queue is empty
   In this public you should declare boolean (any name you want)
   Which return front is equal minus 1
  
step 6. Declare function to check if queue is full
   Called public boolean (any name you want)
   which
   return front is equal to zero and rear is equal to size minus 1
  
step 7. Declare function to get the size of the queue
   Should be public integer (any name to get size)
   which
   return len
  
step 8. Declare function to check the front element of the queue
  
   Should be public integer peek
   then
   condition
   if (call method that you created above to check if is empty)
   //then you can write:
   throw new NoSuchElementException("Underflow Exception");
   then
   return name of your array that you declared in first line [front]
  

step 9. Declare function to insert an element to the queue
Create public void insert or enque with parameters integer i
then condition
if rear is equal minus 1
front is equal to zero
rear is equal to zero
name of array[rear] is equal to i

step 10. else if rear plus 1 is greater equal to size
you can write:
throw new IndexOutOfBoundsException("Overflow Exception");
else if rear plus 1 is less then size
name of array[increment rear] is equal to i
increment len

step 11. Declare function to remove front element from the queue
    Create public integer remove or deque
   then condition
   if to call method that you created above to check if is empty
   then you can write:
   throw new IndexOutOfBoundsException("Overflow Exception");
  
step 12. condition else
    decrement len
    declare variable integer (any name, ex: element) which is equal to name of         array[front]
    condition if front is equal to rear
    front equal minus 1
    rear equal minus 1
    condition else
    increment front
    and
    return element

step 13. Declare function to display the queue
Should be public void display
then
sys.out.print Queue:
condition if len is equal to zero
sys.out.print no values



step 14. then just:
return
then create for loop where i equal to front and i is less equal rear and increment i
then:
sys.out.print name of array[i] + " "


step 15. Scanner scan = new Scanner(System.in);

System.out.println("Enter the Size of Queue ");
            int n = scan.nextInt();
            /* creating object of class aQ */
            aQ q = new aQ(n);       
                   
            char ch;
            do{
                System.out.println("\n Queue Menu");
                System.out.println("1. Insert Value”);
                System.out.println("2. Remove Value”);
                System.out.println("3. Peek");
                System.out.println("4. Check if is empty");
                System.out.println("5. Check if is full");
                System.out.println("6. Check the size of Queue”);
                int choice = scan.nextInt();
                switch (choice)

Having Questions with my Java program.

We consider a school is the user of this application. A courseApp personnel can use the application do complete the following tasks,

1. Add courses. The courseApp can create courses, i.e., a user can add more than one courses for the courseApp in the application.

2. Add students. The courseApp can enroll students, i.e., a user can add a list of students for the courseApp in the application.

3. Register classes. A user can act as a student (e.g., select a student) and enroll in a list of courses not exceeding 18 credit hours in total.

4. Add instructors. The courseApp can hire instructors, i.e., a user can add instructors in the application.

5. Assign instructors to courses. A course can have one to three instructors who teach or co-teach the course. A user can assign instructors to a course.

6. Display students. The application can display the student list. 7. Display course information. The application can display the course information including minimally course name, credit hours, instructors, and the enrollment of the course.

This is my code for now and I don't know how to add instructors into the program:

===========

CourseApp.java

import java.util.Scanner;
import java.util.ArrayList;

public class CourseApp{

public static void main(String[] args){
//vars
ArrayList<Student> studentList = new ArrayList();
ArrayList<Instructor> instructorList = new ArrayList();
ArrayList<Course> courseList = new arrayList();

System.out.println("Add courses");
addCourses(courseList);
System.out.println("Add students");
addStudents(studentList);
System.out.println("Add instructors");
addInstructors(instructorList);
System.out.println("register for courses");
registerClasses(courseList,studentList);
System.out.println("\nShowing all student data");
for(Student s : student) {
System.out.println(s);
System.out.println("====================");
}
System.out.println("Showing all course details:");
for(Courses c : subjects) {
System.out.println(c);
System.out.println("====================");
}
}

//methods
//adds a course to the courseList
void addCourse(Scanner sc){ //you can change this parameter if you'd like
Scanner sc = new Scanner(System.in);
System.out.println("Enter the number of course: ");
int num = sc.nextInt();
sc.nextLine();
System.out.println("Enter course name and credit hours:");
for(int i=0; i<num;i++) {
String line = sc.nextLine();
String[] data = line.split(" ");
String name = data[0];
double hours = Double.parseDouble(data[1]);
classC.add(new Courses(name, hours));
}
}

//adds a student to the total student roster (studentList)
void addStudent(Scanner sc){ //you can change this paramter if you'd like, as well
Scanner sc = new Scanner(System.in);
System.out.println("Enter the number of student: ");
int num = sc.nextInt();sc.nextLine();
System.out.println("Enter name and id:");
for(int i=0; i<num;i++){
String line = sc.nextLine();
String[] data = line.split(" ");
String name = data[0].trim();
int id = Integer.parseInt(data[1]);
classS.add(new Student(name,id));

}
}

//adds an instructor to the total instructors roster (instructorList)
void addInstructor(Scanner sc){ //you can change this paramter if you'd like, as well

}

//adds a student in the student roster to a course
void registerStudentToCourse(Student student, Course course){
Scanner sc = new Scanner(System.in);
double hrs = 0.0;
ArrayList<Courses> temp = new ArrayList<>();
System.out.println("Enter the student's name: ");
String name = sc.nextLine().trim();
Student p = findStudent( s,name);

if(p!=null) {
System.out.println("Enter number of courses you want to add student: ");
int count = sc.nextInt();
sc.nextLine();
System.out.println("Enter course names: ");
ArrayList<Courses> t = studentOptedCourses(c,count);
p.setRegCourses(t);
}
else {
System.out.println("No student named"+name);
}
}

//attempts to set an instructor in the instructor roster to a course
void setInstructorToCourse(Instructor instructor, Course course){

}

//prints out the names and ID numbers of all the students in the student roster
void listAllStudent(){
for(Student s : student) {
if(s.getStudentName().equals(name)) {
return s;
}
}
return null;
}

//prints out the names of all of the hired instructors in the instructor roster
void listAllInstructors(){

}

//prints out the course name, its credit hours, the names of the students
//enrolled in the input course, and the names of the instructors enrolled
//in the input course.
String getCourseInfo(Course course){
for(Courses c: classC) {
if(c.getCourseName().equals(cname)) {
return c;
}
}
return null;
}
}

=================

Course.java

import java.util.ArrayList;
public class Course{
//vars
String name;
int creditHours;
ArrayList<Student> studentList = new ArrayList();
//The size of the Instructor array is set to three because there can only be a max of 3 instructors per course
Instructor[] instructor = new Instructor[3];
  
Courses(String name, double hrs) {
this.courseName = name;
this.creditHours = hrs;
}
Courses(String name, double hrs, ArrayList<String> teachers) { //what if more than one prof
this(name, hrs);
instructors = new ArrayList<>(teachers);
}
//constructor
public Course(String inputName, int creditHours){
}
//methods
//returns the name of the course
public String getName(){
}
//returns the value of addCreditHours
public int getCreditHours(){
}
//returns a list of students in this form (not set in stone): Adam Sandler, Jacob Righdon, Stephen Greene, and Jacob Nate.
//I wasn't too sure about how I would do this so, if you want to change it, feel free to do so
public String getStudents(){
}
//same as the getStudents class. Feel free to change this
public String getInstructors(){
}
//adds a student to studentList. Should this also add a student's ID to another linked list in this class, in the same index location?
void addStudent(Student student){
}
//adds an instructor to the instructor array. Returns true if there is space for a new instructor, and returns false if not.
boolean addInstructor(Instructor instructor){
}
//the overridden equals method
public boolean equals(Object object){
}
//the overriden hashCode method
public int hashCode(){
}
}

==============

Student.java

public class Student{
//vars
String name;
String studentID;
//totalCreditHours is set to 0 because it can only be added to as of now
int totalCreditHours = 0;
//constructor
public Student(String inputName, int studentID){
}

//methods
//returns the value of the name variable
public String getName(){
}

//returns the value of the studentID variable
public int getStudentID(){
}

//returns the value of the totalCreditHours variable
public int getTotalCreditHours(){
}
//if totalCreditHours will not be greater than 18 if the inputCreditHours was added to totalCreditHours,
//then return true and add inputCreditHours to totalCreditHours. Otherwise, do not add to totalCreditHours, and return false.
public boolean addCreditHours(int inputCreditHours){
}
//the overridden equals method
public boolean equals(Object object){
}
//the overriden hashCode method
public int hashCode(){
}
}

===============

Instructor.java

public class Instructor{
//vars
String name;
//constructor
public Instructor(String name){
}
//methods
//returns the value of name
public String getName(){
}
//the overridden equals method
public boolean equals(Object object){
}
//the overriden hashCode method
public int hashCode(){
}
}

Returns earned over a given time period are called realized returns. Historical data on realized returns is often used to estimate future results. Analysts across companies use realized stock returns to estimate the risk of a stock.

Consider the case of Celestial Crane Cosmetics Inc. (CCC):

Five years of realized returns for CCC are given in the following table. Remember:

Given the preceding data, the average realized return on CCC’s stock is ___ .

The preceding data series represents   of CCC’s historical returns. Based on this conclusion, the standard deviation of CCC’s historical returns is___ .

If investors expect the average realized return from 2012 to 2016 on CCC’s stock to continue into the future, its coefficient of variation (CV) will be ___ .

Concord Inc. reported the following pretax income (loss) and related tax rates during the years 2013–2019.

Pretax financial income (loss) and taxable income (loss) were the same for all years since Concord began business. The tax rates from 2016–2019 were enacted in 2016.

Prepare the journal entries for the years 2017–2019 to record income taxes payable (refundable), income tax expense (benefit), and the tax effects of the loss carryback and carryforward. Assume that Concord elects the carryback provision where possible and expects to realize the benefits of any loss carryforward in the year that immediately follows the loss year.

Prepare the portion of the income statement, starting with “Operating loss before income taxes,” for 2017.

Prepare the portion of the income statement, starting with “Income before income taxes,” for 2018.

On January 1, 2015, Charmin Manufacturing Company purchased a machine for $220,000. The company expects to use the machine a total of 80,000 hours over the next 10 years. The estimated sales price of the machine at the end of 10 years is $10,000. The company used the machine 8,000 hours in 2015 and 12,000 in 2016.

Requirements:

1.    Compute and show workings for the deprecation expense to be charged using the straight line, units of production and double-declining methods of deprecation for 2015 and 2016. (Round off answers to the nearest dollar where applicable)

2.    Compute the net book value for 2015 and 2016 if the company adopted the double declining method of deprecation.

Question B

Based on the above information, assume that Charmin Manufacturing company adopted the straight-line method and sold the machine for $180,000 on July 1^st, 2017.

Requirements:

1.       Prepare a statement showing the computation of the gain or loss on the disposal of the machine.

2.       Prepare a compound journal entry to record the disposal of the fixed asset as at July 1^st, 2017. (Round off answer to the nearest dollar).

Use the following information for the Exercises below.

The following selected account balances are provided for Delray Mfg.

Exercise 14-13 Preparation of schedule of cost of goods manufactured LO P2

Prepare its schedule of cost of goods manufactured for the year ended December 31, 2017.

Exercise 14-14 Income statement preparation LO P2

Prepare an income statement for Delray Mfg. (a manufacturer).

RGDP per Person Growth Rate The following table summarizes Bureau of Economic Analysis data on NGDP and RGDP from 2010 – 2016. Data are in billions of dollars. Year NGDP RGDP 2010 14,964.40 14,783.80 2011 15,517.90 15,020.60 2012 16,155.30 15,354.60 2013 16,663.20 15,583.30 2014 17,348.10 15,961.70 2015 17,942.90 16,345.00 The following table summarizes U.S. Census Bureau data on population estimates from 2010 – 2016. 2010 2011 2012 2013 2014 2015 2016 309,348,193 311,663,358 313,998,379 316,204,908 318,563,456 320,896,618 323,127,513 What was the RGDP per person in 2010 and 2011? Round up your answer to a full number (no decimals). On the "short scale," one billion is 1,000 million, or 1 and 9 zeroes (1,000,000,000).

RGDP per person in 2010 was $ ________.

RGDP per person in 2011 was $ ________.

Using the exact formula calculate the annual growth rate of RGDP per person in 2011. Round up your answer to the second decimal. The annual growth rate of RGDP per person in 2011 was ________ percent.