Topics
Revision of Class IX Syllabus
Introduction to Object Oriented Programming Concepts
- Introduction of Object-oriented Programming
- Procedure Oriented Language
- Object Oriented Language
- Principles of Object Oriented Programming (OOP)
Elementary Concept of Objects and Classes
- Introduction of Elementary Concept of Objects and Classes
- Creating an Object of a Class
- Real World Vs Software Class and Objects
- Features of a Class
Values and Data Types
- Introduction of Values and Data Types
- Character Sets in Java
- Encoding of Characters
- Escape Sequences
- Tokens
- Data Types
- Type Conversion
Operators in Java
- Introduction of Operators in Java
- Expression and Statement
- Types of Operators
Introduction to Java
- Introduction to Java
- Java Compiler and Interpreter
- Basic Elements of Java Programming
- Output Statement in Java Programming
- Java Programming using BlueJ
- Java Program on BlueJ Platform
Input in Java
- Introduction of Input in Java
- Using Function Argument
- Using Stream Class
- Using Scanner Class
- Using Command Line Argument
- Types of Errors
- Comment Statements in Java Programming
Mathematical Library Methods
- Introduction of Mathematical Library Methods
- Methods of Math Class
- Trigonometrical Functions
Conditional Statements in Java
- Introduction of Conditional Statements in Java
- Flow of Control
- Normal Flow of Control
- Conditional Flow of Control
Iterative Constructs in Java
- Introduction of Iterative Constructs in Java
- Entry Controlled Loop
- Exit Controlled Loop
Nested Loop
- Introduction of Nested Loop
- Types of Nested Loops
Library Classes
Arrays (Single Dimensional and Double Dimensional)
String Handling
User - Defined Method
Class as the Basis of All Computation
Constructors
Encapsulation
Basic Operations on Arrays
1. Searching:
It simply means searching for a given element in an array. There are two ways of searching:
- Linear Search: This is a simple technique where searching begins from the starting element and goes on until the item is not found.
- Binary Search: This ensures searching in the minimum possible time. Binary search works on sorted arrays. It repeatedly compares the target element with the middle element, narrowing the search to either the first or last half until found or exhausted.
2. Sorting:
It is a system of arranging array elements in a specific order. There are two ways of sorting:
- Selection Sort: This technique sorts array elements by selecting and swapping the lowest element with each index, continuing until the array is sorted.
- Bubble sort: This technique sorts 1-D arrays by repeatedly scanning, comparing, and swapping consecutive elements, arranging them in ascending or descending order. It's simpler but time-consuming with many exchanges.
3. Inserting an element in an array:
To insert an element in an array, we must first ensure that the array size is adequate. Then, from where the element must be inserted, shift the elements downward.
4. Deleting an element from the array:
First, delete the element from the given position. Then, shift the elements upwards to fill up the empty space.
5. Merging (concatenating) two arrays:
First, create a third array whose size is equal to or more than the sum of the sizes of the first two arrays. Then shift the elements of the first array to the third array. Afterwards, shift the element of the second array to the third array.
