lahat ng IT terminology

Question 1

The branch of mathematics dealing with objects that can assume

Answer 1

DICRETE MATHEMATICS

Question 2

Students must understand mathematical reasoning in order to read, comprehend and construct mathematical arguments.

Answer 2

Mathematical Reasoning

Question 3

An important problem-solving skill is the ability to count or enumerate objects; it includes the discussion of basic techniques of counting.

Answer 3

Combinatorial Analysis

Question 4

A course in discrete mathematics should teach students how to work with discrete structures, which are the abstract mathematical structures used to represent discrete objects and relationships between these objects.

Answer 4

Discrete Structure

Question 5

Certain classes of problems are solved by the specification of an algorithm. After an algorithm has been described, a computer program can be constructed implementing it.

Answer 5

Algorithmic Thinking

Question 6

Discrete mathematics has applications to almost every conceivable area of study. There are many applications to computer science and data networking in this course.

Answer 6

Application and Modeling

Question 7

is, roughly speaking, math based on the continuous number line, or the real numbers. The defining quality of it is that given any two numbers, you can always find another number between them - in fact, you can always find an

Answer 7

Continuous Mathematics

Question 8

you’re working with distinct values - given any two points in discrete math, there aren’t an infinite number of points between them.

Answer 8

Discrete Mathematics

Question 9

is a part of logic which deals with statements that are either true or false (but not both)

Answer 9

Propositional Logic

Question 10

is the study of the principles and methods used in distinguishing valid arguments from those that are invalid. It is the basis of all mathematical reasoning and of all automated reasoning. It has practical applications to the design of computing machines, to the specification of systems, to artificial intelligence, to computer programming, to program languages, and other areas of computer science.

Answer 10

Logic

Question 11

is a declarative sentence (that is, a sentence that declares a fact) that is either true or false.

Answer 11

Proposition

Question 12

The basic building block in logic is the statement, also referred to as a proposition. A statement is a declarative sentence which can only be either true or false.

Answer 12

Simple Statements

Question 13

The combination of two or more simple statements is a compound statement, or compound proposition.

Answer 13

Compound Statement

Question 14

is a declarative sentence that can be True (1) or False (0)

Answer 14

Statement

Question 15

Are Question, Imperatives

Answer 15

Not a Statement

Question 16

Since a statement can only be true or false, the values of a statement can be represented by a truth table. Using the variables p and q to represent statements, and letting T and F stand for true and false respectively yields table 1, a truth table.

Answer 16

Truth tables

Question 17

Since a statement can only be true or false, the values of a statement can be represented by a truth table. Using the variables p and q to represent statements, and letting T and F stand for true and false respectively yields table 1, a truth table.

Answer 17

Symbols and Statement

Question 18

The negation of a true statement is a false statement and the negation of a false statement is a true statement

Answer 18

Negating Statements