If \(\; f(x)=\begin{cases} x\sin\!\left(\tfrac{1}{x}\right), & x\neq 0 \\[6pt] 0, & x=0 \end{cases}, \; \text{then } f(x) \text{ is}\)
Step 1: Continuity for $x\neq 0$.
For $x\neq 0$, $f(x)=x\sin(1/x)$ is a product of continuous functions, hence continuous.
Step 2: Limit at $x=0$.
Since $-1\le \sin(1/x)\le 1$, multiplying by $x$ gives $-|x|\le x\sin(1/x)\le |x|$. As $x\to 0$, both bounds $\to 0$; by the Squeeze Theorem, $\lim\limits_{x\to 0}x\sin(1/x)=0$.
Step 3: Compare with $f(0)$.
$f(0)=0$, which equals the limit, so $f$ is continuous at $0$.
Step 4: Conclusion.
$f$ is continuous for all $x\in\mathbb{R}$.
In C language, mat[i][j] is equivalent to: (where mat[i][j] is a two-dimensional array)
Suppose a minimum spanning tree is to be generated for a graph whose edge weights are given below. Identify the graph which represents a valid minimum spanning tree?
\[\begin{array}{|c|c|}\hline \text{Edges through Vertex points} & \text{Weight of the corresponding Edge} \\ \hline (1,2) & 11 \\ \hline (3,6) & 14 \\ \hline (4,6) & 21 \\ \hline (2,6) & 24 \\ \hline (1,4) & 31 \\ \hline (3,5) & 36 \\ \hline \end{array}\]
Choose the correct answer from the options given below:
Match LIST-I with LIST-II
Choose the correct answer from the options given below:
Consider the following set of processes, assumed to have arrived at time 0 in the order P1, P2, P3, P4, and P5, with the given length of the CPU burst (in milliseconds) and their priority:
\[\begin{array}{|c|c|c|}\hline \text{Process} & \text{Burst Time (ms)} & \text{Priority} \\ \hline \text{P1} & 10 & 3 \\ \hline \text{P2} & 1 & 1 \\ \hline \text{P3} & 4 & 4 \\ \hline \text{P4} & 1 & 2 \\ \hline \text{P5} & 5 & 5 \\ \hline \end{array}\]
Using priority scheduling (where priority 1 denotes the highest priority and priority 5 denotes the lowest priority), find the average waiting time.