Final Review Flashcards
(76 cards)
1
Q
Explain the behind the scene steps behind “gcc” command
A
- The C preprocessor processed macros (#define and #include) in
the source code (“.c” file) and produced a new source code file
(unnamed)
2. The **C compiler** processed the output of the C preprocessor into assembly language code (“.s” file).
- The assembler processed the assembly language file and produced a
binary object file (“.o” file). - The linker combined the object file with necessary libraries and produced
the executable file (“a.out”).
2
Q
What does it mean that C is “weakly typed”?
A
This means the compiler assumes the programmer knows what she/he is doing and allows casting of anything to anything else.
3
Q
Explain the two types of C conversions: Explicit vs. Implicit.
A
4
Q
What is a variable?
A
Memory that can hold the value. *Note: the deault value is mostly undefined, so treat it as random idea before initilization
5
Q
List the components that everyta variable in C has.
A
6
Q
When and where is the size of variable determined when a global variable is created? A local variable? A dynamic data varaible?
A
- Global data variables at compile time (.data)
- local data vairable at run-time (stack)
- dynamic data variables by the programmer (heap)
7
Q
What is a pointer?
A
a variable continaing the address of another variable
(when initiated without a value, points to a random location in memory)
8
Q
If we have the 2D array
int weekends[52][2];
What is the equivalent of weekends[3][1] in pointer arithmetic?
A
*(weekends + (3*2) + 1)
NOTE: “*” surrounds everything
General formula:
arr[r][c] = *(arr + (r*num_cols) + c)
9
Q
All data objects of type FILE *…
A
- can be connected to file system files for reading and writing
- represent a buffered systemf chars (bytes) to be written or read
10
Q
What do processors do?
A
From startup to shut down, CPU simply readsnd executes (intereprets) a sequence of instructions, one at a time… this sequenece is called the CPU’s control flow (of flow of control)
11
Q
Define exception
A
An execpetion is a transfer of control to the OS kernel in response to some event (i.e. change in processor state)
12
Q
What are asynchronous events/ interrupts?
A
13
Q
What are synchonous exepctions?
A
Exceptions caused by events that occur as a result of executing an instruction. This includes:
- Traps
- Faults
- Aborts
14
Q
Explain a Trap Exception and provide examples.
A
- Intentional, returns control to “next” instruction
- EX. system calls, breakpoint traps, special instructions
15
Q
Explain Fault Exception and give an example.
A
- Unintential but possibly recoverable, either re-exectues faulting/current instruction or aborts
- EX: page fualts (recoverable), rotection faults (unrecoverable), floating point exceptions
16
Q
Explain abort exceptions and provide an example.
A
- Unintentional and unreciverable, aborts the current program
- EX: llegal instruction, party error, machine check
17
Q
What are exception tables?
A
18
Q
What is a process?
A
A process is in an instance of a running programnd provides each program with two key abstractions
19
Q
Explain the three states a process could be in.
A
20
Q
What is the kernel?
A
The kernel is a shared chunk memory-resident OS code that manages processes
21
Q
What is context switching?
A
Context switching is when control flow passes from one process to another.
Some examples of causes could be
- OS scheduling processs
- Kernel executing a system for user
- interrupts
22
Q
Explain fork()
A
23
Q
What are the three reasons a process becomes terminated?
A
1) Recieving a signal whose default action is to terminate
2) Returning from the main routine
3) Calling the exit function
24
Q
Explain exit()
A
25
Explain reaping child processes.
26
Explain wait()
27
What macros can we use to get information about the exit status of a child process?
WIFEXITED and WEXITSTATUS
28
explain waitpid()
29
explain execve()
30
What is a signal in terms of ECF (Exceptional Control Flow)?
31
ECF: Exlpain sending a signal.
32
ECF: Explain recieving a signal.
33
ECF: Explain pending and blocking signals.
34
Explain signal()
35
Explain a Client Server Transaction.
36
How is a connection uniquely identified
by the socket adresses of its endpoints aka a socket pair
37
What is a socket?
38
Explain accept().
Accept waits for a connection request from the client to arrive on the given listening descriptor, then fills in the given socket address, and returns a connected descriptor that can be used to communicate with the client
39
Describe the socket interface as a whole. What functions/ actions do the client and the server each need to do for a successful connection?
40
What are races and give an example.
Races occur when the outcome depends on the arbitrary scheduling decisions elsewhere in the system
EX. who gets the last seat in an ariplane
41
What is a deadlock and provide an example.
Deadlocks occur when there is imporpper resource allocation prevents forward progress
EX. traffic gridlock
42
What is livelock?
Also known as startvation and fairness, this is when external events and or system schedulingdecisions can preventsub-task progress
EX. people always jump in front of you in line
43
What are the three different approaches to writing concurrent servers.
44
Explain the flaw in in Iterative Servers, where requests are processed one at a time.
45
Explain Process-based servers.
* Spawns a separate process for each client
* No shared state between them
* Simple and straightforward, but has issues...
* Listening sever process must reapzombie children to avoid fatal memory leak
* The parent process must close its copy of confd because the kernel wont close a connection until the refcount to confd is 0
46
Explain Event-based Servers
* ALso known as multiplexing
* Server maintains set of active connections
* an Array of connfds
* Repeats:
* Determine which desriptors (connfd's pr listenfd) have pending inputs using select() - the arrival of a pending input is considered an event
* If listenfs has input, then accept connection and add new connfd to array
* Service all connfds withpending inputs
47
Explain thread-based servers.
* Very similar to the approach of using processes but instead just with threads
* Uses Pthreads library
* Need to malloc for connfdp to avoid race condition
* In the thread function, must
* copy the given void \*vargo, into a new local stack variable connfd, basically removing that data from the heap and placing it on the stack
* call Pthread\_detach() in order to run independtently of other threads and get reaped automatically by the kernel when it terminates
* free storage allocated to hold connfd
* close connfd, which closes this fd for all the threads because we share one fd table
* because if we didn't close it here, the main thread would not know when to close it
* Not doing this can lead to running out of fd for long running programs
48
How do we know which variables in threaded C Porograms are share?
A variable x is shared if and only if multiple threads reference some instance of x
49
What does volatile mean?
It means please dont keep the intermidate value in a register. So, every instance of updating must be pushed back to memory
50
What does it mean when a function is atomic?
This means they can not be interrupted and taken on or off the processor. They are allowed to continue their execution until they are complete
51
What is a semaphore?
A semaphor is a non-negative global integer synchonization variable that is manipulated by P and V operations
52
Explain why mutexes work.
Since Semaphores can never be a nagitive number, mutexes essentially block off the unsade region where the variable would be less than 0 and ensures a safe trajectory
53
Explain the Producer-Consumer Problem.
* Key components of a Producer thread, Consumer thread, and shared buffer between the threads
* Common synchronization pattern:
* Producer waits for empty slot, inserts item in buffer, and notifies consumer
* Consumer waust for item, removes it from buffer,a nd notifers producer
* EX:
* Multimedia processessing: Producer creates MPEG video frames, consumer renders them
54
How many mutexes and semaphores are need to solve the Producer-Consumer Problem? And what are each of there uses?
Requires 1 mutex and two counting semaphores:
* mutex: enforces mutally exclusive access to the buffer
* slots: counts the available slots in the buffer
* items: counts the available items in the buffer
55
Explain the Readers-Writers Problem
It is a generalization of the mutal exclusion problem...
* Problem statement:
* Reader threads only read the object
* Writer threads modift the object
* Writers must have exclusive access to the object
* Unlimited number of readers can access the object
* Real World EX: Online airline reservation system
* There are variants of this problem:
* First readers-writers problem (favor readers)
* No reader should be kept waiting unless a writer has already been granted permission to use the object
* A reader that arrives after a waiting writer gets priority over the writer
* Secind readers-writers problem (favors writers)
* Once a writer is ready to write, it performs its write as soon as possible
* A reader that arrives after a writer must wait, even if the writer is also waiting
56
What is starvation?
When threads are blocked indefinitely because the other type of
57
How do we know if a function is thread-safe?
A fucntions is thread-safe iff it will always produce correct results when called repeatedly from multiple concurrent threads
58
What are the 4 classes of thread-unsafe functions?
* Class 1: Functions taht do not protect shared variables
* Class 2: Functiosn that keep state across multiple invocations
* Class 3: Functions that return a pointer to a static varibable
* * Class 4: Functions that call thread-unsafe functions
59
Explain Class 1 Thread-Unsafe Function's Fixes and Examples.
* Fix by using P and V semaphore operations
* EX. the badcnt.c & goodcnt.c examples where the volatile global variable of cnt was initially unprotected
* Issue: synchronization operations will slow down code
60
Explain Class 2 Thread Unsafe Function's Fixes and Examples.
* Fix: Pass state as part of argument, and, thereby eliminate global state
* EX: Random number generator that relies o static state
* Consequence: programmer using rand\_r (the thread safe version of rand) must maintain seed
61
Explain Class 3 Thread Unsafe Function's Fixes and Examples.
* Fix 1: Rewrite function arguments so caller passes address of variable to store result into
* Requrires changes in caller and callee
* Fix 2: Lock and copy
* Requires simple changes in caller (and non in callee)
* However, caller must free memory
* EX. ctime & gethostbyname
62
When is a function reentrant?
A function is reentrant iff it accesses no shared variables when called by multiple threads
63
Explain Bind()
Bind asks the Kernel to associate the server's given socket address with the given socket descriptor
64
Explain Socket()
Socket is used by clients and servers to create a socket descriptor given a domain, typem and protocol
65
Explain Listen()
Listen converts the given socketfd from an active socket to a listening socket, telling the kernel that the descriptor will be used by the server instead of the client
66
Explain Connect()
Connect attempts to establish a connections iwth the given server's socket address, If successful, the given clientfd is ready for reading and writing
67
What are all the default actions of a signal?
* The process terminates
* EX. SIGKILL
* The process terminates and dumps core
* EX. SIGSEGV
* The process stops until restated by SIGCONT signal
* EX. SIGSTOP
* The process ignores the signal
* EX. SIGCHILD
68
What is implicit blocking mechanism?
* Kernel locks any pending signals of type currently being handled
* Ex. A SIGINT handler can't be interrupted by another SIGINT
69
What is explicit blocking and unblocking mechanism?
* Using sigpromask function and its suppproting functions...
* sigemotyset - creates empty set
* sigfillset - adds every signal number to set
* sigaddset - add signal number to set
* sigdelset - deletes signal unmber from set
70
What is sigsuspend()?
Equivalent to atomic (uniterruptable) version of:
sigpeomask(SIG\_BLOCK, &mask, &prev);
pause();
sigpromask(SIG\_SETMASK, &prev, NULL);
71
What are all the items shared between threads?
* Global variables
* Program Code
* File Descriptor Table
* Heap
* Heap Pointer
72
What items are unique to each thread?
* Program Counter
* Stack Ppointer
* Register Values
73
When file sharing, information about the files are kept in what 3 levels/tables?
* Despriptor Table
* File Table
* V-node Table
74
Describe what a Desciptor Table is (shared or unique to processes? What kind of entries?)
* each process has its own table
* entries are index of file descriptors
* each open descriptor entry points to an entry in the file table
75
Describe what a File Table is (shared or unique to processes? What kind of entries?)
* shared by all processes
* entries contain informayion about file (current position, # of references, pointer to an entry in v-node table)
* Kernel only removes entry if reference count = 0
76
Describe what a V-node Table is (shared or unique to processes? What kind of entries?)
* Shared by all processes
* each entry contains info from stat structure
* Info in stat struct includes File access, File size, File type, etc
