SDK Interview Preparation Guide

Download PDF

Register are electromechanical device it has the capacity to
store only 8 bits.Each have eight location. Each location
store one bit either 0 or1. There are 7 general purpose
registers Accumulator,B,C,D,E,H,L. We can also store 16 bits
with register pairs BC,DE,HL.

If your computer has the option in bios to boot from a USB
device then either use an External CD drive or an external
floppy drive. In the case of External floppy drive, the best
one i have found is an IBM unit. Comes in handy when you
need to load up SCSI drivers on server with no fdd.

NTFS

NTFS allows much Fragmentation,while compared to FAT32

NTFS
1) allows access local to w2k,w2k3,XP,win NT4 with SP4 &
later may get access for some file.
2) Maximum size of partition is 2 Terabytes & more.
3) Maximum File size is up to 16TB.
4) File & folder Encryption is possible only in NTFS.
FAT 32
1) Fat 32 Allows access to win 95,98,win millenium,win2k,xp
on local partition.
2) Maximum size of partition is up to 2 TB.
3) Maximum File size is up to 4 GB.
4) File & folder Encryption is not possible

dynamic memory allocation is the allocation of memory
storage for use in a computer program during the runtime of
that program. It can be seen also as a way of distributing
ownership of limited memory resources among many pieces of
data and code.

Dynamically allocated memory exists until it is released
either explicitly by the programmer or by the garbage
collector. This is in contrast to automatic and static
memory allocation, which have a fixed duration. It is said
that an object so allocated has a dynamic lifetime.

To move the process from one node to another node

revention:
• The goal is to ensure that at least one of the
necessary conditions for deadlock can never hold.

• Deadlock prevention is often impossible to
implement.
• The system doesnot require additional apriori
information regarding the overall potential use of each
resource for each process.
• In order for the system to prevent the deadlock
condition it does not need to know all the details of all
resources in existence, available and requested.
• Deadlock prevention techniques include non-blocking
synchronization algorithms, serializing tokens, Dijkstras
algorithm etc.
• Resource allocation strategy for deadlock
prevention is conservative, it under commits the resources.
• All resources are requested at once.
• In some cases preempts more than often necessary.
Avoidance:
• The goal for deadlock avoidance is to the system
must not enter an unsafe state.
• Deadlock avoidance is often impossible to
implement.
• The system requires additional apriori information
regarding the overall potential use of each resource for
each process.
• In order for the system to be able to figure out
whether the next state will be safe or unsafe, it must know
in advance at any time the number and type of all resources
in existence, available, and requested.
• Deadlock avoidance techniques include Banker’s
algorithm, Wait/Die, Wound/Wait etc.
• Resource allocation strategy for deadlock avoidance
selects midway between that of detection and prevention.
• Needs to be manipulated until atleast one safe path
is found.
• There is no preemption.
Detection:
• The goal is to detect the deadlock after it occurs
or before it occurs.
• Detecting the possibility of a deadlock before it
occurs is much more difficult and is, in fact, generally
undecidable. However, in specific environments, using
specific means of locking resources, deadlock detection may
be decidable.
• The system doesnot requires additional apriori
information regarding the overall potential use of each
resource for each process in all cases.
• In order for the system to detect the deadlock
condition it does not need to know all the details of all
resources in existence, available and requested.
• A deadlock detection technique includes, but is not
limited to, Model checking. This approach constructs a
Finite State-model on which it performs a progress analysis
and finds all possible terminal sets in the model.
• Resource allocation strategy for deadlock detection
is very liberal. Resources are granted as requested.
• Needs to be invoked periodically to test for
deadlock.
• Preemption is seen.

1. reason – the control blocks for processes are larger
than for threads (hold more state information), so the
amount of information to move during the thread switching
is less than for process context switching
2. reason – the major reason is that the memory management
is much simpler for threads than for processes. Threads
share their memory so during mode switching, memory
information does not have to be exchanged/changed, pages
and page tables do not have to be switched, etc. This makes
the thread context switch much cheaper than for processes.
In case of processes the memory pieces (pages) need to be
exchanged, etc. (Will talk about the details in few weeks).
3. reason – threads do not have to worry about accounting,
etc, so do not have to fill out all the information about
accounting and other process specific information in their
thread control block, so keeping the thread control block
consistent is much faster
4. reason – threads share files, so when mode switch
happens in threads, these information stay the same and
threads do not have to worry about it (similar to
accounting information) and that makes the mode switch much
faster.

macintosh, followed by Tiger and now its Lepord