Learn OOPs concepts using Java with 1 real-life program example. You can also DOWNLOAD pdf FREE! ALL oops features used in this program are explained.

## Fibonacci series in Java using recursion and non recursion

We’ll discuss Fibonacci series using recursion and non-recursion approach with logic, code example in java and code explanation. If you’re not familiar about the Fibonacci series, here’s the brief or you can skip: The Fibonacci series is a sequence of numbers in which each number after the first two is the sum of the two […]

## fibonacci series in java using loop – Clear Logic

The Fibonacci series is a sequence of numbers in which each number after the first two is the sum of the two preceding ones. It is defined as follows: F(0) = 0 F(1) = 1 F(n) = F(n-1) + F(n-2) for n > 1 So, the first few terms of the Fibonacci series are: 0, […]

## Why to Use Design Patterns – BEST REASONS

Hi, this post will describe why to use design patterns. In fact, what is the best reason to use a design pattern in software application in java or other languages. Design patterns are reusable solutions to common software design problems that have been discovered and refined over time by experienced software developers. There are several […]

## Real Story: How all CSE freshers Got IT job in 5 months

My Real short STORY: How all freshers got job in 5 months in software field as a developer or tester. I included all the guidelines in the book “IT Jobs made Easy for freshers” published on Amazon One thing that has always unsettled me is how fresh graduates struggle to get a job. Whenever I […]

## 50 Tricky Java MCQs – Check if you can answer

JAVA MCQ BRAIN TEASER: Uniquely crafted from hundreds of real face-to-face interviews. Discover your true skills and gain confidence Today. IMPORTANT 1) If you know the basic concepts, you’ll be able to answer or else you need a serious improvement for your career growth. 2) Answer each question with reasons to get maximum benefits. Start […]

## BIG-O NOTATIONS

Big-O notations are used to represent Space or Time complexities of algorithms. There are more notations such as Theta and Omega. But we’ll restrict the discussion to the frequently used Big-O notation. Here are some terminology and complexity in Big-O notations you should keep in mind. BIG-O NOTATIONS – GRAPHICAL – YOU ALREADY KNOW IT […]

## Time complexity of linear search

The time complexity of linear search is O(n). In the best case its time complexity is O (1). In the linear search, you search an element in a list sequentially until you find that element. For example, Suppose you want to find the element 2 in the given list below. You have to traverse the […]

## Time complexity of for loop – O(1) O(n) and O(log n)

Time complexity of for loop can be anything O(1), O(n), O(log n) depending upon the loop conditions and code you write. Time complexity of for loop with various scenarios. a) Every time you run this loop; it will run 10 times. In other word, this for loop takes constant time. So, the time complexity will […]

## How to measure method execution time in java

You can measure method execution time in java using the method System.nanoTime() or System.currentTimeMillis(). Put this method before and after the method or piece of code for which you want to measure the running time. Find the difference of the time you got before and after your code. The difference is the running time. Method […]