Answer / Mradul Kumar Verma

Dynamic memory allocation is the process of allocating memory during runtime, as opposed to static memory allocation where memory is allocated at compile time. In dynamic memory allocation, a program requests memory from the operating system as needed and returns it when no longer required. This allows for more efficient use of memory by avoiding wasted space. Common dynamic memory allocation algorithms include:
1. First-fit: Finds the first available contiguous block of memory that can fit the requested size.
2. Best-fit: Searches for the smallest available contiguous block of memory that is larger than the requested size.
3. Worst-fit: Searches for the largest available contiguous block of memory that can fit the requested size.

some os have a tree structure file system that limits the depth of a tree and small number of levels.what limit does this have on user? how does this simplify file system design?

1 Answers   NIBS,

---

What is the difference among deadlock avoidance, detection and prevention?

3 Answers  

---

If you do not have cd drive then how will you format c drive?

1 Answers  

---

If you do not have cd drive then how will u format c drive?

1 Answers  

---

what is difference between fat & ntfs

40 Answers   Allied Digital, Bluecom, DynPro, Polaris, RMIC,

---

Explain the difference among deadlock avoidance, detection and prevention?

1 Answers  

---

if You do not cd drive then how will u format c drive ?

5 Answers  

---

absolute path gives the location a file or directory in reference to a rile directory while relative path is a path given file starting from another file. explain?

1 Answers   NIBS,

---

when affected the system from virus , which paths will be it stored in system ?

1 Answers  

---

what is FAT?.

12 Answers   Campus Interview, Mascot, MIS, Nile Bank,

---

can you create con folder in windows, if not why?

3 Answers  

---

Explain the process control block of UNIX ?

1 Answers  

---