Get Off-Campus Placement Jobs Info !!!
Programs asked in Mettl Coding Round
Click To Practce List of Programs asked in Nagarro !!!

Technical Interview Questions and Answers :: Wipro

238.23K

Tot. Mock Test: 20


Total Qs: 84+

  •  Select All
  •  C
  •  Java
  •  C++
  •  SQL
  •  Informatica
  •  WebMethod
  •  DBMS
  •  Soft. Engineering
  •  Operating System
  •  Data Structure
  •  Oracle PLSQL
  •  Finite Automata
  •  HR Question in TR
  •  Networking

    71 / 84

    What are the different levels in programming languages.
    Answer:

    No Discussion on this question yet!

    Please Login First :

    72 / 84

    What is Functional Dependency?
    Answer:

    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.

    Please Login First :

    73 / 84

    Explain the each passes after each iteration using bubble sort for below. 43, 23, 1, 45, 78,7,9,98
    Answer:

    No Discussion on this question yet!

    Please Login First :

    74 / 84

    what is finite automata?
    Answer:

    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:




    • 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

    Please Login First :

    75 / 84

    What are the types of finite automata?
    Answer:

    No Discussion on this question yet!

    Please Login First :

    76 / 84

    What is the difference between the strings and the words of a language?
    Answer:

    No Discussion on this question yet!

    Please Login First :

    77 / 84

    What is the difference between an Alphabet and an element of a set. Whether Alphabet is an element of a set or it is a set itself?
    Answer:

    Please Login First :

    78 / 84

    What is the difference between FA , TG , GTG. ?
    Answer:



    • n Finite Automata transitions are marked with single letter of alphabet. In Transition Graph, they can be marked with letters or strings (combination of letters).




    • In Finite Automata states transition are shown for all letters of given alphabet. In Transition Graph, it does not necessarily shows transition for all letters.




    • Strings transitions can be showed with TGs but impossible with FAs.




    • In GTG transition edges are labelled about RE but in TG edges are labeled with strings.



    Please Login First :

    79 / 84

    Make a FA which will accept only 3 strings 110.
    Answer:

    No Discussion on this question yet!

    Please Login First :

    80 / 84

    What is acid property in SQL Server?
    Answer:

    No Discussion on this question yet!

    Please Login First :


Most Frequent Qs.