The process state transition diagram in below figure is representative of 👁 Untitled
               

Quicksort is run on two inputs shown below to sort in ascending order taking the first element as pivot,

(i) 1, 2, 3,......., n
(ii) n, n-1, n-2,......, 2, 1 

Let C₁ and C₂ be the number of comparisons made for the inputs (i) and (ii) respectively. Then,

Which of the following is false? 👁 opt1
             

∀i, j ∈ [1...n−1], A[i][j] < A[i][j+1] and A[i][j] < A[i+1][j]

procedure insert (x: integer);
var i,j: integer;
begin
 i:=1; j:=1, A[i][j]:=x;
 while (x > ...... or x > ......) do
 if A[i+1][j] < A[i][j] ......... then begin
 A[i][j]:=A[i+1][j]; i:=i+1;
 end
 else begin
 ............
 end
 A[i][j]:= .............
end
.

A complete, undirected, weighted graph G is given on the vertex {0, 1,...., n−1} for any fixed ‘n’. Draw the minimum spanning tree of G if a) the weight of the edge (u,v) is ∣ u−v ∣ b) the weight of the edge (u,v) is u + v

Consider the following program that attempts to locate an element x in a sorted array a[ ] using binary search. Assume N>1. The program is erroneous. Under what conditions does the program fail?

Let G be the directed, weighted graph shown in below figure 👁 gra
We are interested in the shortest paths from A. (a) Output the sequence of vertices identified by the Dijkstra’s algorithm for single source shortest path when the algorithm is started at node A. (b) Write down sequence of vertices in the shortest path from A to E. (c) What is the cost of the shortest path from A to E?

 00FF, 010D, 10FF, 11B0

program Example (input, output)
var b: integer;
procedure test2:
begin b:=10; end
procedure test1 (a:integer):
begin 	a:=5;
 writeln ('point 1: ', a, b);
 test2;
 writeln ('point 2: ', a, b);
end
begin (*Example*)
b:=3; test1(b);
writeln('point3: ', b);
end