Mohit Kalra's repositories
Database-Implementation
COP6726 : Database System Implementation
ftp-client-server
An out-band implementation of ftp client server architecture using socket programming in python
atourofcplusplus
tutorials from the book a tour of c++
City-Development
Problem description Wayne Enterprises is developing a new city. They are constructing many buildings and plan to use software to keep track of all buildings under construction in this new city. A building record has the following fields: buildingNum: unique integer identifier for each building. executed_time: total number of days spent so far on this building. total_time: the total number of days needed to complete the construction of the building. The needed operations are: 1. Print (buildingNum) prints the triplet buildingNume,executed_time,total_time. 2. Print (buildingNum1, buildingNum2) prints all triplets bn, executed_tims, total_time for which buildingNum1 <= bn <= buildingNum2. 3. Insert (buildingNum,total_time) where buildingNum is different from existing building numbers and executed_time = 0. In order to complete the given task, you must use a min-heap and a Red-Black Tree (RBT). You must write your own code the min heap and RBT. Also, you may assume that the number of active buildings will not exceed 2000. A min heap should be used to store (buildingNums,executed_time,total_time) triplets ordered by executed_time. You mwill need a suitable mechanism to handle duplicate executed_times in your min heap. An RBT should be used store (buildingNums,executed_time,total_time) triplets ordered by buildingNum. You are required to maintain pointers between corresponding nodes in the min-heap and RBT. Wayne Construction works on one building at a time. When it is time to select a building to work on, the building with the lowest executed_time (ties are broken by selecting the building with the lowest buildingNum) is selected. The selected building is worked on until complete or for 5 days, whichever happens first. If the building completes during this period its number and day of completion is output and it is removed from the data structures. Otherwise, the building’s executed_time is updated. In both cases, Wayne Construction selects the next building to work on using the selection rule. When no building remains, the completion date of the new city is output.
coursera
Coursera is probably the first website to popularise MOOCs. This repository is to retain everything that I learn in my Coursera Courses.
Cplusplus_Specialization
Coursera CPlusPlus Specialization UCSC
cracking-the-coding-interview
cracking-the-coding-interview problems in python and java
DBI3
Phase 3 DBI
DBI4.2
Assignment 4.2 DBI - Query Optimization
DrawForLeetcode
Leetcode Medium Article Drawings
FluentPython
Small python programs for understanding python in depth
gfg
GeeksForGeeks is a popular website with tons of content pertaining to coding. This repository is for practising GFG content.
karumanchi-python
python examples from karumanchi - data structures and algorithms made easy
leet
repo for my leetcode practice
Pattern-Recognition-Spring-2020
Submission repository for Pattern Recognition Spring 2020
python3-bootcamp
udemy python3 bootcamp notes - colt steele
raw
The missing link between spreadsheets and data visualization
SumOfSquares
An interesting problem in arithmetic with deep implications to elliptic curve theory is the problem of finding perfect squares that are sums of consecutive squares. The goal of this first project is to use F# and the actor model to build a good solution to this problem that runs well on multi-core machines.
udemy
Udemy is a popular website for learning. Udemy hosts tons of courses for learning coding. This repository is to retain content of everything that I learn and practice in my Udemy Courses.
welltok-assessment
A tool for calculating total cost of multi-campaign project for a customer