a) Graphically shade the feasible region for the constraints x+2y 7 , x y 4 , x, y 0 . [2] b) Convert hexadecimal number 81A into Octal number. [2] c) Using Gauss elimination method, solve the…
6
a) Graphically shade the feasible region for the constraints x+2y≤7, x−y≤4, x,y≥0. [2]
b) Convert hexadecimal number 81A into Octal number. [2]
c) Using Gauss- elimination method, solve the equations x+2y=5, 5x−3y=−1. [2]
Answer
PPadhai · Based on the official syllabus and past papers Updated
a) Feasible region for
x+2y≤7,x−y≤4,x≥0,y≥0
The inequalities are linear, so the feasible region is a convex polygon bounded by the lines x+2y=7,x−y=4,x=0,y=0.
Feasible region satisfying all constraints
The intersection points of the boundary lines are:
Line 1
Line 2
Intersection
x+2y=7
x−y=4
(x,y)=(5,1)
x+2y=7
x=0
(0,3.5)
x−y=4
y=0
(4,0)
These points together with the origin (0,0) form the vertices of the feasible polygon. The shaded region in the figure is the set of all (x,y) that satisfy all four inequalities.
b) Hexadecimal 81A → Octal
Convert 81A (hex) to decimal. 8⋅162+1⋅161+10⋅160=8⋅256+1⋅16+10=2048+16+10=207410
Convert 2074 (decimal) to octal. Divide repeatedly by 8, keeping remainders.
Division
Quotient
Remainder
2074 ÷ 8
259
2
259 ÷ 8
32
3
32 ÷ 8
4
0
4 ÷ 8
0
4
Reading remainders from bottom to top gives 40728.
Answer:40728
c) Solve by Gauss‑Elimination
{x+2y=55x−3y=−1
Step 1: Write the augmented matrix
[152−3∣∣5−1]
Step 2: Eliminate x from the second row
Multiply the first row by 5 and subtract from the second row.