592, Soda Hall,
University of California-Berkeley,
CA - 94720
Department of Computer Science,
University of California, Berkeley
Department of Computer Science and Engineering,
Indian Institute of Technology (IIT), Kanpur, India
(September 1997 - May 2001)
Overall GPA: 4.00
In this thesis, we concentrated on the feasibility of finding approximate
solutions to the Query Optimization problem of database systems. We
proved that finding approximate solutions to the Query Optimization
problem (by an exponential factor) is NP complete. To the best of our
knowledge, this was the first inapproximabilty result in Query Optimization.
proving the inapproximability result, we also gave some heuristics
for finding good solutions to the problem.
This thesis was adjudged
the best undergraduate thesis in Computer Science and Engineering Department,
IIT Kanpur for the year 2001.
Received the President's Gold Medal 2001 award for Best Academic
Performance in the Graduating Class in All Disciplines of the Undergraduate
Programmes at IIT Kanpur (in May 2001).
Received the General Proficiency Silver Medal award for Best
Academic Performance in the Graduating Class in Computer Science and Engineering
discipline at IIT Kanpur (in May 2001).
Received Proficiency award for Best Project work (final year thesis)
in Computer Science and Engineering discipline at IIT Kanpur (in May 2001).
Received National Talent Search Scholarship awarded by the Government
of India. (from 1995-2001).
Indian National Mathematics Olympiad (INMO) awardee, 1995. INMO
is a nationwide examination held by National Board of Higher Mathematics
Received Dr. V. Rajaraman Scholarship for excellent academic performance
at IIT Kanpur (for the academic year 1999-2000).
Received Notional Prize for Academic Excellence for the years 1997-98,
1998-99 and 1999-2000 in I.I.T-Kanpur.
Was ranked 2nd in I.I.T Joint Entrance Examination 1997 held
nationwide. in India.
Was ranked 1st in West Bengal Joint Entrance Examination for selection
to Engineering colleges in the state of West Bengal, India.
Randomness and Computation(CS271)
Mathematical and Computational methods in Molecular Biology (MTH 195)
Relevant Undergraduate Coursework
Data Structures, Computer Algorithms, Computer Organization, Operating
Systems, Programming Tools and Techniques, Principles of Programming
Languages, Computer Networks, Theory of Computation, Principles of Compiler
Design, Principles of Database Systems, Advanced Computer Networks, Computer
Architecture, Advanced Compiler Optimization, Fundamentals of Interactive
Computer Graphics, Parallel Computing, Randomized Algorithms, Software
Design for High Performance Architectures .
Mathematics 1, Mathematics 2, Mathematics 3, Discrete Mathematics,
Linear Algebra, Set Theory and Logic, Model Theory.
PROGRAMMING SKILLS AND EXPERIENCE
Summer Internship at TIFR, Mumbai from May-July 2001. Worked on theoretical
aspects of modelling mobility. Telescript is a commercial
language for mobile computationwhereas Ambient Calculus is
a model for describing mobility. We worked on embedding various functions
of Telescript language in Ambient Calculus
Explicit Congestion Notifiication(ECN) in TCP/IP: This term
paper was done as part of the course Advanced Computer Networks.
The aim of the paper was a critical survey of the various protocols which
fall under this field.
Register Allocation Techniques in Compilers: This term paper was
part of the course Advanced Compiler Optimization. The aim
of the paper was a survey of the various register allocation techniques
especially those based on graph coloring.
Pseudorandom Generators: This term paper was part of the
course Randomized Algorithms at IIT Kanpur. The aim of the
term paper was to describe the application of pseudo-random generators
in proving that Steve's Class(SC) is a superset of the class BPSPACE(logn).
Routing Protocols in MANETs: This term paper was part of the course
Computing. This aim of the term paper was a survey of the various
routing protocols for Mobile Adhoc Networks.
A Tutorial (with GUI) on Computational Geometry & Dynamic Programming
This project was done as part of the requirement of the course Computer
Algorithms and was implemented in Java.
Simulating Human Motion: It was implemented in OpenGL. Many additional
features like shadows and reflections were implemented.
Yacc(Yet another Compiler Compiler) Tool : It
was implemented in C and was done in a group of three. We almost implemented
all the features of Yacc.
Implementation of part of MS-DOS filesystem on Linux OS.
Specifying instructions of MIPS-R10000 in Sim-nML : Sim-nML
is a language for specifying uniprocessor instructions.
Platforms: Linux, Solaris, Windows, DOS
C: 4 years experience (1997 onwards)
Java: 3 years experience (1998 onwards)
C++, Perl, Pascal, ML, Prolog, 80x86 Assembly Language
Other Tools proficient in: SQL, Flex, Yacc, OpenGL, CGI Scripts,