Discrets Mathematics

Descrição

Mapa Mental sobre Discrets Mathematics, criado por Bernardo Rz em 18-02-2015.
Bernardo Rz
Mapa Mental por Bernardo Rz, atualizado more than 1 year ago
Bernardo Rz
Criado por Bernardo Rz mais de 9 anos atrás
26
1

Resumo de Recurso

Discrets Mathematics
  1. Lenguage of predicate logic
    1. Computer Organization
      1. A computer program is viewed as a Formula. A programming language, with its formal syntax and with the proof rules that define its semantics, is a formal system for which program execution provides only a model. The computers are conceived with the help of logical devices and are programmed in a logical manner.
      2. Programming Lenguage
      3. Core areas of Discrets Mathematics
        1. Knowledge Management (Intelligent Information Systems; Expert Systems; Knowledge Representation; Automated Reasoning; Natural Language Processing etc.)
          1. Database Systems (Data Models: relational, entityrelationship, etc.; Query-Processing Languages: model theory, completeness, consistency, deduction, etc.; Knowledge-Based Systems with incomplete, imperfect and tentative information requiring probabilistic, modal, possibilistic, belief and fuzzy reasoning; Natural Language Interfaces etc.)
            1. Software Engineering (Program Verification; Correctness; Formal Specifications; Formal Design; Requirements, etc.)
              1. Programming Languages/Data Structures (Language Design; Object-Oriented Approaches; Parallel Processing; Logic programming etc.)
                1. Hardware Topics (Circuit Design/Optimization; Hardware Design Languages; Processor verification; Correctness of OS kernel; Language Implementation of given processors etc.)
                2. Examples
                  1. Some applications of graphs and trees
                    1. 1) Neural nets (NN )
                      1. 2)Semantic Nets (SN)
                        1. 3)Bayesian (Causal) Networks (BN)
                          1. 4) MinimumSpanning Trees
                            1. 5) BinaryTrees
                              1. 6) Compression of(stored or transmitted) data using Huffman algorithm
                                1. 7) Creating a totally ordered list and searching items
                                  1. 8) The reverse Polish notation
                                2. Bernardo Ramirez A0120275
                                  1. Roventa, E. Dept. of Comput. Sci. & Eng., York Univ., Toronto, ON Spircu, T.

                                    Semelhante

                                    Mecânica - cinética
                                    Alessandra S.
                                    ATRIBUTOS DE UM LÍDER
                                    willian reis
                                    Ecologia III
                                    Luiz Antonio Lopes
                                    Princípios da Química
                                    GoConqr suporte .
                                    Principais Fórmulas de Física
                                    Luiz Fernando
                                    Controle de Constitucionalidade
                                    GoConqr suporte .
                                    Introdução ao Microsoft Word
                                    Roberto Becker
                                    Redação para Vestibular
                                    Alice Sousa
                                    Absolutismo e Mercantilismo
                                    Professor Junior
                                    Modelos Atômicos
                                    Marcos do Help
                                    Princípios Fundamentais
                                    Lavs Agah