SIGACT

Dear SIGACT students,

The admission to ACM-ICPC 2010 (International Collegiate Programming Contest) training is now open. If you wish to apply, come to Eng. Ahmed Elhabashy, office 237.

Good Luck

For the upcoming seminars you can have a quick look at the main materials here:

• http://www.topcoder.com/tc?module=Static&d1=tutorials&d2=dataStructures
• http://www.topcoder.com/tc?module=Static&d1=tutorials&d2=standardTemplateLibrary

Have a nice time

We will arrange two workshops with the beginning of the new semester (fall 2009). In the first one we will talk about some useful data structures that are usually used in the programming contests with some hints on their C++ pre-made implementation. Some of these data structure are Sets, Queues, Priority Queues, Binary Indexed Trees, Segments Trees, etc..

The second one will handle the combinatorics and counting techniques. To have a quick hint on them, imagine a state where you have 10 pens and you want to choose 4 of them, how many methods could you choose your pens.

Welcome to the CC department’s Algorithm research community. The SIGACT (a short for Special Interest Group in Algorithm & Complexity Theory) is a research community that aims to study all Algorithms and computational complexity related topics. If you are interested to join, send an email to Eng. Ahmed El-Habashy, the director of the SIGACT in CC.

The CERC (Computer Engineering Riddles Community) will be back shortly (probably it will start at the first/second week of the term) and will start its activity under the umbrella of the SIGACT. It will work exactly as the way it had at the past but it will be totally web-based. Again, the winner’s information and picture are gonna be announced on the home page of the SIGACT site on Sundays of each week.

Check back from time to time to follow up any new updates…

Have a nice time