POC of Suscription Board (Dojo,Dojo mobile, Spring MVC, JPA, Hibernate, Mysql)

You can find a Proof of concept of a "suscription board project", using: Dojo, Dojo mobile, Spring, JPA, Hibernate, Mysql and Amazon AWS technologies, at:

http://discussion.puertocerouno.net

Project now supports:

  • File attachments for discussion and replies

Regards.

Comments

Post a Comment

Popular posts from this blog

Algorithms: Fibonacci numbers, recursive and Dynamic Programing solution (C/C++)

For the Fibonnacci serie that is described like follows: Fibo(0) = 0; Fibo(1)= 1; (base cases) .... Fibo(n) = Fibo(n-1)+Fibo(n-2) Thus: Fibo(2) = 1 + 0 = 1; Fibo(3) = 1 + 1 = 2;... This code computes N term of a Fibonacci serie, using 2 algorithmic techniques: Recursive and Rec-DProgramming, it also measures performance time. fibonacci.h #ifndef FIBONACCI-NUMBER_H_INCLUDED #define FIBONACCI-NUMBER_H_INCLUDED #include #include #include using namespace std; //Fibonnacci recursive int fiboRec(int n){ if(n==0) return 0; if(n (end - start).count() =0 && second>=0) return dp[n] = first + second; else return -6; } int launcherFiboDP(int k) { //dp = (int *) calloc( k+1, sizeof(*dp)); memset(dp, -6, sizeof(dp)); int n = k; ////// auto start = chrono::steady_clock::now(); int r = fiboDP(n); auto end = chrono::steady_clock::now(); ////// cout (end - start).count() > n; cout main.h #include "fibonacci.h...
Read more

Algorithms: N-Queens problem Backtracking technique, (OO/C++)

N-Queens problem consist into place N Queens on a chess board so that any of the queens is able to kill anyother. (Move: Horizontal, Diagonal). To find the solution we use Backtracking technique , code is also documented. nqueens.h #ifndef NQUEENS_H_INCLUDED #define NQUEENS_H_INCLUDED #include //Abstract class using namespace std; class NBacktracking { public: NBacktracking( int n, int defValue){ N = n; defVal = defValue; //board = this->generateBoard(); ld = new int[n*n]; rd = new int[n*n]; cl = new int[n*n]; } virtual ~NBacktracking(){} virtual bool solve(){} virtual bool solveUtil(int **board,int level){} int** generateBoard(){ int **b = new int*[N]; for(int i = 0; i //NQueens problem class NQueens : public NBacktracking { public: NQueens(int n,int defValue):NBacktracking(n,defValue){} virtual ~NQueens() {} virtual bool solve(); virtual bool solveUtil(int **board, int col); virtual void printSolution...
Read more