Describe The Benefits And Drawback Of Using Virtualisation On A Single Machine And Also
Describe the benefits and drawback of using virtualisation on a single machine and also in a cluster environment
Version Control Provide A Specific Example Of How Performing Code Reviews Informed Your Own
Version Control Provide a specific example of how performing code reviews informed your own development work. Specify what ways a team could resolve issues brought up in code reviews. Think about scenarios in which team-based development projects encountered issues during the code review. Assess the usefulness of history and newsfeed tools in monitoring development.
Assess The Most Valuable Features Of The Tools Used In Your Development. Provide
Assess the most valuable features of the tools used in your development. Provide specific examples of the benefits they provided. Contrast the workflow strategies in relation to their application in individual and team development projects. Explain the standard developer version control best practices you considered to be the most effective.
Illustrate How Version Control Tools Provided A Benefit In Identifying Or Resolving An
Illustrate how version control tools provided a benefit in identifying or resolving an issue in developing the Calculator app. Illustrate how version control tools provided a benefit in identifying or resolving an issue in developing the Jukebox Playlist app. Provide a specific example of a version control technique used in both the Calculator and Jukebox Playlist apps that you envision using in your software development moving forward. Explain why.
Describe What Is Meant By The Term 2. Give An Example Of How Each
Describe what is meant by the term 2. Give an example of how each is used or accomplished by the Operating System on your specific computer Workstation Operating Systems a. Managing Apps or Applications b. Voice Search c. Multiple Windows d. Machine Shutdown e. Locking Computer f. Authentication
Scenario The Department Of Administrative Services (DAS) Provides A Number Of Services To Other
Scenario The Department of Administrative Services (DAS) provides a number of services to other departments in an Australian State Government. These services include HR and personnel management, payroll, contract tendering management, contractor management, and procurement. These services have all been provided from the Department’s own data centres. As a result of a change in Government policy, DAS is moving to a “Shared Services” approach. This approach will mean that DAS will centralise a number of services for the whole of Government (WofG). The result of this move will be that each Department or Agency that runs one of these services for its own users, will be required to migrate its data to DAS so that it can be consolidated into one of the DAS centralised databases. DAS will then provide these consolidated services to all other Departments and Agencies within the Government. Another Government policy mandates a “Cloud first” approach to the process of updating or acquiring software or services. Following these strategic policy changes from Government, DAS has decided to: • Purchase a HR and personnel management application from a US based company that provides a SaaS solution. The application will provide DAS with a HR suite that will provide a complete HR suite which will also include performance management. The application provider has advised that the company’s main database is located in a Cloud datacentre based in California in the United States, with a replica database located in a cloud datacentre in Dublin, Ireland. However, all data processing, configuration, maintenance, updates and feature releases are provided from the application provider’s processing centre in Bangalore, India. Employee data will be uploaded from DAS daily at 12:00 AEST. This will be initially transferred to Bangalore in India for processing before being loaded into the main provider database in California. Employees will be able to access their HR and Performance Management information through a link placed on the DAS intranet. Each employee will use their internal agency digital ID to authenticate to the HR and Performance management system. The internal digital ID is generated by each agency’s Active Directory instance and is used for internal authentication and authorisation. • Move the DAS payroll to a COTS (Commercial Off The Shelf) application that it will manage in a public cloud; You may wish to consider the Cloud Security Alliance 2019 Cloud Security Complexity report as part of your response. Tasks You have been engaged to provide a risk assessment for the planned move to s HR SaaS application offering. You are to write a report that assesses the risk to DAS in the following areas: 1. Consider the data and information that DAS holds on its employees in the current HR system. a. Establish the existing threats and risks to the security of that data and information contained in the in house HR database. (25 marks) b. Are there any other risks and threats to the employee data after migration to an SaaS application? (10 marks) c. Assess the resulting severity of risk and threat to employee data. (10 marks) 2. Consider the privacy of the data for those employees who will move to an SaaS application. a. Establish the existing threats and risks to the privacy of that data and information contained in the in house HR database. (25 marks) b. Are there any other risks and threats to the privacy of the employee data after migration to an SaaS application? (10 marks) c. Assess the resulting severity of risk and threat to the privacy of employee data. (10 marks) 3. What are the threats and risks to the digital identities of Government employees from the move to SaaS applications? (10 marks) You are to provide a written report with the following headings: • Security of Employee Data • Privacy of Employee Data • Digital Identity Issues As a rough guide, the report should be approximately about 4,000 words.
Hi …. I Am Using PYTHON To Write A Program Which Can Predict If
Hi …. I am using PYTHON to write a program which can predict if some one has Diabetes or not but will writing the code i faced a problem and i could not solve it because i am beginner with PYTHON … can any one help >>> this is the error: ” ValueError: could not convert string to float: ‘1,699’ ” —————————————————————————————- import pandas as pd import numpy as np from sklearn.model_selection import train_test_split from sklearn.preprocessing import StandardScaler from sklearn.neighbors import KNeighborsClassifier from sklearn.metrics import confusion_matrix from sklearn.metrics import f1_score from sklearn.metrics import accuracy_score #reading the file: dataset= pd.read_csv(‘data.csv’) dataset.head zero_not_accepted = [‘Glucose’,’BloodPressure’,’SkinThickness’,’Insulin’,’BMI’] for column in zero_not_accepted: dataset[column] = dataset[column].replace(0, np.NaN) mean = int(dataset[column].mean(skipna=True)) dataset[column] = dataset[column].replace(np.NaN, mean) x= dataset.iloc [:, 0:8] y= dataset.iloc [:, 8] x_train, x_test, y_train, y_test = train_test_split(x, y, random_state=0, test_size=0.2) sc_x = StandardScaler() x_train = sc_x.fit_transform(x_train) x_test = sc_x.transform(x_test) —————————————————————————
You Have Been Hired By A Bookstore To Provide Them A System That Can
You have been hired by a bookstore to provide them a system that can maintain the costs of up to 3 different book titles; it’s a small bookstore. The owners would like to be able to do the following: 1. Enter the names of 3 books. 2. Enter the cost of each book being maintained. Enter the quantity of each book Calculate the total value of each book title 5. Provide the total costs of inventory (total of all the books in inventory – see formula) Provide the average cost of inventory of all books Total Value of each book = Cost * Quantity Total Inventory = (Sum of (Cost * Quantity) of each book) (i.e. multiply the cost of each book by the quantity entered and add all these to obtain the total cost of inventory) Average Cost of Inventory = Total Inventory Total Quantity of Books Assume the following: 3 names and costs were entered. The input/output for each of the respective requirements should be similar to (assumes all 3 books were entered): The list of inventory is: Book Title Cost Quantity Inventory Value 1. Fury $ 24.12 2 $ 48.24 2. Little Women $ 5.00 3 $ 15.00 War and Peace $ 27.00 1 $ 27.00 The total cost of inventory is: $ 90.24 The average cost of inventory: $ 30.08.
Need Help To Answer Question Below. Evaluate How Black-box Testing And White-box Testing Approaches
Need help to answer question below. Evaluate how Black-box testing and White-box testing approaches may or may not be affected by the use of the opportunistic design in software development.
Do You Really Think Our Life Applications And OSs Will Be Open Source At
Do you really think our life applications and OSs will be open source at the end for everything?
Memory Allocation Lab This Lab Project Addresses The Various Memory-management Schemes In An Operating
Memory Allocation Lab This lab project addresses the various memory-management schemes in an operating system. We model the memory managed in an operating system as a list of memory blocks. Each block of memory is modeled by a data structure of MEMORY_BLOCK defined below: struct MEMORY_BLOCK { int start_address; int end_address; int segment_size; int process_id; //0 indicates a free block } Thus, the operating system code can set up memory blocks for the available memory and keep track of which blocks are allocated to which processes. In particular, note that for each memory block, the system tracks the starting and ending addresses, along with the size of the block and the process to which the block is currently allocated. For free blocks, the process is indicated as 0. The system manages the memory as an array of memory blocks, stored in an array. As memory is allocated and released, the list of blocks in the memory map changes. In this lab project, we address the various ways in which memory can be allocated (based on different schemes – Best Fit, First Fit, Next Fit, Worst (Largest) Fit). In addition, we also develop a method to manage the release of memory blocks by processes. For the purposes of these labs we define the NULLBLOCK as [start_address: 0, end_address: 0, segment_size: 0, process_id: 0] Implement the following five methods in a file called memory.c. You should include the oslabs.h file. best_fit_allocate: This method allocates memory according to the Best Fit scheme. The method is given the process id of the requesting process, size of the memory being requested, and the memory map. It finds the candidate memory blocks that can be allocated and chooses the one whose size is closest to the requested size. If the free block found is exactly of the same size as the requested size, the method returns a pointer to this memory block. If the free block found is larger than the requested size, the block is split into two pieces – the first piece allocated and the second piece becoming a free block in the memory map. Thus, the method may alter the memory map appropriately. Note that if there is no free block of memory (in the memory map) that is at least as large as the requested size, the method returns the NULLBLOCK. The signature of the method is as follows: struct MEMORY_BLOCK best_fit_allocate(int request_size, struct MEMORY_BLOCK memory_map[MAPMAX],int *map_cnt, int process_id); A sample execution input and output: input/output parameter value input memory_map [start_address: 0, end_address: 1023, segment_size: 1024, process_id: 0] input map_cnt 1 input request_size 10 input process_id 32 output memory_map [start_address: 0, end_address: 9, segment_size: 10, process_id: 32], [start_address: 10, end_address: 1023, segment_size: 1014, process_id: 0] output map_cnt 2 output MEMORY_BLOCK [start_address: 0, end_address: 9, segment_size: 10, process_id: 32] Please refer to Section 3.2 of the Modern Operating Systems book for a detailed discussion of the Best Fit algorithm. first_fit_allocate: This method allocates memory according to the First Fit scheme. The method is given the process id of the requesting process, size of the memory being requested, and the memory map. It finds the first (lowest starting address) free memory block whose size is at least as large as the requested size. If the free block found is exactly of the same size as the requested size, the method returns a pointer to this memory block. If the free block found is larger than the requested size, the block is split into two pieces – the first piece allocated and the second piece becoming a free block in the memory map. Thus, the method may alter the memory map appropriately. Note that if there is no free block of memory (in the memory map) that is at least as large as the requested size, the method returns the NULLBLOCK. The signature of the method is as follows: struct MEMORY_BLOCK first_fit_allocate(int request_size, struct MEMORY_BLOCK memory_map[MAPMAX],int *map_cnt, int process_id); A sample execution input and output: input/output parameter value input memory_map [start_address: 0, end_address: 1023, segment_size: 1024, process_id: 0] input map_cnt 1 input request_size 10 input process_id 32 output memory_map [start_address: 0, end_address: 9, segment_size: 10, process_id: 32], [start_address: 10, end_address: 1023, segment_size: 1014, process_id: 0] output map_cnt 2 output MEMORY_BLOCK [start_address: 0, end_address: 9, segment_size: 10, process_id: 32]
Virtual Memory Lab This Lab Project Addresses The Implementation Of Page-replacement Algorithms In A
Virtual Memory Lab This lab project addresses the implementation of page-replacement algorithms in a demand-paging system. Each process in a demand-paging system has a page table that contains a list of entries. For each logical page of the process, there is an entry in the table that indicates if the page is in memory. If the page is in memory, the memory frame number that page is resident in is indicated. Also, for each page, the time at which the page has arrived in memory, the time at which it has been last referenced, and the number of times the page has been referenced since the page arrived in memory are maintained. The page table data structure is a simple array of page-table entries (PTEs). Each PTE contains five fields as defined below: struct PTE { int is_valid; int frame_number; int arrival_timestamp; int last_access_timestamp; int reference_count; } Each process in the system, has a page table that is simply an array of PTEs. Each process also has a pool of frames that is allocated. The frame pool for a process is represented as an array of integers, where each Integer represents the frame number of a frame that is free and is available for use by the process. Note that in order to get the frame number in the pool, you first need to access the integer in the array. This lab project aims to exercise the various policies for page replacement. In particular, we study the following three page-replacement policies: First-In-First-Out (FIFO) Least-Recently-Used (LRU) Least-Frequently-Used (LFU) In order to implement the above policies, we need to develop corresponding functions that process page accesses for a process. That is, for each process, given its page table, a logical page number being referenced and the free frame pool of the process, the functions should determine the memory frame number for the logical page. Also, the functions should modify the page table and the free frame pool appropriately. The details of the functions with respect to the different policies are described below. You need to develop code for these functions that implement the specifications. Place the code in a file called virtual.c. You should include the oslabs.h file. process_page_access_fifo: This function implements the logic to process a page access in a system that uses the First-In First-Out (FIFO) policy for page replacement. Specifically, it takes four inputs: process page table logical page number process frame pool current timestamp. The function determines the memory frame number for the logical page and returns this number. First the function checks if the page being referenced is already in memory (i.e., the page-table entry has the valid bit true). If so, it returns the frame number, after modifying the last_access_timestamp and the reference_count fields of the page-table entry. If the page being referenced is not in memory, the function checks if there are any free frames (i.e., the process frame pool is not empty). If so, a frame is removed from the process frame pool and the frame number is inserted into the page-table entry corresponding to the logical page number. In addition, the other fields of the page-table entry are set appropriately. The function returns the frame number associated with the page-table entry. If the page being referenced is not in memory and there are no free frames for the process, a page needs to be replaced. The function selects among all the pages of the process that are currently in memory (i.e., they have valid bits as true) the page that has the smallest arrival_timestamp. It marks that page-table entry as invalid, along with setting the arrival_timestamp, last_access_timestamp and reference_count to 0. It then sets the frame_number of the page-table entry of the newly-referenced page to the newly freed frame. It also sets the arrival_timestamp, the last_access_timestamp and the reference_count fields of the page-table entry appropriately. Finally, the function returns this frame number. The signature of the method is as follows: int process_page_access_fifo(struct PTE page_table[TABLEMAX],int *table_cnt, int page_number, int frame_pool[POOLMAX],int *frame_cnt, int current_timestamp); A sample execution input and output: input/output parameter value input page_table [IV:false,FN:-1,ATS:-1,LATS:-1,RC:-1] [IV:false,FN:-1,ATS:-1,LATS:-1,RC:-1] [IV:true,FN:10,ATS:3,LATS:3,RC:1] [IV:false,FN:-1,ATS:-1,LATS:-1,RC:-1] [IV:false,FN:-1,ATS:-1,LATS:-1,RC:-1] [IV:true,FN:20,ATS:2,LATS:4,RC:2] [IV:false,FN:-1,ATS:-1,LATS:-1,RC:-1] [IV:true,FN:30,ATS:1,LATS:1,RC:1] input table_cnt 8 input page_number 0 input frame_pool EMPTY input frame_cnt 0 input current_timestamp 12 output page_table [IV:true,FN:30,ATS:12,LATS:12,RC:1] [IV:false,FN:-1,ATS:-1,LATS:-1,RC:-1] [IV:true,FN:10,ATS:3,LATS:3,RC:1] [IV:false,FN:-1,ATS:-1,LATS:-1,RC:-1] [IV:false,FN:-1,ATS:-1,LATS:-1,RC:-1] [IV:true,FN:20,ATS:2,LATS:4,RC:2] [IV:false,FN:-1,ATS:-1,LATS:-1,RC:-1] [IV:false,FN:-1,ATS:0,LATS:0,RC:0] output table_cnt 8 output frame_pool EMPTY output frame_cnt 0 output int 30
Disk Scheduling Lab This Lab Project Addresses The Implementation Of IO-scheduling Algorithms In An
Disk Scheduling Lab This lab project addresses the implementation of IO-scheduling algorithms in an operating system. Each IO request in an operating system is managed by using a data structure called the Request Control Block (RCB). An RCB contains the request ID, arrival timestamp, cylinder, address, and the ID of the process that posted the request. The RCB struct is defined as follows and is accessible from the rest of the code in this lab project by including the header file oslabs.h in your source code files: struct RCB { int request_id; Int arrival_time_stamp; Int cylinder; Int address; int process_id; } The set of IO requests in the operating system that are to be processed are tracked in an IO Request Queue. This data structure is an array of RCBs of the requests. The NULLRCB is defined as [RID:0, AT:0, CYL:0, ADDR:0, PID:0] To determine the schedule of servicing the IO requests in an operating system, we consider three policies: First-Come-First-Served Scheduling (FCFS) Shortest-Seek-Time-First Scheduling (SSTF) LOOK Scheduling (LOOK) In order to implement the above policies, we need to develop methods that handle the arrival of IO requests and the completion of IO requests. That is, when a new IO request arrives, we need to figure out whether to service it immediately or to store it in the IO Request Queue. Whenever an IO request is completed, we need to figure out the next request from the IO Request Queue that needs to be serviced. The details of these methods are described below in the specification and you need to develop code for these methods that follow the specification and place the code in a file named disk.c. You should include the oslabs.h file. handle_request_arrival_fcfs: This method implements the logic to handle the arrival of a new IO request in a First-Come-First-Served Scheduler. Specifically, it takes five inputs: the request queue (an array of RCB structs) The number of items in the request queue the RCB of the currently-serviced request the RCB of the newly-arriving request the current timestamp. The method returns the RCB of the newly-arriving request if the disk is free (indicated by the third parameter be a NULLRCB), otherwise, it returns the RCB of the currently-serviced request after adding the newly-arriving request to the request queue. The signature of the method is as follows: struct RCB handle_request_arrival_fcfs(struct RCB request_queue[QUEUEMAX], int *queue_cnt, struct RCB current_request, struct RCB new_request, int time_stamp); A sample execution input and output: input/output parameter value input request_queue EMPTY input queue_cnt 0 input current_request [RID:51, AT:1, CYL:53, ADDR:53, PID:51] input new_request [RID:52, AT:2, CYL:54, ADDR:54, PID:52] input time_stamp 2 output request_queue [RID:52, AT:2, CYL:54, ADDR:54, PID:52] output queue_cnt 1 output RCB [RID:51, AT:1, CYL:53, ADDR:53, PID:51] Please refer to Section 5.4.3 of the Modern Operating Systems book for a detailed discussion of the First-Come-First-Served algorithm. handle_request_completion_fcfs: This method implements the logic to handle the completion of servicing an IO request in a First-Come-First-Served Scheduler. Specifically, it takes a single input: the request queue (an array of RCB structs). The number of items in the request queue The method determines the request to service next and returns its RCB. If the request queue is empty, the method returns NULLRCBl, indicating that there is no request to service next. Otherwise, the method finds the RCB in the request queue that has the earliest arrival time. It then removes this RCB from the request queue and returns it. The signature of the method is as follows: struct RCB handle_request_completion_fcfs(struct RCB request_queue[QUEUEMAX],int *queue_cnt); A sample execution input and output: input/output parameter value input request_queue [RID:1, AT:10, CYL:124323, ADDR:124323, PID:1] input queue_cnt 1 output request_queue EMPTY output queue_cnt 0 output RCB [RID:1, AT:10, CYL:124323, ADDR:124323, PID:1]
Assume That Numbers Are Represented As Signed, 8-bit 2’s Complement Representation. Carry Out The
Assume that numbers are represented as signed, 8-bit 2’s complement representation. Carry out the following operations: 1111 0000
Create A Class Model For Chess Game: Checkered 8×8 Boards With Each Side Having
Create a class model for chess game: Checkered 8×8 boards with each side having the pieces-king, queen, rook (2), bishop (2), knight (2) and pawn (8). Define the key operations for each class. It is just class diagram
Describe Use Case Relationships In Case Of An Airline Reservation System: We Need To
Describe Use case relationships in case of an airline reservation system: we need to have booking for economy and business class; payment is either by cash or card. Need to have possibilities for group booking too.
Prepare A Class Model For A Dictionary Application. Include Classes, Attributes And Associations With
Prepare a class model for a Dictionary application. Include classes, attributes and associations with multiplicity. The user can refer to words and meanings from multiple dictionaries. The words can have antonym, synonym and related words associated with it. A word will have many spellings and pronunciations. The word meaning can change based on the grammar type (noun, verb, adjective, proverb) and a word can have many such meanings. The system should also capture historical origin of the word and example sentences.
Create A Class Diagram To Depict A House With A Number Of Rooms. The
Create a class diagram to depict A house with a number of rooms. The house will have a floor area, a garage, a kitchen, and a number of exterior doors and windows. All rooms will have dimensions (length and width). Some rooms will be bedrooms; others will be bathrooms, toilets, or games rooms.
Please Help With Writing Matlab Code In Midpoint Method To Solve The Following Problem.
Please help with writing Matlab code in midpoint method to solve the following problem. Please add comments. Will upvote if helpful! Thanks xx MATLAB code, using midpoint method for double a d triple Integration
When We Should Consider Using A Big Data Database System? Don’t Copy Paste, Please.
When we should consider using a Big Data database system? Don’t Copy paste, please.
Question 2 [5 Marks] Complete The Hands-On Projects As Listed In The Online Lab
Question 2 [5 Marks] Complete the Hands-On Projects as listed in the Online Lab section of Module 2 from the subject interact site. In order to complete these activities, students should insert screenshots in the assignment document along with a brief informative description of each step taken to complete the project. To enhance your understanding of the topic, you are encouraged to attempt the following projects from the textbook: Hands-On Project 2-3 to determine the subnet mask required to support a specific number of subnets on an IPv4 network using subnet calculator. Hands-On Project 2-4 to understand the basics of IPv4 subnetting. Hands-On Project 2-5 to comprehend how changing the specified number of subnet for an IP address defined the scope of the address range.
The post Describe The Benefits And Drawback Of Using Virtualisation On A Single Machine And Also appeared first on Smashing Essays.
Looking for a Similar Assignment? Order now and Get 10% Discount! Use Coupon Code "Newclient"
