You must write the correct code for all member methods so that queue functionality can be obtained. Changes to the class definition, instance variables, and signatures of the membership method are not allowed. This class has no main method.
package javaclass;
/**
* A queue structure of Movie objects. Only the Movie values contained
* in the queue are visible through the standard queue methods. The Movie
* values are stored in a DoubleLink object provided in class as attribute.
*
*
*
* @version 2013-07-04
*
* @param Movie
* this data structure value type.
*/
public class DoubleQueue {
// First node of the queue
private DoubleLink values = null;
/**
* Combines the contents of the left and right Queues into the current
* Queue. Moves nodes only - does not move value or call the high-level
* methods insert or remove. left and right Queues are empty when done.
* Nodes are moved alternately from left and right to this Queue.
*
* @param source1
* The front Queue to extract nodes from.
* @param source2
* The second Queue to extract nodes from.
*/
public void combine(final DoubleQueue source1,
final DoubleQueue source2) {
// your code here
}
/**
* Adds value to the rear of the queue.
*
* @param value
* The value to added to the rear of the queue.
*/
public void insert(final Movie value) {
// your code here
}
/**
* Returns the front value of the queue and removes that value from the
* queue. The next node in the queue becomes the new front node.
*
* @return The value at the front of the queue.
*/
public Movie remove() {
//your code here
return null;//you must change this statement as per your requirement
}
/**
* Returns the value at the front. Must be copy safe
*
* @return the value at the front.
*/
public Movie peekFront() {
// your code here
return null;//you must change this statement as per your requirement
}
/**
* Returns the value at the rear. Must be copy safe.
*
* @return the value at the rear.
*/
public Movie peekRear() {
// your code here
return null;//you must change this statement as per your requirement
}
/**
* Returns all the data in the queue in the form of an array.
*
* @return The array of Movie elements. Must be copy safe
*/
public final Movie [] toArray() {
//your code here
return null;//you must change this statement as per your requirement
}
}
Double link class
package javaclass;
/**
* The class for doubly-linked data structures. Provides attributes
* and implementations for getLength, isEmpty, and toArray methods.
* The head attribute is the first node in any doubly-linked list and
* last is the last node.
*
* @author
* @version 2017-11-01
*
*/
public class DoubleLink {
// First node of double linked list
private DoubleNode head = null;
// Number of elements currently stored in linked list
private int length = 0;
// Last node of double linked list.
private DoubleNode last = null;
/**
* Adds a new Movie element to the list at the head position
* before the previous head, if any. Increments the length of the List.
*
* @param value
* The value to be added at the head of the list.
*
* @return true if node is added successfully, else false.
*/
public final boolean addNode(final Movie value) {
//your code here
return false;//you must change this statement as per your requirement
}
/**
* Removes the value at the front of this List.
*
* @return The value at the front of this List.
*/
public Movie removeFront() {
// your code here
return null;//you must change this statement as per your requirement
}
/**
* Returns the head element in the linked structure. Must be copy safe.
*
* @return the head node.
*/
public final DoubleNode getHead() {
//your code here
return null;//you must change this statement as per your requirement
}
/**
* Returns the current number of elements in the linked structure.
*
* @return the value of length.
*/
public final int getLength() {
//your code here
return -1;//you must change this statement as per your requirement
}
/**
* Returns the last node in the linked structure. Must be copy safe.
*
* @return the last node.
*/
public final DoubleNode getLast() {
//your code here
return null;//you must change this statement as per your requirement
}
/**
* Determines whether the double linked list is empty or not.
*
* @return true if list is empty, false otherwise.
*/
public final boolean isEmpty() {
//your code here
return true;//you must change this statement as per your requirement
}
/**
* Returns all the data in the list in the form of an array.
*
* @return The array of Movie elements. Must be copy safe
*/
public final Movie [] toArray() {
//your code here
return null;//you must change this statement as per your requirement
}
}
In: Computer Science
How to make a random word generator from a list of array?
string word ={ "RD","BL", "YW", "GR","OR","VL","WH","BL" }
The output should produce 4 random words from the list like;
Expected output: RD YW OR BL
CODE USED: C++
In: Computer Science
What will you review within the System/Applications Domain as part of your security assessment?
In: Computer Science
You must write an appropriate code for all member methods so that a double-linked list functionality can be obtained. Changes to the class definition, instance variables, and signatures of the membership method are not allowed. This class has no main method.
package javaclass;
/**
* The class for doubly-linked data structures. Provides attributes
* and implementations for getLength, isEmpty, and toArray methods.
* The head attribute is the first node in any doubly-linked list and
* last is the last node.
*
* @author
* @version 2017-11-01
*
*/
public class DoubleLink {
// First node of double linked list
private DoubleNode head = null;
// Number of elements currently stored in linked list
private int length = 0;
// Last node of double linked list.
private DoubleNode last = null;
/**
* Adds a new Movie element to the list at the head position
* before the previous head, if any. Increments the length of the List.
*
* @param value
* The value to be added at the head of the list.
*
* @return true if node is added successfully, else false.
*/
public final boolean addNode(final Movie value) {
//your code here
return false;//you must change this statement as per your requirement
}
/**
* Removes the value at the front of this List.
*
* @return The value at the front of this List.
*/
public Movie removeFront() {
// your code here
return null;//you must change this statement as per your requirement
}
/**
* Returns the head element in the linked structure. Must be copy safe.
*
* @return the head node.
*/
public final DoubleNode getHead() {
//your code here
return null;//you must change this statement as per your requirement
}
/**
* Returns the current number of elements in the linked structure.
*
* @return the value of length.
*/
public final int getLength() {
//your code here
return -1;//you must change this statement as per your requirement
}
/**
* Returns the last node in the linked structure. Must be copy safe.
*
* @return the last node.
*/
public final DoubleNode getLast() {
//your code here
return null;//you must change this statement as per your requirement
}
/**
* Determines whether the double linked list is empty or not.
*
* @return true if list is empty, false otherwise.
*/
public final boolean isEmpty() {
//your code here
return true;//you must change this statement as per your requirement
}
/**
* Returns all the data in the list in the form of an array.
*
* @return The array of Movie elements. Must be copy safe
*/
public final Movie [] toArray() {
//your code here
return null;//you must change this statement as per your requirement
}
-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
DoubleNode class
package doubleNode;
/**
*The individual node for a double-linked structure where movies are
stored * objects. This is a double-linked node. The node link can
be updated, * but not node data to prevent data moving between
nodes. * Data structures must be rearranged by moving nodes.
*
* @author
* @version 2010-10-09
*/
public final class DoubleNode {
// Link to the next DoubleNode.
private DoubleNode next = null;
// Link to the previous DoubleNode.
private DoubleNode prev = null;
// The Movie data.
private Movie value = null;
/**
* Creates a new node with data and link to the previous and next
nodes. Not
* copy safe as it accepts a reference to the data rather than a
copy of the
* data.
*
* @param value
* the data to store in the node.
* @param next
* the previous node to link to.
* @param next
* the next node to link to.
*/
public DoubleNode(final Movie value, final DoubleNode prev,
final DoubleNode next) {
//your code here
}
/**
* Returns the next node in the linked structure.
*
* @return The node that follows this node. Must be copy safe.
*/
public final DoubleNode getNext() {
//your code here
return null;//you must change this statement as per
your requirement
}
/**
* Returns the previous node in the linked structure.
*
* @return The node that precedes this node. Must be copy
safe.
*/
public final DoubleNode getPrev() {
//your code here
return null;//you must change this statement as per
your requirement
}
/**
* Returns the node data. Must be copy safe.
*
* @return The data portion of the node.
*/
public final Movie getValue() {
//your code here
return null;//you must change this statement as per
your requirement
}
/**
* Links this node to the next node.
*
* @param next
* The new node to link to.
*/
public final void setNext(final DoubleNode next) {
//your code here
}
/**
* Links this node to the previous node.
*
* @param prev
* The new node to link to.
*/
public final void setPrev(final DoubleNode prev) {
//your code here
}
}
In: Computer Science
<Bit Stuffing Question>
a) The following message is to be sent by a host running a protocol
with starting and ending flags
and bit stuffing. The starting and ending flags are both 01111110
and they have not yet been
added.
0111111011111011110011111100111111000000111110101111110
What is the message actually sent (after bit stuffing and after
adding the starting and ending flags)?
b) Suppose the bit pattern shown above is received by a host
running the bit stuffing protocol.
That is, this is the actual message that has been received after
bit stuffing and after adding the
starting and ending flags. How many frames are being received? What
is the actual content of
each frame before the flags are added and the bits are stuffed?
In: Computer Science
Enterprise Resource Planning (ERP) Systems
Be able to explain the ERP system include as much as possible from lectures
Explain ERP benefits and drawbacks
--------------------------------------------
Please type it in words so I can understand it and copy it.
Thank you so much!!
----------------------------------------------
In: Computer Science
This is done by using Angular in Visual code:
Can you please give examples of the
following?
1. Use Math.random function to generate a number
between 20 and 100 and then use the ngSwitch directive to display a
letter grade based on this class grading policy.
a. add implements OnInit to the AppComponent
class
b. add variable x in the AppComponent class
c. add ngOnInit(){ this.x =
Math.floor(Math.random()*10);}
d. add {{x}} in the app.components.html file
e. You should see numbers from 1-9 when you refresh
the page
f. Change formula in #c to generate numbers from 20 to
100.
g. Change {{x}} in #d to ngSwitch directive
2. Use attribute directives to display credit card
logo based on the credit card number
Use simplified rules as follows:
4 visa
5 mastercard
34 and 37 amex
30, 36, 38, 39 diners
60, 64, 65 discover
In: Computer Science
Entity Relationship Diagrams are created for a variety of reasons. How would you describe the purpose of an entity-relationship diagram to someone who isn't familiar with data warehousing? How would you explain or define the join types, relationships, and primary /foreign keys?
In: Computer Science
Management Information Systems (MIS)
Be able to explain the importance of MIS report features
Marketing Management Information System (MMIS)
Be able to describe the importance of its key functions
--------------------------------------------
Please type it in words so I can understand it and copy it.
Thank you so much!!
----------------------------------------------
In: Computer Science
write a Matlab program to implement the perceptron learning rule to adjust the value of weight w. You can choose your own learning rate and stop criteria. Try different values of the learning rate and stop criteria, what do you find?
In: Computer Science
Greedy algorithms.
In: Computer Science
Because data warehouses are highly de-normalized, they are highly redundant.
A True
B False
Which of the following measure is fully additive?
After conducting requirements analysis for a data warehouse, it is found that “region” is one of the decision dimensions. The sales are analyzed by zip code, city, state and region. The representation zip → city → state → region is considered a ______.
A Region scale
B Normalization
C Hierarchy
D All of the above
In above problem, the finest granularity is represented by:
A Zip
B City
C State
D Region
E Insufficient information to determine
A surrogate key has following ____ characteristic(s).
A Only used in dimension tables
B . System-generated
C . Non-composite
D (B) and (C)
E (A), (B), and (C)
As for a FACT Table in a data warehouse, which following is NOT TRUE.
A A fact table contains attributes that are typically numeric.
B Besides keys it contains only one numerical value known as measure.
C. Each record in fact table represents data about an event arising from interaction of all of the dimensions.
D. A fact table contains fact-measure attributes and foreign keys that connect the fact table to the dimension tables.
Which of the following is not true of a data warehouse?
a. The data warehouse is physically separated from all other operational systems.
b. The data warehouse replaces the need for all other reporting systems within an organization.
c. The data warehouse holds aggregated data and detailed data for management.
d. None of the above.
In: Computer Science
I don't want plagiarism please
(C) Discusses ISO 9000 certification vs. SEI/CMM?
(D) Explain the main purpose of SEI Capability Maturity Model (SEI
CMM). And how can SEI CMM model be used to improve the quality of
software products?
In: Computer Science
Transaction Processing Systems (TPSs)
Be able to list and explain the changeover strategies
Business Continuity Plan (BCP)
Explain four backup approaches
--------------------------------------------
Please type it in words so I can understand it and copy it.
Thank you so much!!
----------------------------------------------
In: Computer Science
Identify a type of system characterized as a “push” [creating a solution to address a perceived opportunity] solution Complete a Mission Analysis - define the problem space, identify the stakeholders, develop preliminary operational concepts, and distinguish environmental conditions and constraints that bound the solution space
In: Computer Science