Featured Article

How to Choose Best Laptop for Programming in 2017?

This article will guide you to choose the best laptop for programming in 2017. As a programmer or developer it becomes really confusing to pick a best laptop from thousands of laptops available in the market. It becomes even more difficult for a person who is just starting programming. Below I have shared some key… Read More »

Featured Article

5 Best C Books For Beginners

As a beginner in programming it can be difficult for you to choose the best C books to start your C programming journey. Selecting good book is very crucial part of learning. To make your task easier, in this article I have shared some best C books for beginners. These books are highly recommended for those… Read More »

Difference between JSON and XML

Let us understand the difference between JSON and XML web technologies. Here’s a brief overview on JSON vs XML with a complete description and examples as well. XML XML is an abbreviation for Extensible Markup Language and was developed by the World Wide Web Consortium. XML is primarily used to store and transport data from… Read More »

Normalization in DBMS – 1NF, 2NF, 3NF and BCNF

Here you will learn about normalization in dbms with examples. What is Normalization in Database? Most of the projects and websites contain lot of information. They store the data in tables. Since lot of data therefire database contains so many tables. In order to retrieve some information we must go through number of tables which… Read More »

Category: SQL

Asymptotic Notations

Here you will learn about Asymptotic Analysis and Asymptotic Notations in detail. It is common that we write Algorithm before writing code to any problem. There may exist more than one solution for a particular problem. But we need the solution which is better in time and space complexities. To compare and analyse algorithms complexities… Read More »

Dining Philosophers Problem in C and C++

In this tutorial you will learn about Dining Philosophers Problem in C and C++ with program example. What is Dining Philosophers Problem? There are some Philosophers whose work is just thinking and eating. Let there are 5 (for example) philosophers. They sat at a round table for dinner. To complete dinner each must need two Forks (spoons).… Read More »

Priority Queue in C and C++

Here you will get implementation of priority queue in C and C++ with program example. Priority Queue is an ordered list of homogeneous elements. In normal queue, service is provided on the basis of First-In-First-Out. In a priority queue service isn’t provided on the basis of First-In-First-Out service, but rather then each element has a… Read More »

Category: DSA

TCP/IP Socket Programming in C and C++ (Client Server Program)

This tutorial will help you to know about concept of TCP/IP Socket Programming in C and C++ along with client server program example. What is Socket? We know that in Computer Networks, communication between server and client using TCP/IP protocol is connection oriented (which buffers and bandwidth are reserved for client). Server will get so… Read More »

Hashing in C and C++

In this tutorial you will learn about Hashing in C and C++ with program example. You will also learn various concepts of hashing like hash table, hash function, etc. Hashing in Data Structure Searching is dominant operation on any data structure. Most of the cases for inserting, deleting, updating all operations required searching first. So… Read More »

Category: DSA

Difference between BFS and DFS

Here you will learn about difference between BFS and DFS algorithm or BFS vs. DFS. Breadth First Search (BFS) and Depth First Search (DFS) are two popular algorithms to search an element in Graph or to find whether a node can be reachable from root node in Graph or not. And these are popular traversing methods… Read More »

Category: DSA

Bellman-Ford Algorithm in C and C++

Here you will learn about Bellman-Ford Algorithm in C and C++. Dijkstra and Bellman-Ford Algorithms used to find out single source shortest paths. i.e. there is a source node, from that node we have to find shortest distance to every other node. Dijkstra algorithm fails when graph has negative weight cycle. But Bellman-Ford Algorithm won’t fail… Read More »

Topological Sort in C and C++

Here you will learn and get program for topological sort in C and C++. We know many sorting algorithms used to sort the given data. It may be numeric data or strings. Take a situation that our data items have relation. They are related with some condition that one should happen only after other one… Read More »

Category: DSA

Matrix Chain Multiplication in C and C++

Here you will learn about Matrix Chain Multiplication with example and also get a program that implements matrix chain multiplication in C and C++. Before going to main problem first remember some basis. We know that, to multiply two matrices it is condition that, number of columns in first matrix should be equal to number of… Read More »

Travelling Salesman Problem in C and C++

Here you will learn about Travelling Salesman Problem (TSP) with example and also get a program that implements Travelling Salesman Problem in C and C++. Let say there are some villages (1, 2, 3, 4, 5). To work with worst case let assume each villages connected with every other villages. And there is a Salesman living… Read More »