BoYan technology interview questions-Latest (Shanghai)

As last blog mentioned (soft interview questions-Latest), Some outsourcing company, like chinasoft, beyondsoft, vinceinfo, Hisoft, wicresoft, etc. all the process of interview is the same, if you pass the interview of these company, according to the condition of the project to decide whether you are recommended to Microsoft or not, if yes, you have to practice your oral English and some Algorithm. now go to the interview of Beyondsoft:

1. HR will have a interview face to face for your oral English and your ability of expressing your emotion for some thing. then Technical interviewer (Team Leader) will take some technology test.

2. database stored procedures, how to call stored procedures in ASP. NET.

In fact, we mainly examine the application of several features in ADO. NET, such as Connection, Command, DataReader, Dataset,

DataAdapter.

Note:
Connection: establishes a Connection with a specific data source. The base classes of all Connection objects are DbConnection classes.
Command: execute commands on the data source. Publish Parameters and execute it from the Connection within the Transaction range. The base class of all Command objects is the DbCommand class.
DataReader: reads read-only data streams from the data source. The base class of all DataReader objects is the DbDataReader class.
DataAdapter: Fill in DataSet with a data source and fix the update. The base class of all DataAdapter objects is the DbDataAdapter class.
Note: New users often encounter the following questions during interviews: the top five objects of ADO. NET are the four types of DataSet that must be kept in mind. Later development is also frequently used.

3. For a brief introduction to ASP. NET three-tier architecture, refer to my blog: Analysis of ASP. NET three-tier architecture

4. In an unordered integer array, if the length is greater than 10, find any number, which belongs to its smallest set.
For this question, I don't know if the definition will be wrong. How can I understand this minimal set? For example, if an array a = (,) is available, then in this array, there must be a value of 3, which belongs to the minimum set (3, 4 ). Isn't that easy to understand? Find the smallest, and then find the second smallest. In this way, the time complexity is O (n). At this time, the interviewer asked, is there any algorithm smaller than O (n? You can consider it.
5. XPath. Measure the test taker's knowledge about the use of xpath. Among them, wensi innovations like taking this test. Here I will write a little application:

Xpath Public void ReadXmlNode (string filepath)
{
XmlDocument xmldoc = new XmlDocument ();
Xmldoc. Load (filepath );
XmlNodeList nodelist = xmldoc. SelectNodes (@ "/root/employees/employee"); // xpath

Foreach (XmlNode node in nodelist)
{
Console. Write (node. Name + "");
}
}

6. HeapSort. You can get more information from internet. below is source:

HeapSort /// <Summary>
/// Small root heap sorting
/// </Summary>
/// <Param name = "dblArray"> </param>
/// <Param name = "StartIndex"> </param>
/// <Returns> </returns>
Private static void HeapSort (ref double [] dblArray)
{
For (int I = dblArray. Length-1; I> = 0; I --)
{
If (2 * I + 1 <dblArray. Length)
{
Int MinChildrenIndex = 2 * I + 1;
// Compare the left and right subtree and record the Index of the minimum value
If (2 * I + 2 <dblArray. Length)
{
If (dblArray [2 * I + 1]> dblArray [2 * I + 2])
MinChildrenIndex = 2 * I + 2;
}
If (dblArray [I]> dblArray [MinChildrenIndex])
{
ExchageValue (ref dblArray [I], ref dblArray [MinChildrenIndex]);
NodeSort (ref dblArray, MinChildrenIndex );
}
}
}
}

/// <Summary>
/// Node sorting
/// </Summary>
/// <Param name = "dblArray"> </param>
/// <Param name = "StartIndex"> </param>
Private static void NodeSort (ref double [] dblArray, int StartIndex)
{
While (2 * StartIndex + 1 <dblArray. Length)
{
Int MinChildrenIndex = 2 * StartIndex + 1;
If (2 * StartIndex + 2 <dblArray. Length)
{
If (dblArray [2 * StartIndex + 1]> dblArray [2 * StartIndex + 2])
{
MinChildrenIndex = 2 * StartIndex + 2;
}
}
If (dblArray [StartIndex]> dblArray [MinChildrenIndex])
{
ExchageValue (ref dblArray [StartIndex], ref dblArray [MinChildrenIndex]);
StartIndex = MinChildrenIndex;
}
}
}

/// <Summary>
/// Exchange value
/// </Summary>
/// <Param name = "A"> </param>
/// <Param name = "B"> </param>
Private static void ExchageValue (ref double A, ref double B)
{
Double Temp =;
A = B;
B = Temp;
}

7. One of the 12 small balls is different (or light or heavy) from the other, and it takes a day to renew. How can I name it at least several times.
There are many such questions on the internet, mainly examining the logic thinking ability.
8. Design Pattern-single-key pattern, factory pattern, Observer pattern, etc.
No detailed analysis is made here. Readers can find some information on the Internet to find them.

This interview is fast and will be pushed back to Microsoft. I will list the interview questions in the future.

Note: I will only share the skills and experience of the interview here, without any comments from the company. It provides more programmers with a platform for communication and development, as well as a small sharing for college students looking for work on the poverty line. If you have any questions, please leave your footprints behind and I will modify them at the same time.