logo Use CA10RAM to get 10%* Discount.
Order Nowlogo
(5/5)

Write a C++ program that opens a connectivity matrixand Calculatesthe Google PageRank algorithm (search it online what it is) for the web described bythe connectivity matrix.

INSTRUCTIONS TO CANDIDATES
ANSWER ALL QUESTIONS

Write a C++ program that opens a connectivity matrix and Calculates the Google PageRank algorithm (search it online what it is) for the web described by the connectivity matrix.

The connectivity matrix will be in a plaintext file called connectivity.txt.

It will be square, and composed entirely of space-separated 0s and 1s (this is an example):

0 1 1 0

1 0 1 0

1 1 0 0

0 0 0 0

Your program must print the result to cout like this (Output):-

Page A: 31.75%

Page B: 31.75%

Page C: 31.75%

Page D: 4.76%

 

You must create matrix.cpp,  pagerank.cpp (calculates google pagerank algorithm) and main.cpp (should be short). with following requirements: -

 

  • The matrix stores doubles. Implement a default constructorwhich initializes a square 1 x 1 matrix that contains a 0.0.

  • Implement a constructorthat accepts a positive integer n and creates a square n x n matrix that contains 0.0s. Throw an exception if the integer passed to the constructor is zero or negative.

  • Implement a constructor that accepts two positive integers r and c and creates a matrix with r rows and c columns that contains 0.0s. Throw an exception if either integer passed to the constructor is zero or negative.

  • Implement a constructorthat accepts a one-dimensional array/vector of double. If you use an array, it might be helpful to also pass in the size of the array to indicate the number of elements in the array. The size of the array/double must have an integer square root, i.e., the size of the array/double must be 1, or 4, or 9, or 16, etc. Create a square matrix of size 1 x 1, or 2 x 2, or 3 x 3, or 4 x 4, etc., and populate it using the values from the array/double. If the size of the array/double does not have an integer square root, throw an exception.

  • Implement a 3-parameter Setterthat accepts two integers representing row and column and a double representing new value for specified location. Throw an exception if integers are negative or too large.

  • Implement a 2-parameter Getterthat accepts two integers representing row and column and returns value in the matrix from specified location. Throw an exception if the integers are negative or too large.

  • Implement a functioncalled clear which sets all values in the matrix to 0.0.

  • Implement a destructorcalled ~matrix.

  • Implement an overloaded insertion operatorso we can print the matrix to std::cout or other streams.

  • Implement ==and != operators. The equality operators must check if the matrices are same size and contain the same values in the same locations.

  • Implement unary incrementand decrement operators. You will need a prefix and a postfix version of each. The operators should (respectively) increment or decrement each value in the matrix by 1.0.

  • Implement the assignment operatorusing the copy-and-swap algorithm introduced in class.

  • Overload operator +=,operator +, operator - =, and operator - .These will only work if the matrices are the same size otherwise throw an exception. Do not overload operator / or operator/=

  • Overload operator*and operator*= . For operator* and operator*= , be careful. You will need to remember that for 2 matrices a and b, the product matrix c is possibly a different size. If matrix a is 1 x 4 and matrix b is 4 x 3, the size of the product matrix c will be 1 x 3. If the number of columns of the first operand is not equal to the number of rows of the second operand, throw an exception.

 

(5/5)
Attachments:

Related Questions

. Introgramming & Unix Fall 2018, CRN 44882, Oakland University Homework Assignment 6 - Using Arrays and Functions in C

DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma

. The standard path finding involves finding the (shortest) path from an origin to a destination, typically on a map. This is an

Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t

. Develop a program to emulate a purchase transaction at a retail store. This program will have two classes, a LineItem class and a Transaction class. The LineItem class will represent an individual

Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th

. SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

. Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

Ask This Question To Be Solved By Our ExpertsGet A+ Grade Solution Guaranteed

expert
Um e HaniScience

639 Answers

Hire Me
expert
Muhammad Ali HaiderFinance

795 Answers

Hire Me
expert
Husnain SaeedComputer science

623 Answers

Hire Me
expert
Atharva PatilComputer science

557 Answers

Hire Me
April
January
February
March
April
May
June
July
August
September
October
November
December
2025
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
SunMonTueWedThuFriSat
30
31
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
1
2
3
00:00
00:30
01:00
01:30
02:00
02:30
03:00
03:30
04:00
04:30
05:00
05:30
06:00
06:30
07:00
07:30
08:00
08:30
09:00
09:30
10:00
10:30
11:00
11:30
12:00
12:30
13:00
13:30
14:00
14:30
15:00
15:30
16:00
16:30
17:00
17:30
18:00
18:30
19:00
19:30
20:00
20:30
21:00
21:30
22:00
22:30
23:00
23:30