We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>

www.vustudents.ning.com

 www.bit.ly/vucodes + Link For Assignments, GDBs & Online Quizzes Solution www.bit.ly/papersvu + Link For Past Papers, Solved MCQs, Short Notes & More

Dear Students! Share your Assignments / GDBs / Quizzes files as you receive in your LMS, So it can be discussed/solved timely. Add Discussion

# cs 508 Assignment

+ How to Join Subject Study Groups & Get Helping Material?

+ How to become Top Reputation, Angels, Intellectual, Featured Members & Moderators?

+ VU Students Reserves The Right to Delete Your Profile, If?

Views: 4452

.

+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)

+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)

Attachments:

### Replies to This Discussion

cs508 assignmnt solution 2017 -

import java.util.Random;
import java.util.Scanner;
public class Assignment {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
Random random = new Random();
System.out.print("Enter the size (rows and columns) of array:");
int n = sc.nextInt();
System.out.println();
//Assign Random Number To Array
int[][] array = new int[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
array[i][j] = random.nextInt(90) + 10;
}
}
//Traversing The Array
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
System.out.print(array[i][j] + " ");
//Check If Prime Number Found
if (isPrime(array[i][j])) {
}
}
System.out.println();
}
System.out.println("Total Prime Numbers Found:" + primeNumber);
}
public static boolean isPrime(int number) {
boolean flag = true;
for (int i = 2; i < number / 2; i++) {
int tmp = number % i;
if (tmp == 0) {
flag = false;
break;
}
}
return flag;
}
}

import java.utill.Random;
import java.utill.Scanner;

public class Assignment
{
public static void main(String[] args) {
Scanner src = new Scanner (System.in);
Random random = new Random();
System.out.print("Enter the size of arrays: ");
int n = sc.nextInt();

system.out.println();

int [][] array = =new int [n][n];

for (int i=0; i<n; i++) {
for (int j=0; j<n; j++) {
array [i][j] = random.nextIn (bound 90)+10;
}
}
for (int i=0; i<n; i++) {
for (int j=0; j<n; j++) {
system.out.print (array [i][j]+" ");
if (isPrime(array[i][j])){
}
}
system.out.println();
}
}
public static boolean isPrime (int number) {
boolean flag = true;

for (int i=2; i<number/2 i++) {
int tmp = number%i;

if (tmp == 0) {
flag = false;
break;
}
}
return flag;

import java.utill.Random;
import java.utill.Scanner;
public class Assignment
{
public static void main(String[] args) {
Scanner src = new Scanner (System.in);
Random random = new Random();
System.out.print("Enter the size of arrays: ");
int n = sc.nextInt();
system.out.println();
int [][] array = =new int [n][n];
for (int i=0; i<n; i++) {
for (int j=0; j<n; j++) {
array [i][j] = random.nextIn (bound 90)+10;
}
}
for (int i=0; i<n; i++) {
for (int j=0; j<n; j++) {
system.out.print (array [i][j]+" ");
if (isPrime(array[i][j])){
}
}
system.out.println();
}
}
public static boolean isPrime (int number) {
boolean flag = true;
for (int i=2; i<number/2 i++) {
int tmp = number%i;
if (tmp == 0) {
flag = false;
break;
}
}
return flag;

Code notepad mai .java mai save krky upload krna hy LMS py.

## Latest Activity

19 minutes ago
+! ! ! Ελισάβετ ! ! ! updated their profile
31 minutes ago
38 minutes ago
39 minutes ago
+Аүмаи+ liked Mani Siddiqui BS VIII's discussion Happy BirthDay Dear Tariq Bhai
42 minutes ago
42 minutes ago
47 minutes ago
47 minutes ago
47 minutes ago
+ ! ! ❥ FATIMA ! ! + liked +! ! ! Mano ! ! !+'s discussion issy kehty hn help
47 minutes ago
47 minutes ago
48 minutes ago

1

2

3