Discrets Mathematics

Descripción

Mapa Mental sobre Discrets Mathematics, creado por Bernardo Rz el 18/02/2015.
Bernardo Rz
Mapa Mental por Bernardo Rz, actualizado hace más de 1 año
Bernardo Rz
Creado por Bernardo Rz hace más de 9 años
26
1

Resumen del 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.
                                    Mostrar resumen completo Ocultar resumen completo

                                    Similar

                                    Trigonometría
                                    Ana Priego
                                    Elementos Básicos de Ingeniería Ambiental
                                    Evilus Rada
                                    PALABRAS A-...
                                    JL Cadenas
                                    Tablas de multiplicar
                                    Carmen Giralda
                                    Arte del Renacimiento
                                    maya velasquez
                                    Past Simple of Irregular Verbs
                                    Ana María Lara díez
                                    Mapa Conceptual, Seguridad Social en Colombia
                                    mafe__09
                                    LA REVOLUCIÓN FRANCESA
                                    ROSA MARIA ARRIAGA
                                    Metodos de separacion de mezclas
                                    elkin parada
                                    DIPTONGO O HIATO
                                    Silvia Rial Martínez