[Solved]1 Configuring Ip Internet Protocol Version 4 Tcp Ipv4 Properties Replica Add Main Domain C Q37156372

1))When configuring the IP in the Internet Protocol Version 4(TCP/IPv4) Properties on a replica why add the main domaincontroller IP address in the Preferred DNS server?

2)) What is the reason to get the following error when selectinglocation for system state recover :

“The backup contains Active directory domain service which canbe recovered only when the computer is started in directoryservices restore mode. Retry the system state recovery operationfrom DSRM.”

Expert Answer


Answer to 1))When configuring the IP in the Internet Protocol Version 4 (TCP/IPv4) Properties on a replica why add the main domain… . . .

[Solved]1 Computer Running Responding Keyboard Inputs Find Network Activities Running Slowly Proba Q37176964

1) The computer is running, but not responding to your keyboardinputs. You find that the network activities are running veryslowly. You have probably been hit by a rootkit

True

False

2) Suppose your computer network was compromised in a largescale virus attack last Thursday. Most of the data files gotcorrupted beyond repair. The last data backup was done the Sundaybefore the virus attack. This means your company has an adequatebackup process in place

True

False

3) You work at a call center of a large bank where you answercredit card services related questions from customers. Lately, youhave noticed an increased number of customers enquiring if you hadinitiated a call. There can be a scam in progress.

True

False

4) Whenever there is a computer security incident, it is notrecommended that the organization reveal all they know in publicforums.

True

False

Expert Answer


Answer to 1) The computer is running, but not responding to your keyboard inputs. You find that the network activities are running… . . .

[Solved]1 Consider 38 Bit System Paging Scheme Memory Management Page Size System 16k Bytes Note 1 Q37241814

1. Consider a 38-bit system with paging scheme formemory management. The page size of the system is 16K bytes (Note1K=1024=210).

(a) Suppose a single-level paging is used, how many bits shouldbe allocated to the page offset? How large is the page table interms of bytes? Assume that each entry in the page table needs 4bytes.

(b) Suppose that we want to fit each of all the page tables intoone frame using multi-level paging. How many paging levels do weneed at the minimum? Specify the bits at each page level. Eachentry in all the page tables is 4 bytes.

(c) Discuss how to detect illegal memory accesses in this pagingsystem.

Expert Answer


Answer to 1. Consider a 38-bit system with paging scheme for memory management. The page size of the system is 16K bytes (Note 1K=… . . .

[Solved]1 Consider Experiment X Variable Control Y Measured Variable Desired Fit Nonlinear Equatio Q37274393

Can you write in Matlab ? I need implementations.

1 Consider an experiment in which x is the variable that you can control and y is the measured variable. It is desired to fit

1 Consider an experiment in which x is the variable that you can control and y is the measured variable. It is desired to fit the nonlinear equation yto the data given below: 0.2 1.25 0.4 1.45 0.6 1.25 0.85 0.9 0.55 0.35 0.280.18 0.75 a) Plot y versus x as data points. Set the axes limits to be xmin-0, xma,-2, ymin-0, ymax-1.8 Note: In your Matlab program, you are allowed to use the built-in functions sum and mean b) Linearise the given nonlinear equation and then apply linear least-squares regression to find the equation for the regression line. Plot the linearised data set together with the regression line. Determine Sr (the sum of squares of residuals around the regression line) and r(the corresponding coefficient of determination). c) Using the results of part (b), determine the coefficients α, β of the nonlinear equation. Plot the original data set together with the nonlinear equation. Determine S (the sum of squares of residuals around the nonlinear equation fit) and (the corresponding coefficient of determination). In your plot, use the same axes limits given in part (a). d) What can you say about the goodness of the curve-fits applied in parts (b) and (c). Comment shortly 2) Bonus (+10 pts): Using Matlab’s built-in functions polyfit and polyval, fi a 4h order polynomial to the given data (i.e. apply polynomial regression) and plot the data set together with the fitted polynomial. 3) Bonus (+15 pts): Part (b) of Question-1 can be solved very easily and quickly using Matlab’s “Basic Fitting” menu. Plot the linearised data set together with the regression line, find S, and check your answers (Note that the norm of residuals is equal to-/Sr ) . Do not calculate 4) Bonus (+10 pts): Using Matlab’s “Basic Fitting” menu, fit cubic, 4th order and Sth order polynomials to the given data. You are only required to plot the data set together with the fitted polynomials and indicate the most successful curve-fit. Show transcribed image text 1 Consider an experiment in which x is the variable that you can control and y is the measured variable. It is desired to fit the nonlinear equation yto the data given below: 0.2 1.25 0.4 1.45 0.6 1.25 0.85 0.9 0.55 0.35 0.280.18 0.75 a) Plot y versus x as data points. Set the axes limits to be xmin-0, xma,-2, ymin-0, ymax-1.8 Note: In your Matlab program, you are allowed to use the built-in functions sum and mean b) Linearise the given nonlinear equation and then apply linear least-squares regression to find the equation for the regression line. Plot the linearised data set together with the regression line. Determine Sr (the sum of squares of residuals around the regression line) and r(the corresponding coefficient of determination). c) Using the results of part (b), determine the coefficients α, β of the nonlinear equation. Plot the original data set together with the nonlinear equation. Determine S (the sum of squares of residuals around the nonlinear equation fit) and (the corresponding coefficient of determination). In your plot, use the same axes limits given in part (a). d) What can you say about the goodness of the curve-fits applied in parts (b) and (c). Comment shortly 2) Bonus (+10 pts): Using Matlab’s built-in functions polyfit and polyval, fi a 4h order polynomial to the given data (i.e. apply polynomial regression) and plot the data set together with the fitted polynomial. 3) Bonus (+15 pts): Part (b) of Question-1 can be solved very easily and quickly using Matlab’s “Basic Fitting” menu. Plot the linearised data set together with the regression line, find S, and check your answers (Note that the norm of residuals is equal to-/Sr ) . Do not calculate 4) Bonus (+10 pts): Using Matlab’s “Basic Fitting” menu, fit cubic, 4th order and Sth order polynomials to the given data. You are only required to plot the data set together with the fitted polynomials and indicate the most successful curve-fit.

Expert Answer


Answer to 1 Consider an experiment in which x is the variable that you can control and y is the measured variable. It is desired t… . . .

[Solved]1 Consider Following Function G P 1 Sin 2 Q37200091

1. Consider the following function: g(p) = 1 + sin ( for-2<p<2. (a) Write a code to implement the batched steepest descent ba

1. Consider the following function: g(p) = 1 + sin ( for-2<p<2. (a) Write a code to implement the batched steepest descent backpropagation algorithm (SDBP) to b) Write a code to implement the batched conjugate gradient backpropagation algorithm (CGBP) (c) Write a code to implement the batched momentum backpropagation algorithm (MOBP) to ap approximate this function. to approximate this function proximate this function Use a 1-2-1 neural network, .e., 1 input layer, 2 hidden layers and 1 output layer with the transfer functions specified in the example in page 370 of the textbook. Choose the initial weights and biases to be random numbers uniformly distributed between -0.5 and 0.5. Experiment with several different values for the learning rate a, and use several different initial conditions. Generate a training set of 80 data points from the function and use a test set of 20 randomly chosen data points. Plot the training error as a function of the iterations, and give the final test error. Use batch sizes of 1 and 5. Note that a batch size of 1 will yield the non-batched version of each algorithm. Show transcribed image text 1. Consider the following function: g(p) = 1 + sin ( for-2

Expert Answer


Answer to 1. Consider the following function: g(p) = 1 + sin ( for-2… . . .

[Solved]1 Consider Following Graph Edge Weights Listed Table Ab Ac Ad Ae Ag Cd De Dh Eh Fg Fh Gh 4 Q37284533

1. Consider the following graph with edge weights listed in the table AB AC AD AE AG CD DE DH EH FG FH GH 4 4 2 (a) What is t

1. Consider the following graph with edge weights listed in the table AB AC AD AE AG CD DE DH EH FG FH GH 4 4 2 (a) What is the cost of its minimum spanning tree? (b) How many minimum spanning trees does it have? (c) Suppose Kruskal’s algorithm is run on this graph. In what order are the edges added to the MST (in case of ties add the edge which is lexicographically first, that is, comes first in the table)? For each edge in this sequence, give a cut that justifies its addition. Show transcribed image text 1. Consider the following graph with edge weights listed in the table AB AC AD AE AG CD DE DH EH FG FH GH 4 4 2 (a) What is the cost of its minimum spanning tree? (b) How many minimum spanning trees does it have? (c) Suppose Kruskal’s algorithm is run on this graph. In what order are the edges added to the MST (in case of ties add the edge which is lexicographically first, that is, comes first in the table)? For each edge in this sequence, give a cut that justifies its addition.

Expert Answer


Answer to 1. Consider the following graph with edge weights listed in the table AB AC AD AE AG CD DE DH EH FG FH GH 4 4 2 (a) What… . . .

[Solved]1 Consider Following Graphs Step Dijkstra S Algorithm Calculate Single Source Shortest Pat Q37246105

1. Consider the following graphs: Step through Dijkstras algorithm to calculate the single-source shortest paths from A to e

1. Consider the following graphs: Step through Dijkstra’s algorithm to calculate the single-source shortest paths from A to every other vertex. Show your steps in the table below. Cross out old values and write in new ones, from left to right within each cell, as the algorithm proceeds. Also list the vertices in the order which you marked them known. Finally, indicate the lowest-cast path from node A to node G. a. 14 7 3 2 10 F 0 3 2 Known vertices (in order marked known): Path Vertex Known Distance Show transcribed image text 1. Consider the following graphs: Step through Dijkstra’s algorithm to calculate the single-source shortest paths from A to every other vertex. Show your steps in the table below. Cross out old values and write in new ones, from left to right within each cell, as the algorithm proceeds. Also list the vertices in the order which you marked them known. Finally, indicate the lowest-cast path from node A to node G. a. 14 7 3 2 10 F 0 3 2 Known vertices (in order marked known): Path Vertex Known Distance

Expert Answer


Answer to 1. Consider the following graphs: Step through Dijkstra’s algorithm to calculate the single-source shortest paths from A… . . .

[Solved]1 Consider Following Memory Structure Complete Table Unknown Parameters Bitline Conditioni Q37197489

1. Consider following Memory structure and complete the table for unknown parameters. bitline conditioning wordlines bitlinesNumber of words in memory 16 16 64 128 512 1024 2K 8K 32K 128K 512K 1M 4M Number of Number of Number words in each bits for e

1. Consider following Memory structure and complete the table for unknown parameters. bitline conditioning wordlines bitlines memory cells: 2n-k rows x 2mk columns XEXcolumn MUX MUX circuitry 2m bits Number of words in memory 16 16 64 128 512 1024 2K 8K 32K 128K 512K 1M 4M Number of Number of Number words in each bits for each of bits in memory Size ofSize of each n k decoder Multiplexers Number of Number of bits in multiplexers each row word row 4×16 3×8 4×16 5×32 5×32 6×64 6×64 6×64 8×256 8×256 10×1024 9×512 10×1024 4 16 4 16 16 32 32 Show transcribed image text 1. Consider following Memory structure and complete the table for unknown parameters. bitline conditioning wordlines bitlines memory cells: 2n-k rows x 2mk columns XEXcolumn MUX MUX circuitry 2m bits
Number of words in memory 16 16 64 128 512 1024 2K 8K 32K 128K 512K 1M 4M Number of Number of Number words in each bits for each of bits in memory Size ofSize of each n k decoder Multiplexers Number of Number of bits in multiplexers each row word row 4×16 3×8 4×16 5×32 5×32 6×64 6×64 6×64 8×256 8×256 10×1024 9×512 10×1024 4 16 4 16 16 32 32

Expert Answer


Answer to 1. Consider following Memory structure and complete the table for unknown parameters. bitline conditioning wordlines bit… . . .

[Solved]1 Consider Following Logic Program P X X P X S Y P X Y P F X L F Y M P L M Show Successf Q37298314

SLD Resolution / Derivation

1. Consider the following logic program. p(X, x) p(X, s(Y)) - p(X, Y). p(f (X, L), f(Y, M))-p(L, M). Show a successful SLD-de

1. Consider the following logic program. p(X, x) p(X, s(Y)) – p(X, Y). p(f (X, L), f(Y, M))-p(L, M). Show a successful SLD-derivation for the following query: ?- p(f (a, s(a)), f(X, X)). a is a constant. 2. Consider the following logic program p(x, ) p(X, [XIL]) :- p(X, L). Show a successful SLD-derivation for the following query: a is a constant. Show transcribed image text 1. Consider the following logic program. p(X, x) p(X, s(Y)) – p(X, Y). p(f (X, L), f(Y, M))-p(L, M). Show a successful SLD-derivation for the following query: ?- p(f (a, s(a)), f(X, X)). a is a constant. 2. Consider the following logic program p(x, ) p(X, [XIL]) :- p(X, L). Show a successful SLD-derivation for the following query: a is a constant.

Expert Answer


Answer to 1. Consider the following logic program. p(X, x) p(X, s(Y)) – p(X, Y). p(f (X, L), f(Y, M))-p(L, M). Show a successful S… . . .

[Solved]1 Consider Following Page Reference String 2 1 5 6 2 1 2 1 7 6 3 2 1 2 3 6 Using Table Ans Q37242049

1. Consider the following page reference string: 2, 1,5, 6, 2, 1, 2, 1, 7, 6, 3, 2, 1, 2, 3, 6 (using the belowtable Answer the followingquestions.)

Further assume that there are four frames in the system, whereall of the frames are initially empty.

21562121763212 36

(a) For the LRU (Least Recently Used) page replacementalgorithm, fill the table where each column represents the framesafter each page reference.(Note that the last row is the referencestring.) Then specify how many page faults it generates. Mark allthe references that generate a page fault with “*”.

(b)For the Belady’s optimal page replacement algorithm, fill thetable where each column represents the frames after each pagereference. (Note that the last row is the reference string.) Thenspecify how many page faults it generates. Mark all the referencesthat generate a page fault with “*”.

(c) For the working set page replacement algorithm with a windowof size 4, fill the table where each column represents the framesafter each page reference. (Note that the last row is the referencestring.) Then specify how many page faults it generates. Mark allthe references that generate a page fault with “*”.

(d) Based on the number of page faults for each algorithm forthis page reference string, is that possible to calculate the pagefault rate per memory reference? Justify your answer.

21562121763212 36 Show transcribed image text 21562121763212 36

Expert Answer


Answer to 1. Consider the following page reference string: 2, 1, 5, 6, 2, 1, 2, 1, 7, 6, 3, 2, 1, 2, 3, 6 (using the below table A… . . .