CSE 120- Final Exam Guide - Comprehensive Notes for the exam ( 62 pages long!)
29 Mar 2018
School
Department
Course
Professor
Document Summary
Io resources (be able to interact via mouse, keyboard, etc. ) Stack : created by compiler so that your program can actually run. Heap (memory that is dynamically allocated by the programmer"s instructions ) ----- gigantic space in between where data and stack grow towards each other. Stack of activation records, one per pending procedure. Local vars - automatically created whenever a procedure is made. At some point, it needs a resource (anything that helps to make progress) Allocates cpu from one process to another: save context of currently running process, restore (load) context of next process to run. Switches stacks that contain a different set of activation records! Pc - stores contents of the next instruction to run. So that we save the address of if magic == 1 statement instead of asm save sp ! Has its own text, data, and multiple stacks. System call - trap instruction which causes a jump into the kernel.
