Gain insights into Java essentials, including programming paradigms, objects, data types, and algorithms. Delve into extensive exercises to prepare for a software development career.

java.gz

java_input

java_common

java_input-new

java_common-new

This course is your detailed guide to the fundamentals of the Java programming language. This course will get you on the fast track to becoming a proficient and modern Java developer.

In this course, you will start by covering different programming paradigms like object-oriented and procedural programming. You will then cover the fundamentals of programming in Java such as: objects and data types, variables, arrays, and conditional statements.

In the latter half of the course, you will cover iterative constructs, useful algorithms, and data structures. With over 100 problems, 11 quizzes, and 9 challenges, this course will get you prepared for a career in software development.

A Complete Guide to Java Programming

# Coding solution

Let’s take a look at the solution first.


class SumOfFirstFibonacciNumbers{

    public int findTheSum(int n){
        if (n <= 0)
            return 0;

        int fibo[]=new int[n+1];
        fibo[0] = 0; fibo[1] = 1;

        int sum = fibo[0] + fibo[1];

        for (int i=2; i<=n; i++) {
            fibo[i] = fibo[i-1]+fibo[i-2];
            sum += fibo[i];
        }

        return sum;
    }
}

public class FibonacciNumbers {

    public static void main(String args[]) {
        int num = 10;
        SumOfFirstFibonacciNumbers fiboObject = new SumOfFirstFibonacciNumbers();
        System.out.println("The sum of first " + num + " Fibonacci numbers is " + fiboObject.findTheSum(num));
    }
}

## Explanation

- The lines (**4** – **5**) identify if the number is less than or equal to `0`. If it is less than or equal to `0`, simply return `0` as the sum of zero elements is `0`.

- Line **7** creates an empty array of the total numbers of Fibonacci numbers we will need in the code.

- Line **8** initializes the first two Fibonacci numbers to start the further summation.

- The lines (**12** -- **15**) compute the sum of all the remaining Fibonacci numbers based on the statement defined in the line **13**.






A detailed review of the sum of N Fibonacci numbers is discussed in this lesson.

Java, a High Level Language with a Purpose

How Java Programming Works

Objects and Data Types

Variables: The Name of a Field

Arrays: The Container Objects

Operators and Conditional Statements

Iterative Constructs, Entry and Exit Controlled Loops

Algorithms

Basic Input and Output

Classes and Objects

Interface and Abstraction

Exception Handling and Data Structures

Conclusion

Appendix

Solution Review: Compute Sum of N Fibonacci Numbers

Coding solution