EBK USING MIS
10th Edition
ISBN: 8220103633642
Author: KROENKE
Publisher: YUZU
expand_more
expand_more
format_list_bulleted
Question
Chapter 2, Problem 2.1UYK
Program Plan Intro
Collaboration:
- Collaboration is nothing, but group of people working together.
- To achieve common objective
- Trust each other in the team
- Clarifies the roles
- In this process, people spend time on discussions so as to accomplish the task as a team and set team to achieve the common goal.
- Helps team to,
- Analyze
- Construct knowledge
- Collectively solving the issues.
- For collaborative team to be successful, members must provide and receive critical feedback.
Expert Solution & Answer
Explanation of Solution
Team collaboration:
Collaborative work is being promoted in both inter and intra organization aspects. Team works in a collaborative manner only when knowledge is shared among the team members and the tools are shared among them.
“Yes”, my team worked in a collaborative manner as the given resources were shared among the team members and they shared their knowledge with each other so as to support the progress of project and the team respectively and team members even encouraged critical feedback.
Two key characteristics of collaboration:
During collaborative work, if one of the team members has produced a document, then in the next step, other team members review the document and then a critical feedback is given.
- Now, the feedback is taken into consideration and the first version of the document is modified accordingly.
- Then the second version of the document is produced which is then reviewed again by other team members and again based on the feedback the document is revised, this process is called iteration, which is done until the best result is produced.
- This shows that iteration and feedback are required in a team to get the best outcome.
“Yes”, feedback and iteration were involved to produce the effective versions of the document required for the project.
- When the first version of the project document was prepared then it was sent for the revision, where the document was modified and the second version was produced, based on the feedback of the members, this cycle was continued until the best version was derived.
- This way both feedback and iteration was used in our project.
Collaborative
In our team, the members were assigned with some tasks as per the task list made by the members.
- As it is known that if a member is responsible for some task, it means he should take care that the task is completed within the assigned time and with the help of other team members in a collaborative manner.
- When it is necessary to complete a task, then generally the team members focus on sharing the knowledge and information they have regarding the particular aspect of the project with other team members, so that the task has a successful outcome.
If collaborative information systems are not used:
Without the use of collaborative information systems, the best version of the document cannot be derived as there will not be any steps like feedback and iteration.
- The individuals cannot expand their knowledge by sharing the knowledge of each individual, as it is only supported in collaborative information system.
- The task can be completed quickly and within the specified time as the task will be divided and all the members will work collectively to complete the give task.
- Collaborative information system also helps members to improve their decision-making skills, leadership qualities, and skills to work in team while cooperating with other team members.
If collaborative information systems are used:
With the use of collaborative information system, team members can widen their scope of knowledge and by working on a project together, the team may derive the best outcome, as there will be feedback and iteration.
- The skills like decision making, leadership, and working in a team without any disputes with the members, which an individual can acquire while working in a collaborative manner can be improved.
- The project is not a success until the time it is delivered within the given time, so with the help of collaborative information system, the task can be completed within the given time
Want to see more full solutions like this?
Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!
Students have asked these similar questions
1234
3. Which line prevents compiler optimization? Circle one: 1234
Suggested solution:
Store strlen(str) in a variable before the if statement.
⚫ Remove the if statement.
Replace index 0 && index < strlen(str)) {
5 }
}
=
str [index] = val;
Character Hex value | Character Hex value Character Hex value
'A'
0x41
'J'
Ox4a
'S'
0x53
'B'
0x42
'K'
0x4b
"T"
0x54
0x43
'L'
Ox4c
'U'
0x55
0x44
'M'
0x4d
'V'
0x56
0x45
'N'
Ox4e
'W'
0x57
0x46
'0'
Ox4f
'X'
0x58
0x47
'P'
0x50
'Y'
0x59
0x48
'Q'
0x51
'Z'
Ox5a
'T'
0x49
'R'
0x52
'\0'
0x00
Now consider what happens on a Linux/x86 machine when callfoo calls foo with
the input string "ZYXWVUTSRQPONMLKJIHGFEDCBA".
A. On the left draw the state of the stack just before the execution of the instruction
at address Ox40053a; make sure to show the frames for callfoo and foo and
the exact return address, in Hex at the bottom of the callfoo frame.
Then, on the right, draw the state of the stack just after the instruction got
executed; make sure to show where the string "ZYXWVUTSRQPONMLKJIHGFEDCBA"
is placed and what part, if any, of the above return address has been overwritten.
B. Immediately after the ret instruction at address 0x400543 executes, what is
the value of the program counter register %rip?…
1 typedef struct node* {
2
struct node* next;
3
char* key;
4
char* val;
5} node_t;
6
7 char* find_node (node_t* node, char* key_to_find) {
while(strcmp (node->key, key_to_find ) != 0 ) {
node = node->next;
8
9
10
}
11
return node->val;
12 }
Chapter 2 Solutions
EBK USING MIS
Ch. 2.6 - Prob. 1EGDQCh. 2.6 - Prob. 2EGDQCh. 2.6 - Prob. 3EGDQCh. 2.6 - Prob. 4EGDQCh. 2.7 - Prob. 1ACQCh. 2.7 - Prob. 2ACQCh. 2.7 - Prob. 3ACQCh. 2.7 - Prob. 4ACQCh. 2.7 - Prob. 5ACQCh. 2.9 - Prob. 1SGDQ
Ch. 2.9 - Prob. 2SGDQCh. 2.9 - Prob. 3SGDQCh. 2.9 - Prob. 4SGDQCh. 2.9 - Prob. 5SGDQCh. 2.9 - Prob. 2.1ARQCh. 2.9 - Prob. 2.2ARQCh. 2.9 - Prob. 2.3ARQCh. 2.9 - Prob. 2.4ARQCh. 2.9 - Prob. 2.5ARQCh. 2.9 - Prob. 2.6ARQCh. 2.9 - Prob. 2.7ARQCh. 2.9 - Prob. 2.8ARQCh. 2.9 - Prob. 2.9ARQCh. 2 - Prob. 2.1UYKCh. 2 - Using your experience working in past teams, give...Ch. 2 - Prob. 2.3UYKCh. 2 - Prob. 2.5CE2Ch. 2 - Prob. 2.6CE2Ch. 2 - Prob. 2.7CE2Ch. 2 - Prob. 2.8CE2Ch. 2 - Prob. 2.9CS2Ch. 2 - Prob. 2.1CS2Ch. 2 - Prob. 2.11CS2Ch. 2 - Prob. 2.12CS2Ch. 2 - Prob. 2.13CS2Ch. 2 - Prob. 2.14CS2Ch. 2 - Prob. 2.15CS2
Knowledge Booster
Similar questions
- Match each of the assembler routines on the left with the equivalent C function on the right. Write the name of the label (e.g., foo) to the right of the corresponding function. Note: shrq is the logical right shift instruction, and sarq is the arithmetic right shift instruction. foo1: leaq 0(,%rdi, 8), %rax long choice1 (long x) { ret return x - 8 >8; foo3: } movq sarq %rdi, %rax $8, %rax long choice4 (long x) ret { return x*256; } foo4: long choice5 (long x) leaq -8 (%rdi), %rax { ret return x-8; } long choice6 (long x) foo5: { leaq -8 (%rdi), %rax return x+8; shrq $63, %rax } retarrow_forwardGiven the variables and code in the text below, identify where in memory they will live once the code is compiled. 1 char big_array [1L<<24]; /* 16 MB */ 2 GB * :/ 2 char huge_array [1L<<31]; /* 3 4 int global = 0; 5 6 int useless () { return 0; } 7 8 int main() 9 { 10 void *p1, p2, *p3, *p4; int local = 0; malloc (1L << 28); /* 256 MB *, 11 12 p1 13 p2 = malloc (1L << 8); /* 256 B * 14 p3 15 p4 = malloc (1L << 32); malloc (1L << 8); /* 4 GB * */ /* 256 B */ 16 } Note: *pN is the thing at which pN points. 1. big_array 2. huge_array 3. global 4. useless 5. void* p1 6. *p1 7. void* p2 8. *p2 9. void* p3 10. *p3 11. void* p4 12. *p4arrow_forwardThe next problem concerns the following C code: /copy input string x to buf */ void foo (char *x) { char buf [8]; strcpy((char *) buf, x); } void callfoo() { } foo("ZYXWVUTSRQPONMLKJIHGFEDCBA"); Here is the corresponding machine code on a Linux/x86 machine: 0000000000400530 : 400530: 48 83 ec 18 sub $0x18,%rsp 400534: 48 89 fe mov %rdi, %rsi 400537: 48 89 e7 mov %rsp,%rdi 40053a: e8 di fe ff ff callq 400410 40053f: 48 83 c4 18 add $0x18,%rsp 400543: c3 retq 400544: 0000000000400544 : 48 83 ec 08 sub $0x8,%rsp 400548: bf 00 06 40 00 mov $0x400600,%edi 40054d: e8 de ff ff ff callq 400530 400552: 48 83 c4 08 add $0x8,%rsp 400556: c3 This problem tests your understanding of the program stack. Here are some notes to help you work the problem: ⚫ strcpy(char *dst, char *src) copies the string at address src (including the terminating '\0' character) to address dst. It does not check the size of the destination buffer. • You will need to know the hex values of the following characters:arrow_forward
- Consider the following assembly code for a C for loop: movl $0, %eax jmp .L2 .L3: addq $1, %rdi addq %rsi, %rax subq $1, %rsi .L2: cmpq %rsi, %rdi jl .L3 addq ret %rdi, %rax Based on the assembly code above, fill in the blanks below in its corresponding C source code. Recall that registers %rdi and %rsi contain the first and second, respectively, argument of a function. (Note: you may only use the symbolic variables x, y, and result in your expressions below do not use register names.) long loop (long x, long y) { long result; } for ( } return result; __; y--) {arrow_forwardIn each of the following C code snippets, there are issues that can prevent the compiler from applying certain optimizations. For each snippet: Circle the line number that contains compiler optimization blocker. ⚫ Select the best modification to improve optimization. 1. Which line prevents compiler optimization? Circle one: 2 3 4 5 6 Suggested solution: ⚫ Remove printf or move it outside the loop. Remove the loop. • Replace arr[i] with a constant value. 1 int sum (int *arr, int n) { 2 int s = 0; 3 for (int i = 0; i < n; i++) { 4 5 6 } 7 8 } s = arr[i]; printf("%d\n", s); return s; 234206 2. Which line prevents compiler optimization? Circle one: 2 3 4 5 6 Suggested solution: Move or eliminate do_extra_work() if it's not necessary inside the loop. Remove the loop (but what about scaling?). ⚫ Replace arr[i] *= factor; with arr[i] = 0; (why would that help?). 1 void scale (int *arr, int n, int factor) { 5 6 } for (int i = 0; i < n; i++) { rr[i] = factor; do_extra_work ();arrow_forward123456 A ROP (Return-Oriented Programming) attack can be used to execute arbitrary instructions by chaining together small pieces of code called "gadgets." Your goal is to create a stack layout for a ROP attack that calls a function located at '0x4018bd3'. Below is the assembly code for the function 'getbuf', which allocates 8 bytes of stack space for a 'char' array. This array is then passed to the 'gets' function. Additionally, you are provided with five useful gadgets and their addresses. Use these gadgets to construct the stack layout. Assembly for getbuf 1 getbuf: sub mov $8, %rsp %rsp, %rdi call gets add $8, %rsp ret #Allocate 8 bytes for buffer #Load buffer address into %rdi #Call gets with buffer #Restore the stack pointer #Return to caller Stack Layout each 8-byte (fill in section) Address Value (8 bytes) 0x7fffffffdfc0 0x7fffffffdfb8 0x7fffffffdfb0 0x7fffffffdfa8 0x7fffffffdfa0 0x7fffffffdf98 0x7fffffffdf90 0x7fffffffdf88 Gadgets Address Gadget Ox4006a7 pop %rdi; ret Ox4006a9…arrow_forward
- Problem 1 [15 points] The code below is buggy. Assume the code compiles. Briefly: 1). Identify the problem with the code (e.g., can access memory out of bounds) and 2). Suggest a solution (e.g., check the length). Question 1 1 #define BLENGTH 5 2 int b[BLENGTH]; 3 void copy_from_global_int_array_b (int n, int* dest) { 4 5 } *dest = b[n]; ==arrow_forwardWhich statement regarding SGA_MAX_SIZE is true? SGA_MAX_SIZE is modifiable after an instance is started, only when Automatic Memory Management is used. SGA_MAX_SIZE is not dyamically modifiable. SGA_MAX_SIZE is ignored when MEMORY_TARGET > 0. SGA-MAX_SIZE must be specified when SGA_TARGET > 0arrow_forwardExplian this C program #include <stdio.h> unsigned int rotateRight(unsigned int num, unsigned int bits) { unsignedint bit_count =sizeof(unsignedint) *8; bits = bits % bit_count; // Handle cases where bits >= bit_count return (num >> bits) | (num << (bit_count - bits)); } int main() { unsignedint num, bits; printf("Enter a number: "); scanf("%u", &num); printf("Enter the number of bits to shift: "); scanf("%u", &bits); printf("After rotation: %u\n", rotateRight(num, bits)); return0; }arrow_forward
- Explian thiS C program #include<stdio.h> int countSetBits(int n) { int count = 0; while (n) { count += n & 1; n >>= 1; } return count;} int main() { int num; printf("Enter a number: "); scanf("%d", &num); printf("Output: %d units\n", countSetBits(num)); return 0;}arrow_forwardPlease provide the Mathematica codearrow_forwardExplian this C program code. #include <stdio.h> void binary(unsigned int n) { if (n /2!=0) { binary(n /2); } printf("%d", n %2); } int main() { unsignedint number =33777; unsignedchar character ='X'; printf("Number: %u\n", number); printf("Binary: "); binary(number); printf("\nDecimal: %u\nHexadecimal: 0x%X\n\n", number, number); printf("Character: %c\n", character); printf("ASCII Binary: "); binary(character); printf("\nASCII Decimal: %u\nASCII Hexadecimal: 0x%X\n", character, character); return0; }arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Principles of Information Systems (MindTap Course...Computer ScienceISBN:9781285867168Author:Ralph Stair, George ReynoldsPublisher:Cengage Learning
Information Technology Project ManagementComputer ScienceISBN:9781337101356Author:Kathy SchwalbePublisher:Cengage Learning
Principles of Information Systems (MindTap Course...Computer ScienceISBN:9781305971776Author:Ralph Stair, George ReynoldsPublisher:Cengage Learning
Systems Analysis and Design (Shelly Cashman Serie...Computer ScienceISBN:9781305494602Author:Scott Tilley, Harry J. RosenblattPublisher:Cengage Learning
COMPREHENSIVE MICROSOFT OFFICE 365 EXCEComputer ScienceISBN:9780357392676Author:FREUND, StevenPublisher:CENGAGE L
Principles of Information Systems (MindTap Course...
Computer Science
ISBN:9781285867168
Author:Ralph Stair, George Reynolds
Publisher:Cengage Learning
Information Technology Project Management
Computer Science
ISBN:9781337101356
Author:Kathy Schwalbe
Publisher:Cengage Learning
Principles of Information Systems (MindTap Course...
Computer Science
ISBN:9781305971776
Author:Ralph Stair, George Reynolds
Publisher:Cengage Learning
Systems Analysis and Design (Shelly Cashman Serie...
Computer Science
ISBN:9781305494602
Author:Scott Tilley, Harry J. Rosenblatt
Publisher:Cengage Learning
COMPREHENSIVE MICROSOFT OFFICE 365 EXCE
Computer Science
ISBN:9780357392676
Author:FREUND, Steven
Publisher:CENGAGE L