Student should be able to develop the programs for queue using arrays and linked list By Using C++ software. Exercise 1: Implementation of Queue using Array or Linked list Consider a real life situation. Formulate a question and then design a simulation that can help to answer it. Choose one of the following situations: • Cars lined up at a car wash • Customers at a grocery store check-out • Airplanes taking off and landing on a runway • A bank teller Be sure to state any assumptions that you make and provide any probabilistic data that must be considered as part of the scenario.

Sorting is useful as the first step in many different tasks. The most common task is to make finding things easier, but there are other uses as well. In this case, it will make it easier to determine which pair or pairs of elements have the smallest absolute difference between them. Example [5, 2, 3, 4, 1] arr = Sorted, arr' = [1, 2, 3, 4, 5]. Several pairs have the minimum difference of 1: [(1,2), (2, 3), (3, 4), (4, 5)]. Return the array [1, 2, 2, 3, 3, 4, 4, 5]. Note As shown in the example, pairs may overlap. Given a list of unsorted integers, arr, find the pair of elements that have the smallest absolute difference between them. If there are multiple pairs, find them all. Function Description Complete the closestNumbers function in the editor below. closestNumbers has the following parameter(s): int arr[n]: an array of integers Returns - int[]: an array of integers as described Input Format The first line contains a single integer n, the length of arr. The second line contains n…

1. a function that takes in a list (L), and creates a copy of L. note: The function should return a pointer to the first element in the new L. [iteration and recursion].   2. a function that takes in 2 sorted linked lists, and merges them into a single sorted list. note: This must be done in-place, and it must run in O(n+m).

Student should be able to develop the programs for queue using arrays and linked list Exercise 1: Implementation of Queue using Array or Linked list Real life situation. Design a simulation that can help to answer it. Customers at a grocery store want to check-out The grocery have 3 counter and the costumer must choose one of the counter Counter 1:3 people assembly Counter 2: 2 people assembly Counter 3: 3 people assembly The costumer should choose the fastest way to check out

PLEASE WRITE IN C++ Implement a program that uses an array based binary tree (sequential tree) that has a menu with these options: 1.) insert (This option asks the user for a size and then creates the array based tree, filling the tree with characters or integers . Fill the sequential tree as a complete tree and insert keys as children to specific parents, It is also straightforward to insert children to specific parents due to the fixed nature of the parent child relationship, with a parent having children at indexes ( 2 * Parent index ) + 1, and + 2.). 2.) search (asks user for a character to search in the tree then prints if it is in the tree or not.) 3.) quit (exits program)

What the code is about: Implement a recursive algorithm to add all the elements of a non-dummy headed singly linked linear list. Only head of the list will be given as parameter where you may assume every node can contain only integer as its element.Note: you’ll need a Singly Node class for this code. **PLEASE EXPLAIN HOW THE NODE CLASS AND THE CONSTRUCTOR OF THE NODE CLASS IS WORKING IN THIS CODE**   #singlty node class for single linked listclass node:  def __init__(self, value = None, next=None):     self.value = value    self.next = nextdef AddAll(head):#takes head of single linked list head    if head==None:        return 0#if reached end of the linked list    return AddAll(head.next) + head.value    #each node's next pointer is passed in recursive call    #and value of each node is added while returning from recursive call

Write a C++ class called BSTArray with five basic functions for the BST: insert, search, findmin, findmax, and print: 1. int search(x): Find and return the index that stores element x using binary search tree mechanism. Print out all the elements in the search path. You must use the binary tree search algorithm. In other words, do NOT just do a linear search of the array. If the x value is not found, report an error and return -1. 2. int findmax( ): Find and return maximum value in BST. You must use the binary tree search algorithm. In other words, do NOT just perform a linear search of the array. If the tree is empty, return -1. 3. int findmin( ): Find and return minimum value in BST. In other words, do NOT just perform a linear search of the array. If the tree is empty, return -1. 4. void print( ): Print out the BST structure in the form of an array with index. Specifically, print the index of the array and the value stored at that index starting at zero and ending at the capacity of…

python assignment  Matrix class Implement a matrix class (in matrix.py).  a) The initializer should take a list of lists as an argument, where each outer list is a row, and each value in an inner list is a value in the corresponding row.  b) Implement the __str__ method to nicely format the string representation of the matrix: one line per row, two characters per number (%2d) and a space between numbers. For example: m = Matrix([[1,0,0],[0,1,0],[0,0,1]]) print(m)> 1  0  0> 0  1  0> 0  0  1 c) Implement a method scale(factor) that returns a new matrix where each value is multiplied by scale. For example: m = Matrix([[1,2,3],[4,5,6],[7,8,9]])n = m.scale(2)print(n)> 2  4  6> 8 10 12>14 16 18print(m)> 1  2  3> 4 5 6> 7 8 9 d) Implement a method transpose() that returns a new matrix that has been transposed. Transposing flips a matrix over its diagonal: it switches rows and columns. m = Matrix([[1,2,3],[4,5,6],[7,8,9]])print(m)> 1  2  3> 4 5 6> 7 8…

make flowchart for this one plz   #include<stdio.h>int sortingbook(int array[], int N){ int count = 0, i , j , k , minimum , index , flag = 0; for(i=0;i<N;i++) {  minimum = array[i];   //ith element as the minimum  index = i;          //setting index value as i  for( j = i; j < N; j++)  {   if(array[j] < minimum)   {    minimum = array[j];  //calculating minimum    index = j;     //assigning the minimum position into index   }  }  for(k = index; k>i ; k--)  //shifting one position to the right from index to i   array[k] = array[k-1];   if(array[i]!=minimum)   count++;  //if the value of min chganged from previous assumption   array[i] = minimum;  } return count;}int main(){ int array[20],i,N,c; printf("\nEnter number of books(N) : "); scanf("%d",&N);  //number of books printf("\nEntercurrent sequence of  %d books :  \n=>   ",N); for(i=0;i<N;i++)  scanf("%d",&array[i]);  //reading  sqeuence  c = sortingbook(array,N); printf("\nSorted sequence is :\n=>…