GeeksforGeeks

There are two processes... One process(process 1) has a pointer to a variable in the other process(process 2)... Now, can the variable be updated using this pointer in process 1?

How does malloc work?

How is heap space managed in a C/C++ environment.

Explain paging.

A bunch of other OS related questions.

1. What is a process.

2. How is it different from a thread.

3. How is common data shared between threads.

4. Semaphores and other locking mechanisms.

5. Code for some of the locking mechanisms.

Let the page fault service time be 10ms in a computer with average memory access time being 20ns. If one page fault is generated for every 106 memory accesses, what is the effective access time for the memory?
(A) 21ns
(B) 30ns
(C) 23ns
(D) 35ns

Give some important differences between threads and processes. When should one use thread and when processes?

what are the differences between user level and kernel level threads? how to choose one?

different IPC mechenisms.

What kind of operating system UNIX is? Preemptive or Non-Preemptive

In an instruction execution pipeline, the earliest that the data TLB (Translation Lookaside Buffer) can be accessed is
(A) Before effective address calculation has started
(B) During effective address calculation
(C) After effective address calculation has completed
(D) After data cache lookup has completed

There are two threads, one produces even number and other produces odd number, how will you print the consecutive numbers.

What is deadlock and what are 4 conditions of deadlock.

Which data structure will you use for deadlock?

Simulate deadlock(Pictorial diagram).

What is semaphore and how will you implement it?

Difference b/w semaphore and monitor

A parallel program consists of 8 tasks – T1 through T8. Each task requires one time step to be executed on a single processor. Let X -> Y denote the fact that task X must be executed before task Y is executed. Suppose only the tasks X, Y are to be executed. On any multiprocessor machine it would require at least 2 time steps since in the first step X could be executed, and Y could be executed in the next time step (since it requires X to complete first). Now, suppose the following depend...