Algotech Programming Concept

T(n) = T(n/3) + T(2n/3) + n recursion tree example2 || algotech programming concept

Calculator Using Java Applet/Calculator inJava

T(n) = 3 T(n/4) + n^2 | recursion tree example3 |algotech programming concept

solution | parenthesization of matrix chain multiplication |print optimal solution((a1a2)((a3a4)a5))

T(n) = 9 T(n/3) + n | master method case1 | master theorem case1 |algotech programming concept

getCodeBase() and getDocumentBase() in Java Applet

T(n) = 2 T(n/2) + n | recursion tree example1 |algotech programming concept

T(n) = T(n-a) +T(a)+cn using Recursion Tree method

FileNotFoundException Part-1 in HINDI

T(n) = 2 T(n/4) + √n | master method case2 | master theorem case2 | algotech programming concept

A = 7T(n/2)+n^2 , B = aT(n/4)+n^2

set up of multiple node in a cluster using hadoop /4 four Node Cluster/Distributed computing/GCE

Machine Learning and Types, Activation functions,Neural Network, Deep Learning,SVM, RF,

Inplace and Stable sorting GATE(CSE),UGC-NET(CS)

Print Longest common subsequence| LCS Algorithm execution concept |Algotech Programming Concept

Rotations on Special cases for Unbalanced Tree structure AVL Tree part2 GATE(CSE) UGC NET(CS)

matrix chain multiplication | basic concept you must know about matrix chain multiplication

n, log2n, n^2 , nlog2n , 2^n ,n^3 order of growth numerical |GATE(CSE) |UGC NET(CS)

All 3 cases to insert keys into Red Black Tree in easy way

Insert keys in avl tree 41, 38, 31, 12, 19, 8

installation of cloudera manager on multi node cluster in hadoop using Google Compute Platform

Java Package Part - 1 / Use of Package in Java

JDK V/S JRE OR Java Development Kit V/S Java Runtime Environment

Problem:can not ssh to myinstance on gce gcp on multi node cluster in hadoop

count the number of divide and merge operations in merge sort Gate(cse) ugc net(cs)

Java Package Part - 2 / Use of Package in Java

Get Input from User on Console in Java

10 comparison between binary search and linear search