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

Subject: Computer Forensics Provide: APA Citations Q) Discuss The Role That Volatility Plays In

/in /by

Get college assignment help at Smashing Essays Subject: Computer forensics Provide: APA Citations Q) Discuss the role that volatility plays in a digital forensics investigation and how you would approach recovering the most volatile data

Task Env. Observable Deterministic/ Stochastic Episodic/ Sequential Static/ Dynamic Discrete/ Continuous Multi/ Single

Task Env. Observable Deterministic/ Stochastic episodic/ sequential Static/ Dynamic Discrete/ Continuous Multi/ Single Agents Crossword Puzzle Chess with Clock Poker Back Gammon Taxi Driving Medica Diagnosis Image Analysis Partpicking Robot Refinery Controller Interactive Eng.professor Complete this table based on the task env in each activity as to whether its observable, deterministic/stochastic, episodic/sequential, static/dynamic, discrete/continuous, multi/single agents

1. (15) In Hire-Assistant Problem, If Eight Candidates Are Presented In A Random Order,

algorithm answers are correct, explain why please! no more information, this is all question information.

Find All Three-digit Numbers With Non-zero First Digit That Are Equal To The Sum

Find all three-digit numbers with non-zero first digit that are equal to the sum of the cubes of their digits.(FORTON)

Please Implement A Driver Class That Shows These Functions As Well. There Should Only

Please implement a driver class that shows these functions as well. There should only be LQHashed.java (With the methods above) and DriverClass.java (that implements the methods and shows them). Thanks.

Pelican Stores, A Division Of National Clothing, Is A Chain Of Women’s Apparel Stores

Pelican Stores, a division of National Clothing, is a chain of women’s apparel stores operating throughout the country. The chain recently ran a promotion in which discount coupons were sent to customers of other National Clothing Stores. Data collected for a sample of 100 in-store credit card transactions at Pelican Stores during one day while the promotion was running are contained in the file       ENG175 Project 4 PelicanStores.xlsx. Below is a sample of the four of the 100 total records in the data file: Type of Customer:      Customers who made a purchase using a discount coupon are referred to as promotional customers and customers who made a purchase but did not use a discount coupon are referred to as regular customers. Promotional coupons were not sent to regular Pelican Stores customers, management considers the sales made to people presenting the promotional coupon as sales it would not otherwise make. Of course, Pelican also hopes that the promotional customers will continue to shop at its stores. Items: The total number of items purchased Net Sales: The total amount ($) charged to the credit card Method of Payment: Proprietary card method of payment refers to charges made using a National Clothing charge card. Write a C program that analyzes the data for these 100 customers. Report facts only. All calculations must be done by using variables. Find and interpret … *using percentages: the Type of Customer, Method of Payment, Gender and Marital Status *using averages: Items, Net Sales and Age *one other different finding of your choice For example, of the 100 in-store credit card transactions, 30% were regular customers and 70% were promotional customers. For example, of the 100 in-store credit card the average Net Sales or the average credit card amount of sales was $77.60 Print your Find and Interpret facts to an outfile. Print them first. Then print a heading and the 100 customer records to that same outfile. —————- Here is the txt file: Customer TypeofCustomer Items NetSales MethodofPayment Gender MaritalStatus Age 1 Regular 1 39.50 Discover Male Married 32 2 Promotional 1 102.40 ProprietaryCard Female Married 36 3 Regular 1 22.50 ProprietaryCard Female Married 32 4 Promotional 5 100.40 ProprietaryCard Female Married 28 5 Regular 2 54.00 MasterCard Female Married 34 6 Regular 1 44.50 MasterCard Female Married 44 7 Promotional 2 78.00 ProprietaryCard Female Married 30 8 Regular 1 22.50 Visa Female Married 40 9 Promotional 2 56.52 ProprietaryCard Female Married 46 10 Regular 1 44.50 ProprietaryCard Female Married 36 11 Regular 1 29.50 ProprietaryCard Female Married 48 12 Promotional 1 31.60 ProprietaryCard Female Married 40 13 Promotional 9 160.40 Visa Female Married 40 14 Promotional 2 64.50 Visa Female Married 46 15 Regular 1 49.50 Visa Male Single 24 16 Promotional 2 71.40 ProprietaryCard Male Single 36 17 Promotional 3 94.00 ProprietaryCard Female Single 22 18 Regular 3 54.50 Discover Female Married 40 19 Promotional 2 38.50 MasterCard Female Married 32 20 Promotional 6 44.80 ProprietaryCard Female Married 56 21 Promotional 1 31.60 ProprietaryCard Female Single 28 22 Promotional 4 70.82 ProprietaryCard Female Married 38 23 Promotional 7 266.00 AmericanExpress Female Married 50 24 Regular 2 74.00 ProprietaryCard Female Married 42 25 Promotional 2 39.50 Visa Male Married 48 26 Promotional 1 30.02 ProprietaryCard Female Married 60 27 Regular 1 44.50 ProprietaryCard Female Married 54 28 Promotional 5 192.80 ProprietaryCard Female Single 42 29 Promotional 3 71.20 ProprietaryCard Female Married 32 30 Promotional 1 18.00 ProprietaryCard Female Married 70 31 Promotional 2 63.20 MasterCard Female Married 28 32 Regular 1 75.00 ProprietaryCard Female Married 52 33 Promotional 3 63.20 ProprietaryCard Female Married 44 34 Regular 1 40.00 ProprietaryCard Female Married 34 35 Promotional 5 105.50 MasterCard Female Married 56 36 Regular 1 29.50 MasterCard Male Single 36 37 Regular 2 102.50 Visa Female Single 42 38 Promotional 6 117.50 ProprietaryCard Female Married 50 39 Promotional 5 13.23 ProprietaryCard Female Married 44 40 Regular 2 52.50 ProprietaryCard Female Married 58 41 Promotional 13 198.80 ProprietaryCard Female Married 42 42 Promotional 4 19.50 Visa Female Married 46 43 Regular 2 123.50 ProprietaryCard Female Married 48 44 Promotional 1 62.40 ProprietaryCard Female Married 54 45 Promotional 2 23.80 ProprietaryCard Female Married 38 46 Promotional 2 39.60 ProprietaryCard Female Married 60 47 Regular 1 25.00 MasterCard Female Married 46 48 Promotional 3 63.64 ProprietaryCard Female Married 30 49 Promotional 1 14.82 ProprietaryCard Female Married 32 50 Promotional 9 145.20 MasterCard Female Married 46 51 Promotional 6 176.62 ProprietaryCard Female Married 38 52 Promotional 5 118.80 ProprietaryCard Male Married 68 53 Regular 1 58.00 Discover Female Single 78 54 Regular 2 74.00 Visa Female Single 20 55 Regular 2 49.50 MasterCard Female Married 32 56 Promotional 3 141.60 ProprietaryCard Female Married 38 57 Promotional 6 123.10 ProprietaryCard Female Married 54 58 Promotional 2 80.40 ProprietaryCard Female Married 48 59 Promotional 4 65.20 MasterCard Female Married 46 60 Promotional 4 113.00 ProprietaryCard Female Single 50 61 Promotional 1 108.80 ProprietaryCard Female Married 46 62 Promotional 3 59.91 ProprietaryCard Female Single 30 63 Promotional 5 53.60 ProprietaryCard Female Married 54 64 Promotional 1 31.60 ProprietaryCard Female Single 42 65 Promotional 2 49.50 ProprietaryCard Female Married 48 66 Promotional 1 39.60 ProprietaryCard Female Married 62 67 Promotional 2 59.50 ProprietaryCard Female Married 34 68 Promotional 5 146.80 ProprietaryCard Female Married 28 69 Promotional 2 47.20 ProprietaryCard Male Married 46 70 Promotional 8 95.05 ProprietaryCard Female Married 54 71 Promotional 5 155.32 ProprietaryCard Female Married 30 72 Promotional 4 58.00 MasterCard Female Married 32 73 Regular 1 69.00 ProprietaryCard Female Single 22 74 Promotional 2 46.50 ProprietaryCard Female Married 32 75 Promotional 2 45.22 ProprietaryCard Female Married 74 76 Promotional 4 84.74 ProprietaryCard Female Married 62 77 Regular 2 39.00 ProprietaryCard Female Married 42 78 Promotional 4 111.14 ProprietaryCard Female Married 28 79 Promotional 3 86.80 ProprietaryCard Female Married 38 80 Regular 2 89.00 Discover Female Married 54 81 Promotional 2 78.00 MasterCard Female Married 68 82 Promotional 6 53.20 ProprietaryCard Female Single 30 83 Promotional 4 58.50 Visa Female Married 36 84 Promotional 3 46.00 ProprietaryCard Female Married 44 85 Regular 2 37.50 Visa Female Married 44 86 Promotional 1 20.80 ProprietaryCard Female Married 62 87 Regular 6 144.00 MasterCard Female Single 48 88 Regular 4 107.00 ProprietaryCard Female Married 36 89 Promotional 1 31.60 ProprietaryCard Female Single 20 90 Promotional 6 57.60 ProprietaryCard Female Married 42 91 Promotional 4 95.20 ProprietaryCard Female Married 54 92 Promotional 1 22.42 ProprietaryCard Female Married 54 93 Regular 5 159.75 ProprietaryCard Female Married 72 94 Promotional 17 229.50 ProprietaryCard Female Married 30 95 Regular 3 66.00 AmericanExpress Female Married 46 96 Regular 1 39.50 MasterCard Female Married 44 97 Promotional 9 253.00 ProprietaryCard Female Married 30 98 Promotional 10 287.59 ProprietaryCard Female Married 52 99 Promotional 2 47.60 ProprietaryCard Female Married 30 100 Promotional 1 28.44 ProprietaryCard Female Married 44

PYTHON 3 Implement The Table ADT ***Only The Retrieve() And Insert() Methods ***Starter File

PYTHON 3 Implement the Table ADT ***Only the retrieve() and insert() methods ***Starter file below for a10q2: *** class Table(object): def __init__(self): self.__root = None self.__size = 0 def size(self): “”” Purpose: Return the size of the table. Post_condition: The Table does not change Return: :return: the number of key,value pairs in the Table “”” return 0 def is_empty(self): “”” Purpose: Indicate whether the given table is empty. Post_condition: The Table does not change Return: :return: True if the table is empty “”” return False def retrieve(self, key): “”” Purpose: Return the value associated with the given key. Preconditions: :param key: a key Post-condition: The Table does not change Return :return: True, value if the key appears in the table False, None otherwise “”” return False, None def insert(self, key, value): “”” Purpose: Insert a new key, value into the table. Preconditions: :param key: a unique key for the value :param value: a value Post-condition: If the key is not already in the table, it is added to the table If the key is already in the table, change the value (not the key) Return :return: True if the key,value was inserted False if the value of an existing key was changed “”” return False def delete(self, key): “”” Purpose: Delete a given key and its associated value from the table. Preconditions: :param key: a unique key Postconditions: If the key is not in the table, no change to the table If the key is in the table, remove it and the associated value Return :return: True if the key,value was deleted False otherwise “”” return False def in_order(self): “”” Purpose: Returns a string of the keys showing the in-order sequence. May be useful for testing and debugging. Return: A string representing the state of the Table “”” def in_order_prim(kvtnode): if kvtnode is None: return ” ” else: before = in_order_prim(kvtnode.left) this = ‘(‘ str(kvtnode.key) ‘,’ str(kvtnode.value) ‘)’ after = in_order_prim(kvtnode.right) return before this after return in_order_prim(self.__root) ***a10q1 file below*** import KVTreeNode as TN def member_prim(tnode, key): “”” Purpose: Check if value is stored in the binary search tree. Preconditions: :param tnode: a KVTreeNode with the BST property :param key: a key Postconditions: none :return: a pair True, value if key is in the tree a pair False, None if the key is not in the tree “”” if tnode is None: return False, None elif tnode.key is key: return True, tnode.value elif key < tnode.key: return member_prim(tnode.left, key) else: return member_prim(tnode.right, key) def insert_prim(tnode, key, value): """ Insert a new key,value into the binary search tree. Preconditions: :param tnode: a KVTreeNode with the BST property :param key: a key Postconditions: If the key is not already in the tree, it is added. If the key is already in the tree, the old value is replaced with the given value. Return :return: tuple (flag, tree) flag is True if insertion succeeded; tree contains the new key-value flag is False if the value is already in the tree, the value stored with the key is changed """ if tnode is None: return True, TN.KVTreeNode(key, value) else: if tnode.key is key: tnode.value = value return False, tnode elif key < tnode.key: left, left_val = insert_prim(tnode.left, key, value) if left: tnode.left = left_val return True, tnode else: return False, tnode else: right, right_val = insert_prim(tnode.right, key, value) if right: tnode.right = right_val return True, tnode else: return False, tnode def delete_prim(tnode, key): """ Delete a value from the binary search tree. Preconditions: :param tnode: a KVTreeNode with the BST property :param key: a key Postconditions: If the key is in the tree, it is deleted. The tree retains the binary search tree property. If the key is not there, there is no change to the tree. Return :return: tuple (flag, tree) flag is True if deletion succeeded; tree is the resulting without the value flag is False if the value was not in the tree, tree returned unchanged """ def delete(tnode): if tnode is None: return False, tnode else: ckey = tnode.key if ckey == key: return reconnect(tnode) elif key < ckey: flag, subtree = delete(tnode.left) if flag: tnode.left = subtree return flag, tnode else: flag, subtree = delete(tnode.right) if flag: tnode.right = subtree return flag, tnode def reconnect(delthis): if delthis.left is None and delthis.right is None: # the deleted node has no children return True, None elif delthis.left is None: # the deleted node has one child return True, delthis.right elif delthis.right is None: # the deleted node has one child return True, delthis.left else: # the deleted node has two children left = delthis.left right = delthis.right # walk all the way to the right from left walker = left while walker.right is not None: walker = walker.right walker.right = right return True, left return delete(tnode) ***KVTreeNode file below*** class KVTreeNode(object): def __init__(self, key, value, left=None, right=None): """ Purpose: Create a new KVTreeNode for the given data. Pre-conditions: key: A key used to identify the node value: Any data value to be stored in the KVTreeNode left: Another KVTreeNode (or None, by default) right: Another KVTreeNode (or None, by default) """ self.value = value self.left = left self.right = right self.key = key

MATLAB Please Help Me With These Multi-part Question. Thanks A) Create A Function That

MATLAB please help me with these multi-part question. thanks a) Create a function that returns 1 if the customer inputs a valid number of motors to order and 0 if their number is invalid. Assume the customer could attempt to input any scalar value as an input. Use: function Validity = partBQ1(N) Code to call your function: partBQ1(10) %should return 1 partBQ1(3) %should return 0 partBQ1(7.5) %should return 0 b) Create a function that determines the total cost of the order, given the number of motors is provided as an input.Use function Cost = partBQ2(N) Code to call your function: partBQ2(7) %should return 90 partBQ2(15) %should return 160 partBQ2(200) %should return 1420 c) Create a function that determines the maximum number of motors a customer can purchase given their budget is provided as an input (Hint: you can use the floor function to round a number down). Use Nmax = partBQ3(Budget)

If The Partition Skew Of A Relation Is Such That Half The Tuples Reside

If the partition skew of a relation is such that half the tuples reside on a single node, what is the maximum speedup we can expect with 10 nodes for a parallel projection?

If A Query Takes 13.8s On A One-core Server, How Many Seconds Would You

If a query takes 13.8s on a one-core server, how many seconds would you expect it to take on a two-core server that uses interquery parallelism exclusively (assume linear speed-up).

If A Query Takes 13.8s On A One-disk Server, How Many Seconds Would You

Get college assignment help at Smashing Essays If a query takes 13.8s on a one-disk server, how many seconds would you expect it to take on a four-disk server that uses intraquery parallelism (assume linear speed-up).

What Is The Symbol That Causes The Computer To Perform String Concatenation?

What is the symbol that causes the computer to perform string concatenation?

If We Have 3 Datasets, One With Nothing Missing, One MCAR, And One With

If we have 3 datasets, one with nothing missing, one MCAR, and one with imputed pooled estimate model. What, if anything changes between the different summaries? Nothing missing summary: MCAR summary: Imputed summary:

MATLAB CODE ALERT!!! We Know That Gaussian Distribution Approximates To Poisson Distribution For Certain

MATLAB CODE ALERT!!! We know that Gaussian distribution approximates to Poisson distribution for certain values of λ, where λ is mean of the Poisson distribution. In order to see the approximation properties of Gaussian, we will calculate the error of approximation for different parameter values. Write a loop to generate Poisson random variables Xλ with different parameters λ = 1 : 10. You can assume that Xλ can take integer values on [0,10], and set the step size for λ to 1. At each iteration approximate pmf of Xλ with a gaussian distribution. (Calculate the parameters of Gaussian by approximation methods we covered in lecture, do not try to fit the best Gaussian function by built-in MATLAB functions). Then calculate the error of the approximation by mean-squared error (MSE) formula. You can use the built-in MATLAB functions to calculate the MSE. Plot the graph of error vs λ. What do you observe? When do you have maximum and minimum errors? Are your findings in parallel with what we covered in the class?

Consider The Following Variable Declarations In Conjunction To The Above Type Declarations Assume That

Consider the following variable declarations in conjunction to the above type declarations Assume that assignments between variables are allowed if the types of the variables are equivalent. For each of the following, list all type equivalence schemes under which the expression is valid. Consider name equivalence, internal name equivalence, and structural equivalence for each case. Assume that if two variables are equivalent under name equivalence, they are also equivalent under internal name equivalence.

Sadly , The Answer Is Alway That The Question Is Not Clear . It

sadly , the answer is alway that the question is not clear . It is very clear question . I hope some professors can solve it . thank you

For The Second Part Of The Project, We Need A Multiply Subroutine In MARIE

For the second part of the project, we need a Multiply subroutine in MARIE that can be called to return the result of multiplying two numbers. It also must return an error code (set the value of an error code variable) that identifies the problem if there is one, such as 0 if no problem, 1 if overflow was detected. The multiply subroutine must be “bulletproof”, meaning that (a) it must handle all combinations of positive and negative inputs, and (b) it must catch any error conditions and report them. (The principal error condition to detect is Overflow.) It must NEVER return a wrong result without setting an error flag that the caller can test to know that the returned result is not to be trusted. In planning your subroutine, keep in mind that it will be reused many times when called. It must clean up its working data areas gracefully. Also, keep in mind that it must handle combinations of inputs: positive times positive, positive times negative, negative times negative, anything times zero. (Note: A “brute-force” programmer would make a separate loop for each of these cases, but that is NOT necessary. You can use the fact that positive times negative yields a negative result, and all other cases yield a positive result, but in all of them magnitude of the signless number would be the same. For example, 4 x 4 = 16; 4 x -4 = -16; -4 x -4 = 16; see that they are all “16” signless magnitude. Separating the sign determination from the multiply steps means that you only ever need to do a positive times positive multiply, adjusting the sign at the end. Write a short MARIE program that lets you test your Multiply subroutine. Submit the program and subroutine (.mas file) with some examples captured to show that it runs correctly. The program and subroutine you submit must have comments explaining the key parts of the program.

Subject: Computer Forensics Provide: APA Citations Q) Discuss Some Of The Content Found Within

Subject: Computer forensics Provide: APA citations Q) Discuss some of the content found within an email header that can be useful in an investigation. Name one tool that could be used in an email investigation and describe the information it retrieves

Discuss The Differences In Training Between The Perceptron And A Feed Forward Neural Network

Discuss the differences in training between the perceptron and a feed forward neural network that is using a back propagation algorithm.

Subject: Computer Forensics Provide: APA Citations Q) Discuss At Least 3 Challenges Associated With

Subject: Computer forensics Provide: APA Citations Q) Discuss at least 3 challenges associated with performing a forensic investigation on a mobile device. Discuss a tool that would be used in a forensic investigation on a mobile device.

Subject: Computer Forensics Provide: APA Citations Q) Define Steganography, Why An Attacker Or Criminal

Subject: Computer forensics Provide: APA Citations Q) Define steganography, why an attacker or criminal might use it, and what tools can be used by the investigator to determine if steganography has been used?

The post Subject: Computer Forensics Provide: APA Citations Q) Discuss The Role That Volatility Plays In appeared first on Smashing Essays.

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