data center engineer interview questions

I attended a data analysis interview with a company in Hangzhou this afternoon. I am familiar with some of the questions, but I didn't give the best answer. Share: Data Structure: Name category cost Li weixing movie 30 Li weixing 100 Li weixing 500 Wang weixing 500 Wang weixing 100 Wang weixing clothes 700 display effe

and the customer keyword, please list the keywords and the customer's expression symbol and the calculation formulaThree, System design questions (25 points)The fitting of one-dimensional data, given the dataset {Xi,yi} (i=1,..., N), Xi is the training data, and Yi is the corresponding expected value. Fitting with linear, two-time, high-second functionsLinearity

Horse Soldier Big Data Architect (1)Link: http://pan.baidu.com/s/1qYTW1m0 Password: LXJDSpring CloudLink: Http://pan.baidu.com/s/1bzG9vK Password: zy2bLink: Http://pan.baidu.com/s/1qXF3eGG Password: 19u9Design and practice of micro-service architectureLink: Http://pan.baidu.com/s/1slNiP5N Password: u6euBEIJING-PK Education Linux Big Data video sharingLink: http://pan.baidu.com/s/1c2Aci6c Password: m7bnStill

ArticleDirectory 17 questions about massive data processing and bit-Map Preface Part 1 and 15 interview questions on massive data processing Part 2: BTI-map for Massive Data Processing

by Long LuoPersonal blog LinksRecently in the study Java多线程 , encountered a following pen question, the topic is as follows:编写一个程序，程序会启动4个线程，向4个文件A，B，C，D里写入数据，每个线程只能写一个值。 线程A：只写A 线程B：只写B 线程C：只写C 线程D：只写D 4个文件A，B，C，D。 程序运行起来，4个文件的写入结果如下： A：ABCDABCD... B：BCDABCDA... C：CDABCDAB... Online search, as if still a Google pen questions , the problem involves the knowledge points are:,, 多线程 并发 锁 , 线程间通信 .Personal Analysis Process:1

Label:A few days ago to participate in an interview, interview company to do a set of questions, SQL problem is not difficult, but I was the first to write the wrong, come back, write the next. Simply record it, 1. Title: 2. Test data SELECT * from student; INSERT into student (Name,subject,score) VALUES (' Zhang

(); - } - - Public BooleanIsEmpty () {///Bottom call is LinkedList's IsEmpty () method to determine if the set internal data is empty - returnlink.isempty (); in } -}(2) test of Mystack:1 Packagecn.itcast_05;2 3 /*4 * Test of Mystack5 */6 Public classMystackdemo {7 Public Static voidMain (string[] args) {8 //To create a collection object9Mystack ms =NewMystack ();Ten One //adding elements AMs.add ("Hell

= { NewSqlParameter ("@number", SqlDbType.NVarChar),NewSqlParameter ("@moneys", SqlDbType.Int),NewSqlParameter ("@name", SqlDbType.NVarChar),}; para[0]. Value = file[0]; para[1]. Value = Convert.ToInt32 (file[1]); para[2]. Value = file[2]; //Database Operations using(SqlConnection conn =NewSqlConnection ("Data Source=.;i Nitial catalog=test; Persist Security info=true; User Id=sa; Password=123

Question: To define the stack data structure, add a min function to obtain the minimum element of the stack. The time complexity of the min, push, and pop functions is O (1 ). Analysis: this is an interview question from Google last year. When I see this question, the first reaction is to sort all reverse elements in the stack every time a new element is pushed. In this way, the top element of the stack wil

Question: two one-way linked lists to find their first public node. The linked list node is defined: Struct listnode { Int m_nkey; Listnode * m_pnext; }; Analysis: This is a Microsoft interview question. Microsoft is very fond of linked list-related questions, so in Microsoft's interview questions, the probability of a

Question: There is a matrix (10*10). The element value can only be 0 or 1. Now, write a function to check whether a row is 1, and each column is 0 (except that this element of the row is 1 ). The program needs to scan the matrix once to obtain the result. Source: Internet, said to be from Microsoft interview questions. Answer: Without considering the requirements of the last sentence of the question, the mo

then100Find the IP address with the highest frequency among the 0 largest IP addresses. 5. Locate non-repeated integers among the 0.25 billion integers. The memory is insufficient to accommodate these 0.25 billion integers. Solution 1: Use 2-Bitmap (2bit for each number, 00 indicates no, 01 indicates one time, 10 indicates multiple times, and 11 indicates no significance). Memory is required, it is also acceptable. Then scan the 0.25 billion Integers to check the corresponding bits in Bitmap. I