isadoraferrao Goto Github PK

-so2019-grupo-isadoraelucelia

Repositório de arquivos do desenvolvimento do trabalho final de Sistemas Operacionais da pós graduação (2019).

abrigo_animais

Projeto final do curso de Python/Django WomakersCode.

acceleration-dio

acessibilidade

Exemplo de funções de Acessibilidade através de Javascript e JQuery

acessibility-button

adding-and-deleting-vehicles-final

apenasteste

Um exercício pra ser corrigido

applying-texture-to-a-cube

applying-the-while-statement

arithmetic-mean-for-an-undetermined-number-of-notes

arrays

ascending-order

backpropagation

balanced-graphs

bank-account

basic-examples-for-beginners

basic-health-units-database

Basic Health Units (UBS) are the referential gateway to the Unified Health System (SUS). The purpose of these posts is to serve up to 80% of the population's health problems, without the need for referral to hospitals. "BRAZIL. Ministry of Health, 2013". Therefore, the base of Basic Health Units was determined to perform the work of Database I, out of curiosity to know how the database of a system works that is currently so criticized by the population, mainly due to the delay in attendance, another reason was due to the interest in knowing more about the health area where bacharelanders have family members exercising

belonging-to-the-range

binary-search-tree

Full binary search tree, with all functions

binary-tree-that-inserts-and-scrolls-through-a-list.

In the code present in this work, it was implemented a binary tree that inserts and scrolls through a list.

binnavi

BinNavi is a binary analysis IDE that allows to inspect, navigate, edit and annotate control flow graphs and call graphs of disassembled code.

black-scholes---sequential-and-parallel

black-scholes-parallel-

black_scholes

borwein---sequential-and-parallel

borwein_paralelo_sequencial

browsing-reading-and-opening-a-file

bst-for-categories-of-products.

Implement a BST to catalog product categories from an online store (e.g., Submarino, Amazon). Each category has a code and a name. The code is a sequential number. For each category there is a set of products (e.g., 5000 different smartphones). Each product is identified by a code, a name, a manufacturer, model, launch year and price. Each product category must be represented, also, as a BST. In other words, the category tree node value will point to a BST that contains the products of the respective category. The input file, for loading the BSTs, is a CSV file. The default CSV separator is a semicolon (;). However, the user must be able to define any separator for each CSV file, such as "#" and "@". Example input CSV file: Laptop; 12345; Lenovo; 12346; IBM; Model X51; 2014; 1200.00 Laptop; 12347; Latitude; 12348; Dell; Model 21; 2015; 1811.00 Tablet; 12349; iPad; 12350; Apple; II; 2014; 2200.00 Smartphone; 12351; iPhone; 12352; Apple; V; 2014; 3200.00 Scripts to generate input files of any size: Code sample: generation of categories and products Archive Example input file with 200 categories and 300 products per category: Assignment 1: example CSV file (200 categories with 300 products each) Implement the following functions for BSTs: - put (insert new element in the tree) - get (return a pointer to the tree node that contains the searched key) - delete (delete an element from the tree) - contains (check whether the tree contains an X key or not) - size (return the size of a tree, i.e., number of elements below the X key) - min (return the lowest value key) - max (return the key with the highest value) - rank (return the number of elements whose key is less than key X) - height (return the height of the tree) - floor (return the smallest element closest to the X key) - ceiling (return the largest element closest to the X key) - inorder traversal (browse the tree in "inorder" order, i.e., list tree elements in ascending order) What to deliver: a complete version of the work. In other words, the first version of all of the above functions. The user must be able to choose the function through a program execution parameter. Here is the format of the input parameters: put: -p <input_put.csv> get: -g <entrada_get.csv> delete: -d <input_delete.csv> contains: -c <entry_contains.csv> size: -s (prints the size of all trees) min: -m (print the minimum of all trees) max: -M (return the key with the highest value) rank: -R <rank.csv> height: -H (return the height of all trees) floor: -F <entrada_floor.csv> ceiling: -C <entrada_ceiling.csv> opts_sequence: -S <operations_execution_string. example: pgdcM> inorder traversal: -i (browse all trees in "inorder" order, i.e., list tree elements in ascending order) File format entrada_get.csv, entrada_delete.csv, entrada_contains.csv, entrada_rank.csv, entrada_floor.csv, entrada_ceiling.csv: A list containing one "type" and one "key" per line. The type (category or product) and the key are separated by ";". In the case of product, the line contains the category and product information. So there are two types of lines. Lines that only identify one category and lines that identify a category and a product. Example of the contents of the files entrada_contains.csv, entrada_delete.csv, entrada_contains.csv, entrada_rank.csv, entrada_floor.csv, entrada_ceiling.csv: category; 12345 category; 12345; product; 12346 category; 12349 category; 12351 category; 12351; product; 12352 category; 12351; product; 12354 category; 12359; product; 12355 category; 12359; product; 12399 category; 12359; product; 12101 category; 12366 category; 12377 category; 12359; product; 12203 Name: Isadora Garcia Ferrão Registration: 151151387 Name: Sherlon Almeida da Silva Registration: 151150179 * /

cadastro-de-produtos

cadastro-djangosqlite