EBK MATERIALS SCIENCE AND ENGINEERING:
9th Edition
ISBN: 9781118357033
Author: Callister
Publisher: VST
expand_more
expand_more
format_list_bulleted
Question
Chapter 5.7, Problem 14QP
To determine
The carbon centration position for iron-carbon alloy.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
The following problem concerns dynamic storage allocation.
Consider an allocator that uses an implicit free list. The layout of each allocated and free memory block
is as follows:
31
2 1 0
Header
Block Size (bytes)
I
|
Footer
Block Size (bytes)
Each memory block, either allocated or free, has a size that is a multiple of eight bytes. Thus, only the 29
higher order bits in the header and footer are needed to record block size, which includes the header and
footer. The usage of the remaining 3 lower order bits is as follows:
⚫ bit 0 indicates the use of the current block: 1 for allocated, O for free.
⚫ bit 1 indicates the use of the previous adjacent block: 1 for allocated, O for free.
⚫ bit 2 is unused and is always set to be 0.
CPP41419 - Certificate IV in Real Estate Practice (1)
Given the contents of the heap shown on the left, show the new contents of the heap (in the right table)
after a call to free(0x400b010) is executed. Your answers should be given as hex values. Note that
the address grows from bottom up. Assume that the allocator uses immediate coalescing, that is, adjacent
free blocks are merged immediately each time a block is freed.
Address
0x400b028
0x00000012
Address
0x400b028
0x400b024
0x400b611c
0x400b024
0x400b611c
0x400b020
0x400b512c
0x400b020
0x400b512c
0x400b01c
0x00000012
0x400b01c
0x400b018
0x00000013
0x400b018
0x400b014
0x400b511c
0x400b014
0x400b511c
0x400b010
0x400b601c
0x400b010
0x400b601c
0x400b00c
0x00000013
0x400b00c
0x400b008
0x00000013
0x400b008
0x400b004
0x400b601c
0x400b004
0x400b601c
0x400b000
0x400b511c
0x400b000
0x400b511c
0x400affc
0x00000013
0x400affc
Chapter 5 Solutions
EBK MATERIALS SCIENCE AND ENGINEERING:
Ch. 5.7 - Prob. 1QPCh. 5.7 - Prob. 2QPCh. 5.7 - Prob. 3QPCh. 5.7 - Prob. 4QPCh. 5.7 - Prob. 5QPCh. 5.7 - Prob. 6QPCh. 5.7 - Prob. 7QPCh. 5.7 - Prob. 8QPCh. 5.7 - Prob. 9QPCh. 5.7 - Prob. 10QP
Ch. 5.7 - Prob. 11QPCh. 5.7 - Prob. 12QPCh. 5.7 - Prob. 13QPCh. 5.7 - Prob. 14QPCh. 5.7 - Prob. 15QPCh. 5.7 - Prob. 16QPCh. 5.7 - Prob. 17QPCh. 5.7 - Prob. 18QPCh. 5.7 - Prob. 19QPCh. 5.7 - Prob. 20QPCh. 5.7 - Prob. 21QPCh. 5.7 - Prob. 22QPCh. 5.7 - Prob. 23QPCh. 5.7 - Prob. 24QPCh. 5.7 - Prob. 25QPCh. 5.7 - Prob. 26QPCh. 5.7 - Prob. 27QPCh. 5.7 - Prob. 28QPCh. 5.7 - Prob. 29QPCh. 5.7 - Prob. 30QPCh. 5.7 - Prob. 31QPCh. 5.7 - Prob. 32QPCh. 5.7 - Prob. 33QPCh. 5.7 - Prob. 34QPCh. 5.7 - Prob. 35QPCh. 5.7 - Prob. 36QPCh. 5.7 - Prob. 37QPCh. 5.7 - Prob. 38QPCh. 5.7 - Prob. 39QPCh. 5.7 - Prob. 40QPCh. 5.7 - Prob. 41QPCh. 5.7 - Prob. 42QPCh. 5.7 - Prob. 43QPCh. 5.7 - Prob. 44QPCh. 5.7 - Prob. 1DPCh. 5.7 - Prob. 2DPCh. 5.7 - Prob. 3DPCh. 5.7 - Prob. 4DPCh. 5.7 - Prob. 5DPCh. 5.7 - Prob. 1FEQPCh. 5.7 - Prob. 2FEQP
Knowledge Booster
Similar questions
- Calculate the neutral current in a 120/240-volt, single-phase system when the current inphase A is 20 amperes and the current in phase B is 40 amperes. The load is resistive. Calculate the neutral current in a 208Y/120-volt, 3-phase, 4-wire system when thecurrent in phase A is 0, in phase B is 40, and in phase C is 60 amperes. The load isresistivearrow_forwardYour programming buddy notices that your code has some race conditions, and draws up the following locking mechanism: int locked = 0; void lock() { while (locked == 1) { } continue; // keep looping locked = 1; void unlock() { } locked = 0; Because the load-increment-store sequence is the critical section of your program, you place a call to lock() immediately before the i++ line, and a call to unlock() immediately after. However, running your supposedly-now-threadsafe program again, you discover that the output is still nondeterministic. Turns out your buddy's clever locking scheme doesn't do a very good job protecting the critical section after all. (Note: unlike semaphore locking and unlocking functions, lock() and unlock() DO NOT execute atomically.) C. Give an execution sequence of two threads in the lock() function that would end up with both threads holding the lock at the same time.arrow_forwardCalculate the neutral current in a 208Y/120-volt, 3-phase, 4-wire system when the current in phase A is 20, in phase B is 40, and in phase C is 60 amperes. The load is resistive.arrow_forward
- I need expert to solve this,if you don't know don't attempt,also show the signal flow diagramarrow_forwardSuppose we alter do stuff to look as follows: void *do_stuff(void *arg attribute ((unused))) { int a; for (a = 0; a < 1000; a++) i++; return NULL; } Because the code is not optimized, there will be one load-increment-store sequence per iteration of the loop. B. For each number, tell whether or not our program could output it, and briefly explain why or why not. • 2000 • 1500 . 2 1arrow_forwardThe following problem concerns the way virtual addresses are translated into physical addresses. Thememory is byte addressable. • Memory accesses are to 1-byte words (not 4-byte words). • Virtual addresses are 16 bits wide. • Physical addresses are 13 bits wide. •The page size is 512 bytes. • The TLB is 8-way set associative with 16 total entries. • The cache is 2-way set associative, with a 4 byte line size and 16 total lines. In the following tables, all numbers are given in hexadecimal. The contents of the TLB, the page table for the first 32 pages, and the cache are as follows: TLB Page Table 2-way Set Associative Cache Index Tag PPN Valid VPN PPN Valid VPN PPN Valid Index Tag Valid Byte 0 Byte 1 Byte 2 Byte 3 Tag Valid Byte 0 Byte 1 Byte 2 Byte 3 0 09 4 1 00 6 1 10 0 1 0 19 1 99 11 23 11 00 0 99 11 23 11 12 2 1 01 5 0 11 5 0 1 15 0 4F 22 EC 11 2F 1 55 59 OB 41 10 0 1 02 3 1 12 2 1 2 1B 1 00 02 04 08 OB 1 01 03 05 07 08 5 03 4 1 13 4 0 3 06 0 84 06 B2 9C 12 0 84 06 B2 9C 05 7 1 04…arrow_forward
- Part II (8 points) int counter = 0; void handler(int sig) { counter++; } int main() { int i; signal(SIGCHLD, handler); for (i = 0; i < 5; i ++){ if (fork() == 0){ } } exit(0); /* wait for all children to die */ while (wait(NULL) != -1); printf("counter = %d\n", counter); return 0; } A. Does the program output the same value of counter every time we run it? Yes No B. If the answer to A is Yes, indicate the value of the counter variable. Otherwise, list all possible values of the counter variable. Answer: counter =arrow_forwardA useful helper function for opening a socket connection to a server was introduced in the course: int open_clientfd(char *hostname, int port) { int clientfd; struct hostent *hp; struct sockaddr_in serveraddr; if ((clientfd = socket(AF_INET, SOCK_STREAM, 0)) h_addr_list[0], (char *)&serveraddr.sin_addr.s_addr, hp->h_length); serveraddr.sin_port = htons(port); /* Establish a connection with the server */ if (connect(clientfd, (SA *) &serveraddr, sizeof(serveraddr)) < 0) return -1; return clientfd; } The problem with this function is that it is not thread safe: it uses function gethostbyname, which returns a pointer to a static variable. On the following page, reimplement open_clientfd in a thread safe way using the lock-and-copy technique. (Note 1: that the new function will take an additional input: a semaphore that will control access to the critical section so only one thread at a time can call gethostbyname and read the result stored in a static variable. Note 2: a call to malloc is…arrow_forwardA. The box below shows the format of a virtual address. Indicate (by labeling the diagram) the fields (if they exist) that would be used to determine the following: (If a field doesn't exist, don't draw it on the diagram.) VPO The virtual page offset VPN The virtual page number TLBI The TLB index TLBT The TLB tag 15 14 13 12 11 10 98 76543210 B. The box below shows the format of a physical address. Indicate (by labeling the diagram) the fields that would be used to determine the following: PPO The physical page offset PPN The physical page number CO The block offset within the cache line The cache index Cl ст The cache tag 12 11109876543210arrow_forward
- Suppose we have a program as follows: #include #include int i = 0; void *do_stuff(void *arg) { } i++; return NULL; int main() { } pthread_t tid1, tid2; pthread_create(&tid1, NULL, do_stuff, NULL); pthread_create(&tid2, NULL, do_stuff, NULL); pthread_join(tid1, NULL); pthread_join(tid2, NULL); printf("%d\n", i); return 0; Recall that because i is a global variable, i++; will compile to something like this: 400728: 8b 04 25 40 10 60 00 mov 0x601040,%eax 40072f: 83 c0 01 add $0x1,%eax 400732: 89 04 25 40 10 60 00 mov %eax,0x601040 A. (8 points) What are all possible outputs of this program? For each output, explain how the kernel could interleave execution of the two child threads to produce it.arrow_forwardFor the given virtual address, indicate the TLB entry accessed, the physical address, and the cache byte value returned in hex. Indicate whether the TLB misses, whether a page fault occurs, and whether a cache miss occurs. If there is a cache miss, enter "-" for "Cache Byte returned". If there is a page fault, enter "-" for "PPN" and leave parts C and D blank. Virtual address: 1DDE A. Virtual address format (one bit per box). 15 14 13 12 11 10 9 8 7 6 4 3 2 1 0 B. Address translation Parameter Value VPN Ox TLB Index Ox TLB Tag Ox TLB Hit? (Y/N) Page Fault? (Y/N) PPN Ox C. Physical address format (one bit per box) 12 11 10 9 8 765 D. Physical memory reference Parameter Value Byte offset Ox Cache Index Ox Cache Tag Ox Cache Hit? (Y/N) Cache Byte returned Ox 4 3 2 1 0arrow_forwardConsider the C program below. (For space reasons, we are not checking error return codes, so assume that all functions return normally.) int main() { if (fork() == 0) { if (fork() == 0) { printf("3"); } pid_t pid; int status; wait(&status)) > 0) { printf("4"); } else { if ((pid } } } else { } printf("2"); exit(0); printf("0"); return 0; For each of the following strings, circle whether (Y) or not (N) this string is a possible output of the program. A. 32040 Y N B. 34002 Y N C. 30402 Y D. 23040 E. 40302 Y > > Y N Z Z Z N Narrow_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