security plus study guide

more specific, but it's not quite understandable how the cache works, because there's some abstraction.This week's code hostingCode Link: https://git.oschina.net/929210354/LinuxLearning progress Bar lines of code (new /Cumulative) Blog volume ( new/cumulative) Learning time (new/cumulative) Important growth Goal 5000 rows 30 Articles 400 hours First week 0/0 1/2 10/10 Installing a Lin

time, metadata, by invoking the stat and FSTAT functions. #include The stat function takes a file name as input, and the ftast as input with a filename descriptor. Learning progress Bar Code lines (new/cumulative) Blog volume (new/cumulative) Learning Time (new/cumulative) important growth Goal 5000 rows 30 Articles 400 hours Seventh Week 1300/1750 11/11 140/140

) or positive (s=0), and the sign bit with the value 0 is interpreted as a special case.Mantissa: M is a binary decimal order: E is weighted against floating-point numbers and can be negativeFloat:s=1 bit, exp=8 bit, frac=23 bitDouble:s=1 bit, exp=11 bit, frac=52 bit2. Integers and floating-point numbers indicate the relationship of the same number:P74: The relative region corresponds to the low of the integer, just before the highest significant bit equal to one stop, and a floating point repre

address to a low address. Each invocation of each function has its own stack frame, which maintains all the necessary information. Register EBP points to the point of the current stack frame (high address), register ESP points to the top of the current stack frame (low address). Heterogeneous data structure The struct declaration of the C language creates a data type that aggregates objects that may be different types into an object. All components of the Structure are stored in a

particular trajectory through the execution state space, forgetting a guideline that the threaded program must work correctly for any viable trajectory.2. Elimination Method:Dynamically assigns a separate block to each integer ID, and passes to the thread routine a pointer to the block4. Deadlock1. A set of threads is blocked, waiting for a condition that will never be true. Programmers use P and V to operate improperly so that the forbidden areas of two semaphores overlap. Overlap

unsigned number to a larger data type, representing the beginning plus 0.Symbol extension-Converts a complement number to a larger data type.Three, integer arithmeticUnsigned number additionAn arithmetic operation overflow that indicates that a complete integer result cannot be placed into the word length limit of the data type.Multiply Constants either unsigned or complement operations, multiplying by a power of 2 results in overflow. Four, floating

functions:ptr定义为typedef void *ptr PTR isptr (PTR p): if p points to a word in an allocated block, it returns a pointer B to the starting position of the block, otherwise returns null int blockmarked (PTR b): Returns TRUE if Block B is already marked int blockallocated (PTR b): If block B is allocated, then long returns ture void Markblock (PTR b): Tag block B int length (PTR b): Returns the length in words of block B, excluding the head void Unmarkblock (PTR b): Cha

1. Machine-Level Code(1) Two kinds of abstract Defines the format and behavior of machine-level programs by ISA The memory address used by the machine-level program is the virtual address 2. Data format3. Operand designator4. Press in and eject stack data Follow the principle of first in and out Push Press in, pop delete Pushq press four words into the stack popq four words pop-up stack 5. Arithmetic and logical operations LEAQ Load Valid address INC

address addressing, relative base address addressing, proportional addressing mode, base address proportional address mode, and relative base address proportional addressing modeV. directivesmov--transmitting dataadd--Plussub--minusimul--Multiply (signed)xor--XORor--orand--andleal--delivery addressinc--Plus Onedec--minus Oneneg--take negative?not--to take the supplement?Sal (SHL)--shift leftsar--Arithmetic Right Shiftshr--Logical Right Shiftloop--Cyc

implements a finite integer operation compared to a real integer operation, with some special properties: because of overflow, the expression x*x can produce negative numbers. However, both unsigned and complement operations satisfy many of the other properties of integer operations, including binding laws, commutative laws, and distributive laws. This allows the compiler to do a lot of optimizations. We've seen several clever ways to use bit-level arithmetic and arithmetic operations: (1) us

Division Instruction no definition for all condition code bits Bit operations Directives :and logic with or logical or not logic does not affect the flag bit XOR or test instruction except for the four kinds of, set CF, of 0,af undefined, SF,ZF, PF sets the shift instruction based on the result of the operation:SHL logical left SHIFT instruction SHR logical Right SHIFT instruction shift instruction based on result set SF,ZF,PF bit ROL loop left shift instruction ROR loop right Shift instructio

cause a set of states called deadlock zones. Deadlock is a rather difficult problem because it is unpredictable. Mutex lock Order rule : If for each pair of mutex (S,T) in the program, assign a whole order to all the locks, each thread requests the lock in this order, and is released according to reverse, the program is deadlock-free.How to resolve a deadlock do not let a deadlock occur: Static strategy: Design appropriate resource allocation algorithm, do not le

-feeling bad, read a lot of confusion, code execution is also less. This week's code package gives me a good chance to practice understanding! So I just took the code out of the video in handy. The feeling learned a lot of content. In particular, the function of fork such functions are in the execution of the code to feel its principle. It was really touching when I finished it!!!Because there is also a recent project of this course, the internet also searched a lot of communication between the

overlap. If one of the execution trajectories happens to reach the deadlock state D then there is no further progress, since overlapping blocks block progress in each legal direction. In other words, the program is deadlocked because each thread waits for a V operation that is not possible at all.Deadlock is a rather difficult problem because it is not always predictable. Some lucky lines of execution will bypass the deadlock area, while others will fall into the area.20135210 Ellis--The basic