Vivek Saxena   Powered by Cvitae.org
Vivek Saxena




Vivek Saxena
Undergraduate Student
Contact Information:
Kanpur, UP, 208016, India
 

Frontpage

 

I'm presently a sophmore the Indian Institute Of Technology, Kanpur. I have a diverse range of interests chiefly centered around physics, mathematics and electrical engineering. However, I have a general interest in mathematical sciences, which extends beyond these specific fields.
 
My other interests include music, cricket, tennis and Formula-One. In the past, I have worked on projects in optics, electronics, image processing, robotics and computer algorithms. In my spare time, I pursue some of my more practical hobbies, such as gliding, flight simulation, electronic circuits and aermodelling.
  labmouse.jpg

Resume

last modified 2008-01-17 00:33:16

print CV print CV email CV

CVitae -

VIVEK SAXENA

OBJECTIVE

 
To enrich my knowledge and experience by working on a diverse range of scientific problems as part of my formal education, and pursue a career in scientific research.
  

EDUCATION

05/'06 - 05/'10

Indian Institute Of Technology Kanpur, Electrical Engineering Kanpur, UP, 208016, India
  • CPI: 9.2/10 after 3 semesters

EXPERIENCE

      SKILLS, TECHNOLOGIES & PROJECTS

      Academic Interests (Physics): Quantum Mechanics, Theoretical Physics (High Energy Physics), Quantum Computation and Information, Weather Modeling
      Academic Interests (EE): Microelectronics, Signal Processing, Device Physics, Electronic Measurements
      Programming Languages: C/C++, Java, QuickBASIC
      Scripting Languages: HTML, LaTeX
      Operating Systems: Linux, MS Windows, HP UX

      Projects

      Implementation and Analysis of Data Structures
      Thursday, 17 January 2008

      Computer algorithms for specialized purposes often employ sophisticated data structures. Actual design and implementation involves several tradeoffs, characteristic of engineering design. An improvement in time complexity of a specific operation may be at the expense of improvement in complexity of some other operation(s).

      In this project, we implemented three data structures: the Binary Tree, the Red Black Tree and the van Emde Boas priority queue and compared them based on the number of operations and CPU time taken for basic data structure functions such as insertion, search, and predecessor queries. This project was part of a first level computer science course on algorithms and data structures.

      Read More ...

      Connections

      OFFLINE Dirk Englund
      OFFLINE Ilya Fushman