https://aularibit.cat/https://aularibit.cat/ajudahttps://aularibit.cat/contactehttps://aularibit.cat/edahttps://aularibit.cat/eda/analisi-d-algorismeshttps://aularibit.cat/eda/analisi-d-algorismes/analisi-asimptoticahttps://aularibit.cat/eda/analisi-d-algorismes/consolidaciohttps://aularibit.cat/eda/analisi-d-algorismes/cost-d-un-algorismehttps://aularibit.cat/eda/analisi-d-algorismes/cost-dels-algorismes-iteratiushttps://aularibit.cat/eda/analisi-d-algorismes/recurrencies-i-teorema-mestrehttps://aularibit.cat/eda/cerca-exhaustivahttps://aularibit.cat/eda/cerca-exhaustiva/backtrackinghttps://aularibit.cat/eda/cerca-exhaustiva/branch-and-boundhttps://aularibit.cat/eda/cerca-exhaustiva/consolidaciohttps://aularibit.cat/eda/cues-de-prioritathttps://aularibit.cat/eda/cues-de-prioritat/consolidaciohttps://aularibit.cat/eda/cues-de-prioritat/heapshttps://aularibit.cat/eda/cues-de-prioritat/heapsorthttps://aularibit.cat/eda/cues-de-prioritat/tad-cua-de-prioritathttps://aularibit.cat/eda/diccionarishttps://aularibit.cat/eda/diccionaris/arbres-avlhttps://aularibit.cat/eda/diccionaris/arbres-binaris-de-cercahttps://aularibit.cat/eda/diccionaris/consolidaciohttps://aularibit.cat/eda/diccionaris/tad-diccionarihttps://aularibit.cat/eda/diccionaris/taules-de-hashhttps://aularibit.cat/eda/dividir-i-vencerhttps://aularibit.cat/eda/dividir-i-vencer/cerca-binariahttps://aularibit.cat/eda/dividir-i-vencer/consolidaciohttps://aularibit.cat/eda/dividir-i-vencer/esquema-de-dividir-i-vencerhttps://aularibit.cat/eda/dividir-i-vencer/exponenciacio-rapida-i-karatsubahttps://aularibit.cat/eda/dividir-i-vencer/mergesorthttps://aularibit.cat/eda/dividir-i-vencer/quicksorthttps://aularibit.cat/eda/dividir-i-vencer/seleccio-i-medianahttps://aularibit.cat/eda/grafshttps://aularibit.cat/eda/grafs/bfs-i-dfshttps://aularibit.cat/eda/grafs/consolidaciohttps://aularibit.cat/eda/grafs/dijkstrahttps://aularibit.cat/eda/grafs/grafs-representaciohttps://aularibit.cat/eda/grafs/ordenacio-topologicahttps://aularibit.cat/eda/grafs/prim-i-kruskalhttps://aularibit.cat/eda/intractabilitathttps://aularibit.cat/eda/intractabilitat/classes-p-i-nphttps://aularibit.cat/eda/intractabilitat/consolidaciohttps://aularibit.cat/eda/intractabilitat/reduccions-i-np-completesahttps://aularibit.cat/ichttps://aularibit.cat/ic/circuits-combinacionalshttps://aularibit.cat/ic/circuits-combinacionals/blocs-combinacionalshttps://aularibit.cat/ic/circuits-combinacionals/circuits-aritmeticshttps://aularibit.cat/ic/circuits-combinacionals/consolidaciohttps://aularibit.cat/ic/circuits-combinacionals/portes-logiques-i-algebra-de-boolehttps://aularibit.cat/ic/circuits-combinacionals/sintesi-de-circuits-combinacionalshttps://aularibit.cat/ic/circuits-sequencialshttps://aularibit.cat/ic/circuits-sequencials/automats-de-moorehttps://aularibit.cat/ic/circuits-sequencials/biestableshttps://aularibit.cat/ic/circuits-sequencials/consolidaciohttps://aularibit.cat/ic/circuits-sequencials/registreshttps://aularibit.cat/ic/llenguatge-maquina-i-assembladorhttps://aularibit.cat/ic/llenguatge-maquina-i-assemblador/codificacio-d-instruccionshttps://aularibit.cat/ic/llenguatge-maquina-i-assemblador/consolidaciohttps://aularibit.cat/ic/llenguatge-maquina-i-assemblador/joc-d-instruccionshttps://aularibit.cat/ic/llenguatge-maquina-i-assemblador/programacio-en-assembladorhttps://aularibit.cat/ic/memoria-i-entrada-sortidahttps://aularibit.cat/ic/memoria-i-entrada-sortida/consolidaciohttps://aularibit.cat/ic/memoria-i-entrada-sortida/entrada-i-sortidahttps://aularibit.cat/ic/memoria-i-entrada-sortida/memoriahttps://aularibit.cat/ic/processadorhttps://aularibit.cat/ic/processador/consolidaciohttps://aularibit.cat/ic/processador/unitat-de-controlhttps://aularibit.cat/ic/processador/unitat-de-proces-especificahttps://aularibit.cat/ic/processador/unitat-de-proces-generalhttps://aularibit.cat/ic/representacio-de-la-informaciohttps://aularibit.cat/ic/representacio-de-la-informacio/consolidaciohttps://aularibit.cat/ic/representacio-de-la-informacio/enters-en-complement-a-2https://aularibit.cat/ic/representacio-de-la-informacio/naturals-en-binarihttps://aularibit.cat/ic/representacio-de-la-informacio/sistemes-de-numeraciohttps://aularibit.cat/laboratorihttps://aularibit.cat/parhttps://aularibit.cat/par/arquitectures-paral-leleshttps://aularibit.cat/par/arquitectures-paral-leles/consolidaciohttps://aularibit.cat/par/arquitectures-paral-leles/numa-amb-directorishttps://aularibit.cat/par/arquitectures-paral-leles/politica-first-touchhttps://aularibit.cat/par/arquitectures-paral-leles/politiques-d-escriptura-i-mecanismes-de-coherenciahttps://aularibit.cat/par/arquitectures-paral-leles/problema-de-la-coherencia-de-cachehttps://aularibit.cat/par/arquitectures-paral-leles/resum-tipus-d-arquitectures-multiprocessadorhttps://aularibit.cat/par/arquitectures-paral-leles/sincronitzacio-de-baix-nivellhttps://aularibit.cat/par/arquitectures-paral-leles/uma-smp-amb-snoopinghttps://aularibit.cat/par/descomposicio-de-dadeshttps://aularibit.cat/par/descomposicio-de-dades/consolidaciohttps://aularibit.cat/par/descomposicio-de-dades/descomposicions-2dhttps://aularibit.cat/par/descomposicio-de-dades/estrategies-geometriqueshttps://aularibit.cat/par/descomposicio-de-dades/objectius-de-la-descomposicio-de-dadeshttps://aularibit.cat/par/descomposicio-de-dades/padding-contra-el-false-sharinghttps://aularibit.cat/par/descomposicio-de-dades/padding-en-matriushttps://aularibit.cat/par/descomposicio-de-tasqueshttps://aularibit.cat/par/descomposicio-de-tasques/consolidaciohttps://aularibit.cat/par/descomposicio-de-tasques/dependencies-en-openmphttps://aularibit.cat/par/descomposicio-de-tasques/descomposicio-iterativa-de-bucleshttps://aularibit.cat/par/descomposicio-de-tasques/descomposicio-recursivahttps://aularibit.cat/par/descomposicio-de-tasques/instruccions-basiques-d-openmphttps://aularibit.cat/par/descomposicio-de-tasques/models-d-execucio-tasques-implicites-i-expliciteshttps://aularibit.cat/par/descomposicio-de-tasques/privacitat-de-variableshttps://aularibit.cat/par/descomposicio-de-tasques/protegir-problemes-de-concurrenciahttps://aularibit.cat/par/descomposicio-de-tasques/regio-paral-lelahttps://aularibit.cat/par/introduccio-al-paral-lelismehttps://aularibit.cat/par/introduccio-al-paral-lelisme/abstraccio-del-codi-en-tasqueshttps://aularibit.cat/par/introduccio-al-paral-lelisme/consolidaciohttps://aularibit.cat/par/introduccio-al-paral-lelisme/elements-de-l-execucio-paral-lelahttps://aularibit.cat/par/introduccio-al-paral-lelisme/execucio-sequencial-vs-paral-lelahttps://aularibit.cat/par/introduccio-al-paral-lelisme/inici-del-paral-lelismehttps://aularibit.cat/par/introduccio-al-paral-lelisme/models-d-execuciohttps://aularibit.cat/par/introduccio-al-paral-lelisme/problemes-del-paral-lelismehttps://aularibit.cat/par/mesurar-el-paral-lelismehttps://aularibit.cat/par/mesurar-el-paral-lelisme/consolidaciohttps://aularibit.cat/par/mesurar-el-paral-lelisme/construccio-d-un-task-dependence-graphhttps://aularibit.cat/par/mesurar-el-paral-lelisme/escalabilitathttps://aularibit.cat/par/mesurar-el-paral-lelisme/fraccio-paral-lelitzable-i-llei-d-amdahlhttps://aularibit.cat/par/mesurar-el-paral-lelisme/granularitathttps://aularibit.cat/par/mesurar-el-paral-lelisme/memoria-distribuida-i-cost-de-compartir-dadeshttps://aularibit.cat/par/mesurar-el-paral-lelisme/overheadshttps://aularibit.cat/privacitathttps://aularibit.cat/pro1https://aularibit.cat/pro1/estructures-de-controlhttps://aularibit.cat/pro1/estructures-de-control/condicionalshttps://aularibit.cat/pro1/estructures-de-control/consolidaciohttps://aularibit.cat/pro1/estructures-de-control/iteracionshttps://aularibit.cat/pro1/estructures-de-control/recorregut-i-cerca-en-sequencieshttps://aularibit.cat/pro1/funcions-i-procedimentshttps://aularibit.cat/pro1/funcions-i-procediments/consolidaciohttps://aularibit.cat/pro1/funcions-i-procediments/disseny-descendenthttps://aularibit.cat/pro1/funcions-i-procediments/funcionshttps://aularibit.cat/pro1/funcions-i-procediments/procediments-i-pas-per-referenciahttps://aularibit.cat/pro1/matrius-i-tupleshttps://aularibit.cat/pro1/matrius-i-tuples/consolidaciohttps://aularibit.cat/pro1/matrius-i-tuples/matriushttps://aularibit.cat/pro1/matrius-i-tuples/tupleshttps://aularibit.cat/pro1/primers-programeshttps://aularibit.cat/pro1/primers-programes/algorismes-i-programeshttps://aularibit.cat/pro1/primers-programes/consolidaciohttps://aularibit.cat/pro1/primers-programes/entrada-i-sortidahttps://aularibit.cat/pro1/primers-programes/variables-tipus-i-expressionshttps://aularibit.cat/pro1/recursivitathttps://aularibit.cat/pro1/recursivitat/consolidaciohttps://aularibit.cat/pro1/recursivitat/disseny-recursiuhttps://aularibit.cat/pro1/recursivitat/funcions-recursiveshttps://aularibit.cat/pro1/vectorshttps://aularibit.cat/pro1/vectors/algorismes-d-ordenaciohttps://aularibit.cat/pro1/vectors/cerca-en-vectorshttps://aularibit.cat/pro1/vectors/consolidaciohttps://aularibit.cat/pro1/vectors/vectorshttps://aularibit.cat/pro2https://aularibit.cat/pro2/arbreshttps://aularibit.cat/pro2/arbres/arbres-binarishttps://aularibit.cat/pro2/arbres/arbres-generalshttps://aularibit.cat/pro2/arbres/consolidaciohttps://aularibit.cat/pro2/arbres/recorreguts-d-arbreshttps://aularibit.cat/pro2/disseny-iteratiuhttps://aularibit.cat/pro2/disseny-iteratiu/consolidaciohttps://aularibit.cat/pro2/disseny-iteratiu/correctesa-de-programes-iteratiushttps://aularibit.cat/pro2/disseny-iteratiu/esquemes-de-recorregut-i-de-cercahttps://aularibit.cat/pro2/disseny-iteratiu/invariantshttps://aularibit.cat/pro2/disseny-recursiuhttps://aularibit.cat/pro2/disseny-recursiu/consolidaciohttps://aularibit.cat/pro2/disseny-recursiu/correctesa-de-programes-recursiushttps://aularibit.cat/pro2/disseny-recursiu/de-recursiu-a-iteratiuhttps://aularibit.cat/pro2/disseny-recursiu/immersio-i-generalitzaciohttps://aularibit.cat/pro2/especificacio-i-programacio-orientada-a-objecteshttps://aularibit.cat/pro2/especificacio-i-programacio-orientada-a-objectes/classes-i-objectes-a-chttps://aularibit.cat/pro2/especificacio-i-programacio-orientada-a-objectes/consolidaciohttps://aularibit.cat/pro2/especificacio-i-programacio-orientada-a-objectes/disseny-modularhttps://aularibit.cat/pro2/especificacio-i-programacio-orientada-a-objectes/especificacio-pre-posthttps://aularibit.cat/pro2/especificacio-i-programacio-orientada-a-objectes/tipus-abstractes-de-dadeshttps://aularibit.cat/pro2/estructures-de-dades-linealshttps://aularibit.cat/pro2/estructures-de-dades-lineals/consolidaciohttps://aularibit.cat/pro2/estructures-de-dades-lineals/cueshttps://aularibit.cat/pro2/estructures-de-dades-lineals/llistes-i-iteradorshttps://aularibit.cat/pro2/estructures-de-dades-lineals/pileshttps://aularibit.cat/pro2/implementacio-d-estructures-amb-puntershttps://aularibit.cat/pro2/implementacio-d-estructures-amb-punters/arbres-amb-puntershttps://aularibit.cat/pro2/implementacio-d-estructures-amb-punters/consolidaciohttps://aularibit.cat/pro2/implementacio-d-estructures-amb-punters/llistes-doblement-enllacadeshttps://aularibit.cat/pro2/implementacio-d-estructures-amb-punters/memoria-dinamica-i-puntershttps://aularibit.cat/pro2/implementacio-d-estructures-amb-punters/piles-i-cues-enllacadeshttps://aularibit.cat/projectehttps://aularibit.cat/RogeR_Bitlloch