Make a PHP program that connects to a database named “myDB” on localhost. The…
SOLUTION AT Australian Expert Writers
Make a PHP program that connects to a database named “myDB” on localhost. The username for the database is “root” and the password is “pwroot”. If you can’t connect, you should abort with an error message “Database connection failed”. If the connection is successful, you should display all records from the table named “inventory” (Columns – models Make, model Year, modelPrice), using POST parameters. You don’t need to specify the ID column because it is an auto-incrementing primary index.If selection is successful, display the message “Records are shown below: ” and display the records. Otherwise, display the message “Records not available”.Don’t worry about data validation for this question, just focus on the PHP and SQL code.
Lets assume it is possible to travel from any state to any other state in the U.S. using a suitable
Lets assume it is possible to travel from any state to any other state in the U.S. using a suitable any combination of routes. Suppose you have a list of all trips; assume that whenever there is a route x → y, there is also a route y → x. Given 8 states in the US say, Florida, Michigan, Arizona, Texas, New York, California, Alaska, and Kentucky.i. lets use Arizona as the origin. Now starting from Arizona and the 7 other states in the U.S, express this problem as a Graph clearly stating the set of vertices and edges using set notation.ii. From your Graph, what is the destination that requires the maximum number of connections among the list of states? Compute the adjacency Matrix of your Graph. Next, compute the adjacency list and Draw the graph. iii. Illustrate the Breadth First Search of the Graph (starting with the same origin state in i) and use it to prove whether or not the graph is Bipartite iv. Using any programming language of your choice, code the graph and the code should print its set of vertices, edges as well as the destination with the maximum number of connections
CPU Scheduling CPU scheduling is a process which allows one process to use the CPU while the execution of another
CPU Scheduling CPU scheduling is a process which allows one process to use the CPU while the execution of another process is on hold (in waiting state) due to unavailability of any resource like I/O etc., thereby making full use of CPU. The aim of CPU scheduling is to make the system efficient, fast and fair. Whenever the CPU becomes idle, the operating system must select one of the processes in the ready queue to be executed. The selection process is carried out by the short-term scheduler (or CPU scheduler). The scheduler selects from among the processes in memory that are ready to execute and allocates the CPU to one of them. There are 10 processes in the run queue of a processor, all at equal priority, we apply round- robin scheduling, and a scheduling slice is 100ms. a) How long does it take for a process to obtain a slice in which to run? b) Suppose that all 10 processes are compute-bound. Is the round-robin scheduler fair? Why or why not? c) Now suppose that 9 of 10 processes are compute-bound and one process is I/O bound and receives one character per second of user typing, that it processes for 10ms and then blocks again waiting for the next. Is this unfair? Is this an undesirable situation for the user of the I/O bound process?
Answer the following questions a) For segmentation with pages, is there any internal or external fragmentation in segmentation? If yes,
Answer the following questions a) For segmentation with pages, is there any internal or external fragmentation in segmentation? If yes, give an example. b) Most system allows a program to allocate more memory to its address space during execution. The allocation of data in segments of a program is an example of such allocated memory. What is required to support dynamic memory allocation scheme? Briefly describe that scheme. Question related to Operating System
program that creates four processes. The original process creates two children processes and then prints out “parent”. The children process
Computer Science Assignment Writing Serviceprogram that creates four processes. The original process creates two children processes and then prints out “parent”. The children process print “child1” and “child2″respectively. The second child process creates a child process that prints out “grandchild”.The process should print out its process id and the process id of its parent.
Configuration management (5 marks)Code/file version management (2 marks)TeachBen/CMP73010-assignment1-2020 Version management systems are a daily reality for the software development professional.
Configuration management (5 marks)Code/file version management (2 marks)TeachBen/CMP73010-assignment1-2020 Version management systems are a daily reality for the software development professional. On GitHub is a public project named: You are required to sign up to GitHub and then: Fork this project into your public space (1 mark) Modify the Word document called CMP73010.docx (it contains instructions) and request a pull of the project (1 mark) Note: at various times the project manager will pull changes into the mainline. This will be reflected in your GitHub view of the project. Important: Provide Steps used for Github Configuration Management. Build Management (3 marks) A client of yours has confidential plans to develop an open-source web browser and has asked you to provide advice on build management by looking at a competitor (Mozilla ‘Firefox’). Give your advice as follows: A brief description of the nightly build system of Mozilla Firefox for managing changes to software and systems (1 mark) How Mozilla arrives at a release of Firefox that is distributed to the public (1 mark) Advantages and Disadvantages of this system for the client (1 mark). Note that the nightly builds evolve over time so carefully reference the facts that you have gathered and indicate the dates to which your descriptions refer.
You work in the IT department of a company. The company employees need to be able to send encrypted emails
You work in the IT department of a company. The company employees need to be able to send encrypted emails to each other. However the employees are constantly joining and leaving and the number of employees is large, so its not possible for the each employee to store the public key corresponding to every email ID. Every employee can trust the IT department. Propose a solution for encrypted email communication. Assume that all adversary is sitting on the network and watching all communication.
Write C Program -> Write C application that can compute the letter grade of a student after accepting the student’s
Write C Program -> Write C application that can compute the letter grade of a student after accepting the student’s mid and final mark. The program should only accept mid result [0-40]and final [0- 60]. If the data entered violates this rule, the program should display thatthe user should enter the mark in the specified range. The program is also expected torun until the user refuses to continue.
Develop an application that allows the user to control the scene in screen with the buttons of mouse by using
Develop an application that allows the user to control the scene in screen with the buttons of mouse by using shape
Engagement RingProblem Description: Sejal was on a month-long vacation to Europe and has a return trip to India from Lisbon,
Engagement RingProblem Description: Sejal was on a month-long vacation to Europe and has a return trip to India from Lisbon, a city in south west part of Europe. However, a day before the return flight she realizes that she lost her engagement ring. After much contemplation, she decides to go to all the cities she visited to find her ring. She maps all the cities she visited on a graph with Lisbon being at point (0,0). She then makes a route plan to visit all the cities and return to Lisbon by taking the shortest possible distance. She does not remember having her ring even in the first city she visited so there are high chances that she may have lost her ring in the initial part of her trip also. In case there are more than one routes which have the shortest possible distance, she picks that route in which the first city she visited, comes first. For example, if she visited cities 2,5,7,1,8,3 in that order and routes 0,1,8,3,2,5,7,0 and 0,8,3,1,5,2,7,0 (0 being Lisbon) have the same shortest possible distance then she will choose route 0,1,8,3,2,5,7,0 because she visited city 1 before city 8. Her travel guide, Harry also offers to help Sejal. Sejal asks him to travel separately on the same route, but in reverse direction such that each city is visited only once. They plan to travel 20 Kms in each city on taxi to search the ring. Inter-city travel is done on trains only. A secret service officer knows the coordinates of the city that Sejal visited during her the trip in that order. He also knows the city in which the ring is lost but will inform Sejal or Harry only when one of the two is in that city. He knows the path that Sejal has drawn to visit all the cities and return to Lisbon. With Sejal and Harry following that path and either one of them reaching the city where the ring is lost, the secret service officer will inform the person in that city, that the ring will be 10 km away from their current location. They will travel back 10 km in the same city, to catch the train back to Lisbon. Calculate the total distance traveled by Sejal in her search and her return to Lisbon from that city. If the ring is found by Sejal, she goes back to Lisbon from that city. If the ring is found by Harry, he informs Sejal on call at that point. If Sejal is in a city (searching in taxi) she returns to Lisbon via train from that city (without searching any further in that city). If Sejal is on train, she will need to complete the journey and then return from that other city. If the call comes at the exact point she is taking a train, she can return from that city itself. Each unit in the graph is equal to 1 Km. Assume the speed of all trains and taxis is same. Do not consider the decimal values while calculating the distance between two cities, ie. distance will be the floor of the calculated distance. Constraints Floor of the value is to be used while calculating distance between cities. Each city is connected to every other city via trains .Total number of cities <10 Input First Line will provide the coordinates (x|y) of cities separated by semicolon (;) Second Line will provide the number of city where the ring is found.Output One integer representing the number total distance traveled by Sejal Time Limit 1 Examples Example 1 Input 0|90;90|90;90|0 2 Output 347 Explanation Since routes 1,2,3 and 3,2,1 will give the shortest distance, she will select route 1,2,3 as she visited city 1 before city 3. However, Harry will follow the opposite path – 3,2,1. They both will be in city 2 when they will find it. Total distance Sejal covers will be Lisbon to city 1 20Kms, City 1 to City 2 10 km 10 km and then City 2 to Lisbon. i.e. 90 20 90 20 127 = 347 kmExample 2 Input 10|70;30|30;80|20;120|75;90|120 3 Output 334 ExplanationSejal will choose the route 1, 5, 4, 3, 2 with minimum distance of 378 km. However, Harry will follow the opposite path – and will find the ring in City 3. The moment Harry finds the ring, Sejal will be travelling from City 1 to City 5. So she will complete the journey till City 5 and return from there to Lisbon. So the total distance covered by Sejal will be 70 20 94 150 = 334 km..Give the C sol ..///
- Assignment status: Already Solved By Our Experts
- (USA, AUS, UK & CA Ph. D. Writers)
- CLICK HERE TO GET A PROFESSIONAL WRITER TO WORK ON THIS PAPER AND OTHER SIMILAR PAPERS, GET A NON PLAGIARIZED PAPER FROM OUR EXPERTS
QUALITY: 100% ORIGINAL PAPER – NO PLAGIARISM – CUSTOM PAPER