Technical Questions

The time complexity of sequential search is O(n)

When a program forks and the child finishes before the parent, the kernel still keeps some of its information about the child in case the parent might need it – for example, the parent may need to check the child’s exit status. To be able to get this information, the parent calls `wait()’; In the interval between the child terminating and the parent calling `wait()’, the child is said to be a `zombie’ (If you do `ps’, the child will have a `Z’ in its status field to indicate this.)

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.

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’.

High level data models provide the concepts that are close to the way many users perceive data

It is a phenomenon in virtual memory schemes when the processor spends most of its time swapping pages, rather than executing instructions. This is due to an inordinate number of page faults.

1. DBMS

2. RDBMS (Relational)

3. ORDBMS (Object Relational)

4. DDBMS (Distributed)

5. FDBMS (Federated)

6. HDDBMS (Homogeneous)

7. HDBMS (Hierarchical)

8. NDBMS (Networked)

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