CSCE3600 - Exam 1 Flashcards

1
Q

unix command: concatenates files and print to standard output

A

cat

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

unix command: file viewer

A

less

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

unix command: locate a command

A

which

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

unix command: prints the groups a user is in

A

groups

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

unix command: prints lines matching to a pattern

A

grep

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

unix command: search for a file in a directory

A

find

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

unix command: clears the terminal screen

A

clear

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

unix command: prints information about a user

A

finger

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

unix command: shows who is logged in

A

who

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

unix command: identifies the current user

A

whoami

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

List 7 processes associated with Process Control Block (PCB)

A

process state, program counter, cpu registers, cpu scheduling information, memory-management info, accounting info, I/O status info

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

program in execution, which forms the basis of all computation

A

process

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

the context (information/data) maintained for an executing program - intuitively the abstraction of a physical processor

A

process

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Process: containing temporary data (function parameters, return addresses, local variables)

A

stack

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

process: containing global variables

A

data section

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

process: containing memory dynamically allocated during run time

A

heap

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

how does unix view everything?

A

as files

18
Q

what are the three standard unix/linux files?

A

stdin, stdout, stderr

19
Q

what is stored in the user level context (4)

A

code, data, stack, heap

20
Q

preserve the literal value of each character enclosed within the quotes

A

single quotes (‘ ‘)

21
Q

remove the special meaning from a single character

A

backslash ( \ )

22
Q

preserves the literal value of all characters within the quotes

A

double quotes (“ “)

23
Q

draw the process state diagram

A

new, running, waiting, ready, terminated

24
Q

selects which processes should be brought into the ready queue. controls the degree of multiprogramming. invoked infrequently

A

long-term scheduler

25
Q

selects which process should be executed next and allocates cpu. invoked frequently

A

short-term scheduler

26
Q

when cpu switches to another process the system must

A

save the state of the old process and load the saved states for the new process

27
Q

if child exits before parent or if no parent waiting, then terminated process is a

A

zombie

28
Q

if parent exits before child or if parent terminated, processes are

A

orphans

29
Q
using SJF draw chart and calculate waiting time and turn around time: AT:BT
P1 = 0:7
P2 = 2:4
P3 = 4:1
P4 = 5:4
A

chart: P1 - P3 - P2 - P4
WT = 4
TAT = 8

30
Q

only one processor accesses the system data structures, alleviating the need for data sharing

A

asymmetric multiprocessing

31
Q

each processor is self-scheduling, all processes in common ready queue, or each has its own private queue of ready processes

A

symmetric multiprocessing

32
Q

process must voluntarily relinquish by terminating or by making a system call

A

non-preemptive

33
Q

yank the cpu away from the currently executing process when a higher priority process is ready

A

preemptive

34
Q

list preemptive algorithms

A

shortest-remaining-time-first
round-robin
multi-level feedback queue

35
Q

fraction (%) of time that cpu is busy

A

cpu utilization

36
Q

number of job completions (processes) per unit of time

A

throughput

37
Q

the interval from the time of submission of a process to the time of completion

A

turnaround time

38
Q

sum of the periods spent waiting in the ready queue

A

waiting time

39
Q

time of submission to the time the first response is produced

A

response time

40
Q

list 3 resource sharing options for parents and children

A

1) parent and children share all resources
2) children share subset of parent’s resources
3) parent and child share no resources

41
Q

list 2 address space options for parents and children

A

1) child duplicate of parent

2) child has no program loaded into it

42
Q

list 2 execution options for parent and child

A

1) parent and child execute concurrently

2) parent waits until children terminate