Fabulous February is here at last!
This is the month some of the greatest names in TechNet Wiki history will step forth and give us knowledge!
That’s YOU by the way!
Drop us a little ray of sun, a few lines of love, or virtual valentine!
Your revelations could enrich so many more if you copied it for posterity into the wiki of wisdom
We need heroes! We need YOU! Join us and grow your reputation amongst some of the greats of the community!
All you have to do is add an article to TechNet Wiki from your own specialist field. Something that fits into one of the categories listed on the submissions page. Copy in your own blog posts, a forum solution, a white paper, or just something you had to solve for your own day’s work today.
Drop us some nifty knowledge, or superb snippets, and become MICROSOFT TECHNOLOGY GURU OF THE MONTH!
This is an official Microsoft TechNet recognition, where people such as yourselves can truly get noticed!
HOW TO WIN
1) Please copy over your Microsoft technical solutions and revelations to TechNet Wiki.
2) Add a link to it on THIS WIKI COMPETITION PAGE (so we know you’ve contributed)
3) Every month, we will highlight your contributions, and select a “Guru of the Month” in each technology.
If you win, we will sing your praises in blogs and forums, similar to the weekly contributor awards. Once “on our radar” and making your mark, you will probably be interviewed for your greatness, and maybe eventually even invited into other inner TechNet/MSDN circles!
Winning this award in your favoured technology will help us learn the active members in each community.
January’s entries are now being judged, but below are December’s mighty winners!
|Small Basic Technical Guru – December 2015|
|SYEDSHANU||Microsoft Small Basic: Painting Tool Using Graphics Window||RZ: “This is very nicely done! Fantastic tool for painting and illustrating the drawing capabilities of SmallBasic”|
|Ed Price – MSFT||Small Basic Sample: Leap Year Checker||RZ: “Leap year calculation is always interesting — the rules are always just a bit more complicated than you expect :)”|
Thanks in advance!