The document outlines 7 programming problems related to data structures: 1) swapping two numbers using call by reference, 2) swapping two same-sized integer arrays using call by reference, 3) reversing an array by swapping without extra memory, 4) swapping two strings using pointers, 5) finding the number of non-repeated elements in an array, 6) identifying missing numbers in a given array within a specified range, and 7) finding the median of elements after merging two sorted arrays of the same size.
The document outlines 7 programming problems related to data structures: 1) swapping two numbers using call by reference, 2) swapping two same-sized integer arrays using call by reference, 3) reversing an array by swapping without extra memory, 4) swapping two strings using pointers, 5) finding the number of non-repeated elements in an array, 6) identifying missing numbers in a given array within a specified range, and 7) finding the median of elements after merging two sorted arrays of the same size.
The document outlines 7 programming problems related to data structures: 1) swapping two numbers using call by reference, 2) swapping two same-sized integer arrays using call by reference, 3) reversing an array by swapping without extra memory, 4) swapping two strings using pointers, 5) finding the number of non-repeated elements in an array, 6) identifying missing numbers in a given array within a specified range, and 7) finding the median of elements after merging two sorted arrays of the same size.
I. WAP with function to swap two numbers using call by reference.
II. WAP with function to swap two integer arrays of same size using call by reference. III. WAP to reverse an array by swapping (without using additional memory). IV. WAP with function to swap two strings using pointers. V. WAP to find the number of non-Repeated elements in an Array. VI. WAP to identify the missing numbers in a given Array within the range [1...N]. VII. WAP to find the Median of the elements after merging the two sorted Arrays of same size.