Homework Answers
public boolean isPathTree(){
return isPT(root.left) &&
isPT(root.right);
}
private boolean isPT(BTNode<T>p){
if(p == null)return true;
if(p.left!=null && p.right!=null)return false;
if(p.left!=null)return isPT(p.left);
return isPT(right);
}
public <T> void removeItem(Queue q , T e,int i){
int k =0;
for(int j=0;j<q.length();j++){
T t = q.serve();
q.enqueue(t);
if(t.equals(e))k++;
}
if(k>=i){
for(int
j=0;j<q.length();j++){
T t =
q.serve();
if(!t.equals(e))q.enqueue(t);
}
}
}
(1)int k =0;
(2)for(int j=0;j<q.length();j++){
(3)T t = q.serve(); q.enqueue(t);
(4)if(t.equals(e))k++;
(5)if(k>=i){
(6)for(int j=0;j<q.length();j++){
(7)T t = q.serve();
(8)if(!t.equals(e))q.enqueue(t);
(9)None
Add Answer to:
CSC 212 Page 6 of 9 Question 4..... ........... 20 points We can represent the path...
Design and implement a class Q that uses Q.java as a code base. The queue ADT...
Design and implement a class Q that uses Q.java as a code base. The queue ADT must use class LinkedList from Oracle's Java class library and its underlying data structure (i.e. every Q object has-a (contains) class LinkedList object. class Q is not allowed to extend class LinkedList. The methods that are to be implemented are documented in Q.java. Method comment blocks are used to document the functionality of the class Q instance methods. The output of your program must...
// =================== Support Code ================= // Queue // // // // - Implement each of the functions to create a working circular queue. // - Do not change any of the function declarations // ...
// =================== Support Code ================= // Queue // // // // - Implement each of the functions to create a working circular queue. // - Do not change any of the function declarations // - (i.e. queue_t* create_queue(unsigned int _capacity) should not have additional arguments) // - You should not have any 'printf' statements in your queue functions. // - (You may consider using these printf statements to debug, but they should be removed from your final version) // ==================================================...
how do I change my code to generic form *********************************************************************** public class UnboundedStackQueue { //question#3 }...
how do I change my code to generic form *********************************************************************** public class UnboundedStackQueue { //question#3 } class Stack { Node head; int size; Stack() //default constructor { this.head=null; this.size=0; } //Input = data //Output = void (just adds value to list) // method pushes elements on stack // time: O(1) // space: O(1) public void push(int data) { Node node=new Node(data); node.next=head; head=node; size++; } //Input = none //Output = top of stack // method pops value from top of...
I was told I need three seperate files for these classes is there anyway to tie...
I was told I need three seperate files for these classes is there anyway to tie all these programs together into one program after doing that. I'm using netbeans btw. import java.util.ArrayList; import java.util.Scanner; /** * * */ public class MySorts { public static void main(String[] args) { Scanner input = new Scanner(System.in); String sentence; String again; do { System.out .println("Enter a sentence, I will tell you if it is a palindrome: ");...
Complete the code below, test cases to use are at the bottom package Labs; public class ResizingQ...
Complete the code below, test cases to use are at the bottom package Labs; public class ResizingQueue { private final int INITIAL_SIZE = 10; private int [] A = new int[INITIAL_SIZE]; // array to hold queue: front is always at Q[0] // and rear at A[next-1] int next = 0; // location of next available unused slot // interface methods public void enqueue(int key) { //TODO: push the key onto the back of the queue // YOUR CODE HERE! }...
Hi how does this code work'?njobs is the number of jobs in queue?? how can we...
Hi how does this code work'?njobs is the number of jobs in
queue?? how can we add a job in queue in priority order?
// add a new job to the queue in priority order void addToQ(JobQ *g, Job j) assert( != NULL); int i, ki for (i = 0; i < q->njobs; i++) if () .priority > .->jobs[i].priority) break; for (k = q->njobs; k > i; k--) q->jobs[k] = q->jobs [k-1]; q->jobs[i] = j; q->njobs++;
AQueue.java class AQueue implements Queue { private E queueArray[]; // Array holding queue elements private static...
AQueue.java
class AQueue implements Queue {
private E queueArray[]; // Array holding queue elements
private static final int DEFAULT_SIZE = 10;
private int maxSize; // Maximum size of queue
private int front; // Index of front element
private int rear; // Index of rear element
// Constructors
@SuppressWarnings("unchecked") // Generic array allocation
AQueue(int size) {
//BUG #1: maxSize = size
maxSize = size+1; // One extra space is allocated
rear = 0; front = 1;
queueArray = (E[])new Object[maxSize]; //...
i was able to make sense on the others but this two i need help Name:...
i was able to make sense on the others but this two i need help Name: ImprovedQueue<T> Access Modifier: public Implements: QueueInterface<T> Instance variables Name: front Access modifier: private Data type: QueueNode<T> Constructors: Name: ImprovedQueue Access modifier: public Parameters: none (default constructor) Task: sets the value of front to null Methods Name: isEmpty Access modifier: public Parameters: none Return type: boolean Task: returns true if the front is equal to null; otherwise return false Name: dequeue Access modifier: public Parameters:...
In Java. How would this method look? LinkedBinaryTree.java import java.util.Iterator; public class LinkedBinaryTree implements BinaryTreeADT {...
In Java. How would this method look?
LinkedBinaryTree.java
import java.util.Iterator;
public class LinkedBinaryTree implements BinaryTreeADT {
private BinaryTreeNode root;
/**
* Creates an empty binary tree.
*/
public LinkedBinaryTree() {
root = null;
}
/**
* Creates a binary tree from an existing root.
*/
public LinkedBinaryTree(BinaryTreeNode root) {
this.root = root;
}
/**
* Creates a binary tree with the specified element...
Array-based Queue Lecture 6 Two Class Exercises | Class Exercise #1 - Create an array-based queue that holds value...
Array-based Queue Lecture 6 Two Class Exercises | Class Exercise #1 - Create an array-based queue that holds values of double data type. 1.) Create a program that produces the following output OUTPUT: Q Quit Enter your choice: e Enter an item: 1.1 E Enqueue D Dequeue s-show queue ← showMenuO function called in main) OQuit // screen clears-.. continue enqueuing.screen clearing with each iteration Enter your choice: e Queue is full. E Enqueue D Dequeue s Show queue 0...
Hi how does this code work'?njobs is the number of jobs in
queue?? how can we add a job in queue in priority order?
// add a new job to the queue in priority order void addToQ(JobQ *g, Job j) assert( != NULL); int i, ki for (i = 0; i < q->njobs; i++) if () .priority > .->jobs[i].priority) break; for (k = q->njobs; k > i; k--) q->jobs[k] = q->jobs [k-1]; q->jobs[i] = j; q->njobs++;
AQueue.java
class AQueue implements Queue {
private E queueArray[]; // Array holding queue elements
private static final int DEFAULT_SIZE = 10;
private int maxSize; // Maximum size of queue
private int front; // Index of front element
private int rear; // Index of rear element
// Constructors
@SuppressWarnings("unchecked") // Generic array allocation
AQueue(int size) {
//BUG #1: maxSize = size
maxSize = size+1; // One extra space is allocated
rear = 0; front = 1;
queueArray = (E[])new Object[maxSize]; //...
In Java. How would this method look?
LinkedBinaryTree.java
import java.util.Iterator;
public class LinkedBinaryTree implements BinaryTreeADT {
private BinaryTreeNode root;
/**
* Creates an empty binary tree.
*/
public LinkedBinaryTree() {
root = null;
}
/**
* Creates a binary tree from an existing root.
*/
public LinkedBinaryTree(BinaryTreeNode root) {
this.root = root;
}
/**
* Creates a binary tree with the specified element...
Array-based Queue Lecture 6 Two Class Exercises | Class Exercise #1 - Create an array-based queue that holds values of double data type. 1.) Create a program that produces the following output OUTPUT: Q Quit Enter your choice: e Enter an item: 1.1 E Enqueue D Dequeue s-show queue ← showMenuO function called in main) OQuit // screen clears-.. continue enqueuing.screen clearing with each iteration Enter your choice: e Queue is full. E Enqueue D Dequeue s Show queue 0...
Most questions answered within 3 hours.
-
A block is hung by a string from the inside roof of a van. When
the...
asked 8 seconds ago -
Do you think companies should not go for long term debt in their
capital structure to...
asked 8 minutes ago -
I create an address book where the user enters the name, phone
and email in the...
asked 14 minutes ago -
The production capacity for acrylonitrile
(C3H3N) in the United States exceeds 2
million pounds per year....
asked 22 minutes ago -
explain and comment out your answer
43. How many address lines are required to address a...
asked 28 minutes ago -
A sample of 45 observations is selected from a normal
population. The sample mean is 49,...
asked 43 minutes ago -
A construction company is planning to bid on a building
contract. The bid costs the company...
asked 40 minutes ago -
A firm operating in a purely competitive environment is faced
with a market price of $250....
asked 47 minutes ago -
•Let’s say someone claims the average population size is
600 feet squared and the housing authority...
asked 55 minutes ago -
Cynaide is a deadly poison that blocks the last step in the
electron transport chain of...
asked 59 minutes ago -
Your friend tells you that there is a vending machine on campus
that dispenses M&M packs...
asked 1 hour ago -
What advantages are there to using piperidine rather than
hydroxide as a base?
asked 1 hour ago