Huawei H13-311_V3.5 Practice Exams
Last updated on Apr 01,2025- Exam Code: H13-311_V3.5
- Exam Name: HCIA-AI V3.5
- Certification Provider: Huawei
- Latest update: Apr 01,2025
In May 1997, the famous "Human-Machine Wars" final computer defeated Kasparov, the world chess king, with a total score of 3.5 to 2 5. is this computer called?
- A . Dark blue
- B . Dark green
- C . Ponder
- D . Blue sky
PyTorch Which of the following functions does not have?
- A . Inline keras
- B . Support dynamic graph
- C . Automatic derivative
- D . GPU accelerate
Functions are well-organized, non-reusable code segments used to implement a single, or associated Function.
- A . True
- B . False
In the face search service, if we want to delete a certain face set, we can use this code: firs_cliet.get_v2().get_face_set_service().delete_face_set("**"), among them "**" is to fill in the actual face set name.
- A . TRUE
- B . FALSE
The Python dictionary is widely identified by "{}". and the internal data consists of the key and its corresponding value
- A . True
- B . False
twenty two.Among machine learning algorithms, which of the following is not unsupervised learning?
- A . GMM
- B . Xgboost
- C . Clustering
- D . Association rules
Machine Learning Service is a data mining and analytics platform service that helps users quickly discover data patterns and build predictive models through machine learning techniques and deploy them as predictive analytics solutions
- A . True
- B . False
The following code was used when compiling the model: model.compile(optimizer=’Adam,loss=’categorical.crossentropy’,metrics=[tf.keras.metrics.accuracy]), currently using evaluate
When the method evaluates the model, which of the following indicators will be output? (Multiple choice)
- A . accuracy
- B . categorical_ 1oss
- C . loss
- D . categorical accuracy
GBDT Compared with the random forest algorithm, which of the following statements is wrong?
- A . GBDT Algorithm is easier to underfit than random forest
- B . Random forest is calculated in parallel, while GBDT Can’t
- C . GBDT Algorithm is easier to overfit than random forest
- D . GBDT And random forest are built on CART Based on the tree