Bubble Sort Algorithms

Bubble Sort Algorithm Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity are quite high. How does Bubble Sort Work? Suppose we are trying to sort the elements in ascending […]

Dynamic Programming

Dynamic Programming Dynamic Programming is a general algorithm design technique for solving problems defined by recurrences with overlapping subproblems. Dynamic programming is a very powerful, general tool for solving optimization problems. Once understood it is relatively easy to apply, but many people have trouble understanding it.

Inheritance in Java | OOP Fundamental Concept

Inheritance in Java | OOP Fundamental Concept Inheritance in Java is a mechanism in which one object acquires all the properties and behaviors of a parent object. • It is an important feature of OOPs.• Inherited class is called as parent class or super class or base class• Class that inherits a parent class is […]

Polymorphism in Java | OOP Fundamental Concept

Polymorphism in Java | OOP Fundamental Concept Two types of Polymorphism1. Compile-time Polymorphism : Method Overloading1. Run-time Polymorphism : Method Overriding Methods in Java Java Method is a collection of statements that are grouped together toperform a specific task.• A method must be declared within a class. Types of Methods: In Java, there are two […]

Basic Concepts of Graph

Basic Concepts of Graph What is a graph?• A data structure that consists of a set of nodes or vertices and a set of edges that relate the nodes to each other• The set of edges describes relationships among the vertices Undirected graphs• When the edges in a graph have no direction, the graph iscalled […]

Introduction to Knapsack Problem

Introduction to Knapsack Problem its Types and How to solve them The Knapsack problem is an example of the combinational optimization problem. This problem is also commonly known as the “Rucksack Problem“. The name of the problem is defined from the maximization problem as mentioned below: Given a bag with maximum weight capacity of W and a […]

Introduction to Algorithms

Introduction to Algorithms What is an Algorithms? An algorithm is a set of step by step or well-defined instructions for solving a specific problem. This means that the method you use to arrive at the same solution may differ from mine, but we should both get the same result. Because there are various ways to […]

Introduction to SQL Database

Introduction to SQL Database What is a SQL database? SQL databases, also known as relational databases, are systems that store collections of tables and organize structured sets of data in a tabular columns-and-rows format, similar to that of a spreadsheet. The databases are built using structured query language (SQL), the query language that not only makes […]

Introduction to MongoDB Database

Introduction to MongoDB Database MongoDB is an open-source, document-based, and cross-platform NoSQL database that offers high performance, high availability, and easy scalability. It differs from traditional relational databases by utilizing a flexible, schema-less data model built on top of BSON (Binary JSON), allowing for non-structured data to be easily stored and queried. MongoDB is a powerful […]

Database System

Database System A database system is a collection of interrelated files and a set of programs that allow users to access and modify these files. The need for efficiency has led designers to use complex data structures to represent data in the database. The low-level physical view of data is too detailed for most users. A Database […]