A Young tableau is a 2D array of integers increasing from left to right and from top to bottom. Any unfilled entries are marked with ∞, and hence there cannot be any entry to the right of, or below a ∞. The following Young tableau consists of unique entries. 1 2 5 14 3 4 6 23 10 12 18 25 31 ∞ ∞ ∞ When an element is removed from a Young tableau, other elements should be moved into its place so that the resulting table is still a Young tableau (unfilled entries may be filled in with a ∞). The minimum number of entries (other than 1) to be shifted, to remove 1 from the given Young tableau is ________.

Test Index

GATE Computer Science (CS) 2015 Shift 2 Solved Paper

Question : 48

Total: 65

Go to Question:

Prev Question

Next Question