You are now the manager of a small team of software engineers. Some of them are fresh graduates, while some of them have a few years of working experience in the field. You are tasked with producing a small experimental FinTech (Financial Technology) mobile application. You will need to publish on both Android and iPhone platforms. You are adopting an Agile methodology, with emphasis on Test-Driven Development and extensive automated tests. The concept behind the application is very innovative, so the design is constantly changing.

One of your new team members, Ken, is a top CS graduate with a 4.0 GPA and he claims he never produces bugs in his programs. He thus proposes that he won't be adopting the Test-Driven Development methodology that the team is using. As a manager, will you agree with his proposal? Why/why not?

Case-IT Auditing

Code developers modify or create programs. The IT testing team performs all internal IT testing; however, the business areas perform their own user acceptance testing. The IT Departments Middleware team is responsible for migrating all code to production (except for database triggers). The Middleware Team does not perform any code development activities. Although SQL database triggers are developed or modified by code developers, the migration for the triggers is performed by the Database Administrators from test databases to production databases since this code development is specific database centric. Question: What are the Controls and what are the GAPS.

Question: What are the Controls and what are the GAPS

Case-IT Auditing

Once a user enters a request, the internal workflows based on the information downloaded from CBHR will be used to route the request to the user’s manager. Privileged access requests are also routed to the CIO for a secondary approval. The requestor’s manager will receive an email notification of a new access request to approve and will then approve the request using ABCR. Once approved the request is routed to the ABC’s IT helpdesk who processes the request. Upon completion an email notification through ABCR occurs notifying the user that their request was completed. The Company’s IT helpdesk is short staffed so it may take a few days for completion of an access request upon initiation of the request. However, the accuracy of completion is 97% regardless of time to complete.

Question: What are the Controls and what are the GAPS

In strictly three or less lines state if invisible watermarking can be used as a fool-proof method for digital copy prevention and control.

Case- IT Auditing

Windows servers are used for all server types (application, web and database delivery). Windows patch updates comply with the change management policy. Windows patches are downloaded to a central patch server. All patches are reviewed and tested prior to deployment to production servers. All approved patches are first deployed to the development servers, then to the test servers and finally to production servers. Although patches occur on Wednesday evening, if a system reboot is required these are not perform until the weekend downtime window. Approval is not required for patch updates for these are considered a normal standard process for ABC. Additionally, prior to deployment all patches are reviewed to ensure they will function with current systems.

Question: What are the Controls and what are the GAPS

Client must support load-test mode, in this mode, echo client opens a number of concurrent connections, sends a predefined message on each connection, waits for echo message back from server, and records time. User should be able to specify total number of messages to be sent concurrently from client.

Here is an example run of new mode

$python advanced_echo.py load_test 1000

Above, should cause client to attempt 1000 connections CONCURRENTLY, send predefined message, wait for echo back and record time it took each of 1000 connections to close.

Output of client should look like:

CON-1: duration: 20ms

CON-2: duration: 19ms

Lab 1-Refreshing Linux basics

Objective: (Complete using Netlab)

Please try each command in Linux system, and get screenshots (you may put multiple commands in one screenshot) which can show how actually each command runs. Also, give a brief description (one or two sentences) for each command. For the commands which have multiple switches/parameters, please try one popular switch/parameter.

If after the command, there is “date”, please run date to show the system date and time before you run the command; but if there is “name”, please type your first and last name, such as “Levis (First name)   Johnson (Last Name)” before you run this command. Your screenshot must include the above information.

Linux Commands

grep (date), find, man, ls , chmod, chown (name), passed, useradd and adduser, su, vi, rmdir (date), wherein, lsmod, insmod (name), make, | pipe, ln, rm, cp, mv, (name), ld, ftp, more, less, cat (date), tar, top , ps (name), kill, df, last, patch, mkdir (date)

Hello. Please answer the following two-part question in Scheme. Not Python, not any form of C, but in the language Scheme. If you do not know Scheme, please do not answer the question. I've had to upload it multiple times now. Thank you.

2.1 Write a recursive function called eval-poly that takes a list of numbers representing the coefficients of a polynomial and a value for ? and evaluates the polynomial for the given value of ?. The list of coefficients should start with the term of lowest degree and end with the term of highest degree. If any term of intermediate degree is missing from the polynomial it should have a coefficient of zero. For example, the polynomial ?3+4?2+2 would be represented by the list '(2 0 4 1). Hint: the polynomial above can be rewritten as 2+?⋅(0+?⋅(4+?⋅1))
> (eval-poly '() 0)

0

> (eval-poly '(5) 0)

5

> (eval-poly '(4 3) 2)

10

> (eval-poly '(2 7 1) 3)

32

2.2 Write a tail-recursive version of the previous problem called eval-poly-tail. It should call a helper function called eval-poly-tail-helper that uses tail recursion to keep a running sum of the terms evaluated so far. You might want to use the expt function to take a number to a power.
> (eval-poly-tail '() 0)

0

> (eval-poly-tail '(5) 0)

5

> (eval-poly-tail '(4 3) 2)

10

> (eval-poly-tail '(2 7 1) 3)

32

Edit: If you can't answer my question then move along to allow someone who can to do so. Thanks.

Hello. Please answer the following two-part question in Scheme. Not Python, not any form of C, but in the language Scheme. If you do not know Scheme, please do not answer the question. I've had to upload it multiple times now. Thank you.

3.1 Write a recursive function called split that takes a list and returns a list containing two lists, each of which has roughly half the items in the original list. The easiest way to do this is to alternate items between the two lists, so that (split '(1 2 3 4 5)) would return '((1 3 5) (2 4)). I recommend using two base cases: one for an empty list and the other for a list containing one item.
> (split '())

(() ())

> (split '(3))

((3) ())

> (split '(4 8))

((4) (8))

> (split '(8 6 7 5 3 0 9))

((8 7 3 9) (6 5 0))

3.2 Write a recursive function called merge that takes two sorted lists of numbers and merges them together into one sorted list containing all of the number in both lists including duplicates.
> (merge '() '())

()

> (merge '() '(1 2 3))

(1 2 3)

> (merge '(1 2 3) '())

(1 2 3)

> (merge '(2 4 7) '(1 3 5))

(1 2 3 4 5 7)

Case- IT Auditing

The SSO Server is a single purpose server solely designed for SSO and resides in the internal network. Using a batch process, the vendor provides quarterly updates which are downloaded directly to the server and automatically installed by the server’s single purpose operating system. Access to the SSO application is restricted to the security administration staff. The vendor maintains an active account on the server in the event maintenance is required. The vendor accesses the system periodically to review status and log activity to determine the server’s capacity and to proactively look for concerns prior to problems arising. A replication copy of the SSO Server exists as a backup and automatically assumes primary role if the main server stops functioning.

Question: What are the Controls and what are the GAPS

Assignment #1: Sorting with Binary Search Tree (IN C LANGUAGE)

Through this programming assignment, the students will learn to do the following:

1. Know how to process command line arguments.

2. Perform basic file I/O.

3. Use structs, pointers, and strings.

4. Use dynamic memory.

This assignment asks you to sort the lines of an input file (or from standard input) and print the sorted lines to an output file (or standard output). Your program, called bstsort (binary search tree sort), will take the following command line arguments: % bstsort [-c] [-o output_file_name] [input_file_name] If -c is present, the program needs to compare the strings case sensitive; otherwise, it's case insensitive. If the output_file_name is given with the -o option, the program will output the sorted lines to the given output file; otherwise, the output shall be the standard output. Similarly, if the input_file_name is given, the program will read from the input file; otherwise, the input will be from the standard input. You must use getopt() to parse the command line arguments to determine the cases. All strings will be no more than 100 characters long. In addition to parsing and processing the command line arguments, your program needs to do the following:

1. You need to construct a binary search tree as you read from input. A binary search tree is a binary tree. Each node can have at most two child nodes (one on the left and one on the right), both or either one can be empty. If a child node exists, it's the root of a binary search tree (we call subtree). Each node contains a key (in our case, it's a string) and a count of how many of that string were included. If he left subtree of a node exists, it contains only nodes with keys less than the node's key. If the right subtree of a node exists, it contains only nodes with keys greater than the node's key. You can look up binary search tree on the web or in your Data Structure textbook. Note that you do not need to balance the binary search tree (that is, you can ignore all those rotation operations) in this assignment.

2. Initially the tree is empty (that is, the root is null). The program reads from the input file (or stdin) one line at a time; If the line is not an empty line and the line is not already in the tree, it should create a tree node that stores a pointer to the string and a count of 1 indicating this is the first occurrence of that string, and then insert the tree node to the binary search tree. An empty line would indicate the end of input for stdin, an empty line or end of file would indicate the end of
input for an input file. If the line is not an empty line and the line is already in the tree, increase the count for that node indicating that there are multiple instances of that line.

3. You must develop two string comparison functions, one for case sensitive and the other for case insensitive. You must not use the strcmp() and strcasecmp() functions provided by the C library. You must implement your own version. You will be comparing the ASCII values. Note that using ASCII, all capital letters come before all lower case letters.

4. Once the program has read all the input (when EOF is returned or a blank line encountered), the program then performs an in-order traversal of the binary search tree to print out all the strings one line at a time to the output file or stdout. Next to the line include a count of how many times that line appeared. If the selection was for case insensitive then you should include either the first choice encountered, the last choice encountered or all capital letters.

5. Before the program ends, it must reclaim the tree! You can do this by performing a post-order traversal, i.e., reclaiming the children nodes before reclaiming the node itself. Make sure you also reclaim the memory occupied by the string as well. 6. It is required that you use getopt for processing the command line and use malloc or calloc and free functions for dynamically allocating and deallocating nodes and the buffers for the strings. It is required that you implement your own string comparison functions instead of using the corresponding libc functions.

Here's an example:

bash$ cat myfile

bob is working.

david is a new hire.

Bob is working.

alice is bob's boss.

charles doesn't like bob.

bash$ ./bstsort myfile

1 alice is bob's boss.

2 bob is working.

1 charles doesn't like bob.

1 david is a new hire.

Please submit your work through the inbox as one zip file. Follow the instructions below carefully (to avoid unnecessary loss of grade): You should submit the source code and the Makefile in the zip file called FirstnameLastnameA1. One should be able to create the executable by simply 'make'.

The Makefile should also contain a 'clean' target for cleaning up the directory (removing all temporary files and object files). Make sure you don't include intermediate files: *.o, executables, *~, etc., in your submission. (There'll be a penalty for including unnecessary intermediate files). Only two files should be included unless permission is given for more, those would be bstsort.c, and Makefile. If you feel a need to include a bstsort.h file, please send me a note asking for permission.

• Create a simple Graphical User Interface (GUI): Create new JFrameForm and use the Palette to drag and drop the Swing Containers and Controllers like the figure shown.

•  Your Form should accept a file name in its text field. When the user presses OK Button, the content of the String array appear in the Text area below.

•  Handle all Exceptions (File Not Found Exception)

GUI frame

JAVA!

Methods

void read_data()

Description: It handles the reading from the input and the storage of the above class properties

void write_data()

Description: It handles the writing to the output of the final tax return result

float adjusted_gross_income(float income)

Description: It returns the adjusted gross income

Logic: Adjusted gross income is what remains in the income after subtracting the social security and medicare taxes. Social security rate is 12.4%. Medicare is 2.9% but it only applies to the first $100K of the income. Both social security and medicare taxes are split equally between employer and employee.

List out the operation performed on HDD

SIGNS = '03,21-04,19=ARI;04,20-05,20=TAU;05,21-06,21=GEM;06,22-07,22=CAN;' + \
        '07,23-08,22=LEO;08,23-09,22=VIR;09,23-10,23=LIB;10,24-11,20=SCO;' + \
        '11,21-12,21=SAG;12,22-01,20=CAP;01,21-02,21=AQU;02,22-03,20=PIS;'

def find_astrological_sign(month, date):
    '''
    (int, int) -> str
    
    Given two int values representing a month and a date, return a
    3-character string that gives us what star sign a person born in that
    month and on that date belongs to. Use the SIGNS string (already
    defined for you at the top of this file) to figure this out.

    NOTE: A lot of string slicing to do here. The
                   information for each sign is exactly 16 characters long.
                   

    >>> find_astrological_sign(8, 24)
    'VIR'

    >>> find_astrological_sign(1, 15)
    'CAP'
    '''

Looking for a way to complete this function by accessing the string SIGNS