Optiver计算机科学面经_Optiver计算机科学面试真题及高频题

1.Emergency Handling for Server Crash

2.Improving Software Running Efficiency

3.Server Provisioning Environment Design

4.Design a Live Streaming Website

5.Ball Piles Transformation

6.Write a program to match orders from a sequence of limit orders (direction, price) and record the transaction price

7.Calculate the number of ways to arrange parentheses for 2n positions

8.Optimal Dice Toss Strategy

9.Pattern Recognition in Number Sequences

10.Walk through one of your projects

11.OOD Design for Classic Lion

12.OOD Design for Log Server

13.Process Scheduling for a Trading System

14.Implement a Log Recording System

15.Manage Lion Entries Based on Height and Time

16.Implement a Subscriber Class for a Logistics Company

17.Process Scheduling System

18.Log Server Design

19.Stock Exchange Transaction Strategy

20.Find the Third Largest Distinct Number in an Array

21.Log Server Design

22.Process Scheduling System

23.Beverage Stand Order Tracking System

24.N*N Grid Word Search

25.Data Center Initialization Strategy

26.System Design of a Trading System

1. Emergency Handling for Server Crash

If a server crash occurs, how would you perform emergency handling?

2. Improving Software Running Efficiency

How would you improve the running efficiency of software, and how would you use the 'ps' command to increase the priority of a process?

3. Server Provisioning Environment Design

You are a system designer at Optiver and need to provision 1000 servers from bare metal to production environment. How would you design such an environment?

4. Design a Live Streaming Website

Design a live streaming website that can support 100,000 users online simultaneously with live commenting services. How would you design the website, how much bandwidth would you reserve, and provide a UML design.

5. Ball Piles Transformation

Given two piles of balls, each move consists of taking balls from the larger pile to double the number of balls in the smaller pile, following the transformation (a, b) to (2a, b-a). Answer the following questions: 1. Starting with (1, 25), is it possible to end up with (0, 26)? 2. Starting with (1, 24), is it possible to end up with (0, 25)? 3. Starting with (1, 23), is it possible to end up with (0, 24)? 4. For what values of n can the pair (1, n) eventually become (0, n+1)?