UNIVERSITI TEKNOLOGI MARA

CAWANGAN PAHANG
KAMPUS RAUB
27600 RAUB

FACULTY OF COMPUTER AND MATHEMATICAL SCIENCES

Fakulti Sains Komputer dan Matematik

FUNDAMENTALS OF DATA
STRUCTURES
(CSC248)

ASSIGNMENT 1
(Array List, Linked List, Node, Concrete Class Definition and
Application)

Prepared By : ZULFAREEZ FIRDAUS BIN AZMI (2016326527)

CS110 4A
Diploma in Computer Science
Faculty of Computer and Mathematical Sciences

Prepared For: Roslan Bin Sadjirin

Room: S6.L42

Deadline: 12th October 2018: 17:00

 Page 2 of 10

ASSIGNMENT 1
(ARRAY LIST, LINKED LIST, NODE, CONCRETE CLASS DEFINITION
AND APPLICATION)
CSC248: FUNDAMENTALS OF DATA STRUCTURES

public class Number {

int _number;
String _type;
public Number(int _number, String _type) {
this._number = _number;
this._type = _type;
}
public int get_number() {
return _number;
}
public void set_number(int _number) {
this._number = _number;
}
public String get_type() {
return _type;
}
public void set_type(String _type) {
this._type = _type;
}
public String toString () {
return this._number + " " + this._type;
}
}
 Page 3 of 10

import java.util.Random;
import java.util.*;

public class MainApp {

public static void main(String[] args) {

Number numberMain;
ArrayList <Number>oddArList = new ArrayList<Number>();
ArrayList<Number> evenArList = new ArrayList<Number>();
LinkedList <Number> primeLnList = new LinkedList<Number>();

Random rand = new Random();

boolean prime = false;

int i = 0;
//enter 100 random number
while (i < 100) {
//rng
int ranNum = rand.nextInt(10000) + 1;

//prime num check

int ranCheck = 2;
while (ranCheck < ranNum) {
if (ranNum % ranCheck == 0) {
prime = false;
break;
} else {
prime = true;
}
ranCheck++;
}
 Page 4 of 10

if (prime == true) {
numberMain = new Number(ranNum, "Prime");
primeLnList.addLast(numberMain);
}
if (ranNum % 2 == 0) {
numberMain = new Number(ranNum, "Even");
evenArList.add(numberMain);
} else {
numberMain = new Number(ranNum, "Odd");
oddArList.add(numberMain);
}
i++;

displayEvenNumber(evenArList);
displayOddNumber(oddArList);
displayPrimeNumber(primeLnList);
displayCommonNumber(primeLnList,oddArList,evenArList);
}

public static void displayOddNumber (ArrayList<Number> oddArrList)

{
System.out.println("Odd Number:");
for(int i = 0; i < oddArrList.size();i++) {
System.out.println(oddArrList.get(i).toString());
}
}

public static void displayEvenNumber (ArrayList<Number> evenArrList)

{
 Page 5 of 10

System.out.println("Even Number:");
for(int i = 0; i < evenArrList.size();i++)
{
System.out.println(evenArrList.get(i).toString());
}
}

public static void displayPrimeNumber (LinkedList<Number> primeLnList)

{
System.out.println("Prime Number:");
Number p = primeLnList.getFirst();
while (p != null) {
System.out.println(p.toString());
p=primeLnList.getNext();
}

public static void displayCommonNumber (LinkedList<Number> primeLnList1,

ArrayList<Number> oddArList1,ArrayList<Number> evenArrList1)
{

System.out.println("Common Numbers between Prime And Even Number : ");

Number p = primeLnList1.getFirst();
while (p != null) {
for (int i=0;i<evenArrList1.size();i++) {
Number e = evenArrList1.get(i);
if(p.get_number() == e.get_number())
{
System.out.println("\t" +p.toString()+ " == " + e.toString());
 Page 6 of 10

}
}
p=primeLnList1.getNext();

System.out.println("Common Numbers between Prime And Odd Number : ");

p = primeLnList1.getFirst();
while (p != null) {
for (int i=0;i<oddArList1.size();i++) {
Number o = oddArList1.get(i);

if(p.get_number() == o.get_number())
{
System.out.println("\t" + p.toString()+ " == " + o.toString());

}
}
p=primeLnList1.getNext();
}

}
}
Page 7 of 10
Page 8 of 10
Page 9 of 10
 Page 10 of 10

ASSIGNMENT 1 (ARRAY LIST, LINKED LIST, NODE, CONCRETE

CLASS DEFINITION AND APPLICATION)
CSC248: FUNDAMENTALS OF DATA STRUCTURES

Scoring Rubric
20
Name (Student ID) : __________________________________________________________
Group : __________________________________________________________

Marking Scheme

Remarks
Category
Weak Moderate Good Very Good
Definition of 1 2 3 4
concrete and Concrete and application classes are correctly/sufficiently
application classes defined (including instantiation of object)
1 2 3 4
Clarity of code’s
The source code is clearly written as well as easy to understand.
presentation
Each of the processes is documented.
1 2 3 4
Structure and
algorithm of a The algorithm of the program is capable in solving the problem
program completely. There is no syntax error, logic error and run-time
error.
Object-oriented 1 2 3 4
programming and data Apply a clearly Object-Oriented Programming and data structures
structures concept concepts within the algorithm of the program.
1 2 3 4
Result The program produces expected output with correct and
presentable format.