Open Systems Interconnection (OSI) Model

The Open Systems Interconnection Model

History of the Open Systems Interconnection Model

During the late 1970’s the ISO ( developed a theoretical model for networking hardware and software called the Open Systems Interconnection model. The Open Systems Interconnection model was derived, in part, from standards defined within the Advanced Research Projects Agency Network (ARPANET). The OSI model was implemented to address a need to allow multi-vendor interoperability of networking systems; for, the ARPANET was confined to the interconnection of systems within ...

Read more →

The Pigeonhole Principle

The following excerpt was taken from:
Kolman, Busby, & Ross(2009), Discrete Mathematical Structures, 6th ed. Upper Saddle River, NJ: Pearson Prentice Hall

“Theorem: The Pigeonhole Principle

The Pigeonhole Principle is a proof technique that often uses discrete math’s counting methods.

If n pigeons are assigned to m pigeonholes, and m < n, then at least one pigeonhole contains two or more pigeons.

Pigeonhole Principle – Proof

Suppose each pigeonhole contains at most 1 pigeon. Then at most m pigeons have been assigned. But since m ...

Read more →

Fundamentals of Discrete Math

Fundamentals of Discrete Mathematical Structures

This post contains a synopsis of the fundamentals of discrete mathematical structures. This post was created during my second year of college while studying to attain a Bachelors of Science in Computer Science.  The discrete math course is a necessary requirement in attaining a B.S. in Computer Science.

“The origins of matrices goes back to approximately 200 B.C.E, when they were used by the Chinese to solve linear systems of equations” (Kolman, Busby, & Ross, 2009).

Are you interested in ...

Read more →
Page 1 of 8 12345...»