Technical Questions

The time complexity of sequential search is O(n)

Throughput : number of processes that complete their execution per time unit.

Turnaround time : amount of time to execute a particular process.

Waiting time : amount of time a process has been waiting in the ready queue.

Response time : amount of time it takes from when a request was submitted until the firstresponse is produced, not output (for time-sharing environment).

Every line has an upper limit and a lower limit on the frequency of signals it can carry. This limited range is called the bandwidth

The relationship where both the participating entities belong to same entity type is called Recursive relationship

Daemon is a program that runs in the background without user’s interaction. A daemon runs in a multitasking operating system like UNIX. A daemon is initiated and controlled by special programs known as ‘processes’.

Hubs regenerate electrical signals, which are specified at the Physical layer.

No, since the structure contains a char pointer while writing the structure to the disk using fwrite() only the value stored in the pointer n would get written. When this structure is read back the address would be read back but it is quite unlikely that the desired string would be present at this address in memory

Use the concept of register-retiming.

divide the totla combinatorial delay in two segments such that individually the delay is less the clock period.

this can be done by inserting a flip-flop in the combinational path.

e.g.,

clock period --- 5 ns

total cominational delay ---- 7

then divide the 7ns path in two path of 4 or 3 (best resutls are obtained if delays are  same for both path i.e 3.5ns) by inserting a flip-flop in between.