This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# Criado por: profa. Divani Barbosa Gavinier | |
# Curriculo Lattes: http://lattes.cnpq.br/8503400830635447 | |
# divanibarbosa@gmail.com | |
def empty(pilha): #verifica se pilha está vazia | |
return len(pilha) == 0 | |
def push(pilha,item): #adiciona itens na pilha | |
pilha.append(item) | |
def pop(pilha): #remove itens da pilha | |
if empty(pilha): |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# Criado por: profa. Divani Barbosa Gavinier | |
# Curriculo Lattes: http://lattes.cnpq.br/8503400830635447 | |
# divanibarbosa@gmail.com | |
class Vetor: | |
def __init__(self): | |
self.vetor = [] | |
self.n = 0 | |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# Criado por: profa. Divani Barbosa Gavinier | |
# Curriculo Lattes: http://lattes.cnpq.br/8503400830635447 | |
# divanibarbosa@gmail.com | |
class Lista: | |
def __init__(self): | |
self.lista=[] | |
def vazio(self): #verifica se lista está vazia |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# Criado por: profa. Divani Barbosa Gavinier | |
# Curriculo Lattes: http://lattes.cnpq.br/8503400830635447 | |
# divanibarbosa@gmail.com | |
#Programa 1 | |
#imprimindo pagina na tela | |
import urllib.request | |
pagina=urllib.request.urlopen('http://beans.itcarlow.ie/prices.html') | |
texto=pagina.read().decode('utf8') | |
print (texto) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* Criado por: profa. Divani Barbosa Gavinier | |
Curriculo Lattes: http://lattes.cnpq.br/8503400830635447 | |
divanibarbosa@gmail.com | |
*/ | |
import java.io.*; // pacote contem classe Scanner | |
import java.util.*; // pacote contem System.in | |
import java.lang.*; | |
class No { | |
public double item; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* Arvore Binaria em Java (insere, apaga, busca, caminha) | |
Criado por: profa. Divani Barbosa Gavinier | |
Curriculo Lattes: http://lattes.cnpq.br/8503400830635447 | |
divanibarbosa@gmail.com | |
*/ | |
class No { | |
long item; | |
No dir; | |
No esq; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// Tabela HASH com tratamento de colisões LINEAR em C | |
// profa. Divani Barbosa | |
// Curriculo Lattes: http://lattes.cnpq.br/8503400830635447 | |
// Ultima atualização 18/07/2017 | |
// divanibarbosa@gmail.com | |
#include <stdio.h> | |
#include <stdlib.h> | |
#define TAM_MAX 7 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// Tabela HASH com tratamento de colisões do tipo lista | |
// Criado por: profa. Divani Barbosa Gavinier | |
// Curriculo Lattes: http://lattes.cnpq.br/8503400830635447 | |
// divanibarbosa@gmail.com | |
#include <iostream> | |
#include <math.h> | |
using namespace std; | |
//////////////////////////////////////////////// | |
struct NO { |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// HeapSort em C++ usando Classe | |
// Criado por: profa. Divani Barbosa Gavinier | |
// Curriculo Lattes: http://lattes.cnpq.br/8503400830635447 | |
// divanibarbosa@gmail.com | |
#include <iostream> | |
using namespace std; | |
class Heap { | |
private: int *vHeap, tam_max, n; | |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// Criado por: profa. Divani Barbosa Gavinier | |
// Curriculo Lattes: http://lattes.cnpq.br/8503400830635447 | |
// divanibarbosa@gmail.com | |
#include <stdio.h> | |
#include <stdlib.h> | |
#define MAX 10 // quantidade maxima de Nos | |
/////////////////////////////////////// | |
// VARIAVEIS GLOBAL PILHA | |
int itens[MAX], topo, tam; |
OlderNewer