GATEverse Practice, past papers & mock tests
GATE 2027: 115 days Sign in Create account
GATE 2015 · Set-2
Programming & Data StructuresArrayshardNAT2 marks
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 with a ∞). The minimum number of entries (other than 1) to be shifted, to remove 1 from the given Young tableau is
Save your progress

Related Programming & Data Structures PYQs

GATE 2015 · Set-1

Consider the following New-order strategy for traversing a binary tree: • Visit the root; • Visit the right subtree using New-orde…

GATE 2015 · Set-3

Consider the following array of elements. 〈89, 19, 50, 17, 12, 15, 2, 5, 7, 11, 6, 9, 100〉. The minimum number of interchanges nee…

GATE 2015 · Set-1

What is the output of the following C code? Assume that the address of x is 2000 (in decimal) and an integer requires four bytes o…

GATE 2015 · Set-3

Consider the following C program segment. ```c #include <stdio.h> int main() { char s1[7] = "1234", *p; p = s1 + 2; *p…

GATE 2015 · Set-3

Consider the following C program. ```c #include <stdio.h> int main() { static int a[] = {10, 20, 30, 40, 50}; static int *…

GATE 2015 · Set-3

Consider the following two C code segments. Y and X are one and two dimensional arrays of size n and n x n respectively, where 2 <…