Posts

Showing posts from December, 2014

Validate Mobile Number with 10 Digits in ASP.Net

Here is the code for validating textbox for 10 digit mobile number. .ASPX File: <asp:TextBox ID="TextBox1" runat="server"></asp:TextBox><br\>     <asp:RegularExpressionValidator ID="RegularExpressionValidator1" runat="server"        ControlToValidate="TextBox1" ErrorMessage="RegularExpressionValidator"      ValidationExpression="[0-9]{10}"></asp:RegularExpressionValidator>
Post a Comment
Read more

Introducing JSON

Image
JSON (JavaScript Object Notation) is a lightweight data-interchange format. It is easy for humans to read and write. It is easy for machines to parse and generate. It is based on a subset of the JavaScript Programming Language , Standard ECMA-262 3rd Edition - December 1999 . JSON is a text format that is completely language independent but uses conventions that are familiar to programmers of the C-family of languages, including C, C++, C#, Java, JavaScript, Perl, Python, and many others. These properties make JSON an ideal data-interchange language. JSON is built on two structures: A collection of name/value pairs. In various languages, this is realized as an object , record, struct, dictionary, hash table, keyed list, or associative array. An ordered list of values. In most languages, this is realized as an array , vector, list, or sequence. These are universal data structures. Virtually all modern programming languages support them in one form...
Post a Comment
Read more

Dijkstra's Algorithm

D ijkstra's algorithm solves the single-source shortest-path problem when all edges have non-negative weights. It is a greedy algorithm and similar to Prim's algorithm. Algorithm starts at the source vertex, s, it grows a tree, T, that ultimately spans all vertices reachable from S. Vertices are added to T in order of distance i.e., first S, then the vertex closest to S, then the next closest, and so on. Following implementation assumes that graph G is represented by adjacency lists. DIJKSTRA (G, w, s) 1.    INITIALIZE SINGLE-SOURCE (G, s) 2.    S ← { }     // S will ultimately contains vertices of final shortest-path weights from s 3.    Initialize priority queue Q i.e., Q  ←  V[G] 4.    while priority queue Q  is not empty do 5.        u   ←  EXTRACT_MIN(Q)    // Pull out new vertex 6.        S  ←  S È { u...
Post a Comment
Read more

Advantages & Disadvantages of Using Ajax

Advantages Everything has its own merits and demerits, Ajax included. ·            The application seems to become more responsive and interactive as the user gets the response without clicking any buttons. ·            In classic web application, when the web server responds to the web browser with a new page, it may make use of multiple connection threads in order to speed up the process, but this happens for the content only (which is between <body> tags). The CSS as well as the script files present in the head section are transferred using only one connection thread which results in performance degradation. With Ajax, it is required to load only the basic script and CSS files. Rests are requested as content using multiple connections. ·            A big advantage is that the user is not required to keep on waiting and waiting. · ...
Post a Comment
Read more