Problem 1: Will Be Creating Java Programs To Satisfy The Following Requirements And Earn
Get college assignment help at Smashing Essays Problem 1: will be creating java programs to satisfy the following requirements and earn points as indicated. Requirements: You will be designing and creating a GUI-based COURSE application. Create a “Student” class. You need to have at least 3 instance variables (student characteristics like name,…), at least 2 constructors (1 should be a no-arg constructor), set and get methods. Create a “Course” class that consists of 2 instance variables: the course name and an array of Students (using your Student class). Design and create a GUI interface that allows you to : INPUT information for Course and Students taking the course—you will use your Student and Course classes to save this info and then OUTPUT all this information in another section of the GUI window when the user selects a particular course and wants to see the students in the course. SAVE the information you input into an external file. NOTE: You can design this window anyway you want … do NOT use JOptionPane to do any of this GUI interface … you must use the JavaFX library.
This Post Brings Up The Topic Of HTTPS. Simply Explain What HTTPS Inspection Is,
This post brings up the topic of HTTPS. Simply explain what HTTPS inspection is, why businesses use it, and what types of solutions do you normally find HTTPS inspection in
Cn You Explain To Me How To Test Only The Function Show_flashcard On
Cn you explain to me how to test only the function show_flashcard on shell? Question: iii. When you have written the show_flashcard() function test it by calling it several times in the shell. Remember to first run the program and only after that use the shell to call the function. from random import * def show_flashcard(): “”” Show the user a random key and ask them to define it. Show the definition when the user presses return. “”” random_key = choice(list(glossary)) print(‘Define: ‘, random_key) input(‘Press return to see the definition’) print(glossary[random_key]) # Set up the glossary glossary = {‘word1’: ‘definition1’, ‘word2’: ‘definition2’, ‘word3’: ‘definition3’}
List All The Integers Between 0 And 20 That Are Congruent To 7 Modulo
List all the integers between 0 and 20 that are congruent to 7 modulo 30.
Discrete Math. Which Positive Integers Less Than 42 Are Relatively Prime To 42?
Discrete Math. Which positive integers less than 42 are relatively prime to 42?
Topic: Public Key System. A Message M, From A To B Is Encrypted With
Topic: Public Key System. A message M, from A to B is encrypted with B’s public key and decrypted with B’s private key. What the advances and disadvantages?
How To Implement Priority Queues In Java. Design A Data Structure, Utilizing Heaps, That
how to implement priority queues in Java. Design a data structure, utilizing heaps, that supports the following operations: • In logarithmic time o Insert the maximum, o delete the maximum, o Insert the minimum, o delete the minimum • In constant time o find the maximum o find the minimum.
Assignment In JAVA First, Launch NetBeans And Close Any Previous Projects That May Be
Assignment In JAVA First, launch NetBeans and close any previous projects that may be open (at the top menu go to File ==> Close All Projects). Then create a new Java application called “Scorer” (without the quotation marks) that declares a two-dimensional array of doubles (call it scores) with three rows and three columns and that uses methods and loops as follows. Use a method containing a nested while loop to get the nine (3 x 3) doubles from the user at the command line. Use a method containing a nested for loop to compute the average of the doubles in each row. Use a method to output these three row averages to the command line. NOTE: For this assignment and all future assignments that deal with methods, you should be calling the appropriate method to do the task indicated, rather than implementing the task logic in the main method itself. Scorer PA The primary requirement of this PA is to use a two-dimensional array of type double called ‘scores’ with 3 rows and 3 columns. Three methods are required. The PA does not detail what parameters and return values the methods should use so you have some implementation flexibility. Method 1 prompts the user to enter 9 values (type double) and then stores the values in the 2D scores array. Horstmann, pg 288-289 has a section on 2D arrays. Because you know exactly how many values will be entered by the user nested for loops are a good choice. There’s no requirement for user input validation. The method header could look similar to this. Here I’m passing a 2D array in as a parameter. It is declared locally in main. public static void getScores(double[][] scores) Method 2 calculates the row averages of the array filled in Method 1. My approach was to store the row averages in a separate 3-element array (declared in main and passed into the method as a parameter along with the scores array). Use a nested for loop for processing the rows and calculating the row averages. The method header might look like this. I’m storing the row averages in array rowAvgs. public static void calcRowAvgs(double[][] scores, double[] rowAvgs) Method 3 takes the 3-element array containing the row averages (rowAvgs) and uses a for loop to display each of the averaged values. Here’s the method header: public static void outRowAvgs(double[] rowAvgs) In my implementation of main, I declare the local 2D scores array and a local 3-element array (rowAvgs). There is a call to each of the above methods. None of the methods return a value. Declare local 2D array of type double with size 3 by 3 (scores) Declare local 3-element array of type double to store row averages (rowAvgs) Call ‘getScores’ method, pass in scores array Call ‘calcRowAvgs’ method, pass in scores array and 3-element array rowAvgs Call ‘outRowAvgs’ method, pass in rowAvgs array Here is an example run: run: Enter 9 numbers Value 1: 10 Value 2: 20 Value 3: 30 5 Value 4: 40 Value 5: 50 Value 6: 60 Value 7: 70 Value 8: 80 Value 9: 90 The average of row 1 is 20.00 The average of row 2 is 50.00 The average of row 3 is 80.00
Using Resources Such As The Internet And Section 7.7, Identify Two Real-world Applications Of
Using resources such as the Internet and Section 7.7, identify two real-world applications of HGLs and EGLs that are interesting to you. For each application, write a paragraph in which you describe how and why HGLs and EGLs are used
Design And Analysis Of Algorithms， Please Explain And Complete This Question, You Must Complete
Design and Analysis of Algorithms， Please explain and complete this question, you must complete it yourself, you will get a 
Section 1 5G Is The Next Standard For Mobile Phone Data Services. The Article
Get college assignment help at Smashing Essays Section 1 5G is the next standard for mobile phone data services. The article ‘5G goes for the gold’(Bleicher, 2018) reports on some trials used at the 2018 Winter Olympics. After reading the article, write a short document that discusses the following issues. You may wish to supplement your answer from other sources, but it should be sufficient to use the article alone with possible reference to the Microsoft Windows Networking Essentials text. For the purposes of your answer, assume that typical 4G download speeds are 20 Mbps. Write no more than 400 words. In your answer you should do the following: Compare the download speeds of 4G, 5G and Wi-Fi and comment on what the likely impact of 5G might be. (6 marks) State the frequency band that 5G will use and the name usually given to this band. Give the main advantage and disadvantage of using this band. What approach is used to overcome the disadvantage? (7 marks) While 5G offers benefits in the long run, when will the roll out to customers likely be? (2 marks) Up to 3 marks will also be allocated for referencing and the overall quality of your writing – bear in mind clarity, structure, spelling, punctuation and grammar. Section 2 A network needs to be set up with 14 subnets. Given a network to manage which has the network id 192.168.50.0 /24, what subnet mask value should be used? How many useable hosts can be in each subnet? Explain your answer, using binary representation to show how you calculated the answer. Write no more than 100 words. You will also need to show numerical working, which is not included in the word count.
Do The Following In Python 3, Please Provide Screenshots Aswell. Here Is The Code
Do the following in Python 3, Please provide screenshots aswell. Here is the code in Hand.py import random class Hand(object): def __init__(self, n): ”’ Initialize a Hand. n: integer, the size of the hand. ”’ assert type(n) == int self.HAND_SIZE = n self.VOWELS = ‘aeiou’ self.CONSONANTS = ‘bcdfghjklmnpqrstvwxyz’ # Deal a new hand self.dealNewHand() def dealNewHand(self): ”’ Deals a new hand, and sets the hand attribute to the new hand. ”’ # Set self.hand to a new, empty dictionary self.hand = {} # Build the hand numVowels = self.HAND_SIZE // 3 for i in range(numVowels): x = self.VOWELS[random.randrange(0,len(self.VOWELS))] self.hand[x] = self.hand.get(x, 0) 1 for i in range(numVowels, self.HAND_SIZE): x = self.CONSONANTS[random.randrange(0,len(self.CONSONANTS))] self.hand[x] = self.hand.get(x, 0) 1 def setDummyHand(self, handString): ”’ Allows you to set a dummy hand. Useful for testing your implementation. handString: A string of letters you wish to be in the hand. Length of this string must be equal to self.HAND_SIZE. This method converts sets the hand attribute to a dictionary containing the letters of handString. ”’ assert len(handString) == self.HAND_SIZE, “Length of handString ({0}) must equal length of HAND_SIZE ({1})”.format(len(handString), self.HAND_SIZE) self.hand = {} for char in handString: self.hand[char] = self.hand.get(char, 0) 1 def calculateLen(self): ”’ Calculate the length of the hand. ”’ ans = 0 for k in self.hand: ans = self.hand[k] return ans def __str__(self): ”’ Display a string representation of the hand. ”’ output = ” hand_keys = sorted(self.hand.keys()) for letter in hand_keys: for j in range(self.hand[letter]): output = letter return output def update(self, word): “”” Does not assume that self.hand has all the letters in word. Updates the hand: if self.hand does have all the letters to make the word, modifies self.hand by using up the letters in the given word. Returns True if the word was able to be made with the letter in the hand; False otherwise. word: string returns: Boolean (if the word was or was not made) “”” # Your code here raise NotImplementedError() myHand = Hand(7) print(myHand) print(myHand.calculateLen()) myHand.setDummyHand(‘aazzmsp’) print(myHand) print(myHand.calculateLen()) myHand.update(‘za’) print(myHand) ###################################################### ######## Test Cases Follow After This Point ########## ###### You can uncomment them to test your code ###### ###################################################### ## Test Case 1: #myHand = Hand(7) #myHand.setDummyHand(‘aulqqik’) #myHand.update(‘quail’) # True #print(myHand) # kq # ## Test Case 2: #myHand = Hand(14) #myHand.setDummyHand(‘cccllaapppttrr’) #myHand.update(‘claptrap’) # True #print(myHand) # cclprt # ## Test Case 3: #myHand = Hand(4) #myHand.setDummyHand(‘odgz’) #myHand.update(‘dog’) # True #print(myHand) # z # ## Test Case 4: #myHand = Hand(30) #myHand.setDummyHand(‘qqqwwweeerrrtttyyyuuuiiioooppp’) #myHand.update(‘typewriter’) # True #print(myHand) # eiioooppqqqrtuuuwwyy # ### Tests with randomized input ## Test Case 5: #myHand = Hand(9) #myHand.setDummyHand(‘hhsoqxjjt’) #myHand.update(‘shoe’) # False #print(myHand) # hhjjoqstx # ## Test Case 6: #myHand = Hand(11) #myHand.setDummyHand(‘dkkadogurdg’) #myHand.update(‘daikon’) # False #print(myHand) # adddggkkoru # ## Test Case 7: #myHand = Hand(9) #myHand.setDummyHand(‘prpevoggd’) #myHand.update(‘pear’) # False #print(myHand) # deggopprv # ## Test Case 8: #myHand = Hand(10) #myHand.setDummyHand(‘eaaeexnkzb’) #myHand.update(‘apple’) # False #print(myHand) # aabeeeknxz
10.18 LAB: Middle Item Given A Sorted List Of Integers, Output The Middle Integer.
Python Please! No words in the outputs please– only numbers required. Ex. input 11 22 44 Expected output 22
Boolean RemoveAll(Object Item) This Method Takes An Item, And It Should Removes All
boolean removeAll(Object item) This method takes an item, and it should removes all occurrences of that item from the list. If one or more occurrences of the item are removed, the method should return true. If there were no occurrences of the item to begin with, it should return false. Create two implementations of this method: one as part of theArrayList class Bonus: For 5 bonus points, both methods should: run in O(n) time, where n is the number of items in the list use no more than a constant (O(1)) amount of additional memory. In addition, you should make sure that your ArrayList version of the method doesn’t leave any extraneous references to objects in the itemsarray. For example, let’s say that you have 9 items in the ArrayList. If a call to removeAll() removes 3 of them, you should end up with an array in which the first 6 elements hold references to actual items, and all of the remaining elements are null. /* * ArrayList.java **/ import java.util.*; /* * A class that implements our simple List interface using an array. */ public class ArrayList implements List { private Object[] items; // the items in the list private int length; // # of items in the list /* * Constructs an ArrayList object with the specified maximum size * for a list that is initially empty. */ public static boolean removeAll(Object item) { //removes all occurrences of item if one or more occurrences //are removed return true else return false //loops through length of list } public ArrayList(int maxSize) { items = new Object[maxSize]; length = 0; } /* * Constructs an ArrayList object containing the items in the specified * array, and with a max size that is twice the size of that array * (to allow room for growth). */ public ArrayList(Object[] initItems) { items = new Object[2 * initItems.length]; for (int i = 0; i < initItems.length; i ) { items[i] = initItems[i]; } length = initItems.length; } /* * length – returns the number of items in the list */ public int length() { return length; } /* * isFull – returns true if the list is full, and false otherwise */ public boolean isFull() { return (length == items.length); } /* getItem – returns the item at position i in the list */ public Object getItem(int i) { if (i = length) { throw new IndexOutOfBoundsException(); } return items[i]; } /* * addItem – adds the specified item at position i in the list, * shifting the items that are currently in positions i, i 1, i 2, * etc. to the right by one. Returns false if the list is full, * and true otherwise. */ public boolean addItem(Object item, int i) { if (i length) { throw new IndexOutOfBoundsException(); } else if (isFull()) { return false; } // make room for the new item for (int j = length – 1; j >= i; j–) { items[j 1] = items[j]; } items[i] = item; length ; return true; } /* * removeItem – removes the item at position i in the list, * shifting the items that are currently in positions i 1, i 2, * etc. to the left by one. Returns a reference to the removed * object. */ public Object removeItem(int i) { if (i = length) { throw new IndexOutOfBoundsException(); } Object removed = items[i]; // fill in the “hole” left by the removed item for (int j = i; j < length – 1; j ) { items[j] = items[j 1]; } items[length – 1] = null; length–; return removed; } /* * toString – converts the list into a String of the form * {item0, item1, …} */ public String toString() { String str = "{"; for (int i = 0; i < length; i ) { str = str items[i]; if (i < length – 1) { str = str ", "; } } str = str "}"; return str; } /* * iterator – returns an iterator for this list */ public ListIterator iterator() { // still needs to be implemented return null; } }
Write A Program To Simulate Showing An NBA Team On A Basketball Court. Here
Write a program to simulate showing an NBA Team on a Basketball court. Here is an example of the screenshot when running the program: An example of the JFrame subclass with main method is as follows: importjava.awt.*; importjava.awt.event.*; importjavax.swing.*; publicclassNBAPlayoffextendsJFrame { privateJTextField txtName; privateJTextField txtAge; private NBATeam spurs; privateNBAcourtPanel court; privateJLabel lMax, lMin, lAvg, lNum; publicNBAPlayoff(){ spurs=newNBATeam(“Spurs”); court=newNBAcourtPanel(spurs); add(court, BorderLayout.CENTER); JLabel lMax0=newJLabel(“Max Age:”); lMax=newJLabel(“”); JLabel lMin0=newJLabel(“Min Age:”); lMin=newJLabel(“”); JLabel lAvg0=newJLabel(“Average Age:”); lAvg=newJLabel(“”); JLabel lNum0=newJLabel(“Number of Players:”); lNum=newJLabel(“”); JPanel rp=newJPanel(newGridLayout(8, 1)); //right panel rp.add(lNum0);rp.add(lNum);rp.add(lMax0);rp.add(lMax); rp.add(lMin0);rp.add(lMin);rp.add(lAvg0);rp.add(lAvg); add(rp, BorderLayout.EAST); JLabel l1=newJLabel(“Player Name:”); txtName= newJTextField(); txtName.setPreferredSize(newDimension(120,24)); JLabel l2=newJLabel(“Player Age:”); txtAge= newJTextField(); txtAge.setPreferredSize(newDimension(120,24)); JButton jbtAdd=newJButton(“Add A Player”); jbtAdd.addActionListener(newActionListener() { publicvoidactionPerformed(ActionEvent e) { intage=Integer.parseInt(txtAge.getText()); spurs.addAPlayer(txtName.getText(), age); lMax.setText(spurs.getMaxAge() “”); lMin.setText(spurs.getMinAge() “”); lAvg.setText(spurs.getAvgAge() “”); lNum.setText(spurs.getNumOfPlayer() “”); court.repaint(); }}); JButton jbtClear= newJButton(“Clear”); jbtClear.addActionListener(newActionListener() { publicvoidactionPerformed(ActionEvent e) { txtName.setText(“”); txtAge.setText(“”); }}); JPanel pBot=newJPanel(); pBot.add(l1); pBot.add(txtName); pBot.add(l2);pBot.add(txtAge); pBot.add(jbtAdd);pBot.add(jbtClear); add(pBot, BorderLayout.SOUTH); } publicstaticvoidmain(String[] args) { NBAPlayoff frame = newNBAPlayoff(); frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE); frame.setLocationRelativeTo(null); frame.setSize(800, 400); frame.setVisible(true); } }
Write A Program To Simulate Showing An NBA Team On A Basketball Court. Here
Write a program to simulate showing an NBA Team on a Basketball court. Here is an example of the screenshot when running the program: An example of the JFrame subclass with main method is as follows: importjava.awt.*; importjava.awt.event.*; importjavax.swing.*; publicclassNBAPlayoffextendsJFrame { privateJTextField txtName; privateJTextField txtAge; private NBATeam spurs; privateNBAcourtPanel court; privateJLabel lMax, lMin, lAvg, lNum; publicNBAPlayoff(){ spurs=newNBATeam(“Spurs”); court=newNBAcourtPanel(spurs); add(court, BorderLayout.CENTER); JLabel lMax0=newJLabel(“Max Age:”); lMax=newJLabel(“”); JLabel lMin0=newJLabel(“Min Age:”); lMin=newJLabel(“”); JLabel lAvg0=newJLabel(“Average Age:”); lAvg=newJLabel(“”); JLabel lNum0=newJLabel(“Number of Players:”); lNum=newJLabel(“”); JPanel rp=newJPanel(newGridLayout(8, 1)); //right panel rp.add(lNum0);rp.add(lNum);rp.add(lMax0);rp.add(lMax); rp.add(lMin0);rp.add(lMin);rp.add(lAvg0);rp.add(lAvg); add(rp, BorderLayout.EAST); JLabel l1=newJLabel(“Player Name:”); txtName= newJTextField(); txtName.setPreferredSize(newDimension(120,24)); JLabel l2=newJLabel(“Player Age:”); txtAge= newJTextField(); txtAge.setPreferredSize(newDimension(120,24)); JButton jbtAdd=newJButton(“Add A Player”); jbtAdd.addActionListener(newActionListener() { publicvoidactionPerformed(ActionEvent e) { intage=Integer.parseInt(txtAge.getText()); spurs.addAPlayer(txtName.getText(), age); lMax.setText(spurs.getMaxAge() “”); lMin.setText(spurs.getMinAge() “”); lAvg.setText(spurs.getAvgAge() “”); lNum.setText(spurs.getNumOfPlayer() “”); court.repaint(); }}); JButton jbtClear= newJButton(“Clear”); jbtClear.addActionListener(newActionListener() { publicvoidactionPerformed(ActionEvent e) { txtName.setText(“”); txtAge.setText(“”); }}); JPanel pBot=newJPanel(); pBot.add(l1); pBot.add(txtName); pBot.add(l2);pBot.add(txtAge); pBot.add(jbtAdd);pBot.add(jbtClear); add(pBot, BorderLayout.SOUTH); } publicstaticvoidmain(String[] args) { NBAPlayoff frame = newNBAPlayoff(); frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE); frame.setLocationRelativeTo(null); frame.setSize(800, 400); frame.setVisible(true); } }
Boolean RemoveAll(Object Item) This Method Takes An Item, And It Should Removes All
boolean removeAll(Object item) This method takes an item, and it should removes all occurrences of that item from the list. If one or more occurrences of the item are removed, the method should return true. If there were no occurrences of the item to begin with, it should return false. Create two implementations of this method: one as part of the LLList class Bonus: For 5 bonus points, both methods should: run in O(n) time, where n is the number of items in the list use no more than a constant (O(1)) amount of additional memory. /* * LLList.java import java.util.*; /* * A class that implements our simple List interface using a linked list. * The linked list includes a dummy head node that allows us to avoid * special cases for insertion and deletion at the front of the list. */ public class LLList implements List { // Inner class for a node. We use an inner class so that the LLList // methods can access the instance variables of the nodes. private class Node { private Object item; private Node next; private Node(Object i, Node n) { item = i; next = n; } } // fields of the LLList object private Node head; // dummy head node private int length; // # of items in the list /* * Constructs a LLList object for a list that is initially empty. */ public LLList() { head = new Node(null, null); length = 0; } /* * Constructs an LLList object containing the items in the specified array */ public LLList(Object[] initItems) { head = new Node(null, null); Node prevNode = head; for (int i = 0; i < initItems.length; i ) { Node nextNode = new Node(initItems[i], null); prevNode.next = nextNode; prevNode = nextNode; } length = initItems.length; } /* * length – returns the number of items in the list */ public int length() { return length; } /* * isFull – always returns false, because the linked list can * grow indefinitely and thus the list is never full. */ public boolean isFull() { return false; } /* * getNode – private helper method that returns a reference to the * ith node in the linked list. It assumes that the value of the * parameter is valid. * * If i == -1, it returns a reference to the dummy head node. */ private Node getNode(int i) { Node trav = head; int travIndex = -1; while (travIndex < i) { travIndex ; trav = trav.next; } return trav; } /* * getItem – returns the item at position i in the list */ public Object getItem(int i) { if (i = length) { throw new IndexOutOfBoundsException(); } Node n = getNode(i); return n.item; } /* * addItem – adds the specified item at position i in the list, * shifting the items that are currently in positions i, i 1, i 2, * etc. to the right by one. Always returns true, because the list * is never full. * * We don’t need a special case for insertion at the front of the * list (i == 0), because getNode(0 – 1) will return the dummy * head node, and the rest of insertion can proceed as usual. */ public boolean addItem(Object item, int i) { if (i length) { throw new IndexOutOfBoundsException(); } Node newNode = new Node(item, null); Node prevNode = getNode(i – 1); newNode.next = prevNode.next; prevNode.next = newNode; length ; return true; } /* * removeItem – removes the item at position i in the list, * shifting the items that are currently in positions i 1, i 2, * etc. to the left by one. Returns a reference to the removed * object. * * Here again, we don’t need a special case for i == 0 (see the * note accompanying addItem above). */ public Object removeItem(int i) { if (i = length) { throw new IndexOutOfBoundsException(); } Node prevNode = getNode(i – 1); Object removed = prevNode.next.item; prevNode.next = prevNode.next.next; length–; return removed; } /* * toString – converts the list into a String of the form * {item0, item1, …} */ public String toString() { String str = “{“; Node trav = head.next; // skip over the dummy head node while (trav != null) { str = str trav.item; if (trav.next != null) { str = str “, “; } trav = trav.next; } str = str “}”; return str; } /* * iterator – returns an iterator for this list */ public ListIterator iterator() { return new LLListIterator(); } /* * private inner class for an iterator over an LLList */ private class LLListIterator implements ListIterator { private Node nextNode; // the next node to visit public LLListIterator() { nextNode = head.next; // skip over the dummy head node } /* * hasNext – does the iterator have additional items to visit? */ public boolean hasNext() { return (nextNode != null); } /* * next – returns a reference to the next Object in the iteration */ public Object next() { if (nextNode == null) { throw new NoSuchElementException(); } Object item = nextNode.item; nextNode = nextNode.next; return item; } } }
I Know Its Very Time Comsuming, But I Would Really Appreciate If You Could
I know its very time comsuming, but I would really appreciate if you could do it for me. Thanks in advance.
PYTHON 3 Inheritance *I Have Completed The Container Super-class I Just Need The Queue
PYTHON 3 Inheritance *I have completed the Container super-class i just need the Queue class that inherits all the Container attributes **Object oriented Queue from previous question below** from Node import Node class Queue: ”’ Queue class represent a First In First Out structure. This has common methods such as to enqueue the data, dequeue the values, find size and check if queue is empty. ”’ def __init__(self): “”” Purpose Constructor: creates an empty queue Post-condition: queue is created with no values inside Return None “”” self.__front = None self.__back = None self.__size = 0 def size(self): “”” Purpose returns the number of data values in the queue Post-condition: None Return: The number of data values in the queue “”” return self.__size def is_empty(self): “”” Purpose checks if the queue has no data in it Post-condition: None Return: True if the queue has no data, or false otherwise “”” return self.__size == 0 def dequeue(self): “”” Purpose removes and returns a data value from the current queue Post-condition: the first value enqueued in queue is removed from the queue Return: the first value in the queue, or None “”” assert not self.is_empty(), ‘dequeued an empty queue’ result = self.__front self.__front = self.__front.get_next() self.__size -= 1 return result.get_data() def enqueue(self, value): “”” Purpose adds the given data value to the back of the queue Pre-conditions: value: data to be added Post-condition: the value is added to the back of queue Return: (none) “”” # create a new node with value new_node = Node(value) # if queue is initially empty. if self.__size == 0: self.__front = new_node else: # set the new node as the last node self.__back.set_next(new_node) # update the last node and size of queue self.__back = new_node self.__size = 1 def peek(self): “”” Purpose returns the value from the front of queue without removing it Post-condition: None Return: the value at the front of the queue “”” assert not self.is_empty(), ‘peeked into an empty queue’ return self.__front.get_data() def to_string(self): “”” Purpose: Create a string representation of the queue. E.g., [ 1 | *-]–>[ 2 | *-]–>[ 3 | / ] where 1 is the top of the queue and 3 is the end of the queue Post_conditions: None Return: A string representation of the queue. “”” # special case: empty queue if self.is_empty(): result = ‘EMPTY’ else: # walk along the chain walker = self.__front value = walker.get_data() result = ‘[ ‘ str(value) ‘ |’ while walker.get_next() is not None: walker = walker.get_next() value = walker.get_data() result = ‘ *-]–>[ ‘ str(value) ‘ |’ # at the end of the queue, use ‘/’ result = ‘ / ]’ return result **Container Super Class below** from Node import Node class Container: def __init__(self): “”” Purpose Constructor: creates an empty container Post-condition: container is created with no values inside Return None “”” self.__front = None #front of container self.__back=None #back of container self.__size = 0 def size(self): “”” Purpose returns the number of data values in the container Post-condition: None Return: The number of data values in the container “”” return self.__size def is_empty(self): “”” Purpose checks if the container has no data in it Post-condition: None Return: True if the container has no data, or false otherwise “”” return self.__size == 0 def removeFront(self): “”” Purpose removes and returns the front value from the current container Post-condition: the first value is removed from the container Return: the first value in the container, or None “”” assert not self.is_empty() result = self.__front self.__front = self.__front.get_next() if self.__front==None: self.__back=None self.__size -= 1 return result.get_data() def insertFront(self, value): “”” Purpose adds the given data value to the front of the container Pre-conditions: value: data to be added Post-condition: the value is added to the container Return: (none) “”” self.__front = Node(value, self.__front) if self.__back==None: self.__back=self.__front self.__size = 1 def insertRear(self, value): “”” Purpose adds the given data value to the back of the container Pre-conditions: value: data to be added Post-condition: the value is added to the back of container Return: (none) “”” # create a new node with value new_node = Node(value) # if container is initially empty. if self.__size == 0: self.__front = new_node else: # set the new node as the last node self.__back.set_next(new_node) # update the last node and size of queue self.__back = new_node self.__size = 1 def front(self): “”” Purpose returns the value from the front of container without removing it Post-condition: None Return: the value at the front of the container “”” assert not self.is_empty() return self.__front.get_data() def rear(self): “”” Purpose returns the rear value from the container without removing it Post-condition: None Return: the value at the front of the container “”” assert not self.is_empty() return self.__back.get_data() def to_string(self): “”” Purpose: Create a string representation of the Stack. E.g., [ 1 | *-]–>[ 2 | *-]–>[ 3 | / ] where 1 is the top of the container and 3 is the end of the container Post_conditions: None Return: A string representation of the container. “”” # special case: empty container if self.is_empty(): result = ‘EMPTY’ else: # walk along the chain walker = self.__front value = walker.get_data() result = ‘[ ‘ str(value) ‘ |’ while walker.get_next() is not None: walker = walker.get_next() value = walker.get_data() result = ‘ *-]–>[ ‘ str(value) ‘ |’ # at the end of the container, use ‘/’ result = ‘ / ]’ return result
Please Help Me Build This In C . Will Give Points For Fleshed Out Pseudocode
Please help me build this in C . Will give points for fleshed out pseudocode as well! Pseudocode should not be too time consuming!
For FACEBOOK Data Breach Case(Cambridge Analytica), Based On The Information That You Obtained From
For FACEBOOK data breach case(Cambridge Analytica), based on the information that you obtained from your research, choose one control of PR( protect) (subcategories (and not categories) from the NIST Cybersecurity Framework) to describe that you believe were missing and contributed to the breach.
The post Problem 1: Will Be Creating Java Programs To Satisfy The Following Requirements And Earn appeared first on Smashing Essays.
Looking for a Similar Assignment? Order now and Get 10% Discount! Use Coupon Code "Newclient"
