Step 1: Understanding linear regression.
A linear regression model is one in which the dependent variable is modeled as a linear combination of the independent variables. Importantly, the model must be linear in parameters, but the variables may or may not be linear.
Step 2: Analysis of options.
- (A) linear in explanatory variables but may not be linear in parameters: This is incorrect. A linear regression model must be linear in parameters.
- (B) non-linear in parameters and must be linear in variables: This is incorrect. The model should be linear in parameters.
- (C) linear in parameters and must be linear in variables: This is incorrect. The model can be linear in parameters, but the variables do not need to be linear.
- (D) linear in parameters and may be linear in variables: This is correct. Linear regression models are linear in parameters, and the explanatory variables may or may not be linear.
Step 3: Conclusion.
The correct answer is (D), as a linear regression model must be linear in parameters.
Which model is represented by the following graph?
The following graph represents:
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.