In computer science, a stack is an abstract data type that serves as a collection of elements, with two principal operations: push, which adds an element to the collection, and pop, which removes the most recently added element that was not yet removed. The order in which elements come off a stack gives rise to its alternative name, LIFO (for last in, first out). Additionally, a peek operation may give access to the top without modifying the stack.
Quantity I: A vessel contains a mixture of milk and water in the ratio of 7 : 5. If 9 litre of mixture is sold and replaced by same amount of water then...
I. x2 - 5x - 14 = 0
II. y2 - 16y + 64 = 0
I. 96x² + 52x - 63 = 0
II. 77y² + 155y + 72 = 0
I.8(x+3) + 8(-x) =72
II. 5(y + 5) + 5(-y) = 150
I. 4x² - 21x + 20 = 0
II. 8y² - 22y + 15 = 0
I. 3x2 – 17x + 10 = 0
II. y2 – 17y + 52 = 0
I. 2x2 – 19x + 45 = 0
II. y2 – 14y + 48 = 0
Roots of the quadratic equation 2x2 + x – 528 = 0 is
I. 2y2 - 15y + 18 = 0
II. 2x2 + 9x - 18 = 0
I. 2x² - 15x + 13 = 0
II. 3y² - 6y + 3 = 0
