Build a C ++ program that receives as input the ordered pairs A (x1, y1), B (x2.y2), and C (x3, y3) of a triangle. These values will be entered in the following order x1, y1, x2, y2, x3, y3. The program should determine the following: Can a triangle be formed with these three ordered pairs given by the user? If a triangle can be formed, determine the foot of the height from vertex B on the line joining points A and C.

Build a C ++ program that receives as input the ordered pairs A (x1, y1), B (x2.y2), and C (x3, y3) of a triangle. These values will be entered in the following order x1, y1, x2, y2, x3, y3. The program should determine the following: Can a triangle be formed with these three ordered pairs given by the user? If a triangle can be formed, determine the foot of the height from vertex B on the line joining points A and C.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

In Phython Language: The DNA of a living organism consists of a string of 4 different bases represented with letters A, T, G, C. The DNA has a double helix structure which means these bases are paired in the string. An A base is always paired with a T base molecule and a C base is always paired with G molecule. Write a function matchingPair that accepts a single strand of the DNA structure as a string parameter and produces the pairing strand as a result and returns it. Strings can be considered as list of characters. Therefore the subscript notation that we use for lists is acceptable for strings as well. For example to reach to the 4th character of a string variable mystring, you may use the notation mystring[3]. Write another function search that accepts a long and a short DNA strand as parameters. The function should return the index positions of the occurrences of the short strand in the long strand as a list. Test your functions by accepting a long strand of DNA to find the…
c++ A palindrome is a string that reads the same both forward and backward. For example, the string "madam" is a palindrome. Write a program that uses a recursive function to check whether a string is a palindrome. Your program must contain a value-returning recursive function that returns true if the string is a palindrome and false otherwise. Do not use any global variables; use the appropriate parameter.
In C++ Write a recursive function that displays a string reversely on the console using the following header:void reverseDisplay(const string& s) For example, reverseDisplay("abcd") displays dcba. Write a test programthat prompts the user to enter a string and displays its reversal.
А C++ program that finds all the ways in which the mouse can move to the cheese and display it with ‘*’. You can get out of a white cube. You can get out of a black cube, but you can't get out of it. Compose a recursive function path (int i, int j), receiving as parameters the coordinates of the current position of the mouse (initially 0.0, and then run with parameters (i-1, j), (i + 1, j), ( i, j-1) or (i, j + 1)).
Complete the following function using pass-by-reference: void findMax(int &max, int a) which assigns value ‘a’ to ‘max’ if a > max. Write a pseudo-code then implement a program in C language to find the maximum in a sequence of numbers using this function.
A palindrome is a string that reads the same forwards or backwards; for example dad, mom, deed are palindromes (i.e., reversing a palindrome produces the same string). Use C++ Programing language Write a recursive, boolean-valued function, isPalindrome that takes a string as a parameter and returns whether the string is a palindrome. A string, s, is a palindrome if: s is the empty string or s consists of a single letter (which reads the same back or forward), or the first and last characters of s are the same, and the rest of the string (i.e., the second through next-to-last characters) form a palindrome. Write a test program that reads a string from the standard input device and outputs whether the input string is a palindrome or not.
Please Answer in C++ language only Today the chef decided to cook some tasty dishes from the ingredients in his kitchen. There is an NN of components, represented by the strings S1,S2, .... SN. The chef took all the ingredients, put them in a cauldron and mixed them. In the cauldron, the letters of the strings representing the ingredients are completely shuffled, so that each letter appears in the cauldron as many times as it has appeared in all the strings combined; now the cook can take out one letter from the cauldron at will (if that letter appears in the cauldron more than once, it can be taken out that many times) and use it in a dish. Complete Food is a "chef" chain. Help the chef find the maximum number of complete meals he can make! Input 1 5 codechef chefcode fehcedoc cceeohfd codechef Output 5
thello is a board game and you are expected to implement the move function for this game. Arguments passed to the function are - a symbol of the player making the move and x y coordinates of the cell at which the player wishes to make the move. The move function will be returning a boolean, false - if the move isn't feasible and true - if the move is feasible and this function will also make the move then i.e. make the required changes in the board. Input Format: Line 1: Integer n (Total number of moves) Line 2: Player 1 coordinates, x and y (Two integers separated by space) Line 3: Player 2 coordinates, x and y (Two integers separated by space) Note 1: Number of moves (i.e. n) is always even and Player 1 always starts the game. Note 2: If any player's coordinates are not valid, enter again till the right move. Main function is given for you reference. Sample Input: 2 24 15 25 Sample Output: 00000000 00000000 00001000 00011000 00021000 00000000 00000000 00000000 false 00000000 00000000…
2. Write the definition of a bool function named BooleanMode () whose header is bool BooleanMode (bool data[), int n) Given that n represents the size of data, the function returns the truth value that appears the most in data. If there is an equal number of both truth values in data, the function returns the truth value that appeared first. For instance, if data = [true, true,false, false,false, true,falsel, then the function will return false. Impl
Simulate an Elevator-Controller Program in C programming language. The Elevator should be able to travel between five floors namely Ground, 1st, 2nd, 3rd, 4th and 5th floors. It should have some validation,meaning, only the valid characters should be received by the program(G, 1, 2, 3, 4, 5). If the user keys-in “A” or “-1”, the program should be able to handle such input andnot crash and ask for a correct valid input. The elevator should also travel from B1 to B3 (Basement 1 to 3). The elevator can also allow newpassengers to ride the elevator during the trip of the first user. The number of passengers per tripcan vary.
Write a program in C programming language that takes two arguments at the command line, both strings. The program checks to see whether or not the second string is a substring of the first (without using the substr -- or any other library -- function). One caveat: any * in the second string can match zero or more characters in the first string, so if the input were abcd and the substring was a*c, then it would count as a substring. Also, include functionality to allow an asterisk to be taken literally if preceded by a \, and a \ is taken literally except when preceding an asterisk.
Solve the problem in C++ (Anagrams) Write a function that checks whether two words are anagrams. Two words are anagrams if they contain the same letters in any order. For example, “silent” and “listen” are anagrams. The header of the function is as follows: bool isAnagram(const string& s1, const string& s2) Write a test program that prompts the user to enter two strings and checks whether they are anagrams. Sample Run 1 Enter a string s1: silent Enter a string s2: listen silent and listen are anagrams Sample Run 2 Enter a string s1: split Enter a string s2: lisp split and lisp are not anagrams