Mathworks计算机科学面试真题

职位分类
全部
数据相关
计算机科学
人工智能
产品经理
BQ
面试题
全部(57)
OOD(2)
Algorithm(26)
System Design(2)
高频题(0)
Math(26)
全部(57)
OOD(2)
Algorithm(26)
System Design(2)
高频题(0)
Math(26)
1.points
2.50张牌最后几张正面
3. how fast is the top of the ladder falling down the wall at the given instance?
4.What should he set the price at to maximize the total money made from the sales?
5.A Hamiltonian cycle
6.the maximum possible number of families in that town
7.A bag contains 3 white balls and 5 black balls
8.Two grape crushers
9.an ant on each vertex of a pentagon
10.A graph has N vertices
11. 'DETAIL'
12.Sharing their birthday
13.The package was shipped but dropped
14.the largest number representable by a 32-bit signed integer
15.Two Dice are thrown
16. 52 cards
17.Four-digit numbers
18.Bag A and B
19. Process Scheduling
20.Price Check
21.Word Transformation Problem
22.Perfect Pair Problem
23.Count Bitonic Subsequences Problem
24.Balanced Numbers Problem
25.Word Transformation
26.Maximum Operations
27.Coding Challenge in Preferred Language
28.Math and Analytical Thinking Challenge
29.Counting Undirected Graphs
30.Integer Range Limitation
31.Math and Analytical Thinking Question
32.Math and Analytical Thinking Question
33.Maximum Number of Edges in an Acyclic Graph
34.Longest Valid Parentheses in a String
35.Longest Substring with Limited Zeroes
36.ATM Object-Oriented Design
37.Minimum number of operations to reach a target number
38.Find the number of ideal integers
39.Maximum Number of Edges in a k-Regular Graph
40.Ladder Against a Wall
41.Volume of a Revolved Parabola
42.Derivative of Exponential Function
43.Card Flipping Problem
44.Area Calculation with Inheritance
45.Twin Strings
46.Custom Sorted Array
47.Minimum Cost Tree Construction
48.Optimal Building Placement to Minimize Maximum Distance
49.Optimal Office Placement in a Grid
50.Minimum Cost of Constructing a Binary Tree
51.Binary Representation Count and Position
52.Perfect Pair Problem
53.Handling Overflow in Discount Tag Problem
54.Perfect Pair Optimization
55.Script Execution Order
56.Team Formation
57.Identify the Unique String
1. points
A, B and C start running simultaneously from the points P, Q and R respectively on a circular track. The distance (when measured along the track) between any two of the three points P, Q and RisLand the ratio of the speeds of A, B and £T;2:3. If A and B run in opposite directions while B and Crun in the same direction, what is the distance run by C before A,B and C meet for the first time? Answer: never meet
2. 50张牌最后几张正面
50张牌,id1到50,都扣着,第一次都翻开,第二次flip2的倍数的牌,第三次flip3的倍数。。。。。。第n次flip n的倍数的牌,50张最后几张正面?(7)
3.  how fast is the top of the ladder falling down the wall at the given instance?
A 5-meter long ladder is leaning against a wall so that the top of the ladderis4-meters up the wall If the bottom of the ladder is being pulled away from the wall at a rate of 1meter/second, how fast is the top of the ladder falling down the wall at the given instance?
Answer:0.75meters/second
4. What should he set the price at to maximize the total money made from the sales?
 Nick currently sells shoes at a price of $10per pair and sells 100 pairs per day. After doing some market research, Nick finds that he will lose 5 sales per day for every dollar he increases the price. What should he set the price at to maximize the total money made from the sales?
Answer: $15 per pair
5. A Hamiltonian cycle
A Hamiltonian cycle is a cycle that traverses every vertex of a graph exactly once. A Hamiltonian Cycle is a Hamiltonian Graph of order 24 has:24 edges