Skip to main content

Home/ Computer Science Knowledge Sharing/ Group items tagged answers

Rss Feed Group items tagged

Filter: All | Bookmarks | Topics Simple Middle
Abdelrahman Ogail

Quis custodiet ipsos custodes? - Wikipedia, the free encyclopedia - 0 views

en.wikipedia.org/...is_custodiet_ipsos_custodes%3F

LOL

shared by Abdelrahman Ogail on 01 Aug 09 - Cached
  • The question is put to Socrates, "Who will guard the guardians?" or, "Who will protect us against the protectors?" Plato's answer to this is that they will guard themselves against themselves. We must tell the guardians a "noble lie."[1] The noble lie will inform them that they are better than those they serve and it is therefore their responsibility to guard and protect those lesser than themselves. We will instill in them a distaste for power or privilege; they will rule because they believe it right, not because they desire it.
Abdelrahman Ogail

Common Mistakes in Online and Real-time Contests - 0 views

www.acm.org/...contests.html

shared by Abdelrahman Ogail on 09 Jun 09 - Cached
Islam TeCNo liked it
  • Dynamic programming problems are to be solved with tabular methods
    • Ahmed Mansour
      Ahmed Mansour on 09 Jun 09
       
      Dynamic programming, like the divide-and-conquer method, solves problems by combining the solutions to subproblems. ("Programming" in this context refers to a tabular method, not to writing computer code) y3ney 3bara 3n 2nene bn2sem el problem el kbirr le shwit probelsm so3'ira .. we ne solve el problems deh we ngma el yab2a dh 7l lel problem el kbira :D;d see introduction to algorithms book . chapter 15
  • breadth-first search
    • Ahmed Mansour
      Ahmed Mansour on 09 Jun 09
       
      In graph theory, breadth-first search (BFS) is a graph search algorithm that begins at the root node and explores all the neighboring nodes. Then for each of those nearest nodes, it explores their unexplored neighbor nodes, and so on, until it finds the goal. ya3ney be el 3arby keda lw ana 3ndy tree maslan we el tree dh bettkwen mn shwit levels 3ady gedan.. lama hagey 23mel search 3la node mo3ina fi el tree deh hamsk el tree mn el root bet3ha ely hwa level 0 we habda2 2mshy level by level y3ney hanzl 3la el level 1 we hakaz le 3'it mal2y el node bet3ty ,,,, see this ,, it's a tutorial show how BFS algorithm is work!! http://www.personal.kent.edu/~rmuhamma/Algorithms/MyAlgorithms/GraphAlgor/breadthSearch.htm
  • Memorize the value of pi You should always try to remember the value of pi as far as possible, 3.1415926535897932384626433832795, certainly the part in italics. The judges may not give the value in the question, and if you use values like 22/7 or 3.1416 or 3.142857, then it is very likely that some of the critical judge inputs will cause you to get the wrong answer. You can also get the value of pi as a compiler-defined constant or from the following code: Pi=2*acos(0)
    • Islam TeCNo
      Islam TeCNo on 09 Jun 09
       
      hhhhhhhhhhh ...... awl mara a3rf el mawdo3 dah we awl mara a3raf en el Pi = 2*acos(0)
    • Abdelrahman Ogail
      Abdelrahman Ogail on 09 Jun 09
       
      Thanks Islam for the info, really useful
  • ...4 more annotations...
  • You cannot always check the equality of floating point numbers with the = = operator in C/C++. Logically their values may be same, but due to precision limit and rounding errors they may differ by some small amount and may be incorrectly deemed unequal by your program
  • #define swap(xxx, yyy) (xxx) ^= (yyy) ^= (xxx) ^= (yyy)
    • Islam TeCNo
      Islam TeCNo on 09 Jun 09
       
      I remember someone told me that it's impossible to do swaping using macros :D ...but i think it's possible
  • But recursion should not be discounted completely, as some problems are very easy to solve recursively (DFS, backtracking)
    • Islam TeCNo
      Islam TeCNo on 09 Jun 09
       
      Some problems are much easier when using recursion
  • Having a good understanding of probability is vital to being a good programmer
  • Ahmed Mansour on 09 Jun 09
     
    for bignner acmers hoping to be useful !
  • Ahmed Mansour on 09 Jun 09
     
    in this article the author discuss the common problems that faced teams in ACM contests .. and how to avoid it !
Ahmed Mansour

XHTML Frequently Answered Questions - 0 views

www.w3.org/xhtml-faq

xhtml web

shared by Ahmed Mansour on 30 Jun 09 - Cached
Ahmed One liked it
  • Ahmed Mansour on 30 Jun 09
     
    i think this is great article to know the differences between html and xhtml ..!
‹ Previous 21 - 23 of 23
Showing 20▼ items per page