R IZWAN A ZIZ H UDDA

I213, Hall-7, IIT Kanpur, Kanpur - 208016, Uttar Pradesh (91) 8853145973; hudda@cse.iitk.ac.in

E DUCATION
Year 2013 2010 2006 2004 Degree MTech CSE BE (Hons.) CSE XII X Institution(Board) Indian Institute of Technology, Kanpur Birla Institute of Technology and Science, Pilani Sri Chaitanya Junior College, Hydernagar (BIE) Little Star High School, Adilabad CGPA/% 9.00/10.00 8.03/10.00 95.60% 89.60 %

Academic Acheivements
Acheived All India Rank of 46 among 100,000 students Appearing for GATE-2010 Computer Science Test in India. Acheived All India Rank of 380 among 500,000 students Appearing for AIEEE-2006 in india. Acheived State Rank of 25 among 200,000 students Appearing for Engineering Entrance Test EAMCET-2006 in AP. Won 1st prize in Tower Research All India Programming Contest O(log n) in Oct 2012. Member of the team TheNoobs that Ranked 11th among Global and 3rd among Indian teams in IOPC 2012. Member of the team that Ranked 8th among Indian teams in Bitwise 2012 - Algorithm Intensive Programming Contest. Member of the team 28N75E that Ranked 27th in ACM ICPC Asia Regionals 2009 Amritapuri. Member of the team Pandoras Box that Ranked 8th in ACM ICPC Asia Regionals 2012 Amritapuri.

Work Experience
D.E.Shaw India Software Pvt. LtdHyderabad, AP Member Technical: July 2010 June 2011 Was Member of Technical team that develops infrastructure for Energy Trading Group. Key Projects Worked on Data extraction from Simple, Form based and Javascript based websites, FTP sites. Made Enhancements to Backend Infrastructure for Book Keeping and Grouping of PnL. Worked on Backend Python and Excel VBA Based sheet for Historical Beta computation and display. Technologies Used: Python, Perl, CVS, SVN, Java, Firebug, Selenium, Bash, Cron, Sybase, T-SQL Qualcomm India R & D Pvt. LtdHyderabad, AP Engineer Intern: July 2009 Dec 2009 Dependency Analyser tool Aimed to reduce build time of the drivers codebase for embedded device. Analyses the depedencies between different source les by looking at includes. Finally gives recommendations by marking redundant inclusions in the graph. Also useful to reduce intermodule dependencies. Tool to Reverse Engineer data structures from memory dump. Unit Test framework and Test cases for Storage SD Card Driver. Technologies Used: Perl, C, Graphviz, Dot

Key Academic Projects

Design of Efcient Maximum matching algorithms for Planar Graphs.IIT Kanpur Jan 2012 - Present Advisor: Prof. Surender Baswana Design of Efcient Maximum matching algorithms for Planar Graphs. Surveyed the Existing Literature on Maximum matching for Bipartite and General Graphs. Studied the Efcient Algorithms for Maximum ow, Minimum Cut, and Shortest paths in Planar Graphs.

 Designed an algorithm for the case of outer planar graphs with a better time complexity than current state of the art Term paper on Shortest Path in Line arrangementsIIT Kanpur Feb 2012 - April 2012 Given a set of n lines and two points of intersection s and t we need to nd shortest path between them. Surveyed the existing results on this problem and its variants and gave an in class Presentation. Posed an open problem which is closely related to the TSP in geometric setting and suggested some approaches. Term paper on Unique Games Conjecture and its applicationsIIT Kanpur Feb 2012 - April 2012 Studied survey papers by Luca Trevisan, Subhash Khot and gave an in class Presentation. Implementation of Efcient Computational Geometry routinesIIT Kanpur Jan 2012 - Feb 2012 Line Sweep Algorithm for nding points of intersections of a set of n line segments. n-dimensional Range Tree for efciently answering range queries on spatial data. Randomised Algorithm for Minimum Enclosing Circle ProblemIIT Kanpur Oct 2011 - Nov 2011 Implementatin of the Linear time Randomised Algorithm for MEC Problem. Experimental evaluation to estimate the running time as a function of input. Brute force Checker and Visualizer to see the progress of algorithm. LEDA C++ Library for Common Geometry Routines.

Stock Price Prediction using Sentiment AnalysisIIT Kanpur Aug 2011 - Nov 2011 Extracted Stock Price Information from Yahoo! Finance for 20 BSE Listed Companies. Extracted Tweets data from Otter and Aggregated it into daily les. Use Linear Regression Based on sentiment scores and some other parameters to predict the price. We were able to predict the prices with directional accuracy of 60%. Used Python for Scripting and MatLab for Implementing Machine Learning Models.

Co-Curricular Acheivements
Member of the team THE WHO that won 1st Prize in Yahoo!s HackU, a 24 hours application development challenge held at IIT Kanpur in August 2012. Won 1st prize in Code of the Day, an Online Programming contest hosted by MNIT Allahabad in Oct 2012. Ranked in Top 10 among Indian coders in Codechef June 2010, February, March, and August 2012 Algorithm Challenge. Among Top 13% of the Programmers in Google CodeJam in 2011, and 2012. World rank in Top 250 of Sphere Online Judge.

Skills
Programming Languages: Procient in C, C++, Python A Familiar with Java, Haskell, Bash, Perl, T-SQL, L TEX Operating Systems: Linux (Ubuntu, Debian, Fedora), Windows XP/Vista/7

Extra Curricular
Volunteer during InterCollege Cultural Fest Oasis 2006. Volunteer during Technical Fest Apogee 2007. Gave Lectures in ACM Training Camp organised by ACA, IIT Kanpur during Oct 1-8 2011.

Positions of Responsibility
Project Forum Incharge - CSA, BITS-Pilani for Academic year 2008-09 Programming Club PG Mentor, IIT Kanpur from April 2012-Present Teaching Assistant, IIT Kanpur from July 2011-Present