GitHub Portfolio (Software engineering-feature proposal)

Description: we want to allow Github "Admin users" to create their Portfolio (s)" from their selected git url repositories. At first there would be a "Current" portfolio composed by many gits. It would be desirable to have the possibility of easy download (a batch process would create a macro link).

UML design:

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: Backpack problem, Greedy , Dynamic Programming techniques (C++)

This example shows an OO approach to the backpack (rumsack) problem, it implements different techniques (greedy, dynamic programming), it also generates random items and backpack's capacity. backpack.h #ifndef BACKPACK_H_INCLUDED #define BACKPACK_H_INCLUDED #include #include #include #include using namespace std; //A backpack Item class Item { public: Item(double w, double b):_weight(w),_benefit(b){ if(_weight==0) throw -100; } virtual ~Item() {} void setWeight(double w) { _weight = w; } void setBenefit(double b) { _benefit = b;} double getRatio(){ return _benefit/_weight; } double _weight; double _benefit; double _ratio; }; class Backpack { public: Backpack(double mw) { _maxWeight = mw; _items = new vector ; _totBenefit = 0; _currentWeight = 0; } virtual ~Backpack() {} virtual void computeAddItems(vector &items) { //In this case we use raw algorithm double delt...
Read more

Top common mistakes of Java developers && Common mistakes in C++ (for Java developers)

Top common mistakes for Java developers Reference to the article 1: Neglecting Existing Libraries 2: Missing the ‘break’ Keyword in a Switch-Case Block 3: Forgetting to Free Resources 4: Memory Leaks 5: Excessive Garbage Allocation 6: Using Null References without Need 7: Ignoring Exceptions 8: Concurrent Modification Exception 9: Breaking Contracts 10: Using Raw Type Instead of a Parameterized One Top common mistakes for Java developers when programming C++ Reference to the article 1: Type conversion rules 2: Memory management 3: Deterministic destruction 4: Exception handling
Read more