Home > Search Results

memory


sort by: Relevancy | Title try advanced search for more options

  1. Memory I

  2. Memory II

  3. Memory III

  4. Memory-less sources, prefix free codes, and entropy

  5. More Detail about Activation Records - Layout of Memory During a Function Call, How the Return Address of a Function is Stored on the Stack, Example Showing How an Activation Record is Constructed on the Stack, Setting Up Function Parameters on the Stack, Using the Call Instruction to Jump to the Function, Cleaning Up at the End of a Function and Using the RET Instruction and the Saved Return Address to Return to the Original Function, Gen...more

  6. Moving from C Code Generation to C++ Code Generation: Basic Swap Example, Code Generation for the Pointer Swap Function, Code Generation for the C++ Version Of Swap Using References, Which Are Treated as Automatically Dereferenced Pointers, Local Variables Declared as References, Difference Between References and Pointers, Effect Of Declaring a Class on Memory in the Stack, Class Methods, Which Take a "This" Pointer as An invisible First P...more

  7. Professor Diamond continues her discussion of the nervous system with an introduction of the cerebral hemisphere and it is divided into lobes with specific functions. She uses Brodmann's numbering system as she draws the location of lobes and areas of the brain, including the precentral, postcentral, and premotor gyri, the central sulcus, motor cortex, frontal eye fields, and prefrontal lobe. She details the functions of the prefrontal lob...more

  8. Basic concepts of operating systems and system programming. Utility programs, subsystems, multiple-program systems. Processes, interprocess communication, and synchronization. Memory allocation, segmentation, paging. Loading and linking, libraries. Resource allocation, scheduling, performance evaluation. File systems, storage devices, I/O systems. Protection, security, and privacy.

  9. Pointer Movie, Pointer Operations: Code & Pointer Memory Diagrams, Pointer Basics, Pointer and Dynamic Arrays, Use of Pointers, Recursive Data, A Recursive Structure, Live Demo: Working with Linked List, Building the List

  10. Hawkins talks on the importance and inevitability of portablity. With portability comes small size, low cost, simplicity and the need for less power. With wireless networks on their way to becoming very inexpensive, Hawkins envisions a T1 line with high horse power and large memory in the pocket! The need for portability will make the item in your pocket the center of your universe, he says. He notes that there will be obstacles, but belie...more