Internet Programming 1 min read
Hypertext Transfer Protocol (HTTP)
The hypertext transfer protocol (HTTP) was developed by Tim Berners-Lee in 1991 • HTTP was designed to transfer pages between machines…
THE LATEST THINKING
Every story.
Browse our articles in publication order, with new stories added automatically.
Internet Programming 1 min read
Internet Protocol
There are many protocols used by the Internet and the WWW: o TCP/IP o HTTP o FTP o Electronic mail…
Internet Programming 1 min read
The Internet
Medium for communication and interaction in inter connected network. • Makes information constantly and instantly available to anyone with a connection.…
Internet Programming 1 min read
Client-server paradigm
The Client-Server paradigm is the most prevalent model for distributed computing protocols. It is the basis of all distributed computing…
Internet Programming 1 min read
Web Essentials
Server: The software that distributes the information and the machine where the information and software reside is called the server.…
Graph Theory & Applications 1 min read
Exponential Generating Functions
Example .1 Find an exponential generating function for the number of permutations with repetition of length nn of the set {a,b,c}{a,b,c}, in which there…
Graph Theory & Applications 3 min read
Pólya–Redfield Counting
We have talked about the number of ways to properly color a graph with kk colors, given by the chromatic polynomial. For…
Graph Theory & Applications 2 min read
Binomial theorem
Binomial theorem, statement that for any positive integer n, the nth power of the sum of two numbers a and b may be expressed as the sum…
Graph Theory & Applications 2 min read
Pascal’s Identity
Pascal’s identity, first derived by Blaise Pascal in 17th century, states that the number of ways to choose k elements from…
Graph Theory & Applications 5 min read
Permutations
A permutation is an arrangement of some elements in which order matters. In other words a Permutation is an ordered Combination of…
Graph Theory & Applications 1 min read
Spanning Tree of a Graph
Spanning tree of a graph is a subgraph of it which forms a tree and contains (or spans) all the vertices…
