In Exercises 11 through 16, determine the errors.
Want to see the full answer?
Check out a sample textbook solutionChapter 2 Solutions
Introduction To Programming Using Visual Basic (11th Edition)
Additional Engineering Textbook Solutions
Degarmo's Materials And Processes In Manufacturing
Starting Out with C++: Early Objects (9th Edition)
Computer Science: An Overview (13th Edition) (What's New in Computer Science)
Modern Database Management
Starting Out With Visual Basic (8th Edition)
Starting Out with Programming Logic and Design (5th Edition) (What's New in Computer Science)
- Task 3: High cholesteral and high triglycerides have been assicuated with cardiovascular disease. During yearly medical visits a doctor might recommend certain actions if certain test results are received (see Table 1). Write a program that allows the user to enter the numeric cholesteral and triglyceride results and the gives the doctor a recommendation. Please show step-by-step on LabVIEW. Table 1 Recomendation Triglyceride (mg/fL) Total cholesteralSuggest a full workup >886 >240 mg/dLSuggest change in diet 500 to 886 200 to 239Suggest change in activity 150 to 499 N/AAll good <150 <200 Task 4: Create a new version of your file for Task 4. Add two boolean indicators (Round LED). Oneshould light up when both Triglyceride AND Cholesteral levels are in the “All good” range. Theother should light up when either Triglyceride OR Cholesteral levels are in the “Suggest a fullworkup” range. Please show step-by-step on LabVIEW.arrow_forwarduse numbers in second picture rather than first pleasearrow_forwardAlgorithm Steps Fig 2: (I have provided an algorithm and fewer code hints) 1. Set coordinates for NORTH, SOUTH, WEST, and EAST each 100pixels away from center (0,0) 2. Set outer circle size = 40 and inner circle size = 20 3. Set window size 600x600 4. Draw y-axis by connecting NORTH and SOUTH 5. Draw x-axis by connecting WEST and EAST 6. Display name of coordinates 7. Position point to draw circle 8. Set angle 90 degree 9. Set color to red 10. Draw outer circle 11. Draw inner circle and fill redarrow_forward
- Introduction Some number of teams are participating in a race. You are not told how many teams are participating but you do know that: Each team has a name, which is one of the uppercase letters A-Z. No two teams have the same name, so there are a maximum number of 26 teams. Each team has the same number of members. No two runners cross the finish line at the same time – i.e. there are no ties. At the end of the race we can write the results as a string of characters indicating the order in which runners crossed the finish line. For example: ZZAZAA We can see there were two teams: A and Z. Team A’s runners finished in 3rd, 5th and 6th place. Team Z’s runners finished in 1st, 2nd and 4th place. Scoring the race Each runner is assigned a score equal to their finishing place. In the example above team Z’s runners achieved scores of 1, 2 and 4. Team A’s runners scores were 3, 5, and 6 respectively. The team’s score is the sum of the members score divided by the number of people on…arrow_forwardCelebrity problem A celebrity among a group of n people is a person who knows nobody but is known by everybody else. The task is to identify a celebrity by only asking questions to people of the form: ”Do you know him/her?” Solution Select two people from the group given, say, A and B, and ask A whether A knows B. If A knows B, remove A from the remaining people who can be a celebrity; if A doesn’t know B, remove B from this group. Solve the problem recursively for the remaining group of people who can be a celebrity Which design strategy does the following solution use? A-)Decrease-by-a-constant factor algorithm B-)Variable-size-decrease algorithm C-)Decrease-by-a-constant algorithm D-)Divide-and-Conquerarrow_forwardFast pleasearrow_forward
- 14. _____ variables take on values in an experiment. A) Fixed B) Static C) Random D) Denaturedarrow_forwardTask 4 Assume, you have been given a tuple with details about books that won the Good Reads Choice Awards. book_info = ( ("Best Mystery & Thriller","The Silent Patient",68821), ("Best Horror","The Institute", 75717), ("Best History & Biography","The five",31783 ), ("Best Fiction", "The Testaments",98291) Write a Python program that prints the award category, the book name, and its total votes earned as shown below. [Must use Tuple unpacking for printing and need to handle the quotation marks as a part of the output] Output: The Silent Patient won the 'Best Mystery & Thriller' category with 68821 votes The Institute won the 'Best Horror' category with 75717 votes The five won the 'Best History & Biography' category with 31783 votes The Testaments won the 'Best Fiction' category with 98291 votesarrow_forwardIn Exercises 25 through 30, create the form shown in the figure. (These exercises give you practice creating controls and assigning properties. The interfaces do not necessarily correspond to actual programs.)arrow_forward
- uèstion 22 Satisfiability of a Boolean expression means there is a combination of values that make it (true, false) A Moving to another question will save this responsearrow_forwardExplain every step pleasearrow_forwardQuestion-1 Friend's Party Circle: There are a few friends living in the same area. They have a party every weekend and the place of party change each week. It is always a lifficult task to select a place which is nearest for everyone. They advantage of Computer Science to solve this problem. all decided to take Names of friends are Ahmed, Rehman, Careem, Basit, Dawood, Ghani, and Farid. Ahmed lives at 5 minutes' walk from rehman and at 10 minutes' walk from Careem. Careem lives at 3 minutes' walk from Dawood. Rehman lives at 4 minutes' walk from Basit and 2 minutes' walk from Dawood. Dawood lives at two minutes' walk from Farid. Ghani lives at 2 minutes' walk from Basit. a. If we represent a graph G = V (V, E) in which set of vertices are home of each Friend and an edge represents a path between two homes. Provide the adjacency matrix of directed graph of the graph G. b. In above directed graph G. You are required to devise an algorithm to find all possible paths.arrow_forward
- Microsoft Visual C#Computer ScienceISBN:9781337102100Author:Joyce, Farrell.Publisher:Cengage Learning,Programming with Microsoft Visual Basic 2017Computer ScienceISBN:9781337102124Author:Diane ZakPublisher:Cengage Learning