List of practice Questions

A device which connects dissimilar LANs of different topologies, using different sets of communication protocols, is called:
Match LIST-I with LIST-II:\[\begin{array}{|c|c|}\hline \text{LIST-I} & \text{LIST-II} \\ \hline \text{A. Physical} & \text{I. Bit} \\ \hline \text{B. Data Link} & \text{II. Frame} \\ \hline \text{C. Network} & \text{IV. Packet} \\ \hline \text{D. Transport} & \text{III. TPDU} \\ \hline \end{array}\] Choose the correct answer from the options given below:
Which of the following functionality is to be implemented by the transport layer?
Match LIST-I with LIST-II:\[\begin{array}{|c|c|}\hline \text{LIST-I} & \text{LIST-II} \\ \hline \text{A. 10Base5} & \text{I. Thick coax} \\ \hline \text{B. 10Base2} & \text{II. Thin coax} \\ \hline \text{C. 10Base-T} & \text{IV. Twisted pair} \\ \hline \text{D. 10Base-F} & \text{III. Fiber optics} \\ \hline \end{array}\] Choose the correct answer from the options given below:
The data link layer has a number of specific functions it can carry out. These functions include: (A) Providing a well-defined interface to the network layer
(B) Dealing with transmission errors
(C) Regulating the flow of data so that slow receivers are not swamped by fast senders
(D) Routing packets from the source machine to the destination machine
Choose the correct answer from the options given below:
What will be the number of cross points needed for a full duplex 8-line cross point switch with no self connections?
In a system with multiple instances of resources, the resource allocation graph for deadlock avoidance does NOT contain the following edge:
Consider a paging system in which the hit ratio is 80%, TLB (Translation Look Ahead Buffer) access time is 100 nanoseconds, and main memory access time is 100 nanoseconds. Find Effective Access Time (EAT), assuming page-table lookup takes only one memory access.
The time complexity in order to build a heap of 'n' elements is ..............
The operating system is not responsible for:
Process control block in operating system is defined as:
In the context of process creation, arrange the following statements in sequential order of their occurrence: A. One of the two processes typically uses the exec() system call to replace the process's memory space with a new program.
B. A new process is created by the fork() system call.
C. The parent can then create more children; or, can issue a wait() system call to move itself off the ready queue.
D. The exec() system call loads a binary file into memory (destroying the memory image of the program containing the exec() system call) and starts its execution.
Choose the correct answer from the options given below:
A solution to the critical-section problem must satisfy:
Which of the following instruction format is used by stack-organised computer?
Consider a pipeline system. Let the time it takes to process a sub operation in each segment be equal to \( t_p = 20 \, \text{ns} \). Assume that the pipeline has \( k = 4 \) segments and executes \( n = 100 \) tasks in sequence. Consider a non-pipeline system, assume that \( t_n = k t_p \) (a non-pipeline system to perform the operation takes a time equal to \( t_n \) to complete each task), where \( t_p = 20 \, \text{ns} \), \( k = 4 \). Find the speedup of a pipeline processing over an equivalent non-pipeline processing to execute 100 tasks.
The Prime Implicant (PI) whose each 1 is covered by a minimum of one Essential Prime Implicant (EPI) is known as:
A parallel adder in which the carry-out of each full-adder is the carry-in to the next significant digit adder is known as:
Which flip-flop is not widely available for commercial purposes?
For a Non-deterministic Finite Automaton (NDFA) with \( N \) number of states, the equivalent Deterministic Finite Automaton (DFA) has \( D \) number of states. Then, possible number of states in DFA can be defined as:
In a standard Turing Machine \( T \), the transition function \( \delta (q, a) \) for \( q \in Q \) and \( a \in \Gamma \) is defined:
What will be the output after minimizing the following expression with the help of a K-map? \[ F(X,Y) = X Y + X Y' + X Y \]
Match LIST I with LIST II
\[ \begin{array}{|l|l|} \hline \textbf{LIST I} & \textbf{LIST II} \\ \hline A. \ \text{Cable tool drilling} & I. \ \text{No strainer} \\ B. \ \text{Well development} & II. \ \text{Bailer} \\ C. \ \text{Cavity well} & III. \ \text{Effective well diameter} \\ D. \ \text{Gravel pack} & IV. \ \text{Surging} \\ \hline \end{array} \]
Choose the correct answer from the options given below:
Match LIST I with LIST II
\[ \begin{array}{|l|l|} \hline \textbf{LIST I} & \textbf{LIST II} \\ \hline A. \ \text{Cutoff wall} & I. \ \text{Energy dissipation} \\ B. \ \text{Hydraulic jump} & II. \ \text{Critical flow condition} \\ C. \ \text{Froude number is one} & III. \ \text{Preventing piping below the structure} \\ D. \ \text{Flood routing} & IV. \ \text{Storage discharge relationship} \\ \hline \end{array} \]
Choose the correct answer from the options given below:
Match LIST I with LIST II
\[ \begin{array}{|l|l|} \hline \textbf{LIST I} & \textbf{LIST II} \\ \hline A. \ \text{Wind break} & I. \ \text{Surface creep movement} \\ B. \ \text{Boraxing soil particles} & II. \ \text{Suspension movement} \\ C. \ \text{Coarse soil particles} & III. \ \text{Saltation movement} \\ D. \ \text{Floating soil particles} & IV. \ \text{Vegetative barrier for wind erosion} \\ \hline \end{array} \]
Choose the correct answer from the options given below:
Match LIST I with LIST II
\[ \begin{array}{|l|l|} \hline \textbf{LIST I} & \textbf{LIST II} \\ \hline A. \ \text{Splash erosion} & I. \ \text{Impact of falling rain} \\ B. \ \text{Time of concentration} & II. \ \text{Canopy of vegetation} \\ C. \ \text{Dicken's formula} & III. \ \text{Travel time to outlet} \\ D. \ \text{Interception} & IV. \ \text{Peak runoff rate} \\ \hline \end{array} \]
Choose the correct answer from the options given below: