All posts by : chebby

Armv8 Assembly

Internet programming 

This is an open book exam. However, each student is expected to work on it alone. Students whose solutions are the same or similar will get a grade of zero!!!

Exam time is 7:30pm to 10:50pm. Read instruction in “CPSC8720FinalExam.pdf”. Submit entire solution in zip file on blackboard before 10:50pm! Exam link will close and you wont be able to submit after that. Wrap up, zip, submit at least 5 minutes before 10:50pm! Submission passed due time will not be accepted! No Exception!

Do a little bit of research on grant writing versus academic (scholarly) writing. 

Then…

1) Write a one sentence statement that describes the difference in grant writing vs. scholarly writing.

2)  Copy and paste this link in your browser https://walmart.org/how-we-give/local-community-grants and read about local community grants from Wal-Mart. Type up your grant application using the link, copy  the online application and paste it in the discussion forum (screenshots are okay). The amount of the award ranges from $250 – $5,000 and the application is very short.  Please apply for this grant for your school or organization if you can. 

3) Research a need in your community and write a 300 word needs section in an academic writing style, citing your references in APA format. Copy and paste into the discussion forum. 

4) Write One paragraph describing the mock dissertation topic (see list of topics below) that you will write about in this class and include your research question. Use academic writing style and standard. There is no word limit. 

• Note: Topics chosen in this course cannot be used in your actual dissertation that you will complete in the future.
• Students must choose from the listed topics of their school/program:
  • Business Students:
    • How Corporate Policies And Practices Enhance Company Competitiveness
    • Corporate Social Responsibility (CSR) and how it Affects Customer Loyalty
  • IT Students:
    • Enhancing Cyber Security In Healthcare -With The Help Of Machine Learning
    • Using Data Science Techniques To Enhance Data Security
  • Leadership / Educational Leadership Students:
    • Leadership Impact on Organizational Performance
    • The Influence of Visionary Leadership on Change Management and Implementation

5)  Reply to two other student’s posts. 

Write a 6-8 page paper (deliverable length does not include the title and reference pages)

• What are social networks, how do people use them, and what are some of their practical business uses?
• What are some of the key ethical issues associated with the use of social networking Web sites?
• What is a virtual life community, and what are some of the ethical issues associated with such a community?

Provide three articles to substantiate the above three questions.

Using the APA format provide a citation for each of the articles you read

Suggestion: Use a search engine (Google) and keywords

  Go online and search for information that relates to ethical hacking  (white hat or gray hat hacking). Choose one of these areas explain why a  company might benefit from hiring someone to hack into their systems.  

  Your assignment should be 3-4 paragraphs in length.  (300-400 words)

I will expect APA formatting, citations, references

Assignment 4: Truncatable Primes

Background

A left-truncatable prime number is one where the numbers resulting from removing the left-most digits are also prime. For instance, the number 9137 is a left-truncatable prime since 9137, 137, 37 and 7 are all prime.

A right-truncatable prime number is similarly defined, but removes a digit from the right. For example, 31193 is a right-truncatable prime since 31193, 3119, 311, 31, 3 are all prime.

A truncatable prime, also known as a two-sided prime, is one that is both left-truncatable and right-truncatable simultaneously. An example of such a prime is 3797.

We will be writing a program to explore these truncatable primes.

As a side note, the property of truncatable is dependent upon the base that the number is represented in. For this program, only worry about base 10.

Analysis

First note that the property of truncatability always produces a chain of numbers that terminate in single digit prime numbers. Therefore we can identify prime numbers by starting at the end of that chain and build numbers by adding digits. That is, we should be able to identify 3797 as a truncatable prime by building it from the right as in 7, 97, 797, then 3797, all the while verifying each step is left-truncatable.

Next note that when building from the right, we can only add odd digits. If we were to add a 0, 2, 4, 6, or 8, the resulting number would be divisible by 2 and thus not prime.

Finally, all of the single digit prime numbers are 2, 3, 5, and 7. These form the basis of our search.

Approach

Based upon the analysis above, we can find truncatable primes by building primes that are right-truncatable by construction, and verify they are left truncatable as we go. This suggest the following recursive algorithm

Build Truncatable Primes(int start)

if (start is not prime)

return

if (start is left truncatable)

found one. print it out

Build Truncatable Primes (start * 10 + 1)

Build Truncatable Primes (start * 10 + 3)

Build Truncatable Primes (start * 10 + 7)

Build Truncatable Primes (start * 10 + 9)

For left-truncatable, consider testing the number 12345. We know that we need to check 12345, 2345, 345, 45, and 5. But since all must be prime, the order they are tested in does not matter. In particular, we can check them in the order 5, 45, 345, 2345, 12345. What is nice about that order is we can get those digits by modding by successive powers of 10. Therefore you can use a loop that starts at 10, and updates by multiplying by 10.

Tips

· Start by writing an is_prime function.

· Next write an is_left_truncatable function.

· Using the modulus operator with powers of 10 can cut off digits from the left side.

· Write the algorithm specified above.

· Start the algorithm with all possible single digit prime numbers.

Sample Output

The truncatable primes are:

2

23

3

313

3137

317

37

373

3797

5

53

7

73

739397

797

• Review the strategic integration section.  Note what strategic integration is and how it ties to the implementation of technology within an organization.
• Review the information technology roles and responsibilities section.  Note how IT is divided based on operations and why this is important to understand within an organization.

Question 1

Consider the XOR problem where there are four training points: (1, 1, −),(1, 0, +),(0, 1, +),(0, 0, −). Transform the data into the following feature space:

 Φ = (1, √ 2×1, √ 2×2, √ 2x1x2, x2 1, x2 2).

Find the maximum margin linear decision boundary in the transformed space.

Question 2

Consider the following set of candidate 3-itemsets: {1, 2, 3}, {1, 2, 6}, {1, 3, 4}, {2, 3, 4}, {2, 4, 5}, {3, 4, 6}, {4, 5, 6}

Construct a hash tree for the above candidate 3-itemsets. Assume the tree uses a hash function where all odd-numbered items are hashed to the left child of a node, while the even-numbered items are hashed to the right child. A candidate k-itemset is inserted into the tree by hashing on each successive item in the candidate and then following the appropriate branch of the tree according to the hash value. Once a leaf node is reached, the candidate is inserted based on one of the following conditions:

Condition 1: If the depth of the leaf node is equal to k (the root is assumed to be at depth 0), then the candidate is inserted regardless of the number of itemsets already stored at the node.

Condition 2: If the depth of the leaf node is less than k, then the candidate can be inserted as long as the number of itemsets stored at the node is less than maxsize. Assume maxsize = 2 for this question.

Condition 3: If the depth of the leaf node is less than k and the number of itemsets stored at the node is equal to maxsize, then the leaf node is converted into an internal node. New leaf nodes are created as children of the old leaf node. Candidate itemsets previously stored in the old leaf node are distributed to the children based on their hash values. The new candidate is also hashed to its appropriate leaf node.

How many leaf nodes are there in the candidate hash tree? How many internal nodes are there?

Consider a transaction that contains the following items: {1, 2, 3, 5, 6}. Using the hash tree constructed in part (a), which leaf nodes will be checked against the transaction? What are the candidate 3-itemsets contained in the transaction?

 This homework requires students to create a MIPs program to simulate playing multiple games of “Craps” (a popular casino game) to determine an approximate winning percentage. : To simulate throwing two independent dice, you need to get two random numbers in the range of 1 to 6 and add them together. Do not get a single random number in the range of 2 to 12, as each value will not reflect the odds of rolling a particular numbe