1. Are you able to relocate, and is traveling an issue for you?
2. Bubble Sort Problem Statement Sort an unsorted array of non-negative integers using the Bubble Sort algorithm, which swaps adjacent elements if they are not in the correct order to sort the array in non-decreasing order. Input: The first line contains an integer 'T', the number of test cases.For each test case:- The first line contains an integer N, the size of the array.- The second line contains 'N' space-separated integers representing the array elements. Output: For each test case, output the sorted array in a separate line in increasing order. Example: Input:156 2 8 4 10Output:2 4 6 8 10 Constraints: 1 <= T <= 100 1 <= N <= 100 1 <= Arr[i] <= 1000 Note: Update the array in place and print the sorted results. No need to handle input/output; just implement the sorting function.
3. Rotate Array Problem Statement The task is to rotate a given array with N elements to the left by K steps, where K is a non-negative integer. Input: The first line contains an integer N representing the size of the array. The second line contains N space-separated integers representing the elements of the array. The last line contains an integer K representing the number of times the array has to be rotated in the left direction. Output: The output consists of N space-separated integers representing the rotated array elements. Example: Input: N = 5 array = [1, 2, 3, 4, 5] K = 2 Output: [3, 4, 5, 1, 2] Constraints: 1 <= N <= 103 1 <= arr[i] <= 109 1 <= K < N
4. What is the P2P cycle? Explain.
5. What is supply chain management
Browse through a variety of job opportunities tailored to your skills and preferences. Filter by location, experience, salary, and more to find your perfect fit.
We have sent an OTP to your contact. Please enter it below to verify.
Instantly access job listings, apply easily, and track applications.
