Download CNIT 176 Exam 3 Solutions: Data Structures, Operating Systems, and Boot Processes and more Exams Wireless Networking in PDF only on Docsity!
solutions.2025-
CNIT 176 Exam 3 with 134 accurate
solutions.2025- 2026
Abstract data type - ANSWER A data type whose properties (data and operations) are specified independently of any particular implementation
LIFO - ANSWER last in first out
Composite data type - ANSWER A data type in which a name is given to a collection of data values
List - ANSWER "container of items", logical operations that can be applied are: Add item, Remove item, Get next item, or More items
Container - ANSWER Object's whole role is to hold and manipulate other objects
Stack - ANSWER An abstract data type in which accesses are made at only one end (LIFO)
Data structure - ANSWER Implementation of composite data fields in an abstract data type
Push - ANSWER insert on a stack
Array- based - ANSWER Objects in the container are kept in an array
Pop - ANSWER delete on a stack
Linked-based - ANSWER Objects in the container are not kept physically together, but each items tells you where to go to get the next one in the structure
solutions.2025-
Queue - ANSWER An abstract data type in which items are entered at one end and removed from the other end (FIFO)
FIFO - ANSWER first in first out
Multiprogramming - ANSWER the technique of keeping multiple programs in main memory at the same time
Frame - ANSWER a fixed size portion of main memory that holds a process page
Batch processing - ANSWER The first operating system was a human operator who organized various jobs from multiple users into batches of jobs that needed the same resources
Page - ANSWER a fixed size portion of a process that is stored into a memory frame
Time sharing - ANSWER allows multiple users to interact with a computer at the same time
Swap - ANSWER the act of bringing in a page from secondary memory, which often causes another page to be written back to secondary memory
Thrashing - ANSWER inefficient processing caused by constant page swaps
Single Contiguous Memory Management - ANSWER only 2 programs in memory- operating system and application program
Process control block - ANSWER a data structure used by the operating system to manage information about a process
Fixed partitions - ANSWER memory is divided into fixed number of partitions in which programs can be loaded
solutions.2025-
Worst fit - ANSWER allocate program to the biggest partition able to hold it
BIOS - ANSWER Where hardware meets software, and where all the boot magic begins; BIOS code is baked into the motherboard of your pc, usually stored on what is called an EEPROM and is considerably hardware specific.
Partition table - ANSWER an index of up to four partitions that exist on the same disk, a table of contents
MBR - ANSWER Master Boot Record: Located at the first sector of a hard disk, the MBR identifies how and where the OS is located so that it can be loaded into main RAM.
JMP Instruction - ANSWER assembly equivalent of a goto command
Active partition - ANSWER Partition on a hard drive where the OS boots off of, also called a bootable partition
Boot menu - ANSWER When a computer is booting up the bios will allow the user to access the boot menu if a certain key is pressed (normally F2, F12 or esc.) From the boot menu the user can select a bootable device to load.
Bootloader - ANSWER A program that loads an operating system when a computer is turned on. The bootsector loads and runs the bootloader from its filesystem. When the bootloader is finally executed, it loads its configuration/database from files on the same partition.
OS Kernel - ANSWER Communicates with and controls the hardware
EEPROM - ANSWER where the BIOS code is baked into the motherboard of your PC, considerably hardware-specific.
solutions.2025-
Dual/ Multibooting - ANSWER Support for loading multiple operating systems
POST - ANSWER Power-On Self Test
NTLDR - ANSWER the default bootloader for Windows NT, 2000, and XP; BOOT.INI on the active partition contains the list of operating systems and their locations; NTDETECT.COM is a helper program that runs to detect hardware and identify devices
BOOTMGR - ANSWER the new Windows and is used on Windows Vista, 7, 8, and 10; list of operating systems is now read from the BCD file in the BOOT directory on the active partition; is self-contained, and does not need any helper programs or routines
GRUB - ANSWER the most popular bootloader for Linux, though it can boot numerous other OSes as well; its boot settings are stored in a file usually called grub.cfg (GRUB2) or menu.lst (GRUB); GRUB is a modular bootloader can load additional modules from disk
Boot device - ANSWER any piece of hardware that can read or contains the files required for a computer to start. For example, Floppy disk, CD, DVD, and USB Flash Drive are considered bootable devices
Startup disk - ANSWER Hard drive where the BIOS loads a very small program and tells the CPU to execute its contents, handing off control of the computer to whatever is on the hard drive and ending, its active role in loading your PC. Also called a "the boot device" or "drive 0"
Drive - ANSWER An electromechanical device that contains and reads and writes magnetic disks, optical discs or magnetic tapes
Filesystem drivers - ANSWER give the bootloader the ability to read, at the very least, the filesystem it is located on
Firmware - ANSWER permanent software programmed into read-only memory
solutions.2025-
FAT 32 - ANSWER LFN, 2TB volume size limit, 4gb file size limit, share security only
MFT - ANSWER master file table
First 16 records are metadata files that describe the volume - ANSWER
First record stores the MFT value - ANSWER
Each file has an MFT entry - ANSWER
Cluster - ANSWER groups of one or more blocks
Contiguous - ANSWER the blocks that hold a particular file are stored together
Non contiguous - ANSWER the blocks that hold a particular file are scattered all over the device
I-node - ANSWER indexed file allocation. Advantages: fast for small blocks, can accommodate very large files
Random / relative access - ANSWER data files whose records can be retrieved from anywhere in the file random sequence
Indexed access - ANSWER additional means for accessing and viewing records in a file
Logical view - ANSWER reference to a stored value relative to the program making the reference
Physical view - ANSWER actual address in main memory
solutions.2025-
Abstraction - ANSWER a model of a complex system that includes only the details essential to the viewer
Array length - ANSWER the length of the array (?)
Index of last item - ANSWER The total length of the array -1 (mIndex - 1 if looking for last data entry in an array that may not be full).
Phases of computer problem solving - ANSWER identify the problem > understand the problem > identify alternative solutions > select the best solution > list instruction to solve problem > evaluate the solution
Sequential search - ANSWER search begins at the beginning of the list and continues until the item is found or the entire list has been searched
Algorithm - ANSWER a set of unambiguous instructions for solving a problem or subproblem in a finite amount of time using a finite amount of data
Abstract step - ANSWER an algorithmic step containing unspecified details.
Concrete step - ANSWER an algorithmic step in which all details are specified
Record - ANSWER a named heterogeneous collection of items in which individual items are accessed by name (ex. Bundle name, age and hourly wage items into a record named Employee)
Array - ANSWER a named homogeneous collection of items in which an individual item is accessed by its position (index) within the collection
Control structure ( if then, loops) - ANSWER an instruction that determines the order in which other instructions in a program are executed
solutions.2025-
A program may often make reference to variables physical address in memory - ANSWER false
In paged memory management, memory is organized into fixed sized frames - ANSWER true
Application software is written to solve problems in the real world - ANSWER true
In partitioned memory management an application program is separated into pieces and loaded into multiple partitions - ANSWER false
In dynamic partition memory management, the partitions are created as needed when jobs arrive - ANSWER true
Distinguish between an array-based visualization and a linked visualization - ANSWER Linked means they are in different locations but linked together whereas array-based are actually next to one another
Distinguish between an array and a list - ANSWER Array contains items all of the same type whereas a list does not.
Distinguish between and an unsorted list and a sorted list - ANSWER Unsorted = not sorted. Sorted = yes.
Distinguish between the behavior of a stack and a queue - ANSWER Stack = LIFO, Queue = FIFO
Describe the two main responsibilities of an operating system - ANSWER manages resources, and these resources are often shared in one way or another among programs that want to use them
Define memory and process management - ANSWER Memory management: the process of keeping track of what programs are in memory and where in memory they reside. Process management: the act of managing the use of the CPU by individual processes
solutions.2025-
Explain how timesharing creates the virtual machine illusion - ANSWER Seems like they have access to the same computer resources
Explain the relationship between logical and physical addresses - ANSWER Logical is the reference to a stored value relative to the program making the reference. Physical is the actual address in the main memory.
Compare and contrast memory management techniques - ANSWER Single contiguous memory management = only OS and application program in main memory. Partition memory management = memory is cut up into partitions
Distinguish between fixed and dynamic partitions - ANSWER Fixed = memory is divided into "fixed" number of partitions. Dynamic = partitions are created as needed.
Define and apply partition selection algorithms - ANSWER Best fit: find where it fits best. Worst fit: you find the biggest block able to fit the file. First fit: find the first block that will fit the file.
Explain how demand paging creates the virtual memory illusion - ANSWER The illusion that there is no restrictions to size of a program
Explain the processing of various CPU scheduling algorithms - ANSWER First come first serve - whatever is there first, gets processed first. Round Robin - there is a set time, and they all take turns. Shortest job next: does the short processes before the longer ones.
Explain the role of BIOS in the boot sequence - ANSWER Regardless of whether the BIOS was configured to boot from a local hard disk or from a removable USB stick, the handoff sequence is the same. Once the BIOS POST and Add-On ROM procedures have completed, the BIOS loads the first 512 bytes from the hard drive of the selected boot device - these 512 bytes are what is commonly known as the Master Boot Record (MBR)
Explain the steps in the process of bootstrapping that are consistent between systems - ANSWER BIOS > MBR > Active Partition > Bootloader
solutions.2025-
Give examples of file systems for Windows and *nix (Unix/Linux) - ANSWER Windows = FAT, FAT32, NTFS. Unix = ext3, ext4, xfs, ufs/ufs
Differentiate between hard and symbolic links - ANSWER Symbolic links are like shortcuts to a file, they can be used to reach the file but deleting the symbolic link does not impact the file itself. Hard link is the opposite, deleting it would impact the file, this is like the folder that houses the file.
