rajgubrele Goto Github PK

followers: 0.0 following: 0.0 repos: 51.0 gists: 0.0

Name: Raj Gubrele

Type: User

Bio: Data Analyst || Machine Learning || Deep Learning || Educational Data Mining || IIT Bombay || IIT Kharagpur || Intelligence Tutoring System

Location: Mumbai

Blog: https://www.linkedin.com/in/raj-gubrele-a168a11a3?lipi=urn%3Ali%3Apage%3Ad_flagship3_profile_view_base_contact_details%3Bie0Y%2F0BHTVWUM5kATCRQeA%3D%3D

Raj Gubrele's Projects

bisection_method

The program in Python to determine the solution of a nonlinear equation using bisection.

combine_december_month_sheet_data

Combine All Sheets in One Sheet December

Cubic spline interpolation is a special case for Spline interpolation that is used very often to avoid the problem of Runge's phenomenon. This method gives an interpolating polynomial that is smoother and has smaller error than some other interpolating polynomials such as Lagrange polynomial and Newton polynomial

data_structure_linked_list

Linked Lists Formation of Linked List,-------> Addition of Linked List at the begening and -------> Addition of Linked List at the ending ------> Addition of Linked list before and after any specific index or data

data_structure_linked_lists_python

Linked Lists Formation of Linked List,-------> Addition of Linked List at the begening and -------> Addition of Linked List at the ending

datalemur_sql_top_5_artists

Assume there are three Spotify tables: artists, songs, and global_song_rank, which contain information about the artists, songs, and music charts, respectively.

euler_method

The Euler method is a first-order method, which means that the local error (error per step) is proportional to the square of the step size, and the global error (error at a given time) is proportional to the step size.

gauss_jorden_method

The Gauss-Jordan Method is similar to Gaussian Elimination, except that the entries both above and below each pivot are targeted (zeroed out). After performing Gaussian Elimination on a matrix, the result is in row echelon form. After the Gauss-Jordan Method, the result is in reduced row echelon form.

gauss_seidel_method

In numerical linear algebra, the Gauss–Seidel method, also known as the Liebmann method or the method of successive displacement, is an iterative method used to solve a system of linear equations

github-slideshow

A robot powered training repository :robot:

hackerrank_ds_2d_array-ds

Hacker Rank --> Data Structure --> 2D Array -DS--> Python3

hackerrank_ds_dynamic_array

Data Structure --> Array --> Dynamic Array Problem --> Python3

hackerrank_ds_left_rotation

Hacker Rank --> Data Structure --> Array --> Left Rotation --> Python

hackerrank_ds_linked_list_print_in_reverse_python

**HackerRank---> DataStructure ---> Linked List ---> Print in Reverse---> Python**

hackerrank_ds_linkedlist_compare_two_linedlist_python

**HackerRank---> DataStructure ---> Linked List ---> Compare two linked lists ---> Python**

hackerrank_ds_linkedlist_cycle_detection_python

**HackerRank---> DataStructure ---> Linked List ---> Cycle Detection---> Python**

hackerrank_ds_linkedlist_delete_a_node_python

**HackerRank---> DataStructure ---> Linked List ---> Delete a Node ---> Python**

hackerrank_ds_linkedlist_delete_duplicate_value_python

**HackerRank---> DataStructure ---> Linked List ---> Delete duplicate-value nodes from a sorted linked lis---> Python**

hackerrank_ds_linkedlist_find-merge-point-of-two-lists_python

**HackerRank---> DataStructure ---> Linked List --->Find Merge Point of Two Lists---> Python**

hackerrank_ds_linkedlist_get_node_value_lists_python

**HackerRank---> DataStructure ---> Linked List ---> Get Node Value lists---> Python**

hackerrank_ds_linkedlist_inserting-a-node-into-a-sorted-doubly-linked-list_python

**HackerRank---> DataStructure ---> Linked List --->inserting a Node Into a Sorted Doubly Linked List---> Python**

hackerrank_ds_linkedlist_inserting-a-node-into-a-sorted-doubly-linked_list_python

**HackerRank---> DataStructure ---> Linked List --->inserting a Node Into a Sorted Doubly Linked List---> Python**

hackerrank_ds_linkedlist_merge_two_sorted_liniked_list_python

**HackerRank---> DataStructure ---> Linked List ---> Merge two sorted linked lists---> Python**

hackerrank_ds_linkedlist_python

HackerRank---> DataStructure ---> Linked List ---> Insert a node at a specific position in a linked list ---> Python

hackerrank_ds_linkedlist_reverse-a-doubly-linked-list_python

**HackerRank---> DataStructure ---> Linked List --->**HackerRank---> DataStructure ---> Linked List --->inserting a Node Into a Sorted Doubly Linked List---> Python**

hackerrank_ds_linkedlist_reverse_a_linked_listpython

HackerRank---> DataStructure ---> Linked List ---> Reverse a linked list---> Python

hackerrank_ds_stack_balanced-brackets_python

**HackerRank---> DataStructure --->Stack--->Balanced Brackets ---> Python**

hackerrank_ds_stack_equal-stack_python

HackerRank---> DataStructure --->Stack--->Equal Stack ---> Python

hackerrank_ds_stack_maximum-element_python

**HackerRank---> DataStructure --->Stack--->Maximum Element --->Python**

rajgubrele Goto Github PK

Raj Gubrele's Projects

Recommend Projects

Recommend Topics

Recommend Org