SlideShare a Scribd company logo
Dr. S.SHAIK PARVEEN
Department of Computer Science
CLASS DETAILS
 Academic Year 2021-2022
 I M.Sc.(CS)
 II Semester
 Batch 2020-2022
 Course Coordinator: Dr. S.SHAIK PARVEEN
 Course Name: Advanced Java
Programming
 Course Code : 20PCSC21
 Semester : II Part III : Core
COURSE INFORMATION
COURSE PREREQUISITES
 basic understanding of the Java language
 a basic understanding of software
development
 a basic understanding of the software
development life cycle
4
Course Co-requisites
 Good understanding of programming and
OOPs concepts.
COURSE OBJECTIVES:
 To learn how to use Core Java Technologies.
 To implement OOP Concept.
 To get knowledge in Classes, Fundamentals,
Methods, Constructors and Garbage
 To analyze the current Thread and Synchronization
 To cover Applet, AWT Controls, Swing and Java
Beans.
UNIT I
JAVA - GENERAL
 Java is:
 platform independent programming language
 similar to C++ in syntax
 similar to Smalltalk in mental paradigm
 Pros: also ubiquitous to net
 Cons: interpreted, and still under development
(moving target)
JAVA - GENERAL
 Java has some interesting features:
 automatic type checking,
 automatic garbage collection,
 simplifies pointers; no directly accessible pointer to
memory,
 simplified network access,
 multi-threading!
Compile-time Environment
Compile-time Environment
Java
Bytecodes
move locally
or through
network
Java
Source
(.java)
Java
Compiler
Java
Bytecode
(.class )
Java
Interpreter
Just in
Time
Compiler
Runtime System
Class
Loader
Bytecode
Verifier
Java
Class
Libraries
Operating System
Hardware
Java
Virtual
machine
HOW IT WORKS…!
HOW IT WORKS…!
 Java is independent only for one reason:
 Only depends on the Java Virtual Machine
(JVM),
 code is compiled to bytecode, which is
interpreted by the resident JVM,
 JIT (just in time) compilers attempt to
increase speed.
JAVA - SECURITY
 Pointer denial - reduces chances of virulent
programs corrupting host,
 Applets even more restricted -
 May not
 run local executables,
 Read or write to local file system,
 Communicate with any server other than the originating server.
OBJECT-ORIENTED
 Java supports OOD
 Polymorphism
 Inheritance
 Encapsulation
 Java programs contain nothing but definitions and
instantiations of classes
 Everything is encapsulated in a class!
JAVA ADVANTAGES
 Portable - Write Once, Run Anywhere
 Security has been well thought through
 Robust memory management
 Designed for network programming
 Multi-threaded (multiple simultaneous tasks)
 Dynamic & extensible (loads of libraries)
 Classes stored in separate files
 Loaded only when needed
BASIC JAVA SYNTAX
PRIMITIVE TYPES AND VARIABLES
 boolean, char, byte, short, int, long, float, double etc.
 These basic (or primitive) types are the only types
that are not objects (due to performance issues).
 This means that you don’t use the new operator to
create a primitive variable.
 Declaring primitive variables:
float initVal;
int retVal, index = 2;
double gamma = 1.2, brightness
boolean valueOk = false;
INITIALISATION
 If no value is assigned prior to use, then the
compiler will give an error
 Java sets primitive variables to zero or false
in the case of a boolean variable
 All object references are initially set to null
 An array of anything is an object
 Set to null on declaration
 Elements to zero false or null on creation
DECLARATIONS
int index = 1.2; // compiler error
boolean retOk = 1; // compiler error
double fiveFourths = 5 / 4; // no error!
float ratio = 5.8f; // correct
double fiveFourths = 5.0 / 4.0; // correct
 1.2f is a float value accurate to 7 decimal places.
 1.2 is a double value accurate to 15 decimal places.
ASSIGNMENT
 All Java assignments are right associative
int a = 1, b = 2, c = 5
a = b = c
System.out.print(
“a= “ + a + “b= “ + b + “c= “ + c)
 What is the value of a, b & c
 Done right to left: a = (b = c);
CASTING
 Casting is the temporary conversion of a variable from its
original data type to some other data type.
 Like being cast for a part in a play or movie
 With primitive data types if a cast is necessary from a less
inclusive data type to a more inclusive data type it is done
automatically.
int x = 5;
double a = 3.5;
double b = a * x + a / x;
double c = x / 2;
 if a cast is necessary from a more inclusive to a less
inclusive data type the class must be done explicitly by the
programmer
 failure to do so results in a compile error.
double a = 3.5, b = 2.7;
int y = (int) a / (int) b;
y = (int)( a / b );
y = (int) a / b; //syntax error
PRIMITIVE CASTING
double
float
long
int
short,
char
byte
Outer ring is most
inclusive data type.
Inner ring is least
inclusive.
In expressions
variables and
sub expressions
of less inclusive
data types are
automatically cast
to more inclusive.
If trying to place
expression that is
more inclusive into
variable that is less
inclusive, explicit cast
must be performed.
From MORE to LESS
BASIC MATHEMATICAL OPERATORS
 * / % + - are the mathematical operators
 * / % have a higher precedence than + or -
double myVal = a + b % d – c * d / b;
 Is the same as:
double myVal = (a + (b % d)) –
((c * d) / b);
STATEMENTS & BLOCKS
 A simple statement is a command terminated by
a semi-colon:
name = “Fred”;
 A block is a compound statement enclosed in
curly brackets:
{
name1 = “Fred”; name2 = “Bill”;
}
 Blocks may contain other blocks
FLOW OF CONTROL
 Java executes one statement after the other
in the order they are written
 Many Java statements are flow control
statements:
Alternation: if, if else, switch
Looping: for, while, do while
Escapes: break, continue, return
IF – THE CONDITIONAL STATEMENT
 The if statement evaluates an expression and if that
evaluation is true then the specified action is taken
if ( x < 10 ) x = 10;
 If the value of x is less than 10, make x equal to 10
 It could have been written:
if ( x < 10 )
x = 10;
 Or, alternatively:
if ( x < 10 ) { x = 10; }
RELATIONAL OPERATORS
== Equal (careful)
!= Not equal
>= Greater than or equal
<= Less than or equal
> Greater than
< Less than
IF… ELSE
 The if … else statement evaluates an expression
and performs one action if that evaluation is true or
a different action if it is false.
if (x != oldx) {
System.out.print(“x was changed”);
}
else {
System.out.print(“x is unchanged”);
}
NESTED IF … ELSE
if ( myVal > 100 ) {
if ( remainderOn == true) {
myVal = mVal % 100;
}
else {
myVal = myVal / 100.0;
}
}
else
{
System.out.print(“myVal is in range”);
}
ELSE IF
 Useful for choosing between alternatives:
if ( n == 1 ) {
// execute code block #1
}
else if ( j == 2 ) {
// execute code block #2
}
else {
// if all previous tests have failed, execute
code block #3
}
A WARNING…
WRONG!
if( i == j )
if ( j == k )
System.out.print
(
“i equals
k”);
else
System.out.print(
“i is not equal
to j”);
CORRECT!
if( i == j ) {
if ( j == k )
System.out.print(
“i equals k”);
}
else
System.out.print(“
i is not equal to
j”); //
Correct!
THE SWITCH STATEMENT
switch ( n ) {
case 1:
// execute code block #1
break;
case 2:
// execute code block #2
break;
default:
// if all previous tests fail then
//execute code block #4
break;
}
THE FOR LOOP
 Loop n times
for ( i = 0; i < n; n++ ) {
// this code body will execute n times
// ifrom 0 to n-1
}
 Nested for:
for ( j = 0; j < 10; j++ ) {
for ( i = 0; i < 20; i++ ){
// this code body will execute 200 times
}
}
WHILE LOOPS
while(response == 1) {
System.out.print( “ID =” + userID[n]);
n++;
response = readInt( “Enter “);
}
What is the minimum number of times the loop
is executed?
What is the maximum number of times?
DO {… } WHILE LOOPS
do {
System.out.print( “ID =” + userID[n] );
n++;
response = readInt( “Enter ” );
}while (response == 1);
What is the minimum number of times the loop
is executed?
What is the maximum number of times?
BREAK
 A break statement causes an exit from the
innermost containing while, do, for or
switch statement.
for ( int i = 0; i < maxID, i++ ) {
if ( userID[i] == targetID ) {
index = i;
break;
}
} // program jumps here after break
CONTINUE
 Can only be used with while, do or for.
 The continue statement causes the innermost loop
to start the next iteration immediately
for ( int i = 0; i < maxID; i++ ) {
if ( userID[i] != -1 ) continue;
System.out.print( “UserID ” + i + “ :” +
userID);
}
ARRAYS
 Am array is a list of similar things
 An array has a fixed:
 name
 type
 length
 These must be declared when the array is created.
 Arrays sizes cannot be changed during the
execution of the code
myArray has room for 8 elements
 the elements are accessed by their index
 in Java, array indices start at 0
3 6 3 1 6 3 4 1
myArray =
0 1 2 3 4 5 6 7
DECLARING ARRAYS
int myArray[];
declares myArray to be an array of integers
myArray = new int[8];
sets up 8 integer-sized spaces in memory, labelled
myArray[0] to myArray[7]
int myArray[] = new int[8];
combines the two statements in one line
ASSIGNING VALUES
 refer to the array elements by index to store values
in them.
myArray[0] = 3;
myArray[1] = 6;
myArray[2] = 3; ...
 can create and initialise in one step:
int myArray[] = {3, 6, 3, 1, 6, 3, 4, 1};
ITERATING THROUGH ARRAYS
 for loops are useful when dealing with arrays:
for (int i = 0; i < myArray.length; i++) {
myArray[i] = getsomevalue();
}
ARRAYS OF OBJECTS
 So far we have looked at an array of primitive
types.
 integers
 could also use doubles, floats, characters…
 Often want to have an array of objects
 Students, Books, Loans ……
 Need to follow 3 steps.
DECLARING THE ARRAY
1. Declare the array
private Student studentList[];
 this declares studentList
2 .Create the array
studentList = new Student[10];
 this sets up 10 spaces in memory that can
hold references to Student objects
3. Create Student objects and add them to the
array: studentList[0] = new
Student("Cathy", "Computing");

More Related Content

PDF
Object Oriented Programming with JAVA
PDF
java notes.pdf
PPTX
Module 2 2022 scheme BCS403 database management system
PDF
Adv java unit 4 M.Sc CS.pdf
PPTX
Core java complete ppt(note)
PDF
Data Types, Variables, and Arrays in JAVA
PDF
Blockchain Technology And Cryptocurrency
PPTX
Industry 4.0
Object Oriented Programming with JAVA
java notes.pdf
Module 2 2022 scheme BCS403 database management system
Adv java unit 4 M.Sc CS.pdf
Core java complete ppt(note)
Data Types, Variables, and Arrays in JAVA
Blockchain Technology And Cryptocurrency
Industry 4.0

What's hot (20)

PPT
Servlet life cycle
PPTX
Advance Java Topics (J2EE)
PPTX
Introduction to Object Oriented Programming
PPTX
OOP Introduction with java programming language
PDF
JavaScript - Chapter 12 - Document Object Model
PPSX
JDBC: java DataBase connectivity
PPTX
Overview of UML Diagrams
PPTX
Single pass assembler
PPTX
enterprise java bean
PPT
Looping statements in Java
PDF
Identifying classes and objects ooad
PPTX
Java package
PDF
Servlet and servlet life cycle
PPTX
Java Beans
PPS
Java rmi
PPTX
Java Server Pages(jsp)
PPTX
Java abstract class & abstract methods
PPTX
Method overloading
PPT
Hierarchical Object Oriented Design
PPTX
oops concept in java | object oriented programming in java
Servlet life cycle
Advance Java Topics (J2EE)
Introduction to Object Oriented Programming
OOP Introduction with java programming language
JavaScript - Chapter 12 - Document Object Model
JDBC: java DataBase connectivity
Overview of UML Diagrams
Single pass assembler
enterprise java bean
Looping statements in Java
Identifying classes and objects ooad
Java package
Servlet and servlet life cycle
Java Beans
Java rmi
Java Server Pages(jsp)
Java abstract class & abstract methods
Method overloading
Hierarchical Object Oriented Design
oops concept in java | object oriented programming in java
Ad

Similar to Unit I Advanced Java Programming Course (20)

PPT
Java tutorial PPT
PPT
Java tutorial PPT
PPT
Java Tutorial | My Heart
PPT
Java_Tutorial_Introduction_to_Core_java.ppt
PPT
Java Tutorial
PPT
Javatut1
PPT
Java tut1 Coderdojo Cahersiveen
PPT
Java tut1
PPT
Java tut1
ODP
Synapseindia reviews.odp.
PPT
Java teaching ppt for the freshers in colleeg.ppt
PPT
Java Tut1
PPT
Java Tutorial
PPT
Java tut1
PPT
Tutorial java
PPT
Java basic tutorial by sanjeevini india
PPT
Java basic tutorial by sanjeevini india
PPT
Java if and else
PPTX
Knowledge of Javascript
Java tutorial PPT
Java tutorial PPT
Java Tutorial | My Heart
Java_Tutorial_Introduction_to_Core_java.ppt
Java Tutorial
Javatut1
Java tut1 Coderdojo Cahersiveen
Java tut1
Java tut1
Synapseindia reviews.odp.
Java teaching ppt for the freshers in colleeg.ppt
Java Tut1
Java Tutorial
Java tut1
Tutorial java
Java basic tutorial by sanjeevini india
Java basic tutorial by sanjeevini india
Java if and else
Knowledge of Javascript
Ad

More from parveen837153 (7)

PPT
Advanced Excel
PPTX
Cyber Security
PPTX
Cyber Security
PPT
Introduction to CSS in HTML.ppt
PPTX
Object Oriented Programming using C++.pptx
DOCX
IOT-Monograph .docx
PPT
Internet of things Unit I
Advanced Excel
Cyber Security
Cyber Security
Introduction to CSS in HTML.ppt
Object Oriented Programming using C++.pptx
IOT-Monograph .docx
Internet of things Unit I

Recently uploaded (20)

PPTX
Cell Types and Its function , kingdom of life
PPTX
BOWEL ELIMINATION FACTORS AFFECTING AND TYPES
PDF
Insiders guide to clinical Medicine.pdf
PDF
grade 11-chemistry_fetena_net_5883.pdf teacher guide for all student
PPTX
human mycosis Human fungal infections are called human mycosis..pptx
PDF
VCE English Exam - Section C Student Revision Booklet
PPTX
Institutional Correction lecture only . . .
PDF
TR - Agricultural Crops Production NC III.pdf
PPTX
PPT- ENG7_QUARTER1_LESSON1_WEEK1. IMAGERY -DESCRIPTIONS pptx.pptx
PPTX
Final Presentation General Medicine 03-08-2024.pptx
PPTX
Cell Structure & Organelles in detailed.
PDF
BÀI TẬP BỔ TRỢ 4 KỸ NĂNG TIẾNG ANH 9 GLOBAL SUCCESS - CẢ NĂM - BÁM SÁT FORM Đ...
PDF
Origin of periodic table-Mendeleev’s Periodic-Modern Periodic table
PDF
Supply Chain Operations Speaking Notes -ICLT Program
PDF
Classroom Observation Tools for Teachers
PDF
Microbial disease of the cardiovascular and lymphatic systems
PDF
Module 4: Burden of Disease Tutorial Slides S2 2025
PPTX
Renaissance Architecture: A Journey from Faith to Humanism
PDF
Mark Klimek Lecture Notes_240423 revision books _173037.pdf
PDF
2.FourierTransform-ShortQuestionswithAnswers.pdf
Cell Types and Its function , kingdom of life
BOWEL ELIMINATION FACTORS AFFECTING AND TYPES
Insiders guide to clinical Medicine.pdf
grade 11-chemistry_fetena_net_5883.pdf teacher guide for all student
human mycosis Human fungal infections are called human mycosis..pptx
VCE English Exam - Section C Student Revision Booklet
Institutional Correction lecture only . . .
TR - Agricultural Crops Production NC III.pdf
PPT- ENG7_QUARTER1_LESSON1_WEEK1. IMAGERY -DESCRIPTIONS pptx.pptx
Final Presentation General Medicine 03-08-2024.pptx
Cell Structure & Organelles in detailed.
BÀI TẬP BỔ TRỢ 4 KỸ NĂNG TIẾNG ANH 9 GLOBAL SUCCESS - CẢ NĂM - BÁM SÁT FORM Đ...
Origin of periodic table-Mendeleev’s Periodic-Modern Periodic table
Supply Chain Operations Speaking Notes -ICLT Program
Classroom Observation Tools for Teachers
Microbial disease of the cardiovascular and lymphatic systems
Module 4: Burden of Disease Tutorial Slides S2 2025
Renaissance Architecture: A Journey from Faith to Humanism
Mark Klimek Lecture Notes_240423 revision books _173037.pdf
2.FourierTransform-ShortQuestionswithAnswers.pdf

Unit I Advanced Java Programming Course

  • 1. Dr. S.SHAIK PARVEEN Department of Computer Science
  • 2. CLASS DETAILS  Academic Year 2021-2022  I M.Sc.(CS)  II Semester  Batch 2020-2022  Course Coordinator: Dr. S.SHAIK PARVEEN
  • 3.  Course Name: Advanced Java Programming  Course Code : 20PCSC21  Semester : II Part III : Core COURSE INFORMATION
  • 4. COURSE PREREQUISITES  basic understanding of the Java language  a basic understanding of software development  a basic understanding of the software development life cycle 4 Course Co-requisites  Good understanding of programming and OOPs concepts.
  • 5. COURSE OBJECTIVES:  To learn how to use Core Java Technologies.  To implement OOP Concept.  To get knowledge in Classes, Fundamentals, Methods, Constructors and Garbage  To analyze the current Thread and Synchronization  To cover Applet, AWT Controls, Swing and Java Beans.
  • 6. UNIT I JAVA - GENERAL  Java is:  platform independent programming language  similar to C++ in syntax  similar to Smalltalk in mental paradigm  Pros: also ubiquitous to net  Cons: interpreted, and still under development (moving target)
  • 7. JAVA - GENERAL  Java has some interesting features:  automatic type checking,  automatic garbage collection,  simplifies pointers; no directly accessible pointer to memory,  simplified network access,  multi-threading!
  • 8. Compile-time Environment Compile-time Environment Java Bytecodes move locally or through network Java Source (.java) Java Compiler Java Bytecode (.class ) Java Interpreter Just in Time Compiler Runtime System Class Loader Bytecode Verifier Java Class Libraries Operating System Hardware Java Virtual machine HOW IT WORKS…!
  • 9. HOW IT WORKS…!  Java is independent only for one reason:  Only depends on the Java Virtual Machine (JVM),  code is compiled to bytecode, which is interpreted by the resident JVM,  JIT (just in time) compilers attempt to increase speed.
  • 10. JAVA - SECURITY  Pointer denial - reduces chances of virulent programs corrupting host,  Applets even more restricted -  May not  run local executables,  Read or write to local file system,  Communicate with any server other than the originating server.
  • 11. OBJECT-ORIENTED  Java supports OOD  Polymorphism  Inheritance  Encapsulation  Java programs contain nothing but definitions and instantiations of classes  Everything is encapsulated in a class!
  • 12. JAVA ADVANTAGES  Portable - Write Once, Run Anywhere  Security has been well thought through  Robust memory management  Designed for network programming  Multi-threaded (multiple simultaneous tasks)  Dynamic & extensible (loads of libraries)  Classes stored in separate files  Loaded only when needed
  • 14. PRIMITIVE TYPES AND VARIABLES  boolean, char, byte, short, int, long, float, double etc.  These basic (or primitive) types are the only types that are not objects (due to performance issues).  This means that you don’t use the new operator to create a primitive variable.  Declaring primitive variables: float initVal; int retVal, index = 2; double gamma = 1.2, brightness boolean valueOk = false;
  • 15. INITIALISATION  If no value is assigned prior to use, then the compiler will give an error  Java sets primitive variables to zero or false in the case of a boolean variable  All object references are initially set to null  An array of anything is an object  Set to null on declaration  Elements to zero false or null on creation
  • 16. DECLARATIONS int index = 1.2; // compiler error boolean retOk = 1; // compiler error double fiveFourths = 5 / 4; // no error! float ratio = 5.8f; // correct double fiveFourths = 5.0 / 4.0; // correct  1.2f is a float value accurate to 7 decimal places.  1.2 is a double value accurate to 15 decimal places.
  • 17. ASSIGNMENT  All Java assignments are right associative int a = 1, b = 2, c = 5 a = b = c System.out.print( “a= “ + a + “b= “ + b + “c= “ + c)  What is the value of a, b & c  Done right to left: a = (b = c);
  • 18. CASTING  Casting is the temporary conversion of a variable from its original data type to some other data type.  Like being cast for a part in a play or movie  With primitive data types if a cast is necessary from a less inclusive data type to a more inclusive data type it is done automatically. int x = 5; double a = 3.5; double b = a * x + a / x; double c = x / 2;  if a cast is necessary from a more inclusive to a less inclusive data type the class must be done explicitly by the programmer  failure to do so results in a compile error. double a = 3.5, b = 2.7; int y = (int) a / (int) b; y = (int)( a / b ); y = (int) a / b; //syntax error
  • 19. PRIMITIVE CASTING double float long int short, char byte Outer ring is most inclusive data type. Inner ring is least inclusive. In expressions variables and sub expressions of less inclusive data types are automatically cast to more inclusive. If trying to place expression that is more inclusive into variable that is less inclusive, explicit cast must be performed. From MORE to LESS
  • 20. BASIC MATHEMATICAL OPERATORS  * / % + - are the mathematical operators  * / % have a higher precedence than + or - double myVal = a + b % d – c * d / b;  Is the same as: double myVal = (a + (b % d)) – ((c * d) / b);
  • 21. STATEMENTS & BLOCKS  A simple statement is a command terminated by a semi-colon: name = “Fred”;  A block is a compound statement enclosed in curly brackets: { name1 = “Fred”; name2 = “Bill”; }  Blocks may contain other blocks
  • 22. FLOW OF CONTROL  Java executes one statement after the other in the order they are written  Many Java statements are flow control statements: Alternation: if, if else, switch Looping: for, while, do while Escapes: break, continue, return
  • 23. IF – THE CONDITIONAL STATEMENT  The if statement evaluates an expression and if that evaluation is true then the specified action is taken if ( x < 10 ) x = 10;  If the value of x is less than 10, make x equal to 10  It could have been written: if ( x < 10 ) x = 10;  Or, alternatively: if ( x < 10 ) { x = 10; }
  • 24. RELATIONAL OPERATORS == Equal (careful) != Not equal >= Greater than or equal <= Less than or equal > Greater than < Less than
  • 25. IF… ELSE  The if … else statement evaluates an expression and performs one action if that evaluation is true or a different action if it is false. if (x != oldx) { System.out.print(“x was changed”); } else { System.out.print(“x is unchanged”); }
  • 26. NESTED IF … ELSE if ( myVal > 100 ) { if ( remainderOn == true) { myVal = mVal % 100; } else { myVal = myVal / 100.0; } } else { System.out.print(“myVal is in range”); }
  • 27. ELSE IF  Useful for choosing between alternatives: if ( n == 1 ) { // execute code block #1 } else if ( j == 2 ) { // execute code block #2 } else { // if all previous tests have failed, execute code block #3 }
  • 28. A WARNING… WRONG! if( i == j ) if ( j == k ) System.out.print ( “i equals k”); else System.out.print( “i is not equal to j”); CORRECT! if( i == j ) { if ( j == k ) System.out.print( “i equals k”); } else System.out.print(“ i is not equal to j”); // Correct!
  • 29. THE SWITCH STATEMENT switch ( n ) { case 1: // execute code block #1 break; case 2: // execute code block #2 break; default: // if all previous tests fail then //execute code block #4 break; }
  • 30. THE FOR LOOP  Loop n times for ( i = 0; i < n; n++ ) { // this code body will execute n times // ifrom 0 to n-1 }  Nested for: for ( j = 0; j < 10; j++ ) { for ( i = 0; i < 20; i++ ){ // this code body will execute 200 times } }
  • 31. WHILE LOOPS while(response == 1) { System.out.print( “ID =” + userID[n]); n++; response = readInt( “Enter “); } What is the minimum number of times the loop is executed? What is the maximum number of times?
  • 32. DO {… } WHILE LOOPS do { System.out.print( “ID =” + userID[n] ); n++; response = readInt( “Enter ” ); }while (response == 1); What is the minimum number of times the loop is executed? What is the maximum number of times?
  • 33. BREAK  A break statement causes an exit from the innermost containing while, do, for or switch statement. for ( int i = 0; i < maxID, i++ ) { if ( userID[i] == targetID ) { index = i; break; } } // program jumps here after break
  • 34. CONTINUE  Can only be used with while, do or for.  The continue statement causes the innermost loop to start the next iteration immediately for ( int i = 0; i < maxID; i++ ) { if ( userID[i] != -1 ) continue; System.out.print( “UserID ” + i + “ :” + userID); }
  • 35. ARRAYS  Am array is a list of similar things  An array has a fixed:  name  type  length  These must be declared when the array is created.  Arrays sizes cannot be changed during the execution of the code
  • 36. myArray has room for 8 elements  the elements are accessed by their index  in Java, array indices start at 0 3 6 3 1 6 3 4 1 myArray = 0 1 2 3 4 5 6 7
  • 37. DECLARING ARRAYS int myArray[]; declares myArray to be an array of integers myArray = new int[8]; sets up 8 integer-sized spaces in memory, labelled myArray[0] to myArray[7] int myArray[] = new int[8]; combines the two statements in one line
  • 38. ASSIGNING VALUES  refer to the array elements by index to store values in them. myArray[0] = 3; myArray[1] = 6; myArray[2] = 3; ...  can create and initialise in one step: int myArray[] = {3, 6, 3, 1, 6, 3, 4, 1};
  • 39. ITERATING THROUGH ARRAYS  for loops are useful when dealing with arrays: for (int i = 0; i < myArray.length; i++) { myArray[i] = getsomevalue(); }
  • 40. ARRAYS OF OBJECTS  So far we have looked at an array of primitive types.  integers  could also use doubles, floats, characters…  Often want to have an array of objects  Students, Books, Loans ……  Need to follow 3 steps.
  • 41. DECLARING THE ARRAY 1. Declare the array private Student studentList[];  this declares studentList 2 .Create the array studentList = new Student[10];  this sets up 10 spaces in memory that can hold references to Student objects 3. Create Student objects and add them to the array: studentList[0] = new Student("Cathy", "Computing");