Skip to content

array-practical-questions.md

Latest commit

 

History

History
32 lines (30 loc) · 2.09 KB

array-practical-questions.md

File metadata and controls

32 lines (30 loc) · 2.09 KB
Raw
description Practical sample questions for Array and operations.
icon table-cells

Array's Practical Questions

  1. Take N numbers as input, remove all negative numbers, and find the average of remaining elements.
  2. From a given array, replace all even numbers with -1 and all odd numbers with 1.
  3. Delete all elements that are multiples of 4 from the array and print the updated array.
  4. Count how many elements in the array are divisible by both 3 and 5.
  5. Replace prime numbers in the array with 0 and find the sum of non-prime numbers.
  6. Find the smallest and second smallest element in an array.
  7. From a given array, shift all zero elements to the end without changing the order of other elements.
  8. Replace all elements greater than the average value of the array with the average itself.
  9. Count the number of odd numbers and even numbers in a given array.
  10. Delete duplicate elements from an array and display the unique elements.
  11. From the given array, replace multiples of 7 with 7 and multiples of 9 with 9.
  12. Reverse the array and then find the sum of elements at even positions.
  13. Replace all negative numbers with their absolute values and print the modified array.
  14. Find the difference between the largest and smallest elements in the array.
  15. Count how many prime numbers are present in the array.
  16. Replace all numbers ending with digit 5 by 50.
  17. Remove all elements less than 10 and find the average of remaining elements.
  18. Find the frequency of each element in an array.
  19. Replace all odd-position elements with 0 and then find the sum of even-position elements.
  20. Check whether the given array is sorted in ascending order or not.
  21. From the given array, replace multiples of 3 with 0, multiples of 5 with 1, and multiples of both with -1.
  22. Find the maximum element in the array and count how many times it appears.
  23. Delete all prime numbers from the array and print the remaining elements.
  24. Replace every element by the square of that element if it is even, otherwise replace it by its cube.
  25. Rotate the array to the right by one position and display the result.