Oracle数据相关面经_Oracle数据相关面试真题及高频题

1.Probability of Drawing Target Cards from Piles

2.Implement K-Means Clustering Algorithm

3.Describe the bias-variance tradeoff, overfitting, and underfitting in machine learning.

4.Explain the concept of p-value and the difference between type I and type II errors.

5.Vertical Order Traversal of a Binary Tree

6.Meeting Room II Variant

7.Machine Learning Questions and Coding Task

8.Understanding of Databases

9.Array Comparison and Filtering

10.Knowledge of Database Management

11.Retrieving Highest Salaries Using SQL

12.SQL Joins and Group By

13.Relational Database vs NoSQL

14.Database Normalization

15.Simple SQL Query

16.Database Knowledge

17.Database Joins and Indexes

18.ML/Coding Interview

19.ML/Case Study Interview

20.ML Depth Interview

21.Technical Proficiency Quick Check

1. Probability of Drawing Target Cards from Piles

Given multiple piles of cards, where each pile has been shuffled internally but the relative order of the piles remains unchanged, calculate the probability of drawing at least 'k' target cards within the first 'n' draws. The input is a list of lists representing the piles of cards, for example: [[1,2,3,3], [4,5], [6,7,8]]. Provide the formula or method to calculate the probabilities with examples, such as the probability of drawing at least one '3' within the first '1', '2', '4' draws, and the probability of drawing at least one '4' within the first '5' draws.

2. Implement K-Means Clustering Algorithm

Write the K-Means clustering algorithm from scratch. Discuss your approach, how you would implement it, and any considerations you would take into account while coding.

3. Describe the bias-variance tradeoff, overfitting, and underfitting in machine learning.

Describe the bias-variance tradeoff, overfitting, and underfitting in machine learning.

4. Explain the concept of p-value and the difference between type I and type II errors.

Explain the concept of p-value and the difference between type I and type II errors.

5. Vertical Order Traversal of a Binary Tree

Given a binary tree, perform vertical order traversal and print the nodes of the tree in vertical order. This is a LeetCode problem, but the exact problem number is not provided.