Identify a true statement about decision support systems (DSSs).

Computers and Technology

1 answer:

Zolol [24]3 years ago

7 0

Answer:

a. facilitate improvements but do not necessarily cause them.

Explanation:

Decision Support Systems are interactive Information systems that assist decision makers in coming up with strategies that help the organisation achieve its goals .The model base of the DSS uses mathematical and statistical models to analyse information then it generates reports and suggest possible solutions that can be implemented .The system is capable of giving a specific solution and some even allow the decision makers to give input before suggesting the most applicable solution.The effectiveness of a DSS is equally as important as its efficiency .The DSS unlike the conventional decision-making process should be able to analyse information effectively and come up with solutions in the shortest possible time frame.

You might be interested in

The item in this illustration that is highlighted is _____.

Svetlanka [38]

Answer:the title bar

Explanation:

3 0

2 years ago

Read 2 more answers

I analyze data, as a consultant, for companies making important business decisions. In order to get my point across, which of th

ladessa [460]

Answer:

Explanation:

I've just taken the test and made a 100. 3 is the most logical answer aswell, it has more of an effect than the others.

4 0

2 years ago

Which access control principle limits a user's access to the specific information required to perform the currently assigned tas

Svetradugi [14.3K]

Answer:

The answer is "Need-To-Know Access Control Principle"

Explanation:

There are three types of access control methods such as Role-Based Access Control, Discretionary Access Control and Mandatory Access Control.

The access control principle that limits/blocks the user from gaining access to a folder/information/procedure within the system is called "Need-To-Know Access Control Principle".

I hope this answer helps.

4 0

2 years ago

An algorithm whose worst-case time complexity is bounded above by a polynomial function of its size is called a(n)

Sedaia [141]

Answer:

polynomial-bounded algorithms

Explanation:

There are two algorithm complexities and they are time and space complexities. They can be denoted with the big-O notation. The big-o notation for a time and space complexity gets the worst-case time and space respectively.

The time complexity gets the measure of the execution time of an algorithm. When the time function is a polynomial ( k^n + k^n-1 ...) then the algorithm is said to be a polynomial-bounded algorithm.

4 0

2 years ago

Which microsoft operating system started the process of authenticating users with a user name and password?

11111nata11111 [884]

It should be either windows 98 or windows xp but I think it is windows xp

5 0

3 years ago