Which model is represented by the following graph?
Step 1: Understanding the graph.
The given graph shows a straight line representing a relationship between a dependent and independent variable. This is characteristic of a simple linear regression model, which models a linear relationship between two variables.
Step 2: Analysis of options.
- (A) Logistic regression model: Incorrect, logistic regression deals with binary outcomes and produces a sigmoid curve, not a straight line.
- (B) Simple Linear regression model: Correct, this is the model for a straight-line relationship between variables.
- (C) Multiple linear regression model: Incorrect, multiple linear regression involves more than one independent variable, but the graph here shows a single independent variable.
- (D) k nearest neighbor model: Incorrect, the k-nearest neighbor model would not produce a straight line; it is non-parametric.
Step 3: Conclusion.
The correct answer is (B) Simple Linear regression model.
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.