Best writers. Best papers. Let professionals take care of your academic papers

Order a similar paper and get 15% discount on your first order with us
Use the following coupon "FIRST15"
ORDER NOW

This Is The Code I Currently Have, And I Am Encountering Errors Within It.

/in /by

This is the code I currently have, and I am encountering errors within it. import sys, csv, sqlite3 def main(): con = sqlite3.connect(“customers.sqlite”) cur = con.cursor() cur.execute(“DELETE FROM Customer IF EXISTS Customer; CREATE TABLE t (customerID INTEGER PRIMARY KEY, firstName TEXT, lastName TEXT,companyName TEXT, address TEXT, city TEXT, state TEXT,zip TEXT);”) with open(‘customers.csv’, ‘rb’) as f:    reader = csv.reader(f, delimiter=’,’) for row in reader: to_db = [str(row[0], “utf8”), str(row[1], “utf8”), str(row[2], “utf8”),str(row[3], “utf8”),str(row[4], “utf8”),str(row[5], “utf8”),str(row[6], “utf8”),str(row[7], “utf8”)] cur.execute(“INSERT INTO Customer (firstName,lastName,companyName,address,city,state,zip) VALUES(?, ?, ?, ?, ?, ?, ?);”, to_db) con.commit() con.close() if __name__==’__main__’: main()

Information System Question (Microsoft Access – SQL) ———————————————————————- Please Solve The Problem Below. ————————————————————————–

Information System Question (Microsoft Access – SQL) ———————————————————————- Please solve the problem below. ————————————————————————– List the names of the employees who did not sell any items from the garden shop during the period from June to July. ——————————————————————————-

Information System Question (Microsoft Access – SQL) ———————————————————————- Please Solve The Problem Below. ————————————————————————–

Information System Question (Microsoft Access – SQL) ———————————————————————- Please solve the problem below. ————————————————————————– List the manager name and total sales revenue attributable to each manager. (The list should be in descending order by total sales revenue.) Hint, use Self-join. ——————————————————————————-

Information System Question (Microsoft Access – SQL) ———————————————————————- Please Solve The Problem Below. ————————————————————————–

Information System Question (Microsoft Access – SQL) ———————————————————————- Please solve the problem below. ————————————————————————– List the item ID and description of those items whose price is higher than the average price of item in its category. Display also the average price of the categories and name them CatAvg (so the columns will be: itemID, description, listPrice, CatAvg). Hint: pass parameter from outer query into the inner query. ——————————————————————————-

Just 3 Parts Of Exercise，part (a) Need The Function Of Y, And Part B

just 3 parts of exercise，part (a) need the function of y, and part b I’ve been done correctly. and for part c is to solve for lambda

MATLAB – This Question Can To Be Done With If Mod. Eg If(mod(years,400)). Also,

MATLAB – This question can to be done with if  mod. eg if(mod(years,400)). Also, I’m not sure how to do it with a vector of years. Hope anyone can help. Thank you.

2. What Is RAD? List An Advantage And A Disadvantage Of Using RAD. [6

2. What is RAD? List an advantage and a disadvantage of using RAD. [6 marks]

3. Discuss Two Advantages And Two Disadvantages Of Agile Methods. [6 Marks]

3. Discuss two advantages and two disadvantages of agile methods. [6 marks]

4. What Is Scope Creep In Software Development? Explain Three Ways To Deal With

4. What is scope creep in software development? Explain three ways to deal with scope creep. [6 marks]

On Visual Studio Code Using Java: Create A Grid Representing A Field, And Have

On Visual studio code using java: Create a grid representing a field, and have the cells drawn in different shades of green. The various shades of green are representing different heights of grass. Your randomly chosen shades of green should also include randomly chosen red and blue components. Support different types of cell. You should support: Road (shown as dark grey) Mountain (shown as light grey) Water (shown as blue) You should populate the grid with cells randomly chosen from road, mountain, water, and grass but with grass being three times more likely than the others. For full marks, you must use inheritance and must have either a color or a grass height field in your Cell class that is used for the drawing of the cell.

5.) AAA Medical Devices Is A Manufacturer Of Portable And Wearable Medical Monitoring Devices.

5.) AAA Medical Devices is a manufacturer of portable and wearable medical monitoring devices. They have developed a glucose monitor embedded in a wristband. The device is powered by body heat and senses glucose levels from minute quantities of perspiration. AAA wants to develop a Real-Time Glucose Monitoring (RTGM) system which will be using this device. AAA is planning to see the software to other health systems worldwide. The software should be accessible on smartphones with Bluetooth capability. The project has commenced, and you are appointed as a Systems Analyst to understand the requirements of the new system. Think about the potential users of the system and discuss three fact-finding techniques that you would use to collect the requirements of the new system. [8 marks]

Can Anyone Please Help Me With The Remaining 2 Errors, Please Note These Are

Can anyone please help me with the remaining 2 errors, please note these are only practice and NOT assignments, i am trying to understand where i have made a mistake. Where is the error in f1? Please see also the question snip for y1_app PART 7 %% 1 T = 4; f0 = ; fs = ; y1 = ; %% 2 s1 = ; %% 3 t = ; %% 4 numHarm = 5; a0 = ; an = ; bn = ; %% 5 c0 = ; cn = ; %% 7 y1_app = ; %% 8 f1 = ;

IN C#!!! Write A Program To Solve The Word Puzzle Program Described In Section

IN C#!!! Write a program to solve the word puzzle program described in section 1.1 Here’s the word problem: The input consists of a two-dimensional array of letters and a list of words. The object is for the program to find the words in the puzzle. These words may be horizontal, vertical, or diagonal in any direction. As an example, the puzzle shown in Figure 1.1 (below) contains the words this, two, fat, and that. The word this begins at row 1, column 1, or (1,1), and extends to (1,4); two goes from (1,1) to (3,1); fat goes from (4,1) to (2,3); and that goes from (4,4) to (1,1). There are at least two straightforward algorithms that solve the problem. For each word in the word list, we check each ordered triple (row, column, orientation) for the presence of the word. This amounts to lots of nested for loops but is basically straightforward. Alternatively, for each ordered quadruple (row, column, orientation, number of characters) that doesn’t run off an end of the puzzle, we can test whether the word indicated is in the word list. Again, this amounts to lots of nested for loops. It is possible to save some time if the maximum number of characters in any word is know Here’s Figure 1.1:

Hi I Am Stuck On These Questions Of My Final Project The First One

Hi I am stuck on these questions of my final project the first one said to create a table using the erd scenario and the second one said to add a column to the table and alter the column constraint’s but I don’t understand what it wants me to do can someone please help me figure this out thank you. Also, it should be in ORACLE SQL statement II.Table creation process: Based on the ERD provided in the accompanying case scenario: A.Write a query to create tables, assigning a primary key and any required foreign keys and default values. In other words, create a table that utilizes the appropriate keys and default values as provided in the scenario. B.Write an SQL statement to add a column to the table and then alter that column’s constraints. Team Data Teamid, teamname 1, Penguins 2, Dolphins 3, Sharks Player Data Playerid, firstname, lastname, Teamid, dateofbirth, social 1, Mike, Schaub, 2, 07/05/1978, 134-00-9872 2, Marci, Rogan, 2, 01/09/1985, 143-09-6793 3, Carl, Fenzila, 2, 04/25/1968, 009-87-2365 4, John, Pomeraina, 1, 02/04/1975, 128-09-6874 5, Anton, Orlovsky, 1, 09/10/2001, 234-09-9087 6, Brian, Portis, 1, 07/02/1973, 125-09-9988 7, Andrew, Jackson, 1, 06/27/2001

JAVA Red Black Tree Test Import Java.util.ArrayList; Import Java.util.List; Public Class RBTree { Public

JAVA red black tree test import java.util.ArrayList; import java.util.List; public class RBTree<T extends Comparable> { public Node root; // The root node of the tree // Check property 3 public boolean testProp3() { // TODO: Implement this // You are allowed to use any standard library // You may define additional helper methods to complete the task return null; // remove this once you have implemented this method } /** * Base class for node with link to the parent * * @param data type */ public class Node<T extends Comparable> { Colour colour; // Node colour T value; // Node value Node parent; // Parent node Node left, right; // Children nodes public Node(T value) { this.value = value; this.colour = Colour.BLACK; this.parent = null; // Initialise children leaf nodes this.left = new Node(); this.right = new Node(); this.left.parent = this; this.right.parent = this; } // Leaf node public Node() { this.value = null; this.colour = Colour.BLACK; } public void setColour(boolean red) { this.colour = red ? Colour.RED : Colour.BLACK; } } /** * Initialize empty RBTree */ public RBTree() { root = null; } /** * Add a new node into the tree with {@code root} node. * @param root Node The root node of the tree where x is being inserted. * @param x Node New node being inserted. */ private void insertRecurse(Node root, Node x){ if (root.value.compareTo(x.value) > 0) { if (root.left.value == null) { root.left = x; x.parent = root; } else { insertRecurse(root.left, x); } } else if (root.value.compareTo(x.value) < 0) { if (root.right.value == null) { root.right = x; x.parent = root; } else { insertRecurse(root.right, x); } } // Do nothing if the tree already has a node with the same value. } /** * Insert node into RBTree. * * @param x Node The new node being inserted into the tree. */ private void insert(Node x) { // Insert node into tree if (root == null) { root = x; } else { insertRecurse(root, x); } } /** * Demo functions * (Safely) insert a value into the tree * @param value T The value of the new node being inserted. */ public void insert(T value) { Node node = new Node(value); if (node != null) insert(node); } /** * Return the corresponding node of a value, if it exists in the tree * @param x Node The root node of the tree we search for the value {@code v} * @param v Node The node that we are looking for * @return */ private Node find(Node x, T v) { if (x.value == null) return null; int cmp = v.compareTo(x.value); if (cmp 0) return find(x.right, v); else return x; } /** * Returns a node if the value of the node is {@code key}. * * @param key T The value we are looking for * @return */ public Node search(T key) { return find(root, key); } public enum Colour { RED, BLACK; } } Run the following test to check the correctness public class QB4Test { public static void main(String[] args) { RBTree tree = constructRBTreeManually(); // setColour(true) will change the colour of the node to red tree.search(3).setColour(false); System.out.println(“Test 1-A: ” (!tree.testProp3() ? “PASSED” : “FAILED”)); tree.search(3).setColour(true); System.out.println(“Test 1-B: ” (tree.testProp3() ? “PASSED” : “FAILED”)); // Test properties together tree.search(11).setColour(false); System.out.println(“Test 2-A: ” (!tree.testProp3() ? “PASSED” : “FAILED”)); tree.search(11).setColour(true); System.out.println(“Test 2-B: ” (tree.testProp3() ? “PASSED” : “FAILED”)); // node 7 is the root. tree.search(7).setColour(true); System.out.println(“Test 3-A: ” (tree.testProp3() ? “PASSED” : “FAILED”)); tree.search(7).setColour(false); System.out.println(“Test 3-B: ” (tree.testProp3() ? “PASSED” : “FAILED”)); } /** * This function constructs a valid red-black tree via binary tree insertion. * Insertion order is important to keep the valid RBtree structure * * @return redblack tree with keys from 0 to 19 */ private static RBTree constructRBTreeManually() { RBTree tree = new RBTree(); tree.insert(7); tree.insert(3); tree.insert(1); tree.insert(0); tree.insert(2); tree.insert(5); tree.insert(4); tree.insert(6); tree.insert(11); tree.insert(9); tree.insert(8); tree.insert(10); tree.insert(15); tree.insert(13); tree.insert(12); tree.insert(14); tree.insert(17); tree.insert(16); tree.insert(18); tree.insert(19); // adjust colours tree.search(3).setColour(true); tree.search(11).setColour(true); tree.search(13).setColour(true); tree.search(17).setColour(true); tree.search(19).setColour(true); return tree; } }

Public Class RBTree { Public Node Root; // The Root Node Of The Tree

public class RBTree<T extends Comparable> { public Node root; // The root node of the tree // Check property 1 public boolean testProp1() { // TODO: Implement this method // You are allowed to use any standard library // You may define additional helper methods to complete the task return null; // remove this once you have implemented this method } // Check property 2 public boolean testProp2() { // TODO: Implement this method // You are allowed to use any standard library // You may define additional helper methods to complete the task return null; // remove this once you have implemented this method } /** * Base class for node with link to the parent * * @param data type */ public class Node<T extends Comparable> { Colour colour; // Node colour T value; // Node value Node parent; // Parent node Node left, right; // Children nodes public Node(T value) { this.value = value; this.colour = Colour.BLACK; this.parent = null; // Initialise children leaf nodes this.left = new Node(); this.right = new Node(); this.left.parent = this; this.right.parent = this; } // Leaf node public Node() { this.value = null; this.colour = Colour.BLACK; } public void setColour(boolean red) { this.colour = red ? Colour.RED : Colour.BLACK; } } /** * Initialize empty RBTree */ public RBTree() { root = null; } /** * Add a new node into the tree with {@code root} node. * @param root Node The root node of the tree where x is being inserted. * @param x Node New node being inserted. */ private void insertRecurse(Node root, Node x){ if (root.value.compareTo(x.value) > 0) { if (root.left.value == null) { root.left = x; x.parent = root; } else { insertRecurse(root.left, x); } } else if (root.value.compareTo(x.value) < 0) { if (root.right.value == null) { root.right = x; x.parent = root; } else { insertRecurse(root.right, x); } } // Do nothing if the tree already has a node with the same value. } /** * Insert node into RBTree. * Note that for checking properties, we do not need to have a complete RB tree. * Here the insertion is the same as the binary tree. * * @param x Node The new node being inserted into the tree. */ private void insert(Node x) { // Insert node into tree if (root == null) { root = x; } else { insertRecurse(root, x); } } /** * Demo functions * (Safely) insert a value into the tree * @param value T The value of the new node being inserted. */ public void insert(T value) { Node node = new Node(value); if (node != null) insert(node); } /** * Return the corresponding node of a value, if it exists in the tree * @param x Node The root node of the tree we search for the value {@code v} * @param v Node The node that we are looking for * @return */ private Node find(Node x, T v) { if (x.value == null) return null; int cmp = v.compareTo(x.value); if (cmp 0) return find(x.right, v); else return x; } /** * Returns a node if the value of the node is {@code key}. * * @param key T The value we are looking for * @return */ public Node search(T key) { return find(root, key); } public enum Colour { RED, BLACK; } } Run the following test to check the correctness of the answer. /** * Let’s define some test cases without JUnit. * This will save some time to configure JUnit. * * @author dongwookim * */ public class QB3Test { public static void main(String[] args) { RBTree tree = constructRBTreeManually(); // Test properties separately tree.search(7).setColour(true); System.out.println(“Test 1-A: ” (!tree.testProp1() ? “PASSED” : “FAILED”)); tree.search(7).setColour(false); System.out.println(“Test 1-B: ” (tree.testProp1() ? “PASSED” : “FAILED”)); tree.search(9).setColour(true); System.out.println(“Test 2-A: ” (!tree.testProp2() ? “PASSED” : “FAILED”)); tree.search(9).setColour(false); System.out.println(“Test 2-B: ” (tree.testProp2() ? “PASSED” : “FAILED”)); // Test properties together tree.search(11).setColour(false); System.out.println(“Test 3: ” ((tree.testProp1()

IN C# – C-sharp For This Activity, You Will Be Creating The Start Of

IN C# – C-sharp For this activity, you will be creating the start of a card game managing application. The program will feature a dealer and unlimited players. The dealer manages the player’s at the table, the deck of cards, and the dealing of cards to the players. The user creates the cards for the deck, and issues commands to the dealer. Class Data Card Name (Text) Description (Text) Value (Fractional Number) Player Name (Text) Chip Count (Whole Number) Hand of Cards (List of “Card” class objects) Dealer Name (Text) Years of Experience (Whole Number) Deck of Cards (List of “Card” class objects) Players at Table (Dictionary of player objects) Key: The chair name (Text) Think of this as the player’s location at the table. Example: “Chair 1” Value: Player class type References new Player class object instances Dictionary and List Usage List New cards are added to the dealer’s deck. When a card is dealt to a player it is removed from the deck and added to the selected player’s hand-of-cards. When a card is discarded from a player’s hand it is added back to the dealer’s deck. Dictionary Contains the players at the table, and is used to access the different player’s individual hands-of-cards. Each player is accessed by their seating arrangement (i.e. the name of their location at the table or seat name). Program A Dealer class variable to reference the currently hired dealer object instance. This is expected to be null until the user selects the appropriate menu option. Application runs until the user chooses to exit. Menu Hire Dealer Creates a new Dealer object for the program to reference. All other menu options work through that reference. A previous dealer, player(s), and the cards do not need to be transferred. Invite Player Request input necessary to create a new Player object instance. Request which location (seat) at the table the player should sit at. Display a user-friendly message if another player is already sitting at that location. Add the player to the dealer’s dictionary. Create Card Request input necessary to create a new Card object instance. Add it to the current dealer’s deck. Display a user-friendly message if the dealer has not been hired. Deal Card Request which player should receive a card. Allow the user to select by either index or by key. Display a user-friendly message if no players are present. Request which card from the deck should be dealt. Allow the user to select by index. Display a user-friendly message if no cards are present. Remove the selected card from the deck. Add the selected card to the selected player’s hand-of-cards. Play Card Request which player is about to play a card. Allow the user to select by either index or by key. Display a user-friendly message if no players are present. Request which card from their hand should be played. Allow the user to select by index. Display a user-friendly message if no cards are present. Move the card from the player’s hand back to the dealer’s deck. Display Hand Request which player should be displayed. Allow the user to select by either index or by key. Display a user-friendly message if no players are present. Display the selected player’s details. Display the details of each card object in the player’s hand-of-cards. Display All Display the dealer’s information. Display each player’s information. Under each player’s info, display the details of their cards. Exit – stop the program.

Please, No Plagiarism Must Be In Your Own Words. What Are Your Research Interests

Please, no plagiarism must be in your own words. What are your research interests in the area of Information Technology? Why do you think it is important to research in this area? As an individual, what are your strengths and weaknesses? How will these impact you as a doctoral information technology student? Where do you see the future of Information Technology heading? How can obtaining a doctorate impact your contribution to the practices of information technology? Where do you see yourself after obtaining a doctorate from any university?

Import Java.util.*; Public Class BST { Node Root; Public Integer LeastCommonAncestor(int X, Int Y)

import java.util.*; public class BST { Node root; public Integer leastCommonAncestor(int x, int y) { // TODO: Implement this method return null; // remove after implementation } public class Node { Integer value; Node parent; Node left; Node right; public Node(int value) { this.value = value; this.parent = null; this.left = null; this.right = null; } } public BST() { root = null; } public Node find(int value) { Node current = root; while(current != null) { if(current.value.compareTo(value) 0){ current = current.left; }else if(current.value.compareTo(value) == 0) { return current; } } return null; } /** * This implementation of insert follows the pseudo code in the lecture slide. * Node that we did not use recursion here. * * @param value value of inserted node * @return inserted node (not the entire tree) */ public Node insert(int value) { Node parent = null; Node current = root; while (current != null) { if(current.value.compareTo(value) 0){ parent = current; current = current.left; } } if (parent == null

Using C: There Are Various .bin Input Files That Are Used To Check The

Using C: There are various .bin input files that are used to check the output. The expected output is: grain, bikes, goodbye, smash, lip, value, ink, sack, cork, pail, army, argument, addition, rub, shade, wheel, cow 40754621705, 0, 31452121, 0, 1, 0, 0, -18.991909, -1, -1, 2, !, 1.773262, 0, 0.000137, square, fb 5910, 1, 70, 1, 0, 1, 1, -0.030124, 95, -48841747, 13425, b, -0.012099, 1, 0.000046, glass, 6 250526982930, 0, 70, 1, 1, 1, 0, 0.000082, 0, 7, 15, $, -15.910689, 1, -7.535080, approval, fe With the first line being just text and the following lines are the field types: Field grain is a 64-bit unsigned integer Field bikes is a 32-bit Boolean Field goodbye is a 32-bit unsigned integer Field smash is an 8-bit Boolean Field lip is a 32-bit Boolean Field value is an 8-bit Boolean Field ink is a 32-bit Boolean Field sack is a 32-bit floating point number Field cork is an 8-bit integer Field pail is a 32-bit integer Field army is a 16-bit unsigned integer Field argument is an 8-bit character Field addition is a 64-bit floating point number Field rub is a 32-bit Boolean Field shade is a 64-bit floating point number Field wheel is a fixed-length string that can contain 9 characters (including nulls at the end) Field cow is an 8-bit integer Create a C program that will take an input with such specification and be able to return the expected output. for instance first input will be 40754621705 which will print out 40754621705 and the second will be 0 which will print 0 and so on

Swot Analysis On Mogul App( Personnel CRM App) Mogul Being A Personnel Crm App-

swot analysis on mogul app( personnel CRM app) mogul being a personnel crm app- need the current strenght, weakness,oppertunity and threat that the app faces

The post This Is The Code I Currently Have, And I Am Encountering Errors Within It. appeared first on Smashing Essays.

 
Looking for a Similar Assignment? Order now and Get 10% Discount! Use Coupon Code "Newclient"