Competitive coding is taking the world of engineering by storm. Hackathon, Google Code Jam, Facebook Hackers Cup, Code Chef are a few of the many trendsetters. So much so that if you excel in your prowess of competitive coding you might just end up having a coveted internship or even a job. The cherry on the top of this tech-iced cake is that it isn’t just a learning opportunity it is also a lot of fun .
When you serve such an irresistible dish one can hardly resist it. But to make the most out of it you need to know it’s ropes. That’s exactly what the workshop organised by IEEE on the 6th of October was intended to do. To give the FEs a head start like no other. The workshop organised as a part of the celebration of IEEE day( October 2nd ) was hosted by one of our own seniors Tej Thakkar, who has ranked first in Mumbai in ACM ICPC 2017. His experience and skill added to the sheer quality of the workshop.He started of by introducing the students to competitive programming and how it entails real life problems and strives to come up with solutions for them. Talking a little bit about space and time complexity he elaborated on Big-O notation. All of us know that anyone who is interested in coding, must know his or her data structures right. Thus, Tej briefed the attendees on data structures like queues, stacks, graphs and trees.
An important aspect of Competitive Programming is dynamic programming because it stresses on decisions based on precedent. The simplest instance of which is the Fibonacci series. Bit manipulation is also a key to make sure your programs can operate faster. You can use OR, AND and XOR to do so.If you have attended this workshop then I am sure you are ready to sit in the driver seat and crack a few competitive coding battles.
-Akash , Ojasa & Kamal