CIS 390 Midterm Flashcards

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

1/60

flashcard set

Earn XP

Description and Tags

Vocabulary flashcards for CIS 390 Midterm review.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

61 Terms

1
New cards

fork() command in C++

When fork() is called, it creates a copy of the parent process. It returns 0 to the child process and the child's PID to the parent process.

2
New cards

fork() return to a Child

Returns 0.

3
New cards

fork() return to a Parent

Returns the child's PID.

4
New cards

fork() return on fail

Returns a negative number, likely -1.

5
New cards

wait() function

Waits for a child process to finish before continuing.

6
New cards

Variables before fork()

Available to both parent and child, but modifications in one process do not affect the other due to separate memory spaces.

7
New cards

Number of children: fork(); fork();

Four children will be created.

8
New cards

Data structure of a pipe

A structure that allows a child or parent to read and write data.

9
New cards

Index of the reading end in a pipe

When the parent process receives data from the child process

10
New cards

Variable type for a pipe

An int array of size 2.

11
New cards

Reading from an empty pipe

The program waits or stalls until data is put into the pipe.

12
New cards

Multiple processes reading from a pipe

False. Only one is able to read.

13
New cards

Transferring data back and forth using a single pipe

False.

14
New cards

Writing multiple data types into a pipe

It can cause confusion.

15
New cards

Closing pipes

To prevent processes from waiting indefinitely for data, stops processes.

16
New cards

CFS

Short for Central Focus Scheduling. Niceness values (-20 to 19) affect process scheduling, with higher values being 'better' for non-real-time tasks.

17
New cards

Niceness: Higher or Lower?

lower niceness is better.

18
New cards

Real Time Process Scheduling Types

FIFO (First In, First Out) and RR (Round Robin). FIFO runs until blocked or forced to stop. RR is similar to FIFO but gives time slices.

19
New cards

Priority of Scheduler Types

Real-time (RR) takes priority.

20
New cards

Signal Received

Acts as an interrupt to the process.

21
New cards

Catching Signals (SIGINT, SIGTERM)

To inform the user where the process has reached.

22
New cards

Generic Signal Without a Catch

The process gets killed.

23
New cards

Blocking or Catching Signals

True, some signals cannot be blocked or caught.

24
New cards

Function to Send a Signal in C

kill function.

25
New cards

Pointer

A variable that stores the memory address of another variable.

26
New cards

Pointer Code

int n = 2; int *nPtr = &n; *nPtr = *nPtr * 2;

27
New cards

Data Structures using Pointers

It may be faster.

28
New cards

fork() command in C++

When fork() is called, it creates a copy of the parent process. It returns 0 to the child process and the child's PID to the parent process.

29
New cards

fork() return to a Child

Returns 0.

30
New cards

fork() return to a Parent

Returns the child's PID.

31
New cards

fork() return on fail

Returns a negative number, likely -1.

32
New cards

wait() function

Waits for a child process to finish before continuing.

33
New cards

Variables before fork()

Available to both parent and child, but modifications in one process do not affect the other due to separate memory spaces.

34
New cards

Number of children: fork(); fork();

Four children will be created.

35
New cards

Data structure of a pipe

A structure that allows a child or parent to read and write data.

36
New cards

Index of the reading end in a pipe

When the parent process receives data from the child process

37
New cards

Variable type for a pipe

An int array of size 2.

38
New cards

Reading from an empty pipe

The program waits or stalls until data is put into the pipe.

39
New cards

Multiple processes reading from a pipe

False. Only one is able to read.

40
New cards

Transferring data back and forth using a single pipe

False.

41
New cards

Writing multiple data types into a pipe

It can cause confusion.

42
New cards

Closing pipes

To prevent processes from waiting indefinitely for data, stops processes.

43
New cards

CFS

Short for Central Focus Scheduling. Niceness values (-20 to 19) affect process scheduling, with higher values being 'better' for non-real-time tasks.

44
New cards

Niceness: Higher or Lower?

Higher niceness is better.

45
New cards

Real Time Process Scheduling Types

FIFO (First In, First Out) and RR (Round Robin). FIFO runs until blocked or forced to stop. RR is similar to FIFO but gives time slices.

46
New cards

Priority of Scheduler Types

Real-time (RR) takes priority.

47
New cards

Signal Received

Acts as an interrupt to the process.

48
New cards

Catching Signals (SIGINT, SIGTERM)

To inform the user where the process has reached.

49
New cards

Generic Signal Without a Catch

The process gets killed.

50
New cards

Blocking or Catching Signals

True, some signals cannot be blocked or caught.

51
New cards

Function to Send a Signal in C

kill function.

52
New cards

Pointer

A variable that stores the memory address of another variable.

53
New cards

Pointer Code

int n = 2; int *nPtr = &n; *nPtr = *nPtr * 2;

54
New cards

Data Structures using Pointers

It may be faster.

55
New cards

Data Structures using Pointers

It may be faster.

56
New cards

Real Time Process Scheduling Types

FIFO (First In, First Out) and RR (Round Robin). FIFO runs until blocked or forced to stop. RR is similar to FIFO but gives time slices.

57
New cards

Fork() returns to child

Returns 0 to the child process

58
New cards

Function to sena a signal in C

kill function

59
New cards

The process gets killed

Generic signak without a catch

60
New cards

False

Multiple process reading from a pipe is ?

61
New cards

Higher niceness is better

Niceness: Higher or Lower?