The document outlines various data structure and algorithm tasks, including searching, sorting, and operations on linked lists, stacks, and queues. It also covers recursion techniques for calculating factorials, Fibonacci series, and GCD, as well as matrix operations such as converting sparse matrices and implementing different types of matrices. Each category specifies specific tasks to be performed using different methods and data structures.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
0 ratings0% found this document useful (0 votes)
3 views
algorithm_tasks_corrected
The document outlines various data structure and algorithm tasks, including searching, sorting, and operations on linked lists, stacks, and queues. It also covers recursion techniques for calculating factorials, Fibonacci series, and GCD, as well as matrix operations such as converting sparse matrices and implementing different types of matrices. Each category specifies specific tasks to be performed using different methods and data structures.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 1
Category Task
Searching Search an element from a list: Linear or Binary search
Sorting Al Sort a list using Insertion, Bubble, or Selection sort Linked List Linked List: Insertion, deletion, and search; Reverse the list Linked List Linked List: Index lists and operator + overload Linked List Doubly Linked List: Insertion, deletion, and search; Reverse the list Linked List Circular Linked List: Insertion, deletion, and search; Reverse the list Stacks andStack operations using Linked List Stacks andStack operations using Array Stacks andQueue operations using Circular Array Stacks andDouble-ended Queues Recursion aCalculate factorial and compute factors (i) using recursion, (ii) using iteration Recursion aDisplay Fibonacci series (i) using recursion, (ii) using iteration Recursion aCalculate GCD of 2 numbers (i) with recursion, (ii) without recursion Matrix OpeConvert Sparse Matrix into non-zero form and vice-versa Matrix OpeReverse order of elements in a stack using additional stack Matrix OpeReverse order of elements in a stack using additional Queue Matrix OpeImplement Diagonal Matrix using one-dimensional array Matrix OpeImplement Lower Triangular Matrix using one-dimensional array Matrix OpeImplement Upper Triangular Matrix using one-dimensional array Matrix OpeImplement Upper Triangular Matrix using one-dimensional array Matrix OpeImplement Symmetric Matrix using one-dimensional array