What intangible benefits might an organization obtain from the development of an

information system?​

Answer:

The program in Python is as follows:

widget = int(input("Widgets: "))

price = widget * 9.9

tax = price * 0.55

ship = price * 0.40

totalprice = price + tax + ship

print("Total Price: $",totalprice)

Explanation:

The question is incomplete, as what is required is not stated.

However, I will write convert the pseudocode to a programming language (in Python)

Get the number of widgets

widget = int(input("Widgets: "))

Calculate price

price = widget * 9.9

Calculate the tax

tax = price * 0.55

Calculate the shipping price

ship = price * 0.40

Calculate the total price

totalprice = price + tax + ship

Print the calculated total price

print("Total Price: $",totalprice)

Answer:

[tex]E = 14.81\%[/tex]

Explanation:

Given

[tex]n = 150[/tex]

[tex]\sigma = 0.78[/tex]

[tex]c = 0.98[/tex]

Required

The margin of error (E)

This is calculated as:

[tex]E = z * \frac{\sigma}{\sqrt{n}}[/tex]

When confidence level = 0.98 i.e. 98%

The z score is: 2.326

So, we have:

[tex]E = 2.326 * \frac{0.78}{\sqrt{150}}[/tex]

[tex]E = 2.326 * \frac{0.78}{12.247}[/tex]

[tex]E = \frac{2.326 *0.78}{12.247}[/tex]

[tex]E = \frac{1.81428}{12.247}[/tex]

[tex]E = 0.1481[/tex]

Express as percentage

[tex]E = 14.81\%[/tex]

Answer:

C15H24O

Explanation:

n(C) = 4.497 g/44g/mol = 0.1022

Mass of C = 0.1022 × 12 = 1.226 g

n(H) = 1.473g/18 g/mol = 0.0823 ×2 moles = 0.165 moles

Mass of H = 0.0823 × 2 ×1 = 0.165g

Mass of O= 1.501 -(1.226 + 0.165)

Mass of O= 0.11 g

Number of moles of O = 0.11g/16g/mol = 0.0069 moles

Dividing through by the lowest ratio;

0.1022/0.0069, 0.165/0.0069, 0.0069/0.0069

15, 24, 1

Hence the formula is;

C15H24O

Answer

The formula is C1SH240

Answer:

The program in C++ is as follows:

#include <iostream>

#include <vector>

using namespace std;

int main(){

vector<int> nums;

int num;

cin>>num;

while(num != -1){

 nums.push_back(num);

 cin>>num; }  

for (auto i = nums.begin(); i != nums.end(); ++i){

    cout << *i <<endl; }

return 0;

}

Explanation:

This declares the vector

vector<int> nums;

This declares an integer variable for each input

int num;

This gets the first input

cin>>num;

This loop is repeated until user enters -1

while(num != -1){

Saves user input into the vector

 nums.push_back(num);

Get another input from the user

 cin>>num; }

The following iteration print the vector elements

for (auto i = nums.begin(); i != nums.end(); ++i){

    cout << *i <<endl; }

Answer:

nslookup

Explanation:

Nslookup command is considered as one of the most popular command-line software for a Domain Name System probing. It is a network administration command-line tool that is available for the operating systems of many computer. It is mainly used for troubleshooting the DNS problems.

Thus, in the context, the technician receives the error "Web page cannot be displayed" when he alternates to access different web page, the nslookup command is the best command tool to find the root cause of the connection problem.

Answer:

(i) C is increased (S, B same)

Explanation:

Cache are items which are stored in the computer at a hidden place. These are sometimes unwanted and they may hinder the speed and performance of the device. They exist to bridge speed gap.

Answer:

D

Explanation:

Answer:

Explanation:

Pink: Down 5 then left 2.

Yellow: Left 3 and down 2.

Green: Right 7, down 4 and left 1.

Purple: Up 6 and left 9.

Red: Left 7, down 5 and left 1.

You can do the last one, blue :)

Answer:

Explanation:

u=up, d=down, r=right, l=left

yellow: l3d2

pink: d5l2

green: r7d4l1

purple: u6l9

red: l7d5l1

blue: r2u7l5

Answer:

The right answer is "Hardware crash".

Explanation:

Thus the above is the right solution.

Answer:

The function of the suites application is to create presentations and perform numerical calculations.

Explanation:

Answer:

Regardless of how you have formatted a cell to display a date or time, Excel always internally stores dates And times the same way. Excel stores dates and times as a number representing the number of days since 1900-Jan-0, plus a fractional portion of a 24 hour day: ddddd. tttttt

Explanation:

mark me as BRAINLIEST

follow me

carry on learning

100 %sure

1 Account

2 online

3 access

4 password

5 internet

6 email

Answer:

Perimeter:

{ \tt{perimeter = 2(l + w)}}

Circumference:

{ \tt{circumference = 2\pi \: r}}

Just input the codes in the notepad

Answer:

d. call WriteInt

Explanation:

Required

Instruction to write to decimal integer

Of the 4 instructions, the call WriteInt instruction is used write to a decimal integer.

This is so, because the WriteInt instruction writes a signed decimal integer to standard output.

This implies that the output will have a sign (positive or negative) and the output will start from a digit other than 0 (i.e. no leading zero)

Answer:

I think digital,versatile

computer is an electronic digital versatile machine because once a task is initiated computer proceeds on its own till its completation.

Answer:

plug-in

Explanation:

A Plug-in is a software that provides additional functionalities to existing programs. The need for them stems from the fact that users might want additional features or functions that were not available in the original program. Digital audio, video, and web browsers use plug-ins to update the already existing programs or to display audio/video through a media file. Plug-ins save the users of the stress of having to wait till a new product with the functionality that they want is produced.

Answer:

B plug-in

Explanation:

Edge2022

For learning HTML we recommend a simple text editor like Notepad (PC) or TextEdit (Mac).

mark me brainliestt :))

Answer:

If you want to use HTML editor in windows, you can use notepad. And if you want to use HTML editor on your phone than you need to install any editor on your phone.

Explanation:

If you want to use another app than notepad in pc, laptop, mac, OS or Linux, you can download a editor known as Visual Studio Code. If you want to do another language you can also do it in it. You can do all programming languages in it.

Answer:

Acronis True Image is the one I would recommend out of these mentioned online backup services.

Explanation:

The evaluations and reviews of each of the online backup services are as follows:

a. iDrive

For this, we have:

Speed = 60% - fair

Security = 100% - excellent

Privacy = 88% - very good

Features = 95% - excellent

Pricing = 85% - Very good

Because of its various features, pricing, and usability, IDrive reviews suggest that it is a very efficient online backup solution. However, there have been complaints concerning its speed and the fact that there are no monthly plans available.

b. Carbonite

For this, we have:

Speed = 60% - fair

Security = 100% - excellent

Privacy = 87% - very good

Pricing = 85% - very good

File backup and restoration = 75% - good

Carbonite reviews reveal that it is simple to use and provides limitless backup for one device. The main drawback is that it has extremely poor backup speeds.

c. Acronis True Image

This is fast, simple and intuitive

It has complete control over the backup updates, including how and when they occur.

It is not expensive.

Acrnonis True image is a powerful backup storage service. It enables data and file backup and restoration from USB drives.

Many reviewers of Acrnonis True image have stated that they have had no issues with its service, that it is worth purchasing, and that there are no concerns.

d. Backblaze

For this, we have:

Speed = 75% - good

Security = 75% - good

Privacy = 70% - decent

Pricing = 100% - excellent

Support = 95% - excellent

Features = 65% - decent

File back-up and restoration = 70% - decent

Backblaze is one of the most popular internet backup services. This storage service, however, does not allow for ustomization.

Recommendation

Acronis True Image is the one I would recommend out of these mentioned online backup services. This is due to the fact that it delivers a large amount of accurate and high-quality data storage. It is quick, simple and intuitive, which is what most people care about. Furthermore, reviewers have stated that this service is quite effective and that there have been very few issues with it. The other services demonstrate that their services have flaws, such as lack of customization and slowness.

Answer:

function reverseArray(arr) {

   if (arr.length > 1) {

      arr = [arr[arr.length-1], ...reverseArray(arr.slice(1, -1)), arr[0]]

   }

   return arr;

}

function reverseSentence(sentence) {

   let words = reverseArray( sentence.split(" ") );

   return words.join(" ");

}

console.log( reverseSentence("The quick brown fox jumps over the lazy dog's back") );

console.log( reverseSentence("one two three") );

console.log( reverseSentence("one two") );

console.log( reverseSentence("Single") );

Explanation:

This is a solution in javascript leveraging several powerful constructs in that language, such as the spread operator.

Solution :

App.java:  

import Controller.Controller;

import Model.Model;

import View.View;  

public class App

{  

public static void main(String[] args) // Main method

{  

Model model = new Model(); // Creates model object.    

View view = new View(); // Creates view object.    

Controller controller = new Controller(view, model); // Creates controller object that accepts view and model objects.    

}

}  

[tex]\text{Controller.java:}[/tex]  

package Controller;  

[tex]\text{impor}t \text{ Model.Model;}[/tex]

import View.View;  

[tex]\text{public class Controller}[/tex]

{

Model model; // Model object    

View view; // View object

public Controller(View v, Model m) // Method that imports both model and view classes as objects.

{

model = m;    

view = v;  

//view.basicDisplay(model.getData()); // basicDisplay method from View class prints FootballPlayer objects as Strings from Model class.  

view.basicDisplay(model.getMembers().get(1).getAttributeName(3));    

view.basicDisplay(model.getMembers().get(1).getAttribute(3));    

view.basicDisplay(model.getMembers().get(1).getAttributeNames());    

view.basicDisplay(model.getMembers().get(1).getAttributes());    

view.basicDisplay("size of names=" + model.getMembers().get(1).getAttributeNames().size());    

view.basicDisplay("size of attributes=" + model.getMembers().get(1).getAttributes().size());

}  

}  

FootballPlayer.java:

package Model;  

import java.util.ArrayList;  

public class FootballPlayer extends Person implements TableMember { // Used "extends" keyword to inherit attributes from superclass Person, while using "implements" to implement methods from TableMember interface.    

private int number; // Creating private attribute for int number.    

private String position; // Creating private attribute for String position.  

public FootballPlayer(String name, int feet, int inches, int weight, String hometown, String highSchool, int number, String position) // Full parameter constructor for FootballPlayer object (using "super" keyword to incorporate attributes from superclass).

{

super(name, feet, inches, weight, hometown, highSchool); // Used super keyword to include attributes from superclass.  

this.number = number; // Value assigned from getNumber method to private number instance variable for FootballPlayer object.  

this.position = position; // Value assigned from getPosition method to private position instance variable for FootballPlayer object.    

}  

public FootballPlayer() // No parameter constructor for FootballPlayer object.

{

this.number = 0; // Default value assigned to private number instance variable under no parameter constructor for FootballPlayer object.    

this.position = "N/A"; // Default value assigned to private position instance variable under no parameter constructor for FootballPlayer object.    

}  

Override

public String getAttribute(int n) // getAttribute method that is implemented from interface.

{

switch (n) { // Switch statement for each attribute from each FootballPlayer object. Including two local attributes, denoted by this. While the others are denoted by "super".

case 0:

return String.valueOf(this.number); // Use of the dot operator allowed me to discover String.valueOf method to output int attributes as a string.

case 1:

return this.position;

case 2:

return super.getName();

case 3:

return super.getHeight().toString();

case 4:

return String.valueOf(super.getWeight());

case 5:

return super.getHometown();

case 6:

return super.getHighSchool();

default:

return ("invalid input parameter");

}

}  

Override

public ArrayList<String> getAttributes() // getAttributes ArrayList method that is implemented from interface.

{

ArrayList<String> getAttributes = new ArrayList<>();    

for(int i = 0; i <= 6; i++){ // For loop to add each attribute to the getAttributes ArrayList from getAttributes method.    

getAttributes.add(getAttribute(i));    

}    

return getAttributes;

}  

Override

public String getAttributeName(int n) // getAttributeName method implemented from interface.

{

switch (n) { // Switch statement for the name of each attribute from each FootballPlayer object.

case 0:

return "number";

case 1:

return "position";

case 2:

return "name";

case 3:

return "height";

case 4:

return "weight";

case 5:

return "hometown";

case 6:

return "highSchool";

default:

return ("invalid input parameter");

}  

}  

Answer: Load Balancer

Hypervisor

Router

Explanation:

The systems that they may be applying the patches to include load balancer, hypervisor and router.

The load balancer will help in the distribution of a set of tasks over the resources, in order to boost efficiency with regards to processing.

A hypervisor is used for the creation and the running of virtual machines. The router helps in the connection of the computers and the other devices to the Internet.

Answer:

a. tracert

Explanation:

Tracert is a computer network diagnostic demand which displays possible routes for internet protocol network. It also measures transit delays of packets across network. The given output is produced by a tracert command.

Answer:

chosen ciphertext

Explanation:

Chosen ciphertext attack is a scenario in which the attacker has the ability to choose ciphertexts C i and to view their corresponding decryptions – plaintexts P i . It is essentially the same scenario as a chosen plaintext attack but applied to a decryption function, instead of the encryption function.

Cyber attack usually associated with obtaining decryption keys that do not run in fixed time is called the chosen ciphertext attack.

Hence, chosen ciphertext attempts the use of modular exponentiation.

Learn more : https://brainly.com/question/14826269

Answer:

The method is as follows:

public static void checkIntersection(double x1, double y1, double r1, double x2, double y2, double r2){

    double d = Math.sqrt(Math.pow((x1 - x2),2) + Math.pow((y1 - y2),2));

    if(d == r1 + r2){

        System.out.print("The circles touch each other");     }

    else if(d > r1 + r2){

        System.out.print("The circles do not touch each other");     }

    else{

        System.out.print("The circles intersect");     }

}

Explanation:

This defines the method

public static void checkIntersection(double x1, double y1, double r1, double x2, double y2, double r2){

This calculate the distance

    double d = Math.sqrt(Math.pow((x1 - x2),2) + Math.pow((y1 - y2),2));

If the distance equals the sum of both radii, then the circles touch one another

    if(d == r1 + r2){

        System.out.print("The circles touch each other");     }

If the distance is greater than the sum of both radii, then the circles do not touch one another

   else if(d > r1 + r2){

        System.out.print("The circles do not touch each other");     }

If the distance is less than the sum of both radii, then the circles intersect

   else{

        System.out.print("The circles intersect");     }

}

Answer:

adress: 10101100.00010000.1 0000000.00000000

netmask: 11111111.11111111.1 0000000.00000000

Network:   172.16.128.0/17       10101100.00010000.1 0000000.00000000 (Class B)

Explanation:

ex: 10 -> 00001010

200 ->11001000

Answer:

Test if L(M1-2) is empty.

Construct FA M2-1 from M1 and M2 which recognizes the language L(>M2) - L(>M1).

COMMENT: note we use the algorithm that is instrumental in proving that regular languages are closed with respect to the set difference operator.

Test if L(M2-1) is empty.

Answer yes if and only if both answers were yes.

Explanation:

An algorithm must be guaranteed to halt after a finite number of steps.

Each step of the algorithm must be well specified (deterministic rather than non-deterministic).

Three basic problems:

Given an FA M and an input x, does M accept x?

Is x in L(M)

Given an FA M, is there a string that it accepts?

Is L(M) the empty set?

Given an FA M, is L(M) finite?

Algorithm for determining if M accepts x.

Simply execute M on x.

Output yes if we end up at an accepting state.

This algorithm clearly halts after a finite number of steps, and it is well specified.

This algorithm is also clearly correct.

Testing if L(M) is empty.

Incorrect "Algorithm"

Simulate M on all strings x.

Output yes if and only if all strings are rejected.

The "algorithm" is well specified, and it is also clearly correct.

However, this is not an algorithm because there are an infinite number of strings to simulate M on, and thus it is not guaranteed to halt in a finite amount of time.

COMMENT: Note we use the algorithm for the first problem as a subroutine; you must think in this fashion to solve the problems we will ask.

Correct Algorithm

Simulate M on all strings of length between 0 and n-1 where M has n states.

Output no if and only if all strings are rejected.

Otherwise output yes.

This algorithm clearly halts after a finite number of steps, and it is well specified.

The correctness of the algorithm follows from the fact that if M accepts any strings, it must accept one of length at most n-1.

Suppose this is not true; that is, L(M) is not empty but the shortest string accepted by M has a length of at least n.

Let x be the shortest string accepted by M where |x| > n-1.

Using the Pumping Lemma, we know that there must be a "loop" in x which can be pumped 0 times to create a shorter string in L.

This is a contradiction and the result follows.

COMMENT: There are more efficient algorithms, but we won't get into that.

Testing if L(M) is finite

Incorrect "Algorithm"

Simulate M on all strings x.

Output yes if and only if there are a finite number of yes answers.

This "algorithm" is well specified and correct.

However, this is not an algorithm because there are an infinite number of strings to simulate M on, and thus it is not guaranteed to halt in a finite amount of time.

COMMENT: Note we again use the algorithm for the first problem as a subroutine.

Correct Algorithm

Simulate M on all strings of length between n and 2n-1 where M has n states.

Output yes if and only if no string is accepted.

Otherwise output no.

This algorithm clearly halts after a finite number of steps, and it is well specified.

The correctness of the algorithm follows from the fact that if M accepts an infinite number of strings, it must accept one of length between n and 2n-1.

This builds on the idea that if M accepts an infinite number of strings, there must be a "loop" that can be pumped.

This loop must have length at most n.

When we pump it 0 times, we have a string of length less than n.

When we pump it once, we increase the length of the string by at most n so we cannot exceed 2n-1. The problem is we might not exceed n-1 yet.

The key is we can keep pumping it and at some point, its length must exceed n-1, and in the step it does, it cannot jump past 2n-1 since the size of the loop is at most n.

 This proof is not totally correct, but it captures the key idea.

COMMENT: There again are more efficient algorithms, but we won't get into that.

   Other problems we can solve using these basic algorithms (and other algorithms we've seen earlier this chapter) as subroutines.

       COMMENT: many of these algorithms depend on your understanding of basic set operations such as set complement, set difference, set union, etc.

Given a regular expression r, is Lr finite?

Convert r to an equivalent FA M.

COMMENT: note we use the two algorithms for converting a regular expression to an NFA and then an NFA to an FA.

Test if L(M) is finite.

Output the answer to the above test.

Given two FAs M1 and M2, is L(M1) = L(M2)?

Construct FA M1-2 from M1 and M2 which recognizes the language L(>M1) - L(>M2).

COMMENT: note we use the algorithm that is instrumental in proving that regular languages are closed with respect to the set difference operator.

Test if L(M1-2) is empty.

Construct FA M2-1 from M1 and M2 which recognizes the language L(>M2) - L(>M1).

COMMENT: note we use the algorithm that is instrumental in proving that regular languages are closed with respect to the set difference operator.

Test if L(M2-1) is empty.

Answer yes if and only if both answers were yes.