program that reads two vectors and calculate the angle in radius between these two vectors , Visual studio code , C++ Example:(-4,5)(3.7)-12+350= cos v,= 1.079 radius= cosV58/41Cos48.76523= cos 0.472 = 61.86°Note:-Use math library-Read the head file: math.h- acos(x): function returns the Inverse Cosine (cos-1) of the elements of x.Output:CenohmaniDooumential Sudio 201rojecajatrDetugijabegnter the arra leent Numbernter the First Vector elenentsenentElenent 2geter the Second Vector elesentsElenentElenent 2Ehe angle in raduis betueen the two vectors ia 1.07963

I have written code below for above question:

Answered: rogram that reads two vectors and…

Engineering

Computer Science

rogram that reads two vectors and calculate the angle in radius between these two vectors , Visual studio code , 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 Python Minima in permutations. Write a program that takes an integer n from the command line, generates a random permutation, prints the permutation, and prints the number of left-to-right minima in the permutation (the number of times an element is the smallest seen so far). Then write a program that takes integers m and n from the command line, generates m random permutations of length n, and prints the average number of left-to-right minima in the permutations generated
Recursion and loops. Provide both recurrent and loop based implementation of the function count( e, L ) that returns the number of es in L, where L is a list. Also consider cases when L is an empty list. Create test cases and run driver, show how function runs in spyder (py file) or ipynb file. Submit code as a py or html or pdf files with screenshots of the runs.
Write a function-based C++ program that reads an integer array from a file (“input.txt”) and finds all integers which start and end with the same digit. Write these integers into an output file (“output.txt”). You may assume the length of each integer to be a minimum of 2 digits. Example: Input File 12 131 54 7541 9849 6456 Output File 131 9849 6456
def find_root4(x, epsilon): ''' IN PYTHON Assume: x, epsilon are floating point numbers and epsilon > 0 Use bisection search to find the following root of x such that If x >=0, return y such that x - epsilon <= y ** 2 <= x + epsilon Else, return y such that x - epsilon <= y ** 7 <= x + epsilon Note: You must use bisection search to implement the function. ''' pass
• Your program reads one text file:– input.txt• Your program creates a text file:– output.txt• Your program solves the following problem:– You are given a water level information L. Condition: 0<L<128.– You are given a terrain information (elevation matrix M). Condition: 0M[i][j]<128 8i,j<512.– Definition of an island: An island is the collection of terrain points( elevation values M[i][j]), abovewater( greater than L value), from which you can find a path to any other without having to pass thepath through water.– Definition of a path: A path is an ordered set of points where successive points have either their Xcoordinates the same and their Y coordinates different only by one in magnitude (so can be y - 1 or y +1); or have their Y coordinates the same and have their X coordinates different only by one in magnitude(so can be x - 1 or x + 1). But not both of them: in other words they have to touch either in the Xdirection or in the Y direction, and not in the diagonal.–…
In Java languge (Duplicate Elimination) Write a program that reads in a series of first names and eliminates duplicates by storing them in a Set. Allow the user to search for a first name. Add a name to set, use end to terminate input: Search a name, use end to terminate searching: Sample output as follows:
In PYTHON Define a vector of integers with 10 elements  Write a loop to print the vector as follows From 1st to last element, using a while-do loop, where  Print all odd numbers first Then, print all even numbers  Use one loop only
Given subsets A and B of a universal set with 10 elements {0, 1, 2, 3, 4, 5, 6, 7, 8,9}. Write a C++ or Java program that uses bit strings to find A È B, A Ç B, and A – B. Print tothe screen set A, set B ( be sure to print out the name of the sets), as well as the set operation results(be sure to print out the name of the operations).The program requires that elements of subsets A and B are from user input. You can make theassumption that user input numbers are within the domain of the set {0, 1, 2, ..., 9} and there isno improper input.Additional requirements and reminders:• The use of STL, templates, and operator overloading is not permitted in any form.• Remember: You must use a bit string when representing a set. You may not use an array ofBoolean variables.• The elements of subset A and subset B must from user input. You may not hardcode the twosubsets in your program.
In Python code: This exercise is to write a Decimal to Hex function using BYTE operations. You can use a List, Dictionary or Tuple for your Hex_Map as shown below, but it's not necessary to use one. It is necessary to use Byte operations to convert the decimal to hex. The bitwise operations are also available as __dunders__. Write a function to convert a integer to hexidecimal. Do not use the Python hex function (i.e. hexnumber = hex(number)) to convert the number, instead write your own unique version (i.e. MYHEX: hexnumber = MYHEX(number)). Your function should not use any Python functions like hex, dec, oct, bin or any other Python functions or modules. Functions, like Python ORD, can be used to convert a string to a integer. The input number range is 0 to 1024. def MYHEX(number): hex_map = {10: 'A', 11: 'B', 12: 'C', 13: 'D', 14: 'E', 15: 'F'} result = '' while number: digit = number % 16 if digit > 9: result = hex_map[digit] + result…
In Python, given the list = [10,'Hi',20,'Hello',30,'World',40], use map, lambda, and filter to print the string elements in all upper case. You may use the built-in function upper() only. No other built-in functions are allowed. In another notebook, use reduce, lambda, and filter to sum the integers in the list. Use a single line of code only with the exception of the list definition and the reduce() import.
Implement MERGE-SORT() algorithm that reads from a file named “inputHW02.txt” a list of double numbers (max =3,000,000 numbers), sorts those numbers and indicates time consumption. This programming question will address theadvantage of using iteration loops over recursive calls as well as using INSERTION-SORT() as a procedure in MERGESORT().Your program must perform the following actions:1. Opens the given file name and reads all double numbers. For simplicity, we assume this file only containsnumbers and nothing else.2. Implements the function INSERTION-SORT() that only sort an array of maximum 25 numbers. The idea is thatINSERTION-SORT() will be used as a sub-procedure to sort any sub-array when its size is small enough.3. Four versions of MERGE-SORT() namelya. MERGE-SORT-A(): Using recursive calls and NO INSERTION-SORT() as a sub-procedureb. MERGE-SORT-B(): Using ITERATIVE loops (i.e, NO recursion) and NO INSERTION-SORT() as a subprocedure.c. MERGE-SORT-C(): Using recursive calls…
Implement MERGE-SORT() algorithm that reads from a file named “inputHW02.txt” a list of double numbers (max =3,000,000 numbers), sorts those numbers and indicates time consumption. This programming question will address theadvantage of using iteration loops over recursive calls as well as using INSERTION-SORT() as a procedure in MERGESORT().Your program must perform the following actions:1. Opens the given file name and reads all double numbers. For simplicity, we assume this file only containsnumbers and nothing else.2. Implements the function INSERTION-SORT() that only sort an array of maximum 25 numbers. The idea is thatINSERTION-SORT() will be used as a sub-procedure to sort any sub-array when its size is small enough.3. Four versions of MERGE-SORT() namelya. MERGE-SORT-A(): Using recursive calls and NO INSERTION-SORT() as a sub-procedureb. MERGE-SORT-B(): Using ITERATIVE loops (i.e, NO recursion) and NO INSERTION-SORT() as a subprocedure.c. MERGE-SORT-C(): Using recursive calls…