Simple Java derives its syntax from C and object oriented features from C++. If you are good in C and C++ programming then you can learn Java easily. Hence Java is Simple. Secure Java provides its own execution environment and hence do not allow any malicious program to access other parts of computer. Java Virtual …
Swift is an object-oriented programming language for iOS and OS X development which is recently introduced by Apple at its WWDC 2014. It is intended to coexist with Objective-C, the current programming language for Apple operating systems. Swift is designed to be more resilient against erroneous code. It is built with the LLVM compiler. Also …
Swift: A New Programming Language Introduced by Apple For iOS and OS X Development Read More »
What is Error Provider? Error provider is a control that alerts the user that something is wrong in his input. Or simply it just helps in validating data entered from user. In this example, we will see how to display a warning icon when user enter some wrong or unacceptable input. How to Use Error …
Working With Error Provider in VB.Net [Video Tutorial] Read More »
Hack is a programming language for the HipHop Virtual Machine (HHVM) invented by Facebook. It was introduced on March 20, 2014. Before the announcement of the new programming language, Facebook had already implemented the code and tested it on a large portion of Facebook’s site. Over the last year, they have migrated their entire PHP …
Hack: A New Programming Language Invented by Facebook Read More »
B+ tree is a variation of B-tree data structure. In a B+ tree, data pointers are stored only at the leaf nodes of the tree. In a B+ tree structure of a leaf node differ from the structure of internal nodes. The leaf nodes have an entry for every value of the search field, along …
This tutorial is about kruskal’s algorithm in C. It is an algorithm for finding the minimum cost spanning tree of the given graph. In kruskal’s algorithm, edges are added to the spanning tree in increasing order of cost. If the edge E forms a cycle in the spanning, it is discarded. Also Read: Prim’s Algorithm in C …
#include<stdio.h> #define MAX 10 typedef struct Q { int R,F; int data[MAX]; }Q; void initialise(Q *P); int empty(Q *P); int full(Q *P); void enqueue(Q *P,int x); int dequeue(Q *P); void print(Q *P); void main() { Q q; int op,x; initialise(&q); do { printf(“nn1)Insertn2)Deleten3)Printn4)Quit”); printf(“nEnter Your Choice:”); scanf(“%d”,&op); switch(op) { case 1: printf(“nEnter a …
C Program for Implementation of Circular Queue Using Array Read More »
Here you will learn about Dijkstra’s algorithm and how you can implement it in C programming. Dijkstra algorithm is also called the single source shortest path algorithm. It is based on the greedy technique. The algorithm maintains a list visited[ ] of vertices, whose shortest distance from the source is already known. If visited[1], equals 1, then the …
