Computer Science

Functions  A function ( video here ) is a group of statements that together perform a task. Every C++ program has at least one function, which is  main() , and all the most trivial programs can define additional functions. You can divide up your code into separate functions. How you divide up your code among different functions is up to you, but logically the division usually is such that each function performs a specific task. A function  declaration  tells the compiler about a function's name, return type, and parameters. A function  definition  provides the actual body of the function. The C++ standard library provides numerous built-in functions that your program can call. For example, function  strcat()  to concatenate two strings, function  memcpy()  to copy one memory location to another location and many more functions. A function is known with various names like a method or a sub-routine or a procedure etc. Def...

Data Mining Issues   ( Video Here ) Data mining is not an easy task, as the algorithms used can get very complex and data is not always available at one place. It needs to be integrated from various heterogeneous data sources. These factors also create some issues. Here in this tutorial, we will discuss the major issues regarding − Mining Methodology and User Interaction Performance Issues Diverse Data Types Issues The following diagram describes the major issues. Mining Methodology and User Interaction Issues It refers to the following kinds of issues − Mining different kinds of knowledge in databases  − Different users may be interested in different kinds of knowledge. Therefore it is necessary for data mining to cover a broad range of knowledge discovery task. Interactive mining of knowledge at multiple levels of abstraction  − The data mining process needs to be interactive because it allows users to focus the search for patterns, providing and re...

Finite Automaton can be classified into two types −(  Video Here  ) Deterministic Finite Automaton (DFA)  Non-deterministic Finite Automaton (NDFA / NFA) Deterministic Finite Automaton (DFA) In DFA, for each input symbol, one can determine the state to which the machine will move. Hence, it is called  Deterministic Automaton . As it has a finite number of states, the machine is called  Deterministic Finite Machine  or  Deterministic Finite Automaton. Formal Definition of a DFA A DFA can be represented by a 5-tuple (Q, ∑, δ, q 0 , F) where − Q  is a finite set of states. ∑  is a finite set of symbols called the alphabet. δ  is the transition function where δ: Q × ∑ → Q q 0  is the initial state from where any input is processed (q 0  ∈ Q). F  is a set of final state/states of Q (F ⊆ Q). Graphical Representation of a DFA A DFA is represented by digraphs called  state diagram . The ver...

Array (  Video Here  ) C++ provides a data structure,  the array , which stores a fixed-size sequential collection of elements of the same type. An array is used to store a collection of data, but it is often more useful to think of an array as a collection of variables of the same type. Instead of declaring individual variables, such as number0, number1, ..., and number99, you declare one array variable such as numbers and use numbers[0], numbers[1], and ..., numbers[99] to represent individual variables. A specific element in an array is accessed by an index. All arrays consist of contiguous memory locations. The lowest address corresponds to the first element and the highest address to the last element. Declaring Arrays To declare an array in C++, the programmer specifies the type of the elements and the number of elements required by an array as follows − type arrayName [ arraySize ]; This is called a single-dimension array. The  arraySize  mu...