Data Structure and Algorithms

Q1. Singly Linked List :

Given an initiallyempty singly linked list, perform the following operations:

• Initial List: A,B,C,D,E,F
• Add First: Add elements N, and H at the beginning of linked list.
• Add Last: Add elements A, K, and L at the end of linked list.
• Remove First: Remove elementfrom the beginning of linked list.
• Display the resulting LinkedList.

Q2. UnsortedArray and BinarySearch :

Consider the following unsorted array:

B[10]={42,18,7,91,29,63,14,55,37,25}

• Sort the given arrayB in ascending order Using Selection Sort.
• Show each step of the sorting processand provide the final sorted array.
• After sorting, perform a Binary Search for the key 55 in the sorted array.
• Demonstrate the step-by-step processof the binary search, explicitly stating each comparison made and the outcome at each step.
• State the final result and the positionof the key in thesorted array.