MATERIALS SCI + ENGR: INT W/ACCESS
10th Edition
ISBN: 9781119808084
Author: Callister
Publisher: WILEY
expand_more
expand_more
format_list_bulleted
Question
Chapter 9, Problem 17QAP
(a)
To determine
The temperature up to which the specimen should be heated to achieve a state of
(b)
To determine
The amount of Tin added to the specimen to achieve a state of
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Please can you assist me with the attached question. Many thanks.
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?…
A 4-cell reuse cellular system is being rolled out into an operation area and you are the engineer taking charge of this project. The subscriber density for the operation area is 600 people per km2. The average traffic load generated per subscriber is 0.2 Er. You are required to deploy 8 clusters of cells in the operation area and provide a Grade of Service of 0.5% to the subscribers using the blocked calls cleared model. You found out that the total number of trunk channels available to the system is 140. Assuming that fixed channel assignment is used, compute:
a) The traffic load that can be offered to the operation area.
b) The size of the operation area (in km2) that can be supported by the system.
c) The proposed cell area and radius, based on the operation area determined in part (b).
Having successfully implemented the first system above, you are now tasked to implement another system. The requirement is that, this second system must have a cluster size of 7 and provides a…
Chapter 9 Solutions
MATERIALS SCI + ENGR: INT W/ACCESS
Ch. 9 - Prob. 1QAPCh. 9 - Prob. 2QAPCh. 9 - Prob. 3QAPCh. 9 - Prob. 4QAPCh. 9 - Prob. 5QAPCh. 9 - Prob. 6QAPCh. 9 - Prob. 7QAPCh. 9 - Prob. 8QAPCh. 9 - Prob. 9QAPCh. 9 - Prob. 10QAP
Ch. 9 - Prob. 11QAPCh. 9 - Prob. 12QAPCh. 9 - Prob. 13QAPCh. 9 - Prob. 14QAPCh. 9 - Prob. 15QAPCh. 9 - Prob. 16QAPCh. 9 - Prob. 17QAPCh. 9 - Prob. 18QAPCh. 9 - Prob. 19QAPCh. 9 - Prob. 20QAPCh. 9 - Prob. 21QAPCh. 9 - Prob. 22QAPCh. 9 - Prob. 23QAPCh. 9 - Prob. 25QAPCh. 9 - Prob. 26QAPCh. 9 - Prob. 27QAPCh. 9 - Prob. 28QAPCh. 9 - Prob. 29QAPCh. 9 - Prob. 30QAPCh. 9 - Prob. 31QAPCh. 9 - Prob. 32QAPCh. 9 - Prob. 33QAPCh. 9 - Prob. 35QAPCh. 9 - Prob. 36QAPCh. 9 - Prob. 37QAPCh. 9 - Prob. 38QAPCh. 9 - Prob. 39QAPCh. 9 - Prob. 40QAPCh. 9 - Prob. 41QAPCh. 9 - Prob. 42QAPCh. 9 - Prob. 43QAPCh. 9 - Prob. 44QAPCh. 9 - Prob. 45QAPCh. 9 - Prob. 46QAPCh. 9 - Prob. 47QAPCh. 9 - Prob. 48QAPCh. 9 - Prob. 49QAPCh. 9 - Prob. 50QAPCh. 9 - Prob. 51QAPCh. 9 - Prob. 52QAPCh. 9 - Prob. 53QAPCh. 9 - Prob. 54QAPCh. 9 - Prob. 55QAPCh. 9 - Prob. 56QAPCh. 9 - Prob. 57QAPCh. 9 - Prob. 58QAPCh. 9 - Prob. 59QAPCh. 9 - Prob. 60QAPCh. 9 - Prob. 61QAPCh. 9 - Prob. 62QAPCh. 9 - Prob. 63QAPCh. 9 - Prob. 64QAPCh. 9 - Prob. 65QAPCh. 9 - Prob. 66QAPCh. 9 - Prob. 67QAPCh. 9 - Prob. 68QAPCh. 9 - Prob. 69QAPCh. 9 - Prob. 70QAPCh. 9 - Prob. 71QAPCh. 9 - Prob. 72QAPCh. 9 - Prob. 1FEQPCh. 9 - Prob. 2FEQPCh. 9 - Prob. 3FEQPCh. 9 - Prob. 4FEQP
Knowledge Booster
Similar questions
- 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 }arrow_forward3.10 As an anesthesiologist, you are responsible for preparing IV solutions containing various concentrations of drugs. You have three continuous streams available in the operating room. The stream contents are listed with the known mass fractions, where w₁, x is the mass fraction of compound x in stream i: Stream 1: water, salt (w₁s = 0.010) Stream 2: water, salt (w2,s = 0.020), drug A (w2, A = 0.10) Stream 3: water, salt (w3,s = 0.020), drug A (w3, A = 0.050), drug B (w3,B = 0.080) Your goal is to mix the above streams to produce an IV stream (Stream 4) under continuous operation that contains water, salt, drug A, and drug B with the following characteristics: ■ Drug A has a mass fraction of 0.020 (W4,A = 0.020) ■ The ratio of the mass fraction of drug A to the mass fraction of drug B is 2.0 a. Diagram the system, including the streams. Label the system, system boundary, and surroundings. b. State appropriate assumptions applied to the problem. c. What is the basis in your solution…arrow_forwardTITLE: DESIGN OF SINGLY REINFORCED RECTANGULAR BEAMS USING STRENGTH DESIGN METHOD. PROBLEM: Design a rectangular concrete beam section for positive moment and negative moment for the loads (unfactored) and p values given. Show sketch of cross section, including bar size, arrangement and spacing. Use concrete weight = 236 kN/m³, fy = 414 MPa, f`c = 27.6 MPa, p = 0.5Pmax concrete cover = 40 mm, tie bar = 10 mm Ø.Deadload : w₁₁ = 90 kN/m Live Load: WLL = 40 kN/m and PLL = 3kN. Assume beam weight equal to 8 kN/m. PLL W = WDL + WLL +Selfweight of beam 3.5m 7 m 3.5m Use p =Pmax (SUPPORT ONLY) COMPUTATION: Required: 1. Factored Load 2. Required moment Mu, using NSCP 2015 load combination. a. at the left support b. at the mid-span c. at the right support 3. Design a singly reinforced rectangular beam: a. at the left support b. at the mid-span c. at the right support Use b=0.54d and 32-mm diameter bar. 4. Check adequacy: a. at the left support b. at the mid-span c. at the right support SKETCHarrow_forward
- 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_forwardDraw out the way each of these structs looks in memory, including padding! Number the offsets in memory. 1 struct node 2 { 3 node* next; 4 int a; 5 int b; 6 char c, d, e; 7 8 }; node* prev; 1 typedef struct vec4 2 { 3 float x, y, z, w; 4} vec4_t; 1 struct mat4 2 { 3 vec4 v1, v2, v3, v4; 4 } 1 struct goodName 2 { 3 4 567 7 }; char c [8]; int a[2]; double d; short s[4];arrow_forwardNO AI PLEASEarrow_forward
- Given 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_forwardConsider 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_forward
- In 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_forwardProblem 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_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
MATLAB: An Introduction with ApplicationsEngineeringISBN:9781119256830Author:Amos GilatPublisher:John Wiley & Sons Inc
Essentials Of Materials Science And EngineeringEngineeringISBN:9781337385497Author:WRIGHT, Wendelin J.Publisher:Cengage,
Industrial Motor ControlEngineeringISBN:9781133691808Author:Stephen HermanPublisher:Cengage Learning
Basics Of Engineering EconomyEngineeringISBN:9780073376356Author:Leland Blank, Anthony TarquinPublisher:MCGRAW-HILL HIGHER EDUCATION
Structural Steel Design (6th Edition)EngineeringISBN:9780134589657Author:Jack C. McCormac, Stephen F. CsernakPublisher:PEARSON
Fundamentals of Materials Science and Engineering...EngineeringISBN:9781119175483Author:William D. Callister Jr., David G. RethwischPublisher:WILEY
MATLAB: An Introduction with Applications
Engineering
ISBN:9781119256830
Author:Amos Gilat
Publisher:John Wiley & Sons Inc
Essentials Of Materials Science And Engineering
Engineering
ISBN:9781337385497
Author:WRIGHT, Wendelin J.
Publisher:Cengage,
Industrial Motor Control
Engineering
ISBN:9781133691808
Author:Stephen Herman
Publisher:Cengage Learning
Basics Of Engineering Economy
Engineering
ISBN:9780073376356
Author:Leland Blank, Anthony Tarquin
Publisher:MCGRAW-HILL HIGHER EDUCATION
Structural Steel Design (6th Edition)
Engineering
ISBN:9780134589657
Author:Jack C. McCormac, Stephen F. Csernak
Publisher:PEARSON
Fundamentals of Materials Science and Engineering...
Engineering
ISBN:9781119175483
Author:William D. Callister Jr., David G. Rethwisch
Publisher:WILEY