PGT Computer Science (Level-3), (HTET Practice MCQs) (Part-V)

(a) The solution must be feasible, i.e., it must satisfy all the supply and demand constraints.
(b) The number of positive allocations must be equal to m + n - 1, where m is the number of rows and n is the number of columns.
(c) All the positive allocations must be in independent positions.
The initial solution of a transportation problem is said to be non-degenerate basic feasible solution if it satisfies:
Codes:

The transportation cost in the initial basic feasible
solution of the above transportation problem using
Vogel's Approximation method is:

$rm chap0\[1 - 3\]

(a) The ability to develop more realistic models of the real world.
(b) The ability to represent the world in a nongeometric way.
(c) The ability to develop databases using natural language approaches.
(d) The need to split objects into their component parts.
(e) The ability to develop database models based on location rather than state and behaviour.
Codes:

Create table test(
one integer,
two integer,
primary key(one),
unique(two),
check(one> = 1 and < = 10),
check(two> = 1 and < = 5)
);
How many data records/tuples atmost can this table contain?

SQ1: Select *
From R Full Join S
On R.B=S.B;
SQ2: Select *
From R Inner Join S
On R.B=S.B;
The numbers of tuples in the result of the SQL query
SQ1 and the SQL query SQ2 are given by: