Parth Barot ParthBarot-BoTreeConsulting

## 1.first_framework_code.py
class Client:

    def coin_list(self):
        return False

    def coin_snapshot_full_by_id(self, coin_id):
        return False

    def coin_snapshot(self, fsym, tsym):
        return False

## ruby_python_golang.md

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                ParthBarot-BoTreeConsulting
                / ruby_python_golang.md
            
            
              Last active
              August 31, 2017 12:06
            
              
                Ruby Vs Python Vs Golang
              
          
    Ruby version

#Recursive version which we will write mostly!
def fibonacciVal(n)
  if n == 0
    return 0
  elsif n == 1
    return 1
  else

  
## video_youtube_integration.rb

#
# Old code, which has a loop and sends API call for each video ID
#

video_ids.map do |video_id|
  Yt::Video.new(id: video_id).select(:snippet, :content_details, :statistics, :status)
end


## linked_list_manipulation.md

      
              2 files
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                ParthBarot-BoTreeConsulting
                / linked_list_manipulation.md
            
            
              Last active
              June 29, 2017 06:13
            
              
                Programming test
              
          
    Problem

Assuming there is an array A = [1,3,-1,4,2], We have the linked list built as following,
A[0] = 1
A[1] = 3
A[3] = 4
A[4] = 2
A[2] = -1

  
## js_integer_to_bytes.js
~$ node
> var calculatedChecksum = 1513135

// Anding an integer with 0xFF leaves only the least significant byte.
// For example, to get the first byte, we can write "<int value> & 0xFF"
// This is typically referred to as "masking"
> var firstByte = calculatedChecksum & 0XFF

// 0XFF00 is hexadecimal, We are masking out the lower byte of your number,
// then bit-shifting all of the bits to the right by 8.

## js_refactor_final_version.js
// Final code
var MayApp = {};
MyApp.Base = {
  data: {
    rules: {
      FirstSet:{
        "0-12": {
          "0-12000":{
            "0-90" :{
              fixedVal: 0.4

## js_refactor_second_version.js

// intermediate code
var MyApp = {};
MyApp.Base = {
  data: {
    rules: {
      FirstSet:{
        "0-12": {
          "0-12000":{
            "0-90" :{

## js_refactor_pseudo_code.vb
DEFINE amount, fixedVal, myDataVal

IF RANGE(0 - 12) INCLUDES myDataVal

  IF RANGE(0,12000) INCLUDES amount

    IF RANGE(0,95) INCLUDES calculatedVal
      RETURN 0.8
    ELSEIF RANGE(95,*) INCLUDES calculatedVal
      RETURN 0.7

## js_refactor_first_version.js
var MyApp = {};

MyApp.Base = {
  getFixedVal: function(){
    //Javascript code before refactoring
    var myDataVal = someCalculationHere();
    var amount =  someInputFieldValue;
    var fixedVal = 0;
    if(myDataVal > 12){
      if(0 < amount && amount <= 12000){

## js_refactor_final_version.js
// Final code
var MayApp = {};
MyApp.Base = {
  data: {
    rules: {
      FirstSet:{
        "0-12": {
          "0-12000":{
            "0-90" :{
              fixedVal: 0.4
	class Client:

	def coin_list(self):
	return False

	def coin_snapshot_full_by_id(self, coin_id):
	return False

	def coin_snapshot(self, fsym, tsym):
	return False

	#
	# Old code, which has a loop and sends API call for each video ID
	#

	video_ids.map do \|video_id\|
	Yt::Video.new(id: video_id).select(:snippet, :content_details, :statistics, :status)
	end
	~$ node
	> var calculatedChecksum = 1513135

	// Anding an integer with 0xFF leaves only the least significant byte.
	// For example, to get the first byte, we can write "<int value> & 0xFF"
	// This is typically referred to as "masking"
	> var firstByte = calculatedChecksum & 0XFF

	// 0XFF00 is hexadecimal, We are masking out the lower byte of your number,
	// then bit-shifting all of the bits to the right by 8.
	// Final code
	var MayApp = {};
	MyApp.Base = {
	data: {
	rules: {
	FirstSet:{
	"0-12": {
	"0-12000":{
	"0-90" :{
	fixedVal: 0.4

	// intermediate code
	var MyApp = {};
	MyApp.Base = {
	data: {
	rules: {
	FirstSet:{
	"0-12": {
	"0-12000":{
	"0-90" :{
	DEFINE amount, fixedVal, myDataVal

	IF RANGE(0 - 12) INCLUDES myDataVal

	IF RANGE(0,12000) INCLUDES amount

	IF RANGE(0,95) INCLUDES calculatedVal
	RETURN 0.8
	ELSEIF RANGE(95,*) INCLUDES calculatedVal
	RETURN 0.7
	var MyApp = {};

	MyApp.Base = {
	getFixedVal: function(){
	//Javascript code before refactoring
	var myDataVal = someCalculationHere();
	var amount = someInputFieldValue;
	var fixedVal = 0;
	if(myDataVal > 12){
	if(0 < amount && amount <= 12000){