
Explanation of Solution
Processes:
Processes contain sequence of interconnected activities that produces result by converting inputs into outputs.
- Activity is a sub-part of a process.
- Activities in processes include getting inputs, manipulating and producing corresponding output, which are interrelated to one another.
- Activities can be done either by human or by computer systems.
Types of processes:
There are two different types of processes. They are:
- Structured processes
- Dynamic processes
Structured Processes:
- Structured processes are standardized and they mostly contain the same and fixed sequence of activities.
- The flow of activities in structure processes does not change.
Example:
Booking flight tickets:
Here, the user enter their details and some processes takes place internally like, if the seats are available, then the tickets are produced, if the seats are not available, then the tickets are not produced for that particular flight. In this, the procedures to get tickets for all the users are same and so it is called as structured processes.
Dynamic Processes:
- Dynamic processes are not standardized. It is less structured.
- The flow of activities in dynamic processes gets change according to the current trend. It is more strategic and more adaptive.
- This type of processes needs human judgement.
Example:
Programs in TV channels:
Programs in a high rated channel get changed more frequently according to the response of the audience in order to increase Television Rating Point (TRP rate).
Differences between structured and dynamic processes:
Structured Processes | Dynamic Processes |
Structured processes are standardized and they are highly structured. | Dynamic processes are less structured. |
The flow of processes does not change. | The flow of processes gets changed frequently. |
It is formal in nature. | It is informal. |
It supports operational activities and there is no need of human judgement in structured processes. | It supports strategic activities and so this processes needs human judgement. |
Example: Booking flight tickets | Example: Programs in TV channels. |
Workgroup processes:
Workgroup processes achieve goals of a particular department by implementing groupwork.
Example:
Human Resources’ involvement is important in recruitment process, compensation, assessment and HR planning. The HR department in specific company gets performance of an employee from various departments and process overall rating for that particular employee.
Enterprise processes:
Enterprise processes provide the organization to sustain longer and it supports the activities performed in various departments.
Example:
In a corporate company, the process of recruiting a person supports activities in financial department, the employee’s specialized department, and so on...

Want to see the full answer?
Check out a sample textbook solution
Chapter 7 Solutions
EBK USING MIS
- R languagearrow_forwardQuestion 1 (15 Points) Inheritance: In this question, we are going to create a new subclass of the SimpleGeometricObject class, named Triangle. Create a SimpleGeometricObject.java and Copy the source code of the SimpleGeometricObject class from the following link: https://liveexample.pearsoncmg.com/html/SimpleGeometricObject.html TASK 1: Create a Triangle class that extends the SimpleGeometricObject class in Eclipse, following the below UML diagram. + base:double = 5 + height:double = 10 Triangle + Triangle() + Triangle(newBase: double, newHeight: double) + getArea(): double + setBase(): void + setHeight(): void + getBase(): double + getHeight(): doublearrow_forwardQuestion 2 (10 Points): String vs. StringBuilder Create a Question2.java file and finish the following tasks: Task 1. a) Create a 1D array of integers to store 50 integers. b) Store values from 0 to 49 in the array you just created. c) Create a new String Object using no-arg constructor. d) Using for loop to add the array elements one by one to the String (one per loop iteration) Hint: to append an element to a String, use the + operator. e) Output the String on the console. Record and display a run-time it took to append all integers to the String (record run-time of 1.d.)). Please submit a screenshot. The screenshot should match the following example: 012345678910111213141516171819202122232425262728293031323334353637383940414243444546474849 it took 196708 nanoseconds to append 50 integers to the String.| Hint: You can use the following statements to record run-time. long begin, end, time; // we will measure time it took begin = System.nanoTime(); //we measure in nanoseconds. // put…arrow_forward
- Answer this Java OOP question below: Discuss the challenges and benefits of using multiple levels of inheritance in a class hierarchy. How can deep inheritance structures impact the maintainability and readability of code?arrow_forwardAnswer the Java OOP question below: Explain the relationship between a superclass and a subclass. How do the principles of encapsulation and abstraction play a role in this relationship? In your experience, how do you decide what should be included in a superclass versus a subclass? Share an example where a well-defined superclass-subclass hierarchy improved your code.arrow_forward1.) Consider the problem of determining whether a DFA and a regular expression are equivalent. Express this problem as a language and show that it is decidable. ii) Let ALLDFA = {(A)| A is a DFA and L(A) = "}. Show that ALLDFA is decidable. iii) Let AECFG = {(G)| G is a CFG that generates &}. Show that AECFG is decidable. iv) Let ETM {(M)| M is a TM and L(M) = 0}. Show that ETM, the complement of Erm, is Turing-recognizable. Let X be the set {1, 2, 3, 4, 5} and Y be the set {6, 7, 8, 9, 10). We describe the functions f: XY and g: XY in the following tables. Answer each part and give a reason for each negative answer. n f(n) n g(n) 1 6 1 10 2 7 2 9 3 6 3 8 4 7 4 7 5 6 5 6 Aa. Is f one-to-one? b. Is fonto? c. Is fa correspondence? Ad. Is g one-to-one? e. Is g onto? f. Is g a correspondence? vi) Let B be the set of all infinite sequences over {0,1}. Show that B is uncountable using a proof by diagonalization.arrow_forward
- Can you find the least amount of different numbers to pick from positive numbers (integers) that are at most 100 to confirm two numbers that add up to 101 when each number can be picked at most two times?arrow_forwardCan you find the formula for an that satisfies the provided recursive definition? Please show all steps and justificationarrow_forwardWhat is the number of injective functions f from set {1,2,....,2n} to set {1,2,....,2n} so that f(x) >= x for all the 1<= x <= n?arrow_forward
- Fundamentals of Information SystemsComputer ScienceISBN:9781337097536Author:Ralph Stair, George ReynoldsPublisher:Cengage LearningSystems ArchitectureComputer ScienceISBN:9781305080195Author:Stephen D. BurdPublisher:Cengage Learning
- Fundamentals of Information SystemsComputer ScienceISBN:9781305082168Author:Ralph Stair, George ReynoldsPublisher:Cengage LearningPrinciples of Information Systems (MindTap Course...Computer ScienceISBN:9781305971776Author:Ralph Stair, George ReynoldsPublisher:Cengage LearningPrinciples of Information Systems (MindTap Course...Computer ScienceISBN:9781285867168Author:Ralph Stair, George ReynoldsPublisher:Cengage Learning




