Learn the differences between linked allocation, contiguous allocation, and indexed file allocation.

Select problem below. Your post must include: The problem statement. A description of your solution highlighting the use of the split(), join(), lists and the different list operations involved in solving the problems. Include line numbers from your program. please make it simple and DONT use Java   Create a program and reads a MAC address and determines whether it is syntactically correct or not. Assume the format of the MAC address is dd-dd-dd-dd-dd-dd where dd represents a 2-character hexadecimal number (each character is a digit or a letter between a and f). Use the `split function to access the values in the input MAC address.

27. Colton is working on the data structure that is to be used by Universal Bank to store the transactions of users to be displayed on their website interface when the user logs in. Load time needs to be fast, so a fast insertion time is mandatory. The data stored and loaded from the server is already in sorted order.so it is read into Colton's program in sorted order. The data structure does not need fast search times, and no deletion is allowed. The transactions will be shown on the website in order. What data structure would work well for Colton?

Which of the following statement or statements are true ? Please check all that apply.           Both the linkedlist and array size needs to be pre-decided         Arrays have better cache locality that can make them better in terms of performance.         It's easier to insert and delete elements from array than from the linkedlist         Data type of the linked list doesnot need to be same, whereas in array, it must be the same         memory can be allocated at runtime both for linkedlist and dynamic array Which of the following statements are true? Check all that applies 5 points         Accessing any element of an array has the time complexity of O(n)         Searching for an element in array and linkedlist has the same time complexity         Inserting or Deleting an element from a stack or queue has the same time complexity         Accessing an element from a singly…

Need help with the questions provided below.

Please answers fast Implement an external sort, which uses intermediate files to sort files bigger than main memory. Why Mergesort is a better algorithm than heapsort or quicksort to base such an implementation on? Test your program both on files with small records and on files with large records.

[5] In Partition () of QuickSort(), which final position of the Pivot will be a useful one? The first index, the middle index or the last index? Would there be any other useful one beside those indicies? Why or why not?

Compare and contrast the two advantages of binary vs. linear searching.

Compare and contrast the two advantages of binary vs. linear searching.