GMU_IT-342 Final Exam CYUs 7 - Roundup (Holdener)

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/104

encourage image

There's no tags or description

Looks like no tags are added yet.

Last updated 6:59 PM on 5/7/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai

No analytics yet

Send a link to your students to track their progress

105 Terms

1
New cards

7.1 What is a file attribute?

Metadata about a file.

2
New cards

7.1 What use are file attributes to the Information Technologist?

They can be used to determine untoward activities on the system.

3
New cards

7.1 The two biggest issues with using files are:

Performance and corruption.

4
New cards

7.1 What is one method a file system uses to determine which application program applies to a file?

The last three or four characters after the stop character determine the application program.

5
New cards

7.1 What is a file?

A collection of data for use in the future.

6
New cards

7.2 What is a directory?

A cataloging system used to reference files.

7
New cards

7.2 Which of the following types of paths is shortest?

Either, not enough information.

8
New cards

7.2 Which of the following could not be a volume?

File

9
New cards

7.2 How would you change the working directory of your system?

Through the cd command.

10
New cards

7.2 If the current working directory from figure 7.4 were Programming, what would be the relative path to the directory Fixed Wing?

./../../../Personal/RC Models/Fixed Wing

11
New cards

7.3 Updating a file allows a user to

modify, delete, or add to the files data

12
New cards

7.3 While sharing allows a user to access another user's files, security seeks to:

Keep track of the user's actions

13
New cards

7.3 A simple security mechanism uses

read, write, and execute.

14
New cards

7.3 What is not part of file security?

Digital Rights Management

15
New cards

7.3 Methods of sharing include

copying, third-party software, and hard links.

16
New cards

7.4 What is the internal fragmentation of a 26,934-byte file in a system with 1 KB blocks?

2.6%

17
New cards

7.4 A file system can work with only

an indexing and free space management system.

18
New cards

7.4 Transactions and journaling help with what aspect of a file system?

Integrity

19
New cards

7.4 With spanned blocking,

multiple secondary memory blocks may contain parts of the same record.

20
New cards

7.4 Locating a file involves

recursively locating each directory to the file from the root.

21
New cards

7.5 What is one security flaw in NTFS?

File contents can be fully in the MFT

22
New cards

7.5 What two techniques are required to ensure files are managed?

Indexing and Free space management

23
New cards

7.5 In the FAT file system, where are attributes stored?

FAT

24
New cards

7.5 The Apple File System indexes with

B-trees.

25
New cards

7.5 In the FFS file system, where are attributes stored?

In the iNodes

26
New cards

8.1 Why do microprocessors not directly control memory anymore?

The speed of microprocessors has outpaced memory.

27
New cards

8.1 What does an overlay offer?

The ability to use programs larger than the available memory

28
New cards

8.1 What is Logical Memory?

Memory that is set up by software and used by programs.

29
New cards

8.1 The advantages of virtual memory do not include

increased access time

30
New cards

8.1 Types of physical memory include all except

DROM

31
New cards

8.2 If the base register is 1D2F5 and the virtual address is CD4, what is the physical address?

1DFC9

32
New cards

8.2 If the base register is 5C65E and the virtual address is 24E, what value must the limit register contain for the physical address to be valid?

Must be less than 5C8AD

33
New cards

8.2 What is the point of address translation?

To convert the virtual address to a physical address

34
New cards

8.2 Which are located in the microprocessor

Base Register and Limit Register

35
New cards

8.2 What advantage does concatenation offer in translation?

Speeds up the calculation

36
New cards

8.3 Fixed partitioning methods suffer from

internal fragmentation

37
New cards

8.3 (T/F) Performance in paging always improves as the number of page frames increases.

FALSE

38
New cards

8.3 Dynamic portioning methods suffer from

external fragmentation

39
New cards

8.3 Which method allows for the most control over protection?

Paging

40
New cards

8.3 Paging allows for

Relocation

41
New cards

8.4 What is the internal fragmentation for a 5,754,234 program with 1 MB pages?

8.5%

42
New cards

8.4 What would cause a page fault to take twice as long as normal?

A dirty page

43
New cards

8.4 What is the most reasonable page reference string?

222222222222233333333333333333

44
New cards

8.4 What is a page fault?

An error that indicates the requested page is not in memory.

45
New cards

8.4 What is the page fault rate for a 1K page?

0.097%

46
New cards

8.5 What is NOT a technique to keep track of free memory?

Grouping

47
New cards

8.5 Relocation is the ability to

move a programs' memory around the system

48
New cards

8.5 What is the short-term fix to thrashing?

Reduce the degree of multiprogramming

49
New cards

8.5 How is the TLB not like a cache?

It is accessed in parallel.

50
New cards

8.5 Bitmaps cannot be used with

dynamic partitioning

51
New cards

10.1 The values from microprocessor registers are in which category of PCT data?

State

52
New cards

10.1 A program is ______ while a process is ______.

a sequence of instructions, an instance of instructions

53
New cards

10.1 How have processes affected the security of computer systems?

Processes have increased the security of computer systems.

54
New cards

10.2 Process traces provide us with information on

the flow of a program

55
New cards

10.2 A process that has no restrictions could be in which state? (select multiple answers)

Ready, Running, Ready/suspend

56
New cards

10.2 Very large executable files are created by

static linking

57
New cards

10.3 On a Linux System what does Nigel's monitor do?

A performance monitoring tool that displays parameters of subsystems

58
New cards

10.3 Where can you view performance graphs in a Windows system?

In the Task Manger

59
New cards

10.4 Another name for threads includes

light-weight process

60
New cards

10.4 Two approaches to implementing threads are:

kernel level and user level

61
New cards

10.4 The advantages of threading include all of the following, except?

high overhead

62
New cards

11.1 In message passing, a zero-capacity buffer

means the sender must wait to continue until the receiver responds

63
New cards

11.1 Which IPC method can be used in a distributed environment?

Message passing

64
New cards

11.1 What is NOT a reason for a process to cooperate with another process?

Ensure it is not affected

65
New cards

11.2 Each of the following conditions is required for a critical section except

Safety

66
New cards

11.2 Why are race conditions bad?

They provide results that are not always correct and are difficult to track down.

67
New cards

11.2 The primary cause of errors with shared state is

Sequential thinking

68
New cards

11.3 What is NOT a method of recovery from deadlock?

Do nothing

69
New cards

11.3 The three methods of handling deadlock are

prevention, avoidance, detection

70
New cards

11.3 Deadlock is

two or more processes waiting indefinitely for an event

71
New cards

12.1 Preemption is

the sudden shift of a process from Running to Ready before it is complete.

72
New cards

12.1 The most difficult scheduling goal to achieve is

fairness

73
New cards

12.1 The scheduler that is run most often is the

short-term.

74
New cards

12.2 Which metric does Round Robin favor?

Response time

75
New cards

12.2 What happens if the quantum becomes too large in Round Robin

It degrades to FCFS

76
New cards

12.2 How would the ready state be implemented for FCFS?

With simple FIFO queue

77
New cards

12.3 What is a disadvantage of affinity scheduling?

Overworking some CPUs

78
New cards

12.3 Scheduling all the threads of a process together is known as

Gang scheduling

79
New cards

12.3 One multiple CPU configuration is

Peer-to-peer

80
New cards

13.1 What differentiates a real-time system from a non-real-time system?

There is a time component.

81
New cards

13.1 If Task D has a period of 20 msec and executes in 5 msec. Task E has a period of 40 msec and executes in 10 msec. And task F has a period of 60 msec and executes in 15 msec. For the periodic real-time tasks D, E, and F, are the tasks schedulable on a single processor and why?

Yes, guaranteed by rate monotonic scheduling.

82
New cards

13.1 What is one method to ensure real-time tasks are schedulable?

Overprovisioning.

83
New cards

13.2 The characteristics of an embedded system include all of the following except

Reliance on function calls

84
New cards

13.2 When would an embedded Operating System be inappropriate?

When performance is an issue

85
New cards

13.2 How does embedded code differ from other system code?

Generally, a simple loop with interrupts performing specific functions

86
New cards

13.3 One method of sharing memory in a distributed system is

Distributed shared memory

87
New cards

13.3 The advantages of distributed systems include all of the following except

Reduced complexity

88
New cards

13.3 A programming abstraction that supports distributed systems is

Middleware

89
New cards

13.4 What constitutes a virtual machine?

Files

90
New cards

13.4 What is the difference between a type 1 and type 2 hypervisor?

Type 1 does not need an Operating System

91
New cards

13.4 What is a virtual system?

A system that can host multiple Operating Systems at the same time

92
New cards

13.5 What is the most prevalent architecture in mobile phones?

Layered

93
New cards

13.5 Which Operating System has the majority of the mobile market?

Android

94
New cards

13.5 What characteristic distinguishes a mobile system?

Portability

95
New cards

R.1 What Operating System abstractions have we talked about in this book? (select the four that apply)

processes, threads, files, and directories

96
New cards

R.1 On a Linux system, what is the difference between a process running in the foreground and a process running in the background?

running a process in the background returns control immediately to the shell session

97
New cards

R.1 What is the difference between a text string and a number in the computer?

Nothing

98
New cards

R.1 For a Linux system, what is the difference between redirection and piping?

redirection changes the source or destination while piping routes the output of a process to another's input

99
New cards

R.1 For a Windows system, what is the difference between a cumulative update and a build?

a build is an entirely new version of the Windows Operating System

100
New cards

R.1 Why do computers have Operating Systems? (Select the three that apply)

To run third-party programs, To coordinate simultaneous activities, To allow multiple users access