Learn more about our help with Assignments: Algorithms
Search & Filtering
Algorithms
Calculate the dot product of a= (22, 2, 7) & b= (12, -9, 11). And Cross Product of c= (4, 0, 3) & d= (3, 1, 7).
Algorithms
Using Cohen-Sutherland algorithm,
Let, the rectangular window A (15, 15), B (80, 15), C (80, 60), D (15, 60). Find the region codes, slope, intersection points to clip the line with P1(10,20) and P2(70, 80).
Let, the rectangular window A (15, 15), B (80, 15), C (80, 60), D (15, 60). Find the region codes, slope, intersection points to clip the line with P1(10,20) and P2(70, 80).
Algorithms
Given the function; F(W,X,Y,Z)=sum(1,3,7,11,15)+dc(0,2,5,8).
(i) write the function in conjunctive normal form.
(ii)Minimize the function (DNF) using Karnaugh Map.
(iii)Construct the logic circuit diagram for the minimized function.
(i) write the function in conjunctive normal form.
(ii)Minimize the function (DNF) using Karnaugh Map.
(iii)Construct the logic circuit diagram for the minimized function.
Algorithms
compute -ABE(base16)-AF4(base16)using 15's complement
Algorithms
All of your solutions should be structured. Explain why your solution can be considered a structured solution
Algorithms
a) Compute - ABE16 - DF416 using 15’s complement
b) Compute the 3658-3458 in 2’s complement signed magnitude form.
c) Simplify the expression
using rules of Boolean algebra.
d) Compute the value of 3AB16-43510-6178 using 1’s complement arithmetic
leaving your final answer in Octal.
f (a, b, c) = a. b + a.(b + c)+(a. b. (c + b. d)+ a. b). c. d
b) Compute the 3658-3458 in 2’s complement signed magnitude form.
c) Simplify the expression
using rules of Boolean algebra.
d) Compute the value of 3AB16-43510-6178 using 1’s complement arithmetic
leaving your final answer in Octal.
f (a, b, c) = a. b + a.(b + c)+(a. b. (c + b. d)+ a. b). c. d
Algorithms
Given the function F(w,x,y,z)=Σ(1,3,7,11,15)+dc(0,2,5,8)
i. Write the function in conjunctive normal form
ii. Minimize the function (DNF) using Karnaugh Map
iii. Construct the logic circuit diagram for the minimized function.
i. Write the function in conjunctive normal form
ii. Minimize the function (DNF) using Karnaugh Map
iii. Construct the logic circuit diagram for the minimized function.
Algorithms
Remember Rudrata–Path(s, t) and Rudrata–Cycle(x) problems. Now suppose
you are given an oracle that solves Rudrata–Path(s, t) in O(1) time. Propose a
polynomial time algorithm for solving Rudrata–Cycle(x) while using the
Rudrata–Path oracle.
(Hint: This is equivalent to proving Rudrata–Cycle(x) →P Rudrata–Path(s, t))
you are given an oracle that solves Rudrata–Path(s, t) in O(1) time. Propose a
polynomial time algorithm for solving Rudrata–Cycle(x) while using the
Rudrata–Path oracle.
(Hint: This is equivalent to proving Rudrata–Cycle(x) →P Rudrata–Path(s, t))
Algorithms
Write a Pascal program to do the following for matrix A of size 10x10 (its elements are integers)
a) Find out how many of each element is repeated in the matrix
b) Find two elements closest to each other in the matrix (use absolute distance)
If more than one situation with the same distance value is present, it is sufficient to display any
of them.
a) Find out how many of each element is repeated in the matrix
b) Find two elements closest to each other in the matrix (use absolute distance)
If more than one situation with the same distance value is present, it is sufficient to display any
of them.
Algorithms
The mainline logic of almost every procedural program consists of three parts namely housekeeping tasks,details loop and end of job tasks. By making use of flowcharts,show how these parts can be in your solution
