Rajat Jaiswal

I am a Senior Undergraduate in the Department of Computer Science & Engineering at IIT Delhi.

My interests lie in the field of data science and machine learning. I’ve always enjoyed mathematics and its application in solving complex and challenging problems. I have a very keen interest in the financial market.

Email  /  Resume  /  LinkedIn  /  Github

profile photo
Work Experience

Quantitative Analyst, TradeScience August 2020 - Present

I am engaged in technical analysis of derivatives market to design systems based on momentum and volatility of underlying asset. My responsibilities include implementing & backtesting trading strategies, and reviewing trade statistics to optimize strategy performance. It also involves triangulating novel solutions to increase profit, reduce drawdown, for maintaining strong risk-adjusted portfolios.

BigData Experience Labs, Adobe Research
Research Intern, Summer 2020
Hosted by Kuldeep Kulkarni and Sharmila Nangi
Graduate Institute of Biomedical Informatics, Taipei Medical University
Visiting Student, Summer 2019
Hosted by Yu-Chuan Li and Shabbir Syed-Abdul

Here are some selected projects that I have worked on

Advanced RISC Machine based processor

A 32-bit CPU designed for complete ARMv7 instruction set, writtten in Very High Speed Integrated Circuit Hardware Description Language(VHDL), and implemented on Basys3 Field Programmable Gate Array(FPGA) Board

Picture Credit
Traffic Simulator

A C++ simulator for Indian road traffic intersection, using OpenGL for GUI rendering. It supports realistic lane change behavior for Indian traffic. The simulator can be visualized on terminal as well as OpenGL.

Picture Credit
Platform Game

A multi-leveled role-playing based arcade game developed using impact.js. Fun to play for people like me who loved the 8-bit retro world and always look back to the games we played as a child to unwind.

Functional Language Interpreter

A compiler with call-by-name(Krivine Machine) and call-by-value(SECD Machine) semantics, implemented in OCaml. It takes tokens generated from a Lexer to create an Abstract Syntax Tree using recursive Parser.

Picture Credit

Last updated on 23rd September 2020

The template for this website is borrowed from this guy