Given the following memory values and address instruction with an accumulator. Determine the values with the following instructions load into accumulator.

Word 16 contains 22

Word 18 contains 24

Word 20 contains 26

Word 22 contains 28

Word 24 contains 30

Word 26 contains 32

Word 28 contains 34

i. LOAD IMMEDIATE 16

ii. LOAD DIRECT 16

iii. LOAD INDIRECT 16

iv. LOAD IMMEDIATE 18

v. LOAD DIRECT 18

vi. LOAD INDIRECT 20

vii. LOAD IMMEDIATE 24

viii. LOAD DIRECT 26

ix. LOAD INDIRECT 22

x. LOAD DIRECT 28

[10 Marks]

Identify any THREE (3) input devices and THREE (3) output devices which are

common used in our life. Discuss the benefits of using these devices in our daily

life.

[18 Marks]

1. Add the following binary number in 8-bit. Rewrite each problem in decimal notation to check you work. 10110101112 + 011001002

2. Find the binary equivalent the following decimal numbers. 0.25

3. Find the decimal equivalent for the following binary numbers. 1110102/100000002

4. Find the decimal equivalent for the following binary numbers. 0.00102

5. Give the multiplying factor associated with each of the following metric prefixes. Deci-

6. Find the binary equivalent the following decimal numbers. 0.6875

7. Exactly how many bits are in the following? 40 GB

8. Use long division to convert decimal fraction into a binary expansion. 3/5

9. Find the decimal equivalent for the following binary numbers. 1101.11102

10. Use long division to convert decimal fraction into a binary expansion. 3/4

11. What is the best approximation of the decimal fraction 2/3, using a denominator of 8, 16, 256?

12. Find the binary equivalent the following decimal numbers. 14. 25390625

13. Find the decimal equivalent for the following binary numbers. 0.110001102

14. Exactly how many bytes are in the following? 60MB

SQL Program True/False Question

1. Which of the following is true of a many to many relationship? T/F

2. Security is rarely a concern for most databases. T/F

3. A security requirement refers to the need to restrict who can access some of the database data. T/F

4. Report requirements refer to the input forms the database will need. T/F

5. Insert permission is the permission to add records to the database. T/F

6. A trigger is code usually written in SQL which is triggered by a database event such as an insert or delete. T/F

7. A data requirement refers to the need to gather data about the database. T/F

8. One to one relationships are the most common relationship in a relational database. T/F

9. If you have an attribute that can have multiple values you should just number them 1, 2, 3, etc. T/F

10. Ideally every attribute in a database should have a unique name. T/F

11. Lookup entities have no effect on data consistency and integrity T/F

In C: Find a string within a string Given two strings S1 & S2, search for an occurrence of the second string within a first string. Note: Do not use system library for the implementation. Input: Code Zinger University Zinger where, First line represents string S1. Second line represents string S2. Output: 5 Here 'Zinger' word starts at 5th index within 'Code Zinger University’. Assume that, The length of strings S1 & S2 are within the range [1 to 10000]. Character comparisons will be case-sensitive.

Develop a test strategy for testing the entire application chosen in unit 3 for analysis and design. Keep in mind that testing that involves users should minimize their time commitment while obtaining essential information from their involvement. Specifically define roles, responsibilities, timing, and test strategy for each level of testing.

• Consider a simple application-level protocol built on top of UDP that allows a client to retrieve a file from a remote server residing at a well-known address. The client first sends a request with a file name, and the server responds with a sequence of data packets containing different parts of the requested file. To ensure reliability and sequenced delivery, client and server use a stop-and-wait protocol. Ignoring the obvious performance issue, do you see a problem with this protocol? Think carefully about the possibility of processes crashing.

Write a linear-search Java method to test if a String array is already sorted alphabetically. The prototype should be static boolean ifsorted(String [] s)

{

}

Java programming extra credit.

The following program will be used to test your knowledge on Implementing with tester classes. Included is the Details class. Your assignment is to create a class named DetailsTester using info from the two classes(Procedure class is only included to know the details of the procedure, which includes desc, date, and cost) Patient class is included as well.That will properly implement the class.

package doctorOffice;

import java.util.ArrayList;
import java.time.LocalDate;

public class Details
{
//Instance variables
private Patient patient;
private double height;
private double weight;
private ArrayList procedures = new ArrayList();
private LocalDate lastVisit;

Details(Patient patient,
double height,
double weight)
{
this.patient = patient;
this.height = height;
this.weight = weight;
}

//Getters--------------------------------------
public Patient getPatient()
{
return patient;
}

public double getHeight()
{
return height;
}

public double getWeight()
{
return weight;
}

public ArrayList getProcedures()
{
return procedures;
}

public LocalDate getLastVisit()
{
return lastVisit;
}

//Setters--------------------------------------
public void setHeight(double height)
{
this.height = height;
}

public void setWeight(double weight)
{
this.weight = weight;
}

public void setLastVisit(LocalDate lastVisit)
{
this.lastVisit = lastVisit;
}

//Methods--------------------------------------
public boolean addProcedure(Procedure toAdd)
{
//LOGIC HERE
return true;
}
}

*******

package doctorOffice;

import java.time.LocalDate;
import java.time.format.DateTimeFormatter;

//Procedure class holds information about any procedures performed on the patients
public class Procedure
{
   private String desc;
   private double cost;
   private LocalDate date;
  
   public Procedure(String desc, double cost, String date) throws Exception
   {
       this.desc = desc;
       this.cost = cost;
       this.date = LocalDate.parse(date, DateTimeFormatter.ofPattern("MM/dd/yyyy"));
   }
  
   //getters
   public String getDesc()
   {
       return this.desc;
   }
  
   public double getCost()
   {
       return this.cost;
   }
  
   public LocalDate getDate()
   {
       return this.date;
   }

   //toString override
   public String toString()
   {
       String output = "Description: " + desc;
       output += "\n\nCost: " + cost;
       output += "\n\nDate: " + date.toString();
       return output;
   }
}

1. Assuming standard 1500 byte Ethernet max payloads: how many IPv4 fragments will be needed to transfer 2000 bytes of user data with a single UDP send? And, how do the 2000 bytes get split over the frags?
2. Despite its conceptual elegance, RPC (Remote Procedure Call) has a few problems. Discuss any 3 of those in brief.
3. Why is timestamping needed in real-time applications? This is in the context of Real-time Transport Protocol (RTP).
4. Why does UDP exist? Would it not have been enough to just let user processes send raw IP packets?
5. Explain how QUIC eliminates a couple of RTTs usually needed at the start of a secure web connection.

I'm looking for a program, written in vPython, that simulates the movement of a spherical mass, suspended from a ceiling, tied to a spring. We are supposed to take the gravitaional force into account but are allowed to ignore the effects of air-resistance (for now).

I am a newbie at vPython so comments within the program to explain what certain parts of the code do would be appreciated!

An increasing-order integer array may contain duplicate elements. Write a Java method that does a binary search through the array for finding a specific target and return an array of two integer indices that specifies the close interval of indices at which the target is found or null if the target is not present. Use this test driver to test

public class MultBS

{

int [] multBinarySearch(int [] x, int target)

{

// your codes go here

}

public static void main(String [] args)

{ int [] x = new int[]{2,3,3,4,4,4,5,6,7,7,7};

int [] range = multBinarySearch(x, 3);

System.out.println("Target was found from position " + range[0] + " to " + range[1]);

}

}

test your program to make sure you see

the printout is

"Target was found from position 1 to 2"

I have the following code:

//Set.java

import java.util.ArrayList;

public class Set<T> {
    //data fields
    private ArrayList<T> myList;
    // constructors
    Set(){
        myList = new ArrayList<T>();
    }
    // other methods
    public void add(T item){
        if(!membership(item))
            myList.add(item);
    }

    public void remove(T item){
        if(membership(item))
            myList.remove(item);
    }

    public Boolean membership(T item){
        for (T t : myList)
            if (t.equals(item))
                return true;
        return false;
    }

    public String toString(){
        StringBuilder str = new StringBuilder("[ ");

        for(int i = 0; i < myList.size() - 1; i++)
            str.append(myList.get(i).toString()).append(", ");

        if(myList.size() > 0)
            str.append(myList.get(myList.size() - 1).toString());

        str.append(" ]");

        return str.toString();
    }

}

(20 points) Fill the following table with the big-O running times of each of the methods implemented, as well as the running times for the same methods if they were implemented with LinkedList instead. (No need to explain here, only the big-O expression.)

(20 points) Explain each of the eight running times in the table applying the rules of counting seen in class, and for the method calls, if 4 we have covered them already, directly refer to the running times of those methods. (Partial credit if you do not explain all eight. No points for ambiguous explanations. For instance, if you implement add in the class Set using addFirst in the class ArrayList, then you should say something like the following. “The add method of Set is implemented with just one method call to addFirst of ArrayList. addFirst of ArrayList is in O(n) in the worst case. Hence, the same bound on the running time applies to add”. )

Suppose a function receives a pointer as an argument. Explain how this function is declared within its calling function. In particular, explain how the data type of the pointer argument is represented. C++

What are the application and uses of Telemedicine?