Course Details

The following topics will be covered in detail:


Ever wondered, all that math you learned in school and college, is used where? Well, to completely understand algorithms you will need that knowledge. We specifically start with this section to brush up on a few concepts of mathematics like exponents, logarithms, series and more.

Linked List

Have you ever used an image viewer? Are you familiar with a browser window, which enables you to go to the previous/next window? If yes, then you have already been introduced to the data structure - linked lists. A linked list is a collection of data elements, in which each element points to the next. In this section we will look at the advantages of using a linked list, its applications and will learn a few variations of it. Linked lists are also used for implementing other important data structures. Keep this one in your programming hat, and it will save you a lot of space and time (literally!)

Stacks and Queues

The stack data structure in computer science has exactly the same meaning as it does in English. A pile of books, cup trays in a cafeteria, the undo button in a text editor and recursion are all examples of a stack. In this section we will learn about basic stack operations and various stack implementations.Standing in a line, a print job or an image upload are all done using queues. Even twitter uses a special type of queue to display the trending topics. In this section we will learn about different types of queues, various queue representations and their applications.

Binary Trees

Trees are very powerful, nonlinear data structures which greatly help in searching through a large volume of data. In this section we will look at various types of trees, their advantages and their traversals.


If you have searched for something on Facebook, then you have already witnessed the power of graphs as data structures. In this section we will look at various types of graphs, traversal methods (DFS and BFS),dijkstras algorithm, spanning trees and network flow problems.

Sorting and Searching

Sorting large chunks of data is a common and complex problem in the world of computer science. In this section we will learn about the various sorting algorithms available, such as insertion sort, shell sort, heap sort, quick sort, bucket sort, merge sort and radix sort. We will also analyse and compare all these algorithms. Also, we will learn how to search data effectively in an array with some of the teachniques most suited for a sorted array which includes index sequential search, binary search and interpolation search

Complexity Analysis

This is exactly where that math is needed. Here we will learn how to quantify the efficiency of an algorithm and we will also look at a few interesting algorithms.

Do I need to have a programming background prior to learning Java?

No. It is not required for you to have a prior knowledge of programming. But if you have a programming background it will be an add on and the course duration will also be less.

Will I be able to code fluently after learning Java?

Yes, absolutely. That is the aim. We want you to be able to write complex codes and apply your thought process in solving the problems.

What is the course duration?

The course duration normally is around 70-80 hours. But since the learning is customised, it can vary depending on the student/batch.

How many students are there in a batch?

A minimum of 2 and a maximum of up to 5. If you are the only one, then we recommend getting some of your friends. But if you are still interested and passionate to learn, we can consider your request.

How will learning Java help me?

Being an Object Oriented Programming language it is easy to program in Java where everything is in terms of classes and objects. You can model any real world scenario into a program and enjoy designing various functionalities. Later on you can build your own packages and play around in various examples.

Do I get a certificate after the completion of the course?

Yes, we do provide a participation certificate. However, if you wish to to obtain an excellence certificate then it is necessary for you to complete all the tests that are provided after each chapter and a final test taken at the end of the course.

Do I have to pay the full amount for the course at once?

No. You can pay in installments after discussing with the finance team at Bloombench. We are here to make your learning process easy and fun.

How do I register for the course?

If you are interested in the course, reserve your seat in the reservation form below

What if my course syllabus does not match with the curriculum that is specified?

As it is personalised teaching the curriculum can be modified according to the student requirement. But in general the curriculum covers all the important topics needed.

What if I miss a particular lecture?

If you miss a particular lecture there will be a coverup arranged for you depending on the availability of the professor

What if I want to change my batch?

Yes, if you are not comfortable in a particular batch you can change it

Is the fees refundable?

Yes, it is refundable depending on the refund policies

Contact Us