5 SENTENCES EACH

What is a software myth?

Describe the Three (3) Types of Software Myths

Which of the Myths do you think would cause a software developer to be frustrated in a company setting? Explain why.

Identify a popular/common computer related product/solution that utilizes an interface that are not optimal for human interaction. It must clearly identify the original problem that lead to the development of the solution. Describe how the users resolve the problem before the solution was developed and after the development of the solution. Explain why you think the solution is not optimal and how to improve the solution to provide a better interface for human interaction.

you will upload a 1-2 pages synopsis of " the importance of mobile apps in this modern-day".

You should have a

• table of contents,
• introduce your topic, "the importance of mobile apps in this modern-day".
• and give a general outline of how you intend to develop this topic.
• Sources consulted must be appropriately cited and be part of the bibliography.
• You should have at least 10 references.

created a new StringBuilder sb using the following index:

StringBuilder sb = new StringBuilder ("Welcome To ");

What would be sb after each of the following statements? Explain the methods used and how they change the content

sb.append("Java");

sb.insert(11, "HTML and ");

Assume you have found a USB memory stick in a car park, and you plugged the USB memory stick to your computer. Answer the following questions

1.  What are the security key objectives that could be threaten?

2.  Identify and define three types of malware, and give examples about how could they transported from the USB memory stick to your computer.

3.   What could you do to mitigate the security threats and use the contents of the USB memory stick safely?

NETWORKING

Suppose within your web browser you click on a link to obtain a web page. The IP address for the associated URL is cached in your local host, so a DNS lookup is not necessary to obtain the IP address. Further suppose that the web page associated with the link, references ten very small objects on the same server. Let RTT₀ denote the RTTs between the local host and one of the objects. Assuming zero transmission time of the object, how much time elapses from when the client clicks on the link until the client receives the full web page with:

a.) Non-persistent HTTP?

Choose a table on a web page (use your discretion) and scrape the contents to a csv file.

The table selected must have at least 3 numerical columns and at least 15 rows.

You must produce the following results for at least 2 of those columns:

● count - number of values in the column

● mean - average of all values in the column

● std - standard deviation of the column

● min - minimum value in the column

● 25% - percentile value in the column

● 50% - percentile value in the column

● 75% - percentile value in the column

● max - maximum value in the column

Deliverables :

- A file containing your python code.

- The csv file

Q-1) Write a program that mimics a calculator. The program should take as input two integers and the operation to be performed. It should then output the numbers, the operator, and the result. For division, if the denominator is zero, output an appropriate message.

Some sample outputs follow:

3 + 4 = 7

13 * 5 = 65

Python Programming #1

Below is an English algorithm for determining the day of the week (Sunday, Monday, etc.) given the date (day, month and year).

Take the last two digits of the year.

Divide by 4, discarding any fraction. (keep quotient; ignore remainder)

Add the day of the month.

Add the month's key value: JFM AMJ JAS OND 144 025 036 146
[eg, Jan = 1; Feb = 4; March =4; etc] & see note [a]

Subtract 1 for January or February of a leap year.

For a Gregorian date, add 0 for 1900's, 6 for 2000's, 4 for 1700's, 2 for 1800's; for other years, add or subtract multiples of 400.
see note[c]

For a Julian date, add 1 for 1700's, and 1 for every additional century you go back.
see note [b]

Add the last two digits of the year.

Divide by 7 and take the remainder.

Now, 1 is Sunday, the first day of the week, 2 is Monday, and so on.

You have been put in charge of planning the New Year’s Eve party for the Computer Science Department. Your initial task is to determine which day of the week New Year’s Eve will fall on for any given year. To do so, implement the above algorithm in Python with the following abstractions (simplifications):

Assume that the date to be evaluated will always be December 31^st (in step 4, you will always add 6)

Assume that the date will always be Gregorian (you will always ignore step 7)

Assume that the year will always be in the 2000s (in step 6, you will always add 6)

Bonus: If you are an experienced coder, feel free to modify the program to calculate the day of the week for any date, not just December 31. This will require the use of conditionals for step 4 and step 6.

Submit your code (as a .py file or a plain .txt. file) here on Blackboard. Ensure that your code runs before you submit, and ensure the indentation is preserved in the file.

Hints: start by following the steps manually to ensure you understand the algorithm

create three variables (with appropriate names) and assigning them the numeric values of the day, month, and year (last two digits); use another variable (or more) to hold the intermediate results

remember that remainder is determined using the modulo operation (%).

In C++, dealing with Binary Search trees. Implement search, insert, removeLeaf, and removeNodeWithOneChild methods in BST.h. BST.h code below

#include <iostream>
#include "BSTNode.h"
using namespace std;

#ifndef BST_H_
#define BST_H_

class BST {

public:

        BSTNode *root;
        int size;

        BST() {
                root = NULL;
                size = 0;
        }

        ~BST() {
                if (root != NULL)
                        deepClean(root);
        }

        BSTNode *search(int key) { // complete this method
        }

        BSTNode *insert(int val) { // complete this method
        }

        bool remove(int val) { // complete this method
        }

private:

        void removeLeaf(BSTNode *leaf) { // complete this method
        }

        void removeNodeWithOneChild(BSTNode *node) { // complete this method
        }

        static BSTNode *findMin(BSTNode *node) {
                if (NULL == node)
                        return NULL;
                while (node->left != NULL) {
                        node = node->left;
                }
                return node;
        }

        static BSTNode *findMax(BSTNode *node) {
                if (NULL == node)
                        return NULL;
                while (node->right != NULL) {
                        node = node->right;
                }
                return node;
        }

        void print(BSTNode *node) {
                if (NULL != node) {
                        node->toString();
                        cout << " ";
                        print(node->left);
                        print(node->right);
                }
        }

        static int getHeight(BSTNode *node) {
                if (node == NULL)
                        return 0;
                else
                        return 1 + max(getHeight(node->left), getHeight(node->right));
        }
    
    static void deepClean(BSTNode *node) {
        if (node->left != NULL)
            deepClean(node->left);
        if (node->right != NULL)
            deepClean(node->right);
        delete node;
    }

public:

        int getTreeHeight() {
                return getHeight(root);
        }

        void print() {
                print(root);
        }

        int getSize() {
                return size;
        }
};

#endif

For Humming code H(15,11), write a computer program for decoding, which outputs an error correction dictionary from received 15bits to corrected 11bits data or maps from input as the received 15bits to output as the corrected 11bits data. Demonstration outputs of the running program with explanation are required to show its correctness. Any computer programming language is acceptable. DETAILED DESCRIPTIONS MUST BE INCLUDED FOR THE CODE

Exercise 6 - Oscar nominated movies(Using python to solve it! please)

Write a bot that asks a user what movies they have seen. If they have not seen a movie, it tells them to watch that movie. The user can pick as many names as they want, but they will put all of the names in one input, which means the names will be in a single string rather than a list. Use the following list of movies:

1. Once Upon a Time in Hollywood
2. 1917
3. Marriage Story
4. Little Women
5. Joker
6. Jojo Rabbit
7. The Irishman
8. Ford v Ferarri
9. Parasite

Consider the following virtual page reference sequence: page 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3. This indicates that these particular pages need to be accessed by the computer in the order shown. Consider each of the following 4 algorithm-frame combinations:

• LRU with 3 frames
• FIFO with 3 frames
• LRU with 4 frames
• FIFO with 4 frames

Print a copy of this page. For each of the 4 combinations, below, move from left to right as the virtual page numbers are requested in sequence. Put each virtual page into one of the frames by writing its number there (initially while empty frames remain, load them from top down). When all frames are already occupied by other pages, choose the right page to displace according to the applicable algorithm (LRU or FIFO) and mark the event with an F for Fault. (Do not count a fault when loading a missing page at a time when there is a frame unoccupied, in other words on the first 3 or 4 loads.) When finished, total the number of page faults and write it in where indicated.

Submit the printout. The assignment will be graded on 8 items: the 4 final page configuration figures at the extreme right (correct or incorrect), and the 4 page fault totals written (correct or incorrect). Please work carefully.

THREE Page Frames

Least-recently-used (LRU) method:

Number of page faults for LRU/3:                     

First-in-First-out (FIFO) method:

Number of page faults for FIFO/3:                     

FOUR Page Frames

Least-recently-used (LRU) method:

Number of page faults for LRU/4:                     

First-in-First-out (FIFO) method:

Number of page faults for FIFO/4: