Shubham Ojha − Profile

Thanks. 

Compares two strings lexicographically i.e length wise and character-wise taking their respective lengths or ASCII codes into consideation.

return type- int

Used to compare two strings, taking their respectibe cases into consideration and check if they are completely identical or equal or not.

return type- boolean

To count the number of characters and/or white spaces present in a string.

return type- int

To delete or eliminate the leading and trailing spaces of a string variable.

Return type- string

Method

1.It is a member function with a different name than the class name, which is user-defined.

2.HAs a valid return type or void.

3.Used to perform operations on variables/constants.

Constructor

1.It is a member function with the same name as that of the class name.

2.Has no return type not even void.

3.Used to give default/initial values to instance variables.

if-else-if

1. It is used to compare a range of values or to  perform logical/relational or equality operations.

2.Works with all primitve data types.

3.If all conditions are false, else is executed.

switch-case

1.It is used to compare values for equality only.

2.Works with integer datatypes or character datatype only.

3.If all conditions are false, default is executed.

Byte code is a set of highly optimized instruction codes, that are formed when the source code is compiled by javac(java compiler). It is the intermediate code and is formed for interpretation for the java interpreter(JVM) for further execution.

Thanks @catlover.

CLASS   -

1. A class is a collection of obejcts of the same behaviour(functions) and characteristics(variables).

OBJECT-

1. An obejct is a real-world identifiable entity which has certain behaviours and characteristics associated with it.

CLASS- 

2. A class can be called as 'a factory of objects' as any number of obejcts can be created in a class by the process of instantiation.

OBJECT-

2. An obejct is an instance of a class.

Linear Search-

1. Applicable for sorted and unsorted array.

2.Since the number of pases through the loop is more, it is tedious and time consuming.

Binary Search

1. Applicable to a sorted array only.

2. Less time consuming, as passes through the array is reduced by dividing the array every time.

Data abstraction, for sure.