Scribd Logo
Upload

Welcome to Scribd!

  • 10 views

    Technical Questions - C# (4)

    Uploaded by

    Tsuna Sawada

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    Technical Questions - C# (4)

    Uploaded by

    Tsuna Sawada
    10 views3 pages

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    10 views3 pages

    Technical Questions - C# (4)

    Uploaded by

    Tsuna Sawada

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    of 3

    TECHNICAL QUESTIONS

    1. - SQL SERVER (>= 2014)

    1.1. - Write a request in order to list the employee's (surname


    & name) who have “DUPOND Martin” as direct or
    indirect manager.

    Employee table:
    Employees
    EmployeeID (INT , PK)
    FirstName (VARCHAR (255))
    LastName (VARCHAR (255))
    ReportID (INT , FK(employees.ID))

    1.2. - In case of important Lock / Deadlock on a database, what


    are the actions to do and in what order?

    1.3. - What’s the best practice for the SQL server connection :
    integrated security or login / password ?

    1.4. - How to transmit several values from a field to a stored


    procedure?

    1.5. - Generally speaking, is the best practice using table


    variables or temporary tables?

    1.6. - When you use a temporary table, could you create some
    indexes onto it? If yes, is it better to create them before
    or after the data feeding?

    1.7. - When you change the structure of a database, what are


    the actions to do (relative to the source code)?
    2. - .NET
    2.1. - Language

    2.1.1. - What is an interface ?

    2.1.2. - What is an event ?

    2.1.3. - What is boxing ?

    2.1.4. - What are generic classes ?

    2.1.5. - What is a static member of a class?


    2.1.6. - What does the keyword volatile mean?

    2.1.7. - How do you protect a zone of code from being


    accessed by several threads at the same time.

    2.2. - Framework

    2.2.1. - Give 3 collection examples.

    2.2.2. - Which class is used concatenate string efficiently ?

    2.2.3. - If you create a class which uses a lot of system


    resources, how do you release them as soon as you
    don’t use the object?

    2.2.4. - Which class do you use to manipulate Xml


    documents ?

    2.3. - Conception

    2.3.1. - What is the main interest of the interfaces?

    2.3.2. - What are the design patterns ?

    2.3.3. - Give some examples of design patterns

    2.3.4. - What is the difference between Association,


    Aggregation and Composition ?

    2.3.5. - Which design pattern is implemented by the .Net


    events mechanism?

    2.3.6. - Which design pattern is used to dynamically add some


    functionalities to an object?
    3. - SOURCE CODE MANAGEMENT (TFS >=2015)
    3.1. - How often should you archive your code ?

    3.2. - What are the repository types available in TFS ?

    3.3. - Do you know GIT ?

    4. - ALGORITHMIC
    4.1. - Transforming a string into another

    We have a set of words E.

    Example : E = { “band”, “bond”, “bear”, “cars”, “fond”, “food”, foot”,


    “hand”, “head”}

    We pick 2 words M1 and M2 in this set. Example: “hand” and “foot”.

    The goal is to write an algorithm which transforms M1 to M2. At each


    step, you can only change one letter of the current word, and the new
    word must belong to E.

    For instance: hand=>foot: hand, band, bond, fond, food, foot and all
    those words are included in E.

    4.2. - String permutations

    Write a function taking a string as input parameter, and returning all


    the permutations of the string with no duplicates.

    Example : permutations(“java”) = { “aajv”, “aavj”, “ajav”, “ajva”,


    “avaj”, “avja”, “jaav”, “java”, “jvaa”, “vaaj”, “vaja”, “vjaa” }

    What is the complexity of this algorithm?

    You might also like