1.Optimizing a Program for a Hardware Accelerator
2.Select Indices of Frames Based on Cumulative Arc-Length
3.C++ Knowledge and Coding Problem
4.Describe the Byzantine Generals Problem.
5.What is a Unix pipe?
6.Differentiate between Mutex and Semaphore.
7.Explain the CAP theorem.
8.Define and explain the Jacobian matrix and the Hessian matrix.
9.Explain the concepts of thread and process and their relationship.
10.Resume Project Deep Dive
11.Easy Coding Problem
12.Operating System Basics
13.LeetCode-style coding question
14.Maxwell's Equations and Applications
15.RF and Antenna Design Concepts
16.GUI Development with Python for Antenna Design
17.Design a Method to Rank Vehicles by Data Contribution
18.Implement a KV Store with Transactions
19.System and Network Related Questions
20.Tic Tac Toe Winner Evaluation Function
21.Thread Ordering with Locks
22.State Machine Simulation
23.Navigating Out of a Maze with Directions at Each Point
24.System Design Based on a Given Diagram
25.Difference Between dict and list in Python
26.Difference Between struct and union in C/C++
27.Purpose of Static Variables and Methods in C/C++
28.Design a Memory Allocator
29.One-Dimensional Interpolation Function
30.State Machine for a Gumball Vending Machine
31.Debugging a Square Calculation Function
32.Bit Manipulation Function
33.Macro Conversion from Celsius to Fahrenheit
34.Graph Problem Involving String Parsing and Topological Sort
35.Code Submission Task for Cell Engineering Team
36.Implement a Producer-Consumer Model
37.Infotainment QA Position Interview Questions
38.Multithreading List Construction
39.State Machine Implementation
40.PriorityExpiryCache
41.Binary Tree Level Order Traversal
42.Estimating Heat Convection Coefficients
43.Caesar Cipher Grouping
44.Unit Testing for a Given Function
45.String Analysis for Equal Counts of A and B
46.Explaining Merge Sort and Quick Sort
47.Detecting a Cycle in a Linked List
48.Frontend Coding Challenge
49.Construct a Square Polygon from Given Points
50.Design and Implementation Details of a Challenging Project
51.Explain Data Structures with Daily Life Examples
52.Web Development Task for Tesla
53.Difference between Map and HashMap
54.Design a Driver Side of a Ride-Hailing App
55.Difference between stack and heap in memory
56.Mathematics: Matrix Transformations
57.Python Test Framework Development
58.Stopping Distance Solver Implementation
59.Calculate Maximum Number of Four-Person Families on a Plane
60.Implement HTTP Link Generator
61.Algorithm Problem: Dead Corpse Nine
62.Design a Taxi App for Drivers
63.Memory Management: Stack vs Heap
64.Simple Algorithm Problems
65.Troubleshooting with American Colleagues
66.Troubleshooting in Projects
67.Distributed Locks, Cache Penetration, and Consistency
68.Designing a Structure for Objects with Properties
69.Thread Communication Program
70.Array Zeroes Rearrangement
71.String Parsing Program
72.Function to Square a Value
73.Implement a Linked List
74.Running Sum Convergence
75.Design an Inventory System for Factory Sensors
76.Find the Difference of Two Arrays
77.Design a Distributed Message Queue System like Kafka
78.Handling High Traffic in System Design
79.Implement a Memory Pool in C++
1. Optimizing a Program for a Hardware Accelerator
Assuming a hardware accelerator that includes a CPU and a DMA Engine, with the DMA having only one input channel and one output channel, and computations can only be completed on on-chip storage and the CPU. The basic process involves reading in_data[i] from DRAM, processing in_data[i] to produce out_data[i], and writing out_data[i] back to DRAM. How would you optimize your program? Note that you are required to write a program.
2. Select Indices of Frames Based on Cumulative Arc-Length
You're writing a function to select indices of frames given a clip of the car driving. We want to select frames that are separated spatially based on the movement of the car (as measured in cumulative arc-length). For example, every 5 meters apart. We've already computed the trajectory for the car, which you have available as a list of (x, y) points with an arbitrary non-zero distance between each consecutive point. The car is currently at the last location in the trajectory. Additionally, you have a list of desired strides, in terms of how many meters ago we want each frame to be. This list is always monotonically decreasing and ends with 0.0, the current frame. Your task is: for each desired stride, find the index of the frame that's closest to being the correct distance away. If the difference between the desired distance and the closest match is >= TOL (defined as 1.0 meters), then return -1 for that frame. You are to provide two implementations: 1) select_indices without Numpy, accepting O(N * M) complexity, and 2) select_indices_batched with Numpy, accepting O(B * N * M) complexity, with no loops.
3. C++ Knowledge and Coding Problem
The interview started with questions about C++ fundamentals such as pointers, stack, and heap memory, which were promptly answered. The coding question involved adding points between given points at a certain distance. For example, given points (0, 1), (1, 2), (2, 3) and a distance of 0.5, points (0.5, 1.5) and (1.5, 2.5) need to be added. The challenge also included considering a distance of 0.4, which would require adding points (0.4, 1.4) and (0.8, 1.8) between the first two points. All points then had to be printed out in order.
4. Describe the Byzantine Generals Problem.
Describe the Byzantine Generals Problem.
5. What is a Unix pipe?
What is a Unix pipe?
解锁更多真题，请点此 登录 篱笆帮
高频题（0）
