FUNCTION AND TYPE OF AN OS

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

1/66

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.

67 Terms

1
New cards

WHAT IS A PROCESS?

A PROCESS IS A PROGRAM THAT IS BEING EXECUTED BY THE CPU.

2
New cards

A _____ IS A PROGRAM THAT IS BEING EXECUTED BY THE CPU.

PROCESS

3
New cards

WHAT IS THREAD?

A thread is a smaller unit of a process.

4
New cards

_____ is a smaller unit of a process.

THREAD

5
New cards

_____ are called “lightweight processes” because they share memory and resources, making them faster than full processes.

THREADS

6
New cards

THREADS

are called “lightweight processes” because they share memory and resources, making them faster than full processes.

7
New cards

THREADS are called _____ because they share memory and resources, making them faster than full processes.

LIGHTWEIGHT PROCESSES

8
New cards

_____ allows OS to handle many processes at once, making the computer do many things at the same time.

MULTITASKING

9
New cards

MULTITASKING

allows OS to handle many processes at once, making the computer do many things at the same time.

10
New cards

CORE FUNCTION OF PROCESS MANAGEMENT

PROCESS SCHEDULING, PROCESS SYNCHRONIZATION, DEADLOCK HANDLING, AND INTER-PROCESS COMMUNICATION (IPC)

11
New cards

The OS deciding which process/thread gets the CPU next

PROCESS SCHEDULING

12
New cards

PROCESS SCHEDULING

The OS deciding which process/thread gets the CPU next

13
New cards

Make sure that multiple processes don't interfere with each other, especially when accessing shared files/resources.

PROCESS SYNCHRONIZATION

14
New cards

PROCESS SYNCHRONIZATION

Make sure that multiple processes don't interfere with each other, especially when accessing shared files/resources.

15
New cards
  • Prevents program from getting stuck

DEADLOCK HANDLING

16
New cards

DEADLOCK HANDLING

Prevents program from getting stuck

17
New cards

Allows to exchange data 

INTER-PROCESS COMMUNICATION (IPC)

18
New cards

INTER-PROCESS COMMUNICATION (IPC)

Allows to exchange data 

19
New cards

Manages how memory is used so that programs run efficiently without crashing or interfering with each other.

MEMORY MANAGEMENT

20
New cards

MEMORY MANAGEMENT

Manages how memory is used so that programs run efficiently without crashing or interfering with each other.

21
New cards

MEMORY MANAGEMENT: 2 TYPES

PRIMARY MEMORY MANAGEMENT AND SECONDARY MEMORY MANAGEMENT

22
New cards

PRIMARY MEMORY MANAGEMENT: 5 PARTS

MEMORY ALLOCATION, MEMORY DEALLOCATION, MEMORY PROTECTION, VIRTUAL MEMORY AND FRAGMENTATION MEMORY.

23
New cards

MEMORY ALLOCATION

Uses techniques like PAGING (splitting memory to fixed-size pages) or SEGMENTATION (variable-size segments)

24
New cards

______ (splitting memory to fixed-size pages)

PAGING

25
New cards

_____ (variable-size segments)

SEGMENTATION

26
New cards

MEMORY DEALLOCATION

When program finishes, its memory is released for others to use

27
New cards

When program finishes, its memory is released for others to use

MEMORY DEALLOCATION

28
New cards

MEMORY PROTECTION

Keeps one program from accessing another’s memory, avoiding crashes and security issues.

29
New cards

Keeps one program from accessing another’s memory, avoiding crashes and security issues.

MEMORY PROTECTION

30
New cards

Uses hard drive space as extra memory when ram is full, allowing larger programs to run

VIRTUAL MEMORY

31
New cards

VIRTUAL MEMORY

Uses hard drive space as extra memory when ram is full, allowing larger programs to run

32
New cards

Deals with unused gaps in memory. Rearrange data to free up larger blocks of memory called COMPACTION.

FRAGMENTATION MANAGEMENT

33
New cards

FRAGMENTATION MANAGEMENT

Deals with unused gaps in memory. Rearrange data to free up larger blocks of memory called COMPACTION.

34
New cards

SECONDARY MEMORY MANAGEMENT: 5 PARTS

DISK SPACE ALLOCATION, FILE SYSTEM MANAGEMENT, FREE SPACE MANAGEMENT, DISK SCHEDULING, AND BACK UP AND RECOVERY

35
New cards

Determines how files are saved, either in order, linked, or using indexes.

DISK SPACE ALLOCATION

36
New cards

DISK SPACE ALLOCATION

Determines how files are saved, either in order, linked, or using indexes.

37
New cards

Manages folders, file names, and file organization.

FILE SYSTEM MANAGEMENT

38
New cards

FILE SYSTEM MANAGEMENT

Manages folders, file names, and file organization.

39
New cards

Tracks available storage to prevent saving issues

FREE SPACE MANAGEMENT

40
New cards

FREE SPACE MANAGEMENT

Tracks available storage to prevent saving issues

41
New cards

DISK SCHEDULING

Optimized how storage is read/written.

42
New cards

Optimized how storage is read/written.

DISK SCHEDULING

43
New cards

Ensures that files are saved and can be restored after system failure. Protects data from being lost

BACK UP AND RECOVERY

44
New cards

BACK UP AND RECOVERY

Ensures that files are saved and can be restored after system failure. Protects data from being lost

45
New cards

FILE MANAGEMENT

  • It organizes files into folders/directories

  • It manages access permissions (who can read/write/execute a file)

  • It hides hardware details so users don’t have to worry about where files are stored physically

46
New cards

FILE MANAGEMENT: 4 TYPES

FILE ATTRIBUTES, FILE TYPES, FILE OPERATIONS AND ACCESS METHODS

47
New cards

FILE ATTRIBUTE: 4 PARTS

FILE NAME, FILE TYPE, SIZE AND PERMISSIONS

48
New cards

FILE NAME

WHAT IS FILE CALLED

49
New cards

FILE TYPE

TYPE OF CONTENT

50
New cards

SIZE

HOW MUCH SPACE THE FILE TAKES

51
New cards

PERMISSIONS

WHO CAN READ, WRITE OR EXECUTE THE FILES

52
New cards

FILE TYPES: 3 PARTS

TEXT FILES, BINARY FILES AND EXECUTABLE FILES

53
New cards

FILE OPERATIONS

CREATE, READ, WRITE AND DELETE

54
New cards

ACCESS METHODS: 3 PARTS

SEQUENTIAL ACCESS, DIRECT ACCESS, AND INDEXED ACCESS

55
New cards

SEQUENTIAL ACCESS

READ FROM THE START TO END

56
New cards

DIRECT ACCESS

JUMP TO SPECIFIC PART

57
New cards

INDEXED ACCESS

USES INDEX TO FIND DATA QUICKLY (LIKE TABLE OF CONTENTS)

58
New cards

TYPE OF AN OS: 3 TYPES

BATCH OS, TIME-SHARING OS, AND DISTRIBUTED OS

59
New cards

BATCH OS

You group similar tasks together and run them all at once and with no interruptions or changes in between.

60
New cards

______ IS You group similar tasks together and run them all at once and with no interruptions or changes in between.

BATCH OS

61
New cards

Earliest types of OS used in computers

BATCH OS

62
New cards

_____ Is like doing all your chores all at once without stopping

BATCH OS

63
New cards

_____ means sharing CPU time among multiple users or processes

TIME-SHARING OS

64
New cards

Supports real-time multitasking for multiple users.

TIME-SHARING OS

65
New cards

connects multiple computers called nodes over network.

DISTRIBUTED OS

66
New cards

spreads tasks across several machines connected in a network

DISTRIBUTED OS

67
New cards

These computers work together and share resources like memory, files and processing power

DISTRIBUTED OS