If \( \vec{F} = x^2 \hat{i} + z \hat{j} + yz \hat{k} \), for \( (x, y, z) \in \mathbb{R}^3 \), then:
Evaluate \( \oiint_S \vec{F} \cdot d\vec{S} \), where \( S \) is the surface of the cube formed by \( x = \pm 1, y = \pm 1, z = \pm 1 \):
If \( \vec{F} \) is a vector point function and \( \phi \) is a scalar point function, then match List-I with List-II and choose the correct option:
LIST-I | LIST-II |
---|---|
(A) \( \text{div (grad } \phi) \) | (IV) \( \nabla \cdot \nabla \phi \) |
(B) \( \text{curl (grad } \phi) \) | (III) \( \vec{0} \) |
(C) \( \vec{F} \times \text{curl } \vec{F} \) | (I) \( \frac{1}{2} \nabla F^2 - (\vec{F} \cdot \nabla) \vec{F} \) |
(D) \( \text{curl (curl } \vec{F}) \) | (II) \( \text{grad(div } \vec{F}) - \nabla^2 \vec{F} \) |
Choose the correct answer from the options given below:
Let \( R \) be the planar region bounded by the lines \( x = 0 \), \( y = 0 \) and the curve \( x^2 + y^2 = 4 \) in the first quadrant. Let \( C \) be the boundary of \( R \), oriented counter clockwise. Then, the value of:
\[ \oint_C x(1 - y) \, dx + (x^2 - y^2) \, dy \] is equal to:
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.