Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Palindrome: Write a recursive program to find out if the strings in the file strings.txt are palindromes are not [Programming, 10 Points] . Implement a

  1. Palindrome: Write a recursive program to find out if the strings in the file strings.txt are palindromes are not [Programming, 10 Points].
  1. Implement a method that uses insertion sort to sort numbers. Use the numbers provided in files (100.txt, 1000.txt, 5000.txt, 50000.txt, 100000.txt and 500000.txt) as input. Measure the time taken to sort these numbers (do not include the file IO time). Plot the time taken to sort the numbers [Programming, 35 points] .
  1. Read about the problem towers of Hanoi. How is recursion used to solve this problem [Reading, 5 Points].

Files to submit.

  1. A report that briefly talks about your solution to each of the problem (the explanation should not exceed more than half pages each).
  1. Seperate file for each of the programs.

100.txt

4 50 34 40 22 54 94 3 94 38 8 95 0 36 54 54 81 30 24 98 12 25 43 0 52 52

88 22 83 70 96 57 89 53 13 64 74 18 37 86 73 76 15 1 93 69 77 81 29 78 14

45 67 1 0 41 60 63 74 16 75 75 36 49 68 5 67 29 15 84 47 77 40 80 24 61 25

7 85 83 81 47 10 39 22 72 87 64 92 27 50 69 12 54 23 85 38 75 73 94

1000.txt

955 462 237 790 505 242 457 808 741 988 959 208 48 44 901 335 476 366 491

14 540 99 122 499 553 829 456 447 815 20 162 138 324 118 59 940 610 716

570 287 931 27 706 87 354 579 303 503 160 731 868 541 616 104 153 703 408

497 587 288 915 172 732 538 84 670 256 961 863 495 280 624 37 11 579 117

833 956 808 173 837 779 847 672 625 835 363 825 991 163 936 896 816 150

408 728 428 912 653 658 774 616 620 181 837 300 348 840 526 954 595 370

682 775 915 108 948 528 247 15 990 901 592 445 971 569 914 969 223 476 191

141 781 454 445 80 841 915 668 157 191 789 784 847 371 280 168 39 675 289

818 699 63 560 930 808 744 676 518 920 479 70 726 508 630 100 632 540 585

75 695 321 498 818 452 736 182 16 735 453 616 108 435 540 754 931 850 183

221 673 680 911 78 955 84 779 7 8 544 472 161 997 944 190 470 485 913 453

341 968 460 700 552 122 892 657 650 165 265 961 285 296 943 482 744 678

356 83 413 877 737 318 3 934 411 719 178 524 228 850 625 742 825 297 739

126 743 87 795 445 844 847 928 638 82 150 266 56 460 91 299 790 914 142

930 476 935 709 677 407 983 620 207 170 128 988 666 339 894 504 350 900

997 239 822 227 497 445 975 402 931 699 445 602 138 969 422 88 807 806 208

45 306 948 755 167 910 57 60 411 431 186 502 779 116 843 131 346 860 184

466 9 984 967 586 578 287 381 167 904 643 746 630 739 137 417 782 840 631

884 137 694 700 225 632 867 66 547 587 613 13 2 568 886 806 300 296 280

764 350 837 778 491 850 122 381 752 157 245 841 597 757 110 747 649 0 716

154 920 544 797 804 106 129 576 730 116 881 117 706 453 337 132 568 198

776 116 900 529 255 390 974 136 930 944 102 403 886 996 757 954 705 821

929 2 419 717 166 960 363 938 677 929 627 60 688 26 513 499 967 974 402

856 54 29 933 360 276 99 227 884 83 880 198 980 557 915 628 875 225 769

793 624 472 914 922 479 898 513 627 46 944 985 800 20 9 179 131 89 35 972

544 127 256 342 364 929 390 309 940 569 74 653 807 900 721 987 183 878 347

589 762 121 79 377 313 596 241 544 535 380 906 683 7 217 776 648 834 974

91 43 752 171 0 962 57 475 539 540 717 416 872 941 383 613 967 652 873 483

231 314 861 749 938 908 149 52 449 766 908 637 355 766 693 384 640 80 899

427 913 987 523 208 536 626 776 131 238 18 131 868 394 332 839 991 718 165

831 846 547 557 169 473 239 564 911 964 465 482 327 830 343 223 878 859

426 933 292 446 517 661 360 568 185 777 774 431 630 901 458 294 231 270

361 144 734 852 596 691 505 30 158 634 727 330 181 254 694 505 848 185 617

264 612 635 460 87 352 427 371 824 444 978 220 278 509 726 590 523 759 598

340 532 464 798 502 538 42 590 855 692 671 770 996 779 116 200 77 137 703

131 712 486 931 32 708 67 292 285 395 345 263 439 323 539 261 664 25 428

625 665 326 176 295 613 450 448 937 573 754 667 713 487 509 114 751 51 535

478 664 690 893 599 98 419 65 398 440 594 219 395 236 412 225 829 812 557

69 69 874 592 180 956 574 490 971 697 646 255 605 192 725 682 568 983 912

160 167 551 954 843 454 355 166 686 408 828 364 571 434 524 616 224 363

750 606 691 167 315 728 894 555 475 846 191 462 753 787 931 201 93 248 695

690 699 780 304 772 21 892 688 69 542 147 408 245 441 306 949 792 726 201

917 673 161 40 904 255 119 270 120 939 568 952 837 860 507 860 322 792 541

135 200 139 725 395 158 551 488 664 440 177 195 322 878 71 895 582 79 586

891 647 954 838 23 805 995 511 2 194 581 316 667 874 103 403 816 139 912

902 103 720 907 555 579 621 98 97 623 884 619 632 373 478 478 770 311 850

808 689 259 418 486 613 945 431 783 412 219 161 126 167 167 374 169 573

661 362 77 11 327 614 382 932 514 368 775 3 640 860 962 80 163 106 47 662

544 416 963 960 770 648 129 70 414 445 873 52 731 263 155 898 20 73 754

460 295 1 442 434 376 27 568 395 618 111 161 699 877 723 896 784 761 849

216 48 857 983 503 2 420 461 421 842 980 811 464 953 382 414 311 66 96 898

794 8 2 157 152 9 461 778 803 515 205 974 999 359 461 825 629 884 782 726

879 342 242 503 651 486 16 529 426 747 888 554 741 847 880 676

Please use java to solve that.

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Beginning ASP.NET 2.0 And Databases

Authors: John Kauffman, Bradley Millington

1st Edition

0471781347, 978-0471781349

More Books

Students also viewed these Databases questions

Question

Which process scheduling method is provably optimal?

Answered: 1 week ago

Question

how can a cosmetic mirror be used for survival in a desert

Answered: 1 week ago