Match List-I with List-II:
\[\begin{array}{|l|l|} \hline \textbf{List-I} & \textbf{List-II} \\ \hline \text{(A) Sale of jewelry} & \text{(I) Income from Salary} \\ \hline \text{(B) Pension from former employer} & \text{(II) Capital gain/loss} \\ \hline \text{(C) Salary received from a partnership firm} & \text{(III) Income from other sources} \\ \hline \text{(D) Income from sub-letting of property} & \text{(IV) Profits and gains from business or profession} \\ \hline \end{array}\]
Step 1: Identify taxable heads for each income source.
- Sale of jewelry → Capital gain/loss
- Pension from former employer → Income from Salary
- Salary received from partnership firm → Profits and gains from business or profession
- Income from sub-letting → Income from other sources
Step 2: Match accordingly.
Correct matching: (A)-(II), (B)-(I), (C)-(IV), (D)-(III)
Match List-I with List-II:
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.