Skip to main content

Value assignment to name in R

 Like other programming languages, the value can be assigned to name variables in R.  The assignment of a value to variable can be done as below. 

> y <- 12

> y

[1] 12

'=' can be also be used in place of '<-'. If '<-' is used, there should not be any space between two characters.

The name can be chosen from letter, digits and period symbol. But the name should not be started with a digit or period followed by a digit.

> 1. = 5

Error in 1 = 5 : invalid (do_set) left-hand side to assignment.

> .1 = 1

Error in 0.1 = 1 : invalid (do_set) left-hand side to assignment

Some characters are used already for defining functions. However, it would cause confusion if it is used for assigning a value. Few of the defined function characters are c, q, t , F, T etc.

c - Combine values into a vector or list

q - Terminate the current R session

t - Return a transpose of the given matrix

F & T - Logical argument TRUE or FALSE

Except F & T, other characters won't cause any trouble when they are assigned with value. 

Popular posts from this blog

Exercise 1 - Amdahl's Law

A programmer is given the job to write a program on a computer with processor having speedup factor 3.8 on 4 processors. He makes it 95% parallel and goes home dreaming of a big pay raise. Using Amdahl’s law, and assuming the problem size is the same as the serial version, and ignoring communication costs, what is the speedup factor that the programmer will get? Solution Speedup formula as per Amdahl's Law, N - no of processor = 4 f - % of parallel operation = 95% Speedup = 1 / (1 - 0.95) + (0.95/4) = 1 / 0.5 + (0.95/4) Speedup = 3.478 The programmer gets  3.478 as t he speedup factor.

Exercise 2 - Amdahl's Law

A programmer has parallelized 99% of a program, but there is no value in increasing the problem size, i.e., the program will always be run with the same problem size regardless of the number of processors or cores used. What is the expected speedup on 20 processors? Solution As per Amdahl's law, the speedup,  N - No of processors = 20 f - % of parallel operation = 99% = 1 / (1 - 0.99) + (0.99 / 20) = 1 / 0.01 + (0.99 / 20) = 16.807 The expected speedup on 20 processors is 16.807

Gaussian Elimination - Row reduction Algorithm

 Gaussian elimination is a method for solving matrix equations of the form, Ax=b.  This method is also known as the row reduction algorithm. Back  Substitution Solving the last equation for the variable and then work backward into the first equation to solve it.  The fundamental idea is to add multiples of one equation to the others in order to eliminate a variable and to continue this process until only one variable is left. Pivot row The row that is used to perform elimination of a variable from other rows is called the pivot row. Example: Solving a linear equation The augmented matrix for the above equation shall be The equation shall be solved using back substitution. The eliminating the first variable (x1) in the first row (Pivot row) by carrying out the row operation. As the second row become zero, the row will be shifted to bottom by carrying out partial pivoting. Now, the second variable (x2)  shall be eliminated by carrying out the row operation again. ...