2019獨(dú)角獸企業(yè)重金招聘Python工程師標(biāo)準(zhǔn)>>>

?network, web, database, Linux system

Interview Questions

• Given a list of numbers, find a fastest sort algorithm
• Describe TCP hand shake process
• Describe DB master-slave process
• Describe the work process of a TCP proxy
• Describe the ways to defend DDOS.
• Describe what "quick sort" is, And explain its time complexity.?
• What is "index" in SQL??
• Explain the difference between Treemap and Hashmap in Java ?
• How does a website's account login system work? ?
• How to reverse a doubly linked list with O(N) space complexity?
• How to sort a single string without using any api/library functions with O(N) time complexity??

1 hour of technical test (test consists of 2 parts: MCQ (24 questions of 4-choice, correct answers could be multiple), Algorithm (write a program on paper (can be written in C/C++/C#/Java)). Topics covered in MCQ: various sorting algorithms (e.g. Heap Sort, Insertion Sort, Merge Sort, Selection Sort) (mainly on the time complexity), TCP/IP fundamentals (structure of headers / properties of connection and connectionless protocols, hand shake, closure of connection), database?(shared lock/exclusive lock, SQL statement), system stability calculation, computer science (page file basic (e.g. global to system or private to individual processes, CPU scheduling (What is the minimum unit for scheduling?, Little/Big Endian Byte Order), IPC mechanism (message queue, pipeline, semaphore), programming (mainly on interpreting the memory allocation for pointers/malloc()/array/string assignment). Question for Algorithm test: Without using standard library function, write a program that covert decimal to hexadecimal, check if the hexadecimal number is the same in forward order and reverse order (e.g. 0x3C3, 0x4B4 are the same in forward order and reverse order). HR questions: Reason for leaving? What do you think is required to be a great software engineer? ?

轉(zhuǎn)載于:https://my.oschina.net/u/203607/blog/736443

總結(jié)

以上是生活随笔為你收集整理的Oversea company interview question.的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。