C191: Operating Systems for Programmers

0.0(0)
studied byStudied by 2 people
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/312

encourage image

There's no tags or description

Looks like no tags are added yet.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

313 Terms

1
New cards

Secure

Protects the integrity of a system. A system whose resources are used and accessed as intended under all circumstances.

2
New cards

Cracker

Someone attempting to breach security.

3
New cards

Threat

The potential for a security violation.

4
New cards

Attack

An attempt to break security.

5
New cards

Denial-of-Service (DoS)

An attack that attempts to disrupt or prevent legitimate use of a system.

6
New cards

Trojan Horse

A code segment that tries to misuse its environment.

7
New cards

Virus

A malicious fragment of code embedded in a legitimate program.

8
New cards

Worm

Similar to a virus, but self replicates throughout a network.

9
New cards

Domain

Specifies resources a process may access. Specifies a set of objects and the operations that may be invoked on those objects. Set of access rights.

10
New cards

Protection

A mechanism for controlling the access of programs, processes, or users to the resources defined by a computer system.

11
New cards

Security

Requires not only an adequate protection of system, but also consideration of the external environment within which the system operates (i.e., threats and attacks).

12
New cards

Breach of Confidentiality

Gaining access to information, credit card numbers, personal information, etc.

13
New cards

Breach of Integrity

Modified data.

14
New cards

Breach of Availability

Destruction of data.

15
New cards

Theft of Service

Unauthorized use of resources such as using a server as a personal file server.

16
New cards

Trap Door

A hole purposely left in a software program that only the programmer is capable of using.

17
New cards

UNIX Domain Association

A UNIX domain is associated with a user.

18
New cards

Masquerading

The most common method used by an attacker.

19
New cards

Principle of Least Privilege

Where just enough privilege is given to perform a task.

20
New cards

Need-to-Know Principle

Where a process is only given access to resources it currently needs.

21
New cards

Copy and Owner Rights

Rights needed to change entries in a column of an access matrix.

22
New cards

Control Rights

Rights needed to change entries in a row of an access matrix.

23
New cards

Role-Based Access Control

A type of control where privileges and programs are assigned roles, and users are assigned roles based on passwords.

24
New cards

Compiler-Based Enforcement

A type of enforcement where protection needs are declared rather than programmed.

25
New cards

Kernel-Based Enforcement

Enforcement provided by the subsystem designer.

26
New cards

The 4 Levels of Security

Physical - site must be secured.
Human - only appropriate users have access.
OS - system must be able to protect itself.
Network - network must be secured.

27
New cards

Logic Bomb

A security incident initiated when certain logical conditions are met.

28
New cards

Stack and Buffer Overflow

A tactic used to gain access to a system by writing into the stack so that a return address will specify malicious code to be run.

29
New cards

Symmetric Encryption

A type of encryption where the same key is used to encrypt and decrypt.

30
New cards

Asymmetric Encryption

A type of encryption where 2 different keys are used to encrypt and decrypt.

31
New cards

Encryption

Places constraints on the receivers.

32
New cards

Authentication

Places constraints on the senders.

33
New cards

SSL

Allows two computers to communicate securely.

34
New cards

Passwords

The most common authentication mechanism.

35
New cards

Digital Certificate

A public key that has been digitally signed by a certificate authority.

36
New cards

Paired Passwords

One is provided by the system and the other is provided by the user.

37
New cards

Two-Factor Authentication

Authentication using something you know and something you have.

38
New cards

Intrusion Detection System (IDS)

Detects attempted or successful intrusions into a system or network.

39
New cards

Intrusion Prevention System (IPS)

Detects and attempts to prevent an intrusion into a system or network.

40
New cards

Port

A connection point via which an OS communicates with a device.

41
New cards

PCI Bus

The common system bus connecting the process-memory subsystem to fast devices.

42
New cards

Interrupt

The hardware mechanism that enables a device to notify the CPU.

43
New cards

Buffer

A memory area that stores data being transferred between two devices or between a device and an application.

44
New cards

Cache

A region of fast memory that holds copies of data.

45
New cards

Platter

A circular, metal disk used for the magnetic storage of data within a hard-disk drive.

46
New cards

iSCSI

A network-attached storage protocol, utilizing the IP network protocol to carry the SCSI protocol, instead of using SCSI cables.

47
New cards

Logical Formatting

The creation of a file system.

48
New cards

Network Attached Storage (NAS)

A special-purpose storage system that is accessed remotely over a data network.

49
New cards

Solid State Disk (SSD)

Utilizes non-volatile memory (DRAM) to behave like a traditional disk drive but utilizes no moving parts. Has no latency or seek times.

50
New cards

File

A logical storage unit as defined by the OS.

51
New cards

Text File

A sequence of characters organized into lines, possibly pages.

52
New cards

Source File

A sequence of functions, further organized as declarations followed by an executable statement.

53
New cards

Executable File

A series of code sections that the loader can bring into memory and execute.

54
New cards

Name

A file attribute defining the symbolic file name in human-readable format.

55
New cards

Identifier

A unique tag which identifies a file within the file system in non-human-readable format.

56
New cards

Open-File Table

An OS table containing information about all open files.

57
New cards

Sequential Access

An access method where the information in the file is processed in order, one record after another.

58
New cards

Direct Access

An access method allowing programs to read and write records rapidly in no particular order.

59
New cards

Sector

A subdivision of a track, usually 512 bytes.

60
New cards

Track

A circular path on the surface of a disk, broken up into sectors.

61
New cards

Cluster

Multiple blocks grouped together.

62
New cards

Block

A sector or group of sectors that the operating system can address. The smallest unit of transfer.

63
New cards

Common File Attributes

Name, identifier, type, location, size, protection, time, date, and user information.

64
New cards

Control Register

Can be written to by the host to start a command or to change the mode of an I/O device.

65
New cards

Status Register

Contains bits that can be read by the host to convey the status of I/O devices.

66
New cards

Data-Out Register

Written by the host to send output to I/O devices.

67
New cards

Data-In Register

Read by the host to get input from I/O devices.

68
New cards

Constant Linear Velocity (CLV)

Where the density of bits per track is uniform and the speed changes.

69
New cards

Constant Angular Velocity (CAV)

The density of bits decreases from inner tracks to outer tracks to keep the data rate constant.

70
New cards

Low-Level Formatting (Physical Formatting)

Divides and fills the disk with a special data structure for each sector. Must be done before a disk can store data.

71
New cards

PCI Express (PCIe)

Has a throughput of up to 16 GB per second.

72
New cards

HyperTransport

Has a throughput of up to 25 GB per second.

73
New cards

Interrupt-Controller Hardware Features

The ability to defer interrupt handling during critical processing.

An efficient way to dispatch to the proper interrupt handler for a device without first polling all the devices to see which one raised the interrupt.

Multilevel interrupts, so that the operating system can distinguish between high- and low-priority interrupts and can respond with the appropriate degree of urgency.

74
New cards

Direct Memory Access (DMA) Controller

A special processor that avoids programmed I/O by writing a command block into memory. This block contains a pointer to the source of a transfer, a pointer to the destination of the transfer, and a count of the number of bytes to be transferred. The CPU writes the address of this command block to the controller.

75
New cards

Block-Device Interface

Captures all the aspects necessary for accessing disk drives and other block-oriented devices.

76
New cards

Character-Stream Interface

A set of basic system calls that an application can use to get() or put() one character.

77
New cards

Raw

I/O accesses a block device as a simple array of blocks, bypasses all file system services.

78
New cards

Contiguous Allocation

File occupies a set of contiguous blocks on the disk and can be accessed using sequential or direct access.

79
New cards

Blocking System Call

Wherein the execution of the application is suspended.

80
New cards

Spool

A buffer that holds output for a device that cannot accept interleaved data streams.

81
New cards

Sense Key

Identifies the general nature for a failure in a SCSI device.

82
New cards

Additional Sense Code

States the category of failure, such as a bad command parameter or a self-test failure.

83
New cards

Additional Sense Code Qualifier

Gives even more detail, such as which command parameter was in error or which hardware subsystem failed its self-test.

84
New cards

Terminal Concentrator

A front-end processor that multiplexes the traffic from hundreds of remote terminals into one port on a large computer.

85
New cards

Local I/O Ports

Where host-attached storage is accessed.

86
New cards

I/O Processing Improvement

Can be done by moving processing primitives into hardware.

87
New cards

Swap Space Management

The main goal for the design and implementation of swap space is to provide the best throughput for the virtual memory system.

88
New cards

RAID 5

The most common RAID level.

89
New cards

First-Come-First-Serve (FCFS) Disk Head Scheduling Algorithm

A disk head scheduling algorithms that does not take into account the current position of the disk head.

90
New cards

Linked Allocation

The file-allocation table (FAT) used in MS-DOS is an example of this.

91
New cards

Immutable File Key Properties

Its name may not be reused and its contents may not be altered.

92
New cards

Mount Point

The location within the file structure where the file system is to be attached.

93
New cards

Write-Anywhere File Layout (WAFL)

Used exclusively on networked file servers where clones are similar to snapshots and part of the caching uses non-volatile RAM (NVRAM).

94
New cards

Storage Area Network (SAN)

A private network connecting servers and storage units.

95
New cards

Unified Buffer Cache

Contains the same pages for memory-mapped I/O as well as ordinary I/O.

96
New cards

Double Caching

Where the contents of the file in the buffer cache are copied into the page cache. Wastes memory and significant CPU and I/O cycles.

97
New cards

DMA Controller Port Location

000-00F.

98
New cards

Interrupt Controller Port Location

020-021.

99
New cards

Game Controller Port Location

200-20F.

100
New cards

Serial Port (Secondary) Port Location

2F8-2FF.