Login/RegisterTechnical Interview Questions and Answers :: Wipro
- Select All
- C
- Java
- C++
- SQL
- Informatica
- WebMethod
- DBMS
- Soft. Engineering
- Operating System
- Data Structure
- Oracle PLSQL
- Finite Automata
- HR Question in TR
- Networking
- a finite set S of N states
- a special start state
- a set of final (or accepting) states
- a set of transitions T from one state to another, labeled with chars in C
71 / 86
No Discussion on this question yet!
72 / 86
Functional dependency is a relationship that exists when one attribute uniquely determines another attribute.
If R is a relation with attributes X and Y, a functional dependency between the attributes is represented as X->Y, which specifies Y is functionally dependent on X. Here X is a determinant set and Y is a dependent attribute. Each value of X is associated precisely with one Y value.
Functional dependency in a database serves as a constraint between two sets of attributes. Defining functional dependency is an important part of relational database design and contributes to aspect normalization.
73 / 86
No Discussion on this question yet!
74 / 86
A finite automaton (FA) is a simple idealized machine used to recognize patterns within input taken from some character set (or alphabet) C. The job of an FA is to accept or reject an input depending on whether the pattern defined by the FA occurs in the input.
A finite automaton consists of:
75 / 86
No Discussion on this question yet!
76 / 86
No Discussion on this question yet!
77 / 86
78 / 86
This is not perfect answer
79 / 86
No Discussion on this question yet!
80 / 86
It ensures Data validity and
