Make a list of 500 three-digit numbers using a random number generator. Make a FILE with a list of the 500 numbers in order. Create artificial storage blocks on the sequential list, each of which can hold no more than 10 digits. The highest key in each storage block is recorded together with the storage block's address in an index called INDX that is opened over the sequential list FILE. Indexed Sequential search should be used to search for keys K in FILE. Compare how many comparisons the search made to how many the sequential search made using the same set of keys. Include an index over the index INDX in the extension of the implementation.

Assume that the input is a sorted list of distinct integers and a key to be inserted into this sorted list. Your task is to return either the location index of the key within the sorted list if the target is found. If the key is not found in the sorted list, return the index where it should be if we were to do an insertion. Input Format sorted list the last number is the target number eg 4 5 6 7 6 Constraints from sys import stdin def searchInsert(nums, target): # put in your code here if __name__ == '__main__': # put in your code here Output Format The index of where the key should be inserted in. eg 2 Sample Input 0 2 4 6 8 5 Sample Output 0 2

Write a program (call it intersection.py) that finds all gene symbols that appear both in the chr21_genes.txt file and in the HUGO_genes.txt file. These gene symbols should be printed to a file in alphabetical order (you can hard code the output file OUTPUT/intersection_output.txt) . The program should also print on the terminal how many common gene symbols were found. Use Lists or Sets to solve the problem. It is fine to use a temporary Dictionary to find the intersection of two Lists, but this can be simplified with Sets. Note: HUGO_genes.txt could have some duplicate entries.Remember to have these command line options:$ python3 intersection.py -h usage: intersection.py [-h] -i1 FILE1 -i2 FILE2 Provide two gene list (ignore header line), find intersection optional arguments: -h, --help show this help message and exit -i1 INFILE1, --infile1 INFILE1 Gene list 1 to open -i2 INFILE2, --infile2 INFILE2 Gene list 2 to open $ python3 intersection.py -i1 chr21_genes.txt -i2 HUGO_genes.txt #…

When each object in a collection has a priority, how should you organize several objects that have the same priority? One way is to order the objects with the same priority in chronological order. Thus, you can create a priority queue of queues. Design such an ADT.

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.

What exactly does it mean when something is deleted using the delete operator?

In the third step, you will review the Quicksort and the Insertion Sort code. You will recall from the class presentation that it was suggested that Quicksort is not very efficient when the partition sizes become very small. It was also suggested in class that most implementations of Quicksort switch to another method when the partition size gets small. Create a new version of the Quicksort code to switch to Insertion sort on partitions less than 32 data items in size. 1. Confirm, using a small data set, that your version works. 2. Run a comparison between the original Quicksort and your new version in a way like the way you did comparisons in Step 2. Use the RANDOM.TXT file for the data to test both versions - with at least 50000 items of data in your input file.

in C++ answer the following question in the image :

JAVA: Use the "natural split" algorithm on the file split.txt and answer the following question: How many elements are in the first list?   Split.txt file 200494 774 644 345 521 61 27 28 584 569 66 857 210 2 211 675 548 596 188 647 671 517 408 475 615 113 731 522 850 17 640 940 556 517 602 935 76 578 880 428 168 394 381 497 247 368 137 138 619 973 895 106 838 45 921 800 681 660 490 427 937 917 786 959 152 604 837 749 684 963 926 963 988 492 385 458 788 7 62 46 932 996 787 634 34 616 71 128 686 578 923 532 933 545 100 224 895 595 342 933 934 797 120 565 495 884 237 648 843 599 157 843 192 279 301 649 382 881 667 178 126 746 44 601 22 52 769 708 991 83 447 786 525 168 328 922 153 367 22 689 834 774 93 110 547 597 644 726 237 20 370 573 391 225 750 897 956 839 951 455 8 509 746 338 576 276 277 341 274 891 723 53 966 271 50 990 493 823 833 306 619 461 768 832 736 759 920 451 549 833 911 123 907 225 252 179 177 272 747 859

Select a states that is not q2 from the GNFA to delete. Then, create a new GNFA for the deleted state that is equivalent to M but does not have the selected state.