Contact

-
Kartik Butani

 Moblie No. : 8460304360


Comments

Post a Comment

Popular posts from this blog

First-line and First-letter Pseudo attribute in css

-
Image
In css, give two most useful pseudo attribute that are: 1. First-line : it is effect in first line of given paragraph. 2. First-letter: it is effect in first letter of given paragraph. For Example HTML File is : <!DOCTYPE html> <html> <head> <meta http-equiv="Content-Type" content="text/html; charset=utf-8" /> <title>krButani</title> <style> p.texts { width:500px; font-family:Verdana, Arial, Helvetica, sans-serif; font-size:16px; } /* This is apply to first line */ p.texts:first-line { Color:green; font-size:24px; } /* This is a apply to first letter. */ p.texts:first-letter { Color:red; font-size:72px; } </style> </head> <body> <p class="texts"> Premananda was a "vyakhyan-kar", a traveling storyteller, who narrated his subject in song form and then perhaps elaborated on the lines in prose. His style was so fluent that the long poems runnin...
Read more

date_diff function in php

-
////////////////////////////////////////////////////////////////////// //PARA: Date Should In YYYY-MM-DD Format //RESULT FORMAT: // '%y Year %m Month %d Day %h Hours %i Minute %s Seconds'        =>  1 Year 3 Month 14 Day 11 Hours 49 Minute 36 Seconds // '%y Year %m Month %d Day'                                    =>  1 Year 3 Month 14 Days // '%m Month %d Day'                                            =>  3 Month 14 Day // '%d Day %h Hours'                                            =>  14 Day 11 Hours // '%d Day'                                 ...
Read more

Greedy Prim Algorithm using c/c++

-
Greedy Prim Algorithm using c/c++ In computer science, Prim's algorithm is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized. The algorithm operates by building this tree one vertex at a time, from an arbitrary starting vertex, at each step adding the cheapest possible connection from the tree to another vertex. #include<stdio.h> #include<conio.h> #include<iostream.h> enum logical {TRUE=1,FALSE=0}; struct edge {                 int from,to ;                 float cost ;                 logical rejected,selected ; }; int nv,ne; struct edge e[20...
Read more