Technical Ramblings

Tag: Discrete Maths

Combinatorics

May 20, 2008 r9paul

Combinatorics is a branch of mathematics concerned with the study of finite objects, and has many applications in the field of Computer Science. Combinatorics is useful in problem solving, and is most often involves ideas such as counting elements in a set, or calculating permutations or combinations of elements in a set.

Read More
Comsci Notes Discrete Maths, FA, FA-ADM, Set TheoryLeave a Comment on Combinatorics

Recent Posts

  • How to Reset to Factory Default a Cisco Catalyst 2960, 2950, 2960, 3560…
  • Exporting Contacts from the Durham Uni Database
  • Iris Exchequer Fails to Install
  • Working with MDI Window Backgrounds in .NET
  • Ethernet Fail

Categories

  • Blog
  • Cisco
  • Comsci Notes

powered by

Proudly powered by WordPress

  • Follow Us