please write 1000 words about differences between Facebook and twitter in public relation

Identify a specific example of a cyberattack and discuss security measures that could be been employed to protect against this type of cybercrime. Discuss the impact of cybercrime on an organization's reputation and how cybercrime can affect an organization's sustainability.

the main services that financial institutions provide as financial intermediaries

With the advent of the Internet combined with globalization and the strong presence of multinational companies, many experts claim that cultural homogenization is destroying culture and traditional values. For example, in the future regardless of where you travel in the world, you may see a typical person on the street wearing a pair of Levis jeans, a Calvin Klein shirt, Nike shoes, while holding an iPhone in one hand and a cup of Starbucks in the other hand. State your opinion on this.

Dollar-Value LIFO Retail

Johns Company adopts the dollar-value LIFO retail inventory method on January 1, 2016. The following information for 2016 is obtained from Johns' records:

The price index on January 1, 2016, was 100, and on December 31, 2016, it was 110.

Required:

Compute the cost of the inventory on December 31, 2016. Round the cost-to-retail ratio to three decimal places.

For java script

1. Make a set of buttons that demonstrate strings. Feel free to combine these new buttons with the buttons of the previous HW if you like, but you don't have to.

2. Modify the button styles

3. Add a for loop, a while loop, and a do while loop. These should be activated by buttons to demonstrate the loops.

In reality, network performance is limited by bandwidth, latency, jitters, congestions,
Errors and etc. Meanwhile the client also has the limitations due to resource load,
application interaction with TCP stack, and etc.
In this question, you will be tested for your familiarity in using Wireshark software for
packet capture and analyze the client’s TCP window size.
Instruction: Start packet capture in Wireshark application and download Ubuntu 18.04.2
image from this page: http://releases.ubuntu.com/bionic/.

Answer the following questions with proven screenshots:
(a) What is the Internet Protocol (IP) address of the URL of Ubuntu.com?
Answer Guide:
may use dnslookup + wirehshark to complete this action.

(b) What is the port number that the website/network service used?
Answer Guide: Kindly able to notice and differentiate between a simple HTTP, HTTPS,
TLS, and SSL. Some website may appear to use SSL/TLS for the comm. Provide a
screenshot to support your answer.

(c) How long does it take from the HTTP GET message was sent until the HTTP OK reply
was received for the ubuntu.com webpage that you visited?
Answer Guide: Inspect either the web is using HTTP/HTTPS or SSL/TLS and provide
your statement. The trick is, through the Wireshark. If there is no HTTP protocol
involves during the observation,

(d) Determine the TCP window size while downloading is still in progress. Determine the
steps taken to determine the TCP window size value with screenshot.
Answer Guide:
The Ubuntu ISO will be downloaded from a mirror. Please specify the mirror that you
are using at that moment. State the domain name, protocols involved, and the port
number.

(e) Provide a screenshot of TCP Window using I/O graph (Statistics > TCP StreamGraph
> Window Scaling Graph).
The window scaling graph shows the size of advertised receive window (including scaling
factor). The graph tells on how well the receiver can handle the received data.
Observation:

Print the mean and the first 10 eigenvector images and plot the first 100 eigenvalues using python.

1. For each of the following, prove using the definition of O(·):

(a) 7n + log(n) = O(n)

(b) n² + 4n + 7 = O(n² )

(c) n! = O(nⁿ)

(d) 2ⁿ = O(2²ⁿ)

Please explain the procedure clearly for all (They are of the same question)

What are some common logical fallacies (section 3.9) that you have witnessed in your life? (at work/school, in conversation, TV, Internet, etc.)

They can be related to technology, try not to get overly political in nature. Avoid Ad Hominem arguments in discussion.

Please use the python and explain.

Also please show python.

Suppose that a cashier owes a customer some change and that the cashier only has quarters, dimes, nickels, and pennies. Write a program the computes the minimum number of coins that the cashier can return. To solve this problem use the greedy algorithm explained below. PROBLEM STATEMENT: Your program should first ask the user for the amount of money he/she is owed (in dollars). You may assume that the user will enter a positive number. It should then print the minimum number of coins with which that amount can be made. Assume that the only coins available are quarters (25 cents), dimes (10 cents), nickels (5 cents), and pennies (1 cent). EXAMPLES: If cashier owes 56 cents (i.e. $0.56) to the customer, the minimum number of coins the cashier can return is 4 (in particular, 2 quarters, 0 dimes, 1 nickel and 1 penny. It is not possible to return 3 or less coins). If cashier owes $1.42 to the customer, the minimum number of coins the customer can return is 9 (in particular 5 quarters, 1 dime, 1 nickel and 2 cents). Thus your program will look like this, for different runs:

Enter the amount you are owed in $: 0.56 The minimum number of coins the cashier can return is: 4

Enter the amount you are owed in $: 1.42 The minimum number of coins the cashier can return is: 9

Enter the amount you are owed in $: 1.00 The minimum number of coins the cashier can return is: 4

Q1-

Given a set S = {1, 2, . . . , n} of players, with skill levels

a₁, a₂, . . . , a_n,

we need to partition the set of players S into two teams S₁ and S₂ of equal total skill. The teams do not need to be of equal size. However, every player must be in exactly one team. In other words,

S₁ ∪ S₂ = S                                        (1)

S₁ ∩   S₂ = ∅                                                     (2)

Σ a_k= Σ a_k                                  (3)

k∈S₁   k∈S2

1. Give a brute-force algorithm to solve this problem.

Hint: You must be able to generate subsets of S. To do that, you can use a list of binary digits b = b₁b₂. . . b_nwhere setting b = 100010 means that only players 1 and 5 are in the subset represented by b.

2. Give time complexity analysis for the worst case.

Hint: How many subsets of S contain a specific element i?

Q2-

Intervals (1, 8), (6, 9), (10, 14), (7, 11), (3, 12). Maximum activity is in the interval (7, 8), where four jobs are active.

Given a set S of n open intervals on R defined by

(a₁, b₁), (a₂, b₂), . . . , (a_n, b_n)

Each a_irepresents the beginning time of a process, and b_irepresents the termination time of the process. There is an open interval (x, y) where the greatest number of processes is active. What are the x and y of such an interval. Consider the example given in Figure 1.

1. Give a brute-force algorithm to solve this problem, with a worst-case running time of Θ(n³).
2. Provide the time complexity analysis.

Design a counter that uses only 3 D flip-flops and as many logic gates as needed. The counter follows a sequence: 0, 5, 25, 15, 9, 6, 12, 3, 0, 5, 25, 15, 9, 6, 12, 3, …. Show all design details, i.e., block diagram, equations, and circuit diagram.

Given a doubly linked list in c++, how do I create a function that returns the pointer to first node in the given pattern, For example, given mainList (a -> b -> c -> d) and sublist  (b -> c), our function should return a Node pointer that points to first node of the sublist in the mainList. If the pattern doesn't exist in the mainList, we should return a nullptr, there are multiple of the same sublist in the mainList, we should return the very first instance where pattern is seen.

struct Node {

char value;

Node* next;

Node* prev;

}

Node* findList(Node* subList, Node* mainList) {

// need to do this

}

void printList(Node* node)
{
    while (node != nullptr)
    {
        printf("%c ", node->value);
        node = node->next;
    }
}

Node *newNode(char key)
{
    Node *temp = new Node;
    temp->value= key;
    temp->next = nullptr;
    return temp;
}

int main() {
    // this is the sublist
    Nucleotide *a = newNode('T');
    a->next = newNode('G');
    a->next->next = newNode('T');
    a->next->next->next = nullptr;

    // this is the main list
    Node *b = newNode('A');
    b->prev = nullptr;
    b->next = newNode('A');
    b->next->prev = b;
    b->next->next = newNode('C');
    b->next->next->prev = b->next;
    b->next->next->next = newNode('T');
    b->next->next->next->prev = b->next->next;
    b->next->next->next->next = newNode('G');
    b->next->next->next->next->prev = b->next->next->next;
    b->next->next->next->next->next = newNode('A');
    b->next->next->next->next->next->prev = b->next->next->next->next;
    b->next->next->next->next->next->next = nullptr;
    printList(a);
    cout << endl;
    printList(b);
    cout << endl;
    Node *c = findList(a, b);
    cout << c->value << endl;

    return 0;
}