WGU D684 - INTRODUCTION TO
COMPUTER SCIENCE - SECTION 4
QUESTIONS & ANSWERS
address binding - ANSWERthe process of mapping a program's symbolic addresses to
physical addresses in memory
application software - ANSWERprograms designed to help users perform specific tasks,
such as word processing, web browsing, or gaming
batch processing - ANSWERa method of executing a series of jobs on a computer
without manual intervention where tasks are processed in batches
base register - ANSWERa register in the CPU that holds the starting address of the
current memory segment; used in address translation
bounds register - ANSWERa register that holds the ending address of a memory
segment, ensuring that memory accesses stay within the allocated range
context switch - ANSWERthe process of storing and restoring the state of a CPU so
multiple processes can share a single CPU
CPU scheduling - ANSWERthe method by which an operating system decides which
processes should be executed by the CPU and in what order
demand paging - ANSWERa memory management scheme where pages of data are
brought into memory only when they are needed rather than in advance
dumb terminal - ANSWERa simple display and input device with no processing power
relying on a central computer for computing tasks
dynamic partition technique - ANSWERa memory management method where memory
is divided into variable-sized partitions based on the needs of processes
first-come, first-served (FCFS) - ANSWERa CPU scheduling algorithm that processes
requests in the order they arrive without priority
fixed partition technique - ANSWERa memory management method where memory is
divided into fixed-sized partitions, each holding one process
frame - ANSWERa fixed-size block of physical memory used in paging systems to hold
pages of virtual memory
COMPUTER SCIENCE - SECTION 4
QUESTIONS & ANSWERS
address binding - ANSWERthe process of mapping a program's symbolic addresses to
physical addresses in memory
application software - ANSWERprograms designed to help users perform specific tasks,
such as word processing, web browsing, or gaming
batch processing - ANSWERa method of executing a series of jobs on a computer
without manual intervention where tasks are processed in batches
base register - ANSWERa register in the CPU that holds the starting address of the
current memory segment; used in address translation
bounds register - ANSWERa register that holds the ending address of a memory
segment, ensuring that memory accesses stay within the allocated range
context switch - ANSWERthe process of storing and restoring the state of a CPU so
multiple processes can share a single CPU
CPU scheduling - ANSWERthe method by which an operating system decides which
processes should be executed by the CPU and in what order
demand paging - ANSWERa memory management scheme where pages of data are
brought into memory only when they are needed rather than in advance
dumb terminal - ANSWERa simple display and input device with no processing power
relying on a central computer for computing tasks
dynamic partition technique - ANSWERa memory management method where memory
is divided into variable-sized partitions based on the needs of processes
first-come, first-served (FCFS) - ANSWERa CPU scheduling algorithm that processes
requests in the order they arrive without priority
fixed partition technique - ANSWERa memory management method where memory is
divided into fixed-sized partitions, each holding one process
frame - ANSWERa fixed-size block of physical memory used in paging systems to hold
pages of virtual memory
