Java代写 | Com S 311 Assignment 2 Implementing an Extended Priority Interface

本次cs代写的主要内容是使用java编程进行堆数据结构的实现

Com S 311 Spring 2021
Assignment 2: Implementing an Extended Priority Interface

Due: March 12, 11:59 pm
Early Submission: March 11, 11:59 p.m. (5% bonus) Late Submission: March 13, 11:59 A.M. (25% penalty)

Introduction

This assignment gives you an opportunity to work on the heap data structure by implementing an extended priority interface in Java. The interface is defined in a given template code segment, with many of its methods already completed. Your task is to implement the remaining methods marked by TODO before their method headings. You should study the completed methods along with comments carefully before you complete the remaining methods. Note that Java is 0-based for array and list indexes, instead of 1-based. If an array A[0..n−1] of length n is used to implement a nearly complete tree for a heap, then the index for the parent of a child at index j is ⌊j − 1⌋/2, the index for the left child of a parent at index j is 2j + 1, and that for the right child is 2j + 2. In the template code segment, an instance of ArrayList<E> is used as an array list for the heap, where indexes in this array list of length n are 0, 1, …, n − 1. Note that if an element is removed from the heap, then an element is also removed from this array list so that the length of this array list is always the size of the heap.

You are allowed to discuss with classmates, but you must work on the homework problems on your own. You should write the final code alone, without consulting anyone.

Below is a sample code segment to use the Heap class along with its output.

  public static void main(String[] args)
  {
     Heap<Integer>  pq = new Heap<Integer>();
     pq.add(10);
     pq.add(15);
     pq.add(20);
     pq.add(30);
     pq.add(25);
     pq.add(25);
     pq.add(30);
     pq.add(40);
     pq.add(35);
     pq.add(50);

1

     pq.add(10);
     pq.showHeap();
     System.out.println( pq.getLastInternal() );
     pq.trimEveryLeaf();
     pq.showHeap();
     while ( ! pq.isEmpty() )
     {
       System.out.println( pq.removeMin() );
     }
     List<String>  alist = new ArrayList<String>();
     alist.add("TGA");
     alist.add("ACG");
     alist.add("GCT");
     alist.add("GTA");
     System.out.println( "Before sorting: " + alist.toString() );
     heapSort(alist);
     System.out.println( "After sorting: " + alist.toString() );

}
} // Heap

// The root is shown on the leftmost column, with its children on the next column,
// The string null means no child is present.
Output:

>10 >10

>30 >40

>null

>null >35

>null

>null >15

   >50
    >null
    >null
   >25
    >null
    >null

>20

2

   >25
    >null
    >null
  >30
   >null
   >null

15 >10

>10 >30

>null

>null >15

>null

>null >20

>null

>null 10

10
15
20
30
Before sorting: [TGA, ACG, GCT, GTA]
After sorting: [ACG, GCT, GTA, TGA]

程序代写代做C/C++/JAVA/安卓/PYTHON/留学生/PHP/APP开发/MATLAB


blank

本网站支持淘宝 支付宝 微信支付  paypal等等交易。如果不放心可以用淘宝交易!

E-mail: itcsdx@outlook.com  微信:itcsdx


如果您使用手机请先保存二维码,微信识别。如果用电脑,直接掏出手机果断扫描。

blank

发表评论