EBK DATA STRUCTURES AND ALGORITHMS IN C
4th Edition
ISBN: 9781285415017
Author: DROZDEK
Publisher: YUZU
expand_more
expand_more
format_list_bulleted
Question
Chapter 1, Problem 2PA
Program Plan Intro
Quaternion
Program plan:
- Define a class named “Quaternion” that defines basic operations of quaternion
- Define a function named “operator+()” that adds two input terms and displays the result.
- Define a function named “operator-()” that subtracts two input terms and displays the result.
- Declare a function named “operator*()” that multiplies two input terms and displays the result.
- Define a function named “operator/()” that divides one input term with the other and displays the result.
- Define a function named “operator<<()” that overloads the output operator to output the fraction.
- Declare a function named “operator=()” that performs the function of assignment operation.
- Declare a function named “operator~()” that computes the conjugate of given input quaternion term.
- Declare a function named “normSquared()” that computes the squared norm of an input term and displays the result.
- Declare a function named “operator+=()” that denotes the operation of add AND assignment operators.
- Declare a function named “operator-=()” that denotes the operation of subtract AND assignment operators.
- Declare a function named “operator*=()” that denotes the operation of multiply AND assignment operators.
- Declare a function named “operator/=()” that denotes the operation of divide AND assignment operators.
- Declare a function named “operator==()” that denotes the operation of equality comparison operators.
- Declare a function named “operator!=()” that denotes the operation of add equality operators of comparison type.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
code in java pls
Summary: Given integer values for red, green, and blue, subtract the gray from each value.
Computers represent color by combining the sub-colors red, green, and blue (rgb). Each sub-color's value can range from 0 to 255. Thus (255, 0, 0) is bright red, (130, 0, 130) is a medium purple, (0, 0, 0) is black, (255, 255, 255) is white, and (40, 40, 40) is a dark gray. (130, 50, 130) is a faded purple, due to the (50, 50, 50) gray part. (In other words, equal amounts of red, green, blue yield gray).
Given values for red, green, and blue, remove the gray part.
Ex: If the input is:
130 50 130
the output is:
80 0 80
Find the smallest value, and then subtract it from all three values, thus removing the gray.
Part IV
An early method of telegraph communication was based on the Morse code. This code uses patterns of short and
long pulses to represent a message. Each letter is represented as a sequence of dots (a short pulse), and dashes (a
long pulse). For example, the first eight letters of the alphabet have the following representation:
A
In HDL
Verilog
В
C
D
E
F
G
H
Design and implement a circuit that takes as input one of the first eight letters of the alphabet and displays the
Morse code for it on a red LED. Your circuit should use switches SW2-o and pushbuttons KEY1
a user presses KEY1, the circuit should display the Morse code for a letter specified by SW2-0 (000 for A, 001 for
B, etc.), using 0.5-second pulses to represent dots, and 1.5-second pulses to represent dashes. Pushbutton KEY,
should function as an asynchronous reset. A high-level schematic diagram of the circuit is shown in Figure 2.
(1-0 as inputs. When
Hint: Use a counter to generate 0.5-second pulses, and another counter…
Code in C++ only. Correct answer will upvoted else downvoted.
framework of size n×m, with the end goal that every cell of it contains either 0 or 1, is considered lovely if the total in each adjoining submatrix of size 2×2 is actually 2, i. e. each "square" of size 2×2 contains precisely two 1's and precisely two 0's. You are given a network of size n×m. At first every cell of this network is unfilled. How about we indicate the cell on the crossing point of the x-th line and the y-th segment as (x,y). You need to handle the inquiries of three sorts: x y −1 — clear the cell (x,y), in case there was a number in it; x y 0 — compose the number 0 in the cell (x,y), overwriting the number that was there already (assuming any);
x y 1 — compose the number 1 in the cell (x,y), overwriting the number that was there beforehand (assuming any). After each question, print the number of ways of filling the unfilled cells of the grid so the subsequent network is delightful. Since the appropriate…
Chapter 1 Solutions
EBK DATA STRUCTURES AND ALGORITHMS IN C
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- Java Assignment: Mathematics is the very interesting subject and for the India it is also a point of pride because Mr. Brahmagupta gives the 0 to world. So, in this series want to be great mathematician like Brahmagupta. He is keep practicing for her goal achievement. Once He knew about the Vector dot Product So He asked his friend Sammer the problem. He gave her two vectors A and B length N. He asked him to reduce the dot output of these two vectors. Sammer has the option to change the order of the objects of these two carriers i.e., in any two objects I and j at any vector can change the shape of these objects. Since Sammer is new to the program, he has asked you to resolve the issue using C++ Programming language. Input: 1 4 142-5 3 -8 5 2 Output: -50arrow_forwardLet A = {a, b, c}, B = {x, y}, and C = {0, 1}.arrow_forwardPlease written by computer source Question 1: Suppose we wish to write a procedure that computes the inner product of two vectors u and v. An abstract version of the function has a CPE of 14–18 with x86- 64 for different types of integer and floating-point data. By doing the same sort of transformations we did to transform the abstract program combine1 into the more efficient combine4, we get the following code: Our measurements show that this function has CPEs of 1.50 for integer data and 3.00 for floating-point data. For data type double, the x86-64 assembly code for the inner loop is as follows: Assume that the functional units have the characteristics listed in Figure 5.12. **See last page for figures A. Diagram how this instruction sequence would be decoded into operations and show how the data dependencies between them would create a critical path of operations, in the style of textbook Figures 5.13 and 5.14. vmovsd vmovsd vmulsd vaddsd | | | |…arrow_forward
- Python only Rajesh loves lucky numbers. Everyone knows that lucky numbers are positive integers whose decimal representation contains only the lucky digits 4 and 7. For example, the numbers 47,744, 4 are lucky and 5, 17,467 are not. Let Fa(x) equal the number of digits d in the decimal representation of the positive integer x. Chef is only interested in F4(x) and F7(x) functions. For a given positive integer N, he wants to know the total number of distinct pairs (L; R) such that F4(L) + F4(L + 1) + ... + F4(R) equals F7(L) + F7(L + 1) + ... + F7(R) and 1arrow_forwardPlease Answer this in C++ only Devo is learning Combinatorics in his college. He finds it very interesting to calculate number of ways of going to point (c, d) from point (a, b) in co-ordinate plane. We can take horizontal and vertical steps only and cannot visit at a point twice. In a step, you can move one unit only. We have to reach to the point (c, d) from the point (a, b) using abs(a-c) + abs(b-d) steps only. Devo has two sets of points. Set A contains points having X co-ordinate 0 and Y co- ordinates varying from 1 to N (both inclusive). Set B contains points having X co- ordinate K and Y co-ordinates varying from 1 to N (both inclusive). Both sets contain N number of integral points. He wants to calculate the sum of number of ways to going to each point of set B from each point of set A. As the answer can be large, print it modulo 1000000007. Input 2 22 45 Output 8 236arrow_forwardA decreasing sequence of numbers is a sequence of integers where every integer in the sequence is smaller than all other previous integers in that sequence. For example, •35, 16, 7, 2, 0, -3, -9 is a decreasing sequence of numbers. The length of this sequence is 7 (total numbers in the sequence) and the difference of this sequence is 35 - (-9) -44. • 5 is a decreasing sequence of numbers with length 1 and difference 5-5 = 0 •99,-99 is a decreasing sequence of numbers with length 2 and difference 99-(-99) = 198 •17, 23, 11, 8, -5, -3 is not a decreasing sequence of %3D numbers. Write a program that contains a main() function. The main function repeatedly asks the user to enter an integer if the previously entered integers form a decreasing sequence of numbers. This process stops as soon as the latest user input breaks the decreasing sequence. Then your function should print the length and difference of the decreasing sequence. Finally, call the main() function such that the call will be…arrow_forwardJava considers the String data type as non-primitive, because it contains a sequence of characters and hence there is a predefined class called String dedicated to String processing. The String class has a lot of functions and continues to grow. See https://www.tutorialspoint.com/java/java_strings.htm for more on strings. Your task is to then create a java program that when give a sentence will replace the first occurrence of NUST with Namibia University of Science and Technology. Sample run 1: --- Input ---Welcome to my NUST --- Expected output (text)---Welcome to my Namibia University of Science and Technology. Sample run 2: --- Input ---The nust is a great institution of high learning. --- Expected output (text)---The Namibia University of Science and Technology is a great institution of high learning. Sample run 3: --- Input ---The NuSt was renamed from Polytechnic Of Namibia under Act No. 7 of 2015. --- Expected output (text)---The Namibia University of Science and…arrow_forwardJava considers the String data type as non-primitive, because it contains a sequence of characters and hence there is a predefined class called String dedicated to String processing. The String class has a lot of functions and continues to grow. See https://www.tutorialspoint.com/java/java_strings.htm for more on strings. Your task is to then create a java program that when give a sentence will replace the first occurrence of NUST with Namibia University of Science and Technology. Sample run 1: Enter a sentence: Welcome to my NUST. Output: Welcome to my Namibia University of Science and Technology. Sample run 2: Enter a sentence: The nust is a great institution of high learning. Output: The Namibia University of Science and Technology is a great institution of high learning.arrow_forwardDraw Flowchart of this program // C# program for implementation // of Lagrange's Interpolation using System; class GFG { // To represent a data point // corresponding to x and y = f(x) class Data { public int x, y; public Data(int x, int y) { this.x = x; this.y = y; } }; // function to interpolate the given // data points using Lagrange's formula // xi corresponds to the new data point // whose value is to be obtained n // represents the number of known data points static double interpolate(Data []f, int xi, int n) { double result = 0; // Initialize result for (int i = 0; i < n; i++) { // Compute individual terms // of above formula double term = f[i].y; for (int j = 0; j < n; j++) { if (j != i) term = term * (xi - f[j].x) / (f[i].x - f[j].x); } // Add current term to result result += term; } return result; } // Driver code public static void Main(String[] args) { // creating an array of 4 known data points Data []f = {new Data(0, 2), new Data(1, 3), new Data(2, 12), new Data(5,…arrow_forwardcode for this in C: The Pascal triangle can be used to compute the coefficients of the terms in the expansion (a + b)n. For example, (a + b)2 = a2 + 2ab + b2 where 1, 2, and 1 are coefficients. Write a C program that creates a two-dimensional matrix a representing the Pascal triangle of size n. For example, a Pascal triangle of size 6 is shown below: 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1arrow_forwardWrite a java code to implement four new functions DFA Union: Given Two DFAs, M1 and M2, create a DFA which accepts the union of the languages of M1 and M2. Intersection: Given Two DFAs, M1 and M2, create a DFA which accepts the intersection of the languages of M1 and M2. Difference: Given Two DFAs, M1 and M2, create a DFA which accepts the set difference of the languages of M1 and M2, that is, L(M1) - L(M2), the set of strings accepted by M1 but not M2. Complement: Given DFA M, create a DFA which accepts the complement of the language of M.arrow_forwardMultidimensional arrays are used in image processing in C++. A gray-scale image of size m*n is represented as a m*n matrix (array). Each pixel can be shown using a double number between 0 and 1 (0 for black and 1 for white and numbers between 0 and 1 for the gray values). Let's say we scan a document and notice that we have a dark background. Can you think of a function that gets an image as a 2D array and eliminates its background? What operations are needed to make an image lighter? How about sharpening or softening? Now with this definition, what do you think of software like Photoshop? How can we write a small version of Photoshop that only works on gray images and does sharpening and softening?arrow_forwardarrow_back_iosSEE MORE QUESTIONSarrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education
6 Stages of UI Design; Author: DesignerUp;https://www.youtube.com/watch?v=_6Tl2_eM0DE;License: Standard Youtube License