This document provides descriptions for 20 different programming problems involving arrays, matrices, linked lists, stacks, queues, sorting, searching and other data structures. The problems include writing programs to find the second non-repeating number in an array, reverse an array, find common elements between arrays, multiply matrices, find the transpose of a matrix, interchange the largest and smallest elements, find the occurrence of a number, display the Fibonacci series, and calculate the factorial of a number. Other problems involve finding the greatest common divisor, implementing stacks, queues, linked lists and their variations, as well as binary search trees, and different sorting and searching algorithms like insertion sort, selection sort, bubble sort, quick sort and merge sort.
This document provides descriptions for 20 different programming problems involving arrays, matrices, linked lists, stacks, queues, sorting, searching and other data structures. The problems include writing programs to find the second non-repeating number in an array, reverse an array, find common elements between arrays, multiply matrices, find the transpose of a matrix, interchange the largest and smallest elements, find the occurrence of a number, display the Fibonacci series, and calculate the factorial of a number. Other problems involve finding the greatest common divisor, implementing stacks, queues, linked lists and their variations, as well as binary search trees, and different sorting and searching algorithms like insertion sort, selection sort, bubble sort, quick sort and merge sort.
This document provides descriptions for 20 different programming problems involving arrays, matrices, linked lists, stacks, queues, sorting, searching and other data structures. The problems include writing programs to find the second non-repeating number in an array, reverse an array, find common elements between arrays, multiply matrices, find the transpose of a matrix, interchange the largest and smallest elements, find the occurrence of a number, display the Fibonacci series, and calculate the factorial of a number. Other problems involve finding the greatest common divisor, implementing stacks, queues, linked lists and their variations, as well as binary search trees, and different sorting and searching algorithms like insertion sort, selection sort, bubble sort, quick sort and merge sort.