Overview of Java

1. IntroductionIntroduction
By
Nilesh Dalvi
Lecturer, Patkar-Varde College.Lecturer, Patkar-Varde College.
http://www.slideshare.net/nileshdalvi01
Java and Data StructuresJava and Data Structures

2. Introduction
• Java is a object-oriented programming
language.
• Related to C++, which is an offspring of
C-Language.
• Much of the characteristics of Java
inherited from C-Language & C++.
Nilesh Dalvi, Lecturer@Patkar-Varde College, Goregaon(W).
C-Language C++
Java
Syntax Oops features

3. History of Java
• General purpose object-oriented language
developed by sun microsystems in 1991.
• It is initially called ‘oak’, was
renamed as ‘Java’ in 1995.
• Originally designed to develop software
for consumers electronic devices like
toasters, TVs, etc.
• First language that is not tied to any
particular H/W or OS
• Java is platform-neutral language.
Nilesh Dalvi, Lecturer@Patkar-Varde College, Goregaon(W).

4. A first simple program
Nilesh Dalvi, Lecturer@Patkar-Varde College, Goregaon(W).
/*
This is simple Java Program
Call this file "Example.Java".
*/
public class Example
{
//Your proram begins with a call to main().
public static void main(String args [])
{
System.out.println("Hello World!");
}
}

5. History of Java
• General purpose object-oriented language
developed by sun microsystems in 1991.
• It is initially called ‘oak’, was
renamed as ‘Java’ in 1995.
• Originally designed to develop software
for consumers electronic devices like
toasters, TVs, etc.
• First language that is not tied to any
particular H/W or OS
• Java is platform-neutral language.
Nilesh Dalvi, Lecturer@Patkar-Varde College, Goregaon(W).

6. Running Java Programs
• Compiling..
D:>javac Example.java
• Running..
D:>java Example
Nilesh Dalvi, Lecturer@Patkar-Varde College, Goregaon(W).

7. Syllabus
Unit – I: Core Java
– Features of Java
– JVM
– Data Types
– Variables
– Arrays
– Operators
– Control Statements
– type-casting
– Classes
– Objects and
Methods
– Constructor,
– method overriding,
– finalize methods.
Nilesh Dalvi, Lecturer@Patkar-Varde College, Goregaon(W).

8. Syllabus
Unit – II: Derived Concepts
– Inheritance
– Packages and Interfaces
– Exception Handling
– String handling
– Multithreaded Programming
Nilesh Dalvi, Lecturer@Patkar-Varde College, Goregaon(W).

9. Syllabus
Unit – III: Java I/O
– Creating File
– Creating Directories
– Creating Directories
– Stream Classes
• Byte Streams
– InputStream
– OutputStream
– FileInputStream
– FileOutputStream
– ByteArrayInputStream
– ByteArrayOutputStream
– Filtered Byte Streams
– Buffered Byte Streams
– SequenceInputStream
– PrintStream
– RandomAccessFile
Nilesh Dalvi, Lecturer@Patkar-Varde College, Goregaon(W).

10. Syllabus
Unit – III: Java I/O
– Creating File
– Creating Directories
– Creating Directories
– Stream Classes
Character Streams
– Reader
– Writer
– FileReader
– FileWriter
– CharArrayReader
– CharArrayWriter
– BufferedReader
– BufferedWriter
– PushbackReader
– PrintWriter
Nilesh Dalvi, Lecturer@Patkar-Varde College, Goregaon(W).

11. Data Structures
• Data may be organized in many
different way.
• A Data Structure is an arrangement
of data in a computer memory or on
disk a disk.
• Logical or mathematical model of a
particular organization of data is
called data structures.
Nilesh Dalvi, Lecturer@Patkar-Varde College, Goregaon(W).

12. Syllabus
Unit – IV: Data Structures
Complexity and analysis of algorithms
– algorithm
– time and space complexity
– asymptotic notations
Types of data structures
– Arrays
• Properties of Arrays
• Duplicating an Array
• sequential search algorithm
• binary search algorithm
Nilesh Dalvi, Lecturer@Patkar-Varde College, Goregaon(W).

13. Syllabus
Unit – IV: Data Structures
Stacks-
• Stack Operations,
• indexed Implementation,
• Linked Implementation, ,
• Applications - recursion,
Queue -
• Queue Operations,
• indexed Implementation,
• Applications,
Nilesh Dalvi, Lecturer@Patkar-Varde College, Goregaon(W).

14. Syllabus
Unit – V: Data Structure
– Linked Lists –
• representation
• traversing
• searching
• insertion
• deletion
– Hash table –
• hashing functions
• collision-resolution
techniques
– Trees-
• Binary Trees
• traversing binary
tree
• traversing
algorithm using
stacks
• binary search trees
( insertion and
deletion)
• AVL trees
• B trees
Nilesh Dalvi, Lecturer@Patkar-Varde College, Goregaon(W).

15. Syllabus
Unit – VI: Data Structure
– Heaps –
• insertion and deletion
– Sorting –
• selection
• bubble
• merge
• tree
• radix
• insertion
– Graphs –
• graph theory,
• sequential
representation,
• adjacency matrix,
• path matrix,
• Warshall’s algorithm,
Nilesh Dalvi, Lecturer@Patkar-Varde College, Goregaon(W).

16. Practical's
• Should contain at least 10
practical's.
• Covering all syllabus.
Nilesh Dalvi, Lecturer@Patkar-Varde College, Goregaon(W).

17. Obtaining Required Tools
notepad ++ or Edit Plus
JDK 7
Nilesh Dalvi, Lecturer@Patkar-Varde College, Goregaon(W).

18. Java Development Kit (JDK)Java Development Kit (JDK)

19. Course Texts
• Core Java for Beginners, Sharanam Shah
and V Shah, The X Team SPD.
• Java 2 Complete Reference, 5th Edition ,
Osborne , Tata-McGrawhill.
• Data Structures,S Lipschutz, Tata-
McGrawhill.
• Data Structures with Java, 2nd edition,
J Hubbard, Tata-McGrawhill.
Nilesh Dalvi, Lecturer@Patkar-Varde College, Goregaon(W).

20. Q & A