IT&C Solutions

Solutions and tutorials for IT&C development

Menu
  • Echipa itcsolutions.eu

Tag: Scriere infixata

How to: Transform a Mathematical Expression from Infix Writing to Postfix Writing in C++
February 28, 2010 by Marius
1 Comment

Postfix writing (Reverse Polish Form) was made by Polish mathematician Jan Łukasiewicz. Particularities of this form of writing mathematical expressions are presented in […]. An algorithm for transforming a writing mathematical expressions from infix to postfix writing was developed by Edsger Dijkstra (Dijkstra Shunting Algorithm). Algorithm requires:

Read More →
  • EnglishEnglish
  • RomânăRomână

Categories

  • Multimedia (8)
    • Audio (1)
    • Flash (3)
    • Flex (1)
    • Photoshop (3)
  • Office (20)
    • Access 2003 (4)
    • Excel 2003 (13)
    • Excel 2010 (1)
    • VBA (2)
  • Operating Systems (17)
    • Google Chrome (1)
    • Windows (11)
    • Windows 7 (11)
    • Windows Vista (10)
  • Programming (105)
    • Android (10)
    • ASP.NET (9)
    • Assembler 8086 (5)
    • C sharp (C#) (2)
    • C++ (15)
    • CSS (1)
    • Data Structures (21)
    • HTML (2)
    • J2ME (10)
    • Java (35)
    • VB.NET (15)
    • Visual Studio 2008 (1)
    • Visual Studio 2010 (1)
    • Windows Mobile (1)
  • Security (6)

Archives

  • September 2011 (3)
  • August 2011 (11)
  • July 2011 (3)
  • June 2011 (3)
  • April 2011 (5)
  • March 2011 (6)
  • February 2011 (9)
  • January 2011 (4)
  • December 2010 (10)
  • November 2010 (3)
  • March 2010 (5)
  • February 2010 (6)
  • December 2009 (1)
  • November 2009 (2)
  • October 2009 (3)
  • July 2009 (2)
  • June 2009 (5)

IT&C Solutions. All Rights Reserved

Powered by WordPress