拖踩媒驰藩陈矩涂冉段肌罗诞
Part I. Basics： Chapter 1. Introduction Quizzes for Chapter 1
1、 问题:Turing Test is designed to provide what kind of satisfactory operational definition? 图灵测试旨在给予哪一种令人满意的操作定义
选项：
A: machine intelligence机器智能
B: human intelligence人工智能
C:machine action机器动作
D: human action人类动作
E:human thinking人类思考
答案: 【 machine intelligence机器智能】
2、 问题:Select the following true statements regarding the concept of artificial intelligence选择以下关于人工智能概念的正确表述
选项：
A:Artificial intelligence is the intelligence exhibited by machines or software.人工智能是通过机器或软件展现的智能
B:Artificial intelligence aims to create intelligent machines.人工智能旨在创造智能机器
C:Artificial intelligence defines itself as the study of human agents.人工智能将其定义为人类智能体的研究
D:Artificial intelligence is to enable the development of computers that are able to do things normally done by human.人工智能是为了开发一类计算机使之能够完成通常由人类所能做的事
E:Artificial intelligence is to study and construct agent programs that perform well in a given environment.人工智能是研究和构建在给定环境下表现良好的智能体程序
答案: 【Artificial intelligence is the intelligence exhibited by machines or software.人工智能是通过机器或软件展现的智能;
Artificial intelligence aims to create intelligent machines.人工智能旨在创造智能机器;
Artificial intelligence is to enable the development of computers that are able to do things normally done by human.人工智能是为了开发一类计算机使之能够完成通常由人类所能做的事;
Artificial intelligence is to study and construct agent programs that perform well in a given environment.人工智能是研究和构建在给定环境下表现良好的智能体程序】
3、 问题:Which of the following are the foundations of artificial intelligence?如下学科哪些是人工智能的基础？
选项：
A:Philosophy哲学
B: History历史
C:Mathematics数学
D:Medicine医学
E:Economics经济学
F:Psychology心理学
答案: 【Philosophy哲学;
Mathematics数学;
Economics经济学;
Psychology心理学】
4、 问题:Which of the following statements are true to describe strong AI(General AI)? 下列陈述中哪些是描述强AI(通用AI)的正确答案？
选项：
A:The appropriately programmed computer with the right inputs and outputs would thereby have a mind in exactly the same sense human beings have minds.是经过适当编程的具有正确输入和输出的计算机，因此有与人类同样判断力的头脑
B:It defines non-sentient computer intelligence or AI that is focused on one narrow task.其定义为无知觉的计算机智能，或专注于一个狭窄任务的AI
C:It means a machine with the ability to apply intelligence to any problem.指的是一种机器，具有将智能应用于任何问题的能力
D:It means a machine with the ability to apply intelligence to a specific problem. 指的是一种机器，仅针对一个具体问题
答案: 【The appropriately programmed computer with the right inputs and outputs would thereby have a mind in exactly the same sense human beings have minds.是经过适当编程的具有正确输入和输出的计算机，因此有与人类同样判断力的头脑;
It means a machine with the ability to apply intelligence to any problem.指的是一种机器，具有将智能应用于任何问题的能力】
5、 问题:Select the following computer systems which are instances of artificial intelligence. 选择下列计算机系统中属于人工智能的实例
选项：
A:Robot机器人
B:Intelligent personal assistant智能个人助理
C:Voice-activated telephone menus声控电话菜单
D:Web search enginesWeb搜索引擎
E:Distributed computing超市条形码扫描器
答案: 【Robot机器人;
Intelligent personal assistant智能个人助理;
Web search enginesWeb搜索引擎】
6、 问题:Select which of the following ones are research area of artificial intelligence.选择下列哪些是人工智能的研究领域
选项：
A:Distributed computing分布式计算
B:Expert system专家系统
C: Software outsourcing软件外包
D:Machine learning机器学习
E:Image understanding图像理解
F:Face recognition 人脸识别
答案: 【Expert system专家系统;
Machine learning机器学习;
Image understanding图像理解;
Face recognition 人脸识别】
7、 问题:Examine some applicationsof artificial intelligence (AI) to discover which the following tasks can currently be solved by AI.考察人工智能(AI)的一些应用，去发现目前下列哪些任务可以通过AI来解决
选项：
A: Playing a decent game of table tennis (Ping-Pong).打一场像样的乒乓球比赛
B:Buying a week’s worth of groceries at the market.在市场上购买一周的食品杂货
C:Buying a week’s worth of groceries on the Web.在Web上购买一周的食品杂货
D: Playing the game of Texas Holdem Poker at a competitive level.以竞技水平玩德州扑克游戏
E: Translating spoken English into spoken Chinese in real time.将英文口语实时翻译为中文口语
答案: 【 Playing a decent game of table tennis (Ping-Pong).打一场像样的乒乓球比赛;
Buying a week’s worth of groceries on the Web.在Web上购买一周的食品杂货;
Playing the game of Texas Holdem Poker at a competitive level.以竞技水平玩德州扑克游戏;
Translating spoken English into spoken Chinese in real time.将英文口语实时翻译为中文口语】
8、 问题:Rationally means the property of a systemwhich does the right thing given what it __. 理性指的是一个系统的属性，即在___的环境下做正确的事。
答案: 【knows
已知】
Part I. Basics： Chapter 2. Intelligent Agent Quizzes for Chapter 2
1、 问题:For the following comparisons, select which approaches are more general and more amenable to scientific development.对于如下比拟，选择哪些方法更通用并且更适合于科学开发
选项：
A:Thinking humanly类人思考
B:Thinking rationally理性思考
C:Acting humanly类人动作
D:Acting rationally理性动作
答案: 【Thinking rationally理性思考;
Acting rationally理性动作】
2、 问题:A rational agent is one that does the right thing, but what does it mean to do the right thing? Considering the consequences of the agent’s behavior, select the following true statements regarding the concept of “right thing”.理性智能体指的是有正确行为的智能体，但正确的行为意味着什么？考虑智能体行为的后果，选择下列有关“正确的行为”概念的真实陈述
选项：
A:This sequence of actions causes the environment to go through a sequence of states. 这些动作序列引起环境改变而产生状态序列
B:An agent in an environment generates a sequence of actions according to the
percepts. 智能体在某个环境中依据感知生成动作序列
C:If the sequence is desirable, then the agent has performed well.如果该序列是所期望的，则该智能体表现良好
D:But if the sequence is undesirable, then the agent destroys the environment.但若该序列是不期望的，则该智能体对其环境造成破坏。
答案: 【This sequence of actions causes the environment to go through a sequence of states. 这些动作序列引起环境改变而产生状态序列;
An agent in an environment generates a sequence of actions according to the
percepts. 智能体在某个环境中依据感知生成动作序列;
If the sequence is desirable, then the agent has performed well.如果该序列是所期望的，则该智能体表现良好】
3、 问题:PEAS is a task environment description which stands for:PEAS是一种任务环境描述，它代表：
选项：
A:Performance性能
B: Perceive感知
C:Environment环境
D:Exclusion排斥
E:Actuators动作器
F:Actions动作
G:Sense感觉
H:Sensors感受器
答案: 【Performance性能;
Environment环境;
Actuators动作器;
Sensors感受器】
4、 问题:Which of the following statements are true about environment types for intelligent agents?下列中语句哪些与智能体环境类型有关
选项：
A:Fully observable vs. partially observable完全可观测与部分可观测
B:Single agent vs. multi-agent单智能体与多智能体
C: Good agent vs. bad agent好的智能体与差的智能体
D: Episodic vs. sequential阵发性与连续性
E:Deterministic vs. stochastic确定性与随机性
F: Solidvs vs. liquid固体与液体
G:Perfect vs. imperfect完美与不完美
答案: 【Fully observable vs. partially observable完全可观测与部分可观测;
Single agent vs. multi-agent单智能体与多智能体;
Episodic vs. sequential阵发性与连续性;
Deterministic vs. stochastic确定性与随机性】
5、 问题:Thinking the differences between gent functions and agent programs, select correct statements from following ones. 考虑智能体函数与智能体程序的差异，从下列陈述中选择正确的答案
选项：
A:An agent program implements an agent function一个智能体程序实现一个智能体函数
B:An agent function implements an agent program.一个智能体函数实现一个智能体程序
C:An agent program has no any relation with an agent function.智能体程序与智能体函数没有任何关系
D:An agent program contains agent function. 智能体程序包含智能体函数
答案: 【An agent program implements an agent function一个智能体程序实现一个智能体函数;
An agent program contains agent function. 智能体程序包含智能体函数】
6、 问题:Selectthe following true ways that can be used to represent states for an agent.选择下列哪些方法可以用于表示智能体的状态
选项：
A: Atomic原子式
B:Distributed分布式
C:Factored因子式
D:Networked网络式
E:Molecular模块式
F:Structured结构式
答案: 【 Atomic原子式;
Factored因子式;
Structured结构式】
7、 问题:The approach of artificial intelligence (AI) which epresents information through symbols and their relationships is _ AI, and which represents information in a distributed form within a network is Connectionist AI.凭借符号及他们之间的关系来表征信息的人工智能方法是______AI，而用网络内部的一种分布式形式来表征信息的是联结主义AI。
答案: 【Symbolist
符号主义】
8、 问题:An intelligent agent is anything that can be viewed as perceiving its environment through _, and acting upon that environment through actuators.
智能体可看作是通过___感知外部环境，并且通过执行器作用于外部环境的任何事物。
答案: 【sensors
感受器】
Part II. Searching： Chapter 3. Solving Problems by Search Quizzes for Chapter 3
1、 问题:There are two main kinds of formulation for 8-queens problem. Which of the following items is such a formulation that starts with all 8 queens on the board and moves them around?有两种8皇后问题的形式化方式。“初始时8个皇后都放在棋盘上，然后再进行移动”是哪一种形式化方式？
选项：
A: Incremental formulation增量形式化
B:Normal formulation正则形式化
C: Complete-state formulation全态形式化
D:Half-state formulationon半态形式化
答案: 【 Complete-state formulation全态形式化】
2、 问题:Let h(n) denote heuristic function and g(n) denote cost, the evaluation function f(n) used by Greedy search is:设h(n)表示启发式函数且g(n)表示代价，则贪婪搜索所使用的评价函数是
选项：
A:f(n) = h(n)
B:f(n) = g(n)
C:f(n) = g(n) + h(n)
D:f(n) = g(n) – h(n)
答案: 【f(n) = h(n)】
3、 问题:Let h(n) denote heuristic function and g(n) denote cost, the evaluation function f(n) used by A search is: 设h(n)表示启发式函数且g(n)表示代价，则A搜索所使用的评价函数是:
选项：
A:f(n) = h(n)
B:f(n) = g(n)
C:f(n) = g(n) + h(n)
D:f(n) = g(n) – h(n)
答案: 【f(n) = g(n) + h(n)】
4、 问题:Which of the following items are used to formulate a problem?下列哪些项用于对问题进行形式化
选项：
A: Environment环境
B:Initial state初始状态
C:Goal state目标状态
D:Perception感知
E:Actions动作
F:Actuator执行器
G:Transition model转换模型
H: Agent function智能体函数
I:Goal test目标检测
J:Path cost路径检测
答案: 【Initial state初始状态;
Actions动作;
Transition model转换模型;
Goal test目标检测;
Path cost路径检测】
5、 问题:Select which of the following search methods are true uninformed search.选择如下哪些搜索方法属于无信息搜索
选项：
A:A SearchA搜索
B:Best-first Search最佳优先搜索
C:Bidirectional search双向搜索
D:Breadth-first search宽度优先搜索
E:Depth-first search深度优先搜索
F:Depth-limited search深度受限搜索
G: Greedy Search贪婪搜索
H: Uniform-cost search一致代价搜索
答案: 【Bidirectional search双向搜索;
Breadth-first search宽度优先搜索;
Depth-first search深度优先搜索;
Depth-limited search深度受限搜索;
Uniform-cost search一致代价搜索】
6、 问题:The search strategies that use problem-specific knowledge beyond the definition of the problem itself are known as:除了问题本身的定义之外，使用问题特定知识的搜索策略被认为是
选项：
A: Binary search二元搜索
B:Brute force search蛮力搜索
C:Informed search有信息搜索
D:Uninformed search无信息搜索
E: Heuristic search启发式搜索
答案: 【Informed search有信息搜索;
Heuristic search启发式搜索】
7、 问题:Some __ problems or NP-hard problems can be solved only by search.某些_____或NP难问题只能通过搜索来求解。
答案: 【NP-complete
NP完】
8、 问题:Problem formulation is the process of deciding what _ and states to consider, given a goal.问题形式化是给定一个目标，决定要考虑的_与状态的处理。
答案: 【actions
动作】
Part II. Searching： Chapter 4. Local Search and Swarm Intelligence Quizzes for Chapter 4
1、 问题:Keeping just one node in memory might seem to be an extreme reaction to the problem of memory limitations. Local beam search keeps track of:在内存中仅保存一个节点似乎是对内存限制问题的极端反应。局部束搜索保持：
选项：
A:k states rather than just one.k个状态而不仅仅为一
B:m states rather than n states.m个状态而不是n个
C:just one rather than k states.仅有一个状态而不是k个
D:just m states rather than n states仅有n状态而不是m
答案: 【k states rather than just one.k个状态而不仅仅为一】
2、 问题:A genetic algorithm is a variant of stochastic beam search, in which successor states are generated:遗传算法是随机束搜索的一个变体，其中后继节点的生成是由：
选项：
A:by combining two parent states rather than by modifying a single state.组合两个双亲状态而不是修改单一状态。
B:by modifying a single state rather than by combining two parent states.组合两个双亲节点而不是修改单一节点。
C:by combining two parent nodes rather than by modifying a single node.组合单一状态而不是组合两个双亲状态。
D:by modifying a single node rather than by combining two parent nodes.组合单一节点而不是组合两个双亲节点。
答案: 【by combining two parent states rather than by modifying a single state.组合两个双亲状态而不是修改单一状态。】
3、 问题:Hill climbing search is sometimes called greedy local search because it grabs a good neighbor state without thinking ahead about where to go next. Unfortunately, it often gets stuck for the three reasons:爬山搜索有时也被称为贪婪局部搜索，因为它只顾抓住一个好的邻接点的状态，而不提前思考下一步该去哪儿。它在三种情况下经常被困：
选项：
A:Hill山丘
B:Local maxima局部最大值
C:Mountain高山
D:Plateaux高原
E:Ridges山岭
答案: 【Local maxima局部最大值;
Plateaux高原;
Ridges山岭】
4、 问题:Which of the following statements are true about Simulated annealing algorithm？以下关于模拟退火算法的陈述哪些是正确的？
选项：
A:The inner loop of the simulated annealing algorithm is quite similar to hill climbing.模拟退火算法的内循环与爬山法非常相似。
B:The inner loop of the simulated annealing algorithm is very different from hill climbing.模拟退火算法的内循环与爬山法完全不同。
C:Instead of picking the best move, simulated annealing algorithm picks a random move.模拟退火算法不是选择最佳行动，而是选择随机行动。
D:Instead of picking the random move, simulated annealing algorithm picks a best move.模拟退火算法不是选择随机行动，而是选择最佳行动。
答案: 【The inner loop of the simulated annealing algorithm is quite similar to hill climbing.模拟退火算法的内循环与爬山法非常相似。;
Instead of picking the best move, simulated annealing algorithm picks a random move.模拟退火算法不是选择最佳行动，而是选择随机行动。】
5、 问题:Ant Colony Optimization (ACO) algorithm was inspired by the behavior of ants seeking a path between _ and a source of food.蚁群优化算法是受蚂蚁在_和食物源之间寻找路径行为的启发而形成的。
答案: 【between their nest
蚁巢】
6、 问题:Inspired by social behavior of birds and fishes, Particle Swarm Optimization (PSO) algorithm uses a number of __ that constitute a swarm moving around in the search space looking for the best solution.受鸟类和鱼类的社会行为的启发，粒子群优化算法采用若干_构成一个围绕搜索空间移动的群体来寻找最优解。
答案: 【particles
粒子】
7、 问题:Local search algorithms operate using a single __ (rather than multiple paths) and generally move only to neighbors of that node.局部搜索算法使用一个____（而不是多条路径），并且通常仅移动到该节点相邻的节点。
答案: 【current node
当前节点】
8、 问题:In addition to finding goals, local search algorithms are useful for solving pure ___, in which the aim is to find the best state according to an objective function.除了寻找目标之外，局部搜索算法对解决纯___也很有效。其目的是根据一个目标函数找到其最好的状态。
答案: 【optimization problems
优化问题】
Part II. Searching： Chapter 5. Adversarial Search Quizzes for Chapter 5
1、 问题:Which of the following is a true statement about games?以下关于博弈的陈述哪个是正确的？
选项：
A:Adversarial search problems are often known as games.对抗搜索通常称为博弈
B:Classical search problems are often known as games.经典搜索问题通常称为博弈
C:Heuristic search problems are often known as games.启发式搜索问题通常称为博弈
D:Local search problems are often known as games.局部搜索问题通常称为博弈
答案: 【Adversarial search problems are often known as games.对抗搜索通常称为博弈】
2、 问题:__ describes a situation in which the interacting agents’ aggregate gains and losses can be less than or more than zero.__中智能体交互动作的总收益和损失可以小于或大于零
选项：
A:Computer game计算机博弈
B:Non-zero sum game非零和博弈
C:Two-player game双人博弈
D:Zero sum game零和博弈
答案: 【Non-zero sum game非零和博弈】
3、 问题:Select the following true statements regarding the concept of minimax rule for a zero sum game.从如下关于零和博弈maximum概念中选择正确的答案。
选项：
A:Each player maximizes the maximum payoff possible for itself.每个玩家会使自己可能的最大收益变得最大。
B:Each player minimizes the maximum payoff possible for itself.每个玩家会使自己可能的最大收益变得最小。
C:Each player maximizes the maximum loss possible for the other.每个玩家会使对手可能的最大损失变得最大。
D:Each player minimizes the maximum loss possible for the other.每个玩家会使对手可能的最大损失变得最小。
答案: 【Each player maximizes the maximum payoff possible for itself.每个玩家会使自己可能的最大收益变得最大。;
Each player maximizes the maximum loss possible for the other.每个玩家会使对手可能的最大损失变得最大。】
4、 问题:Which of the following statements are true about alpha-beta pruning?以下关于alpha–beta剪枝的陈述哪些是正确的？
选项：
A:Alpha–beta pruning is to decrease the number of nodes that are evaluated by the minimax algorithm in its search tree.Alpha–beta剪枝旨在减少其搜索树中由minimax算法评价的节点数量。
B:Alpha–beta pruning is to increase the number of nodes that are evaluated by the minimax algorithm in its search tree.Alpha–beta剪枝旨在增加其搜索树中由minimax算法评价的节点数量。
C:Alpha–beta pruning is to eliminate large parts that are evaluated by the minimax algorithm in its search tree.Alpha–beta剪枝旨在消除其搜索树中由minimax算法评价的大部分。
D:Alpha–beta pruning is to add large parts that are evaluated by the minimax algorithm in its search tree.Alpha–beta剪枝旨在添加其搜索树中由minimax算法评价的大部分。
答案: 【Alpha–beta pruning is to decrease the number of nodes that are evaluated by the minimax algorithm in its search tree.Alpha–beta剪枝旨在减少其搜索树中由minimax算法评价的节点数量。;
Alpha–beta pruning is to eliminate large parts that are evaluated by the minimax algorithm in its search tree.Alpha–beta剪枝旨在消除其搜索树中由minimax算法评价的大部分。】
5、 问题:Claude Shannon proposed instead that programs should cut off the search earlier and apply a __evaluttion function to states in the search, effectively turning nonterminal nodes into terminal leaves.克劳德·香农提出：程序应该早一些剪断搜索，并在搜索中对状态应用_____评价函数，有效地将非终端节点转换为终端叶节点。（请填写中文答案）
答案: 【启发式】
6、 问题:__ is a dynamic game with probabilistic transitions played by one or more players.____是一种具有概率转换的动态博弈，有一个或多个玩家。（请填写中文答案）
答案: 【随机博弈】
7、 问题:Monte-Carlo methods are a broad class of computational algorithms that rely on ____ to obtain numerical results.蒙特卡罗方法是一大类计算算法，它凭借____来获得数值结果。（请填写中文答案）
答案: 【重复随机采样】
8、 问题:__ tree search is on the analysis of the most promising moves, expanding the search tree based on random sampling of the search space.__树搜索对最有利的动作进行分析，根据搜索空间的随机采样来扩展搜索树。（请填写中文答案）
答案: 【蒙特卡罗】
Part II. Searching： Chapter 6. Constraint Satisfaction Problem Quizzes for Chapter 6
1、 问题:Select the following true one that is used to the state representation for constraint satisfaction problems (CSPs).从如下用于约束满足问题 (CSP)的状态表示中选择正确的答案。
选项：
A:atomic原子
B:Distributed分布
C:Factored因子
D:Networked网络
E:Molecular分子
F:Structure结构
答案: 【Factored因子】
2、 问题:Assume that {A, B, C, D} are variables, the domain of each variable is {u, v, w}, and != denotes “not equal”, select which of the following expressions is a binary constraint on CSP formalism?设{A, B, C, D}为变量，每个变量的域是{u, v, w}，且“!=”表示不等于，从如下表达式中选择那个是CSP形式化的2元约束？
选项：
A:<(A), A = v>
B:Diff(A, D)
C:A + B = C
D:Alldiff(A, B, C, D)
答案: 【Diff(A, D)】
3、 问题:Compare CSP and state-space search, and select correct statements from following ones. 比较CSP和状态空间搜索，并从下列叙述中选择正确的答案。
选项：
A:CSP solving system can be faster than state-space search solving system.CSP求解系统会比状态空间搜索求解系统快。
B:CSP solving system can be slower than state-space search solving system.CSP求解系统会比状态空间搜索求解系统慢。
C:CSP can quickly eliminate large swatches of the search space.CSP可以快速排除大的搜索空间样本。
D:State-space search can quickly eliminate large swatches of the search space.状态空间搜索可以快速排除大的搜索空间样本。
答案: 【CSP solving system can be faster than state-space search solving system.CSP求解系统会比状态空间搜索求解系统快。;
CSP can quickly eliminate large swatches of the search space.CSP可以快速排除大的搜索空间样本。】
4、 问题:Which of the following statements are true types of types of local consistency for constraint propagation?如下陈述中哪些是约束传播局部一致性的正确类型？
选项：
A:Arc consistency弧一致
B:Graph consistency图一致
C:k-consistencyk一致
D:Loop consistency环路一致
E:Node consistency节点一致
F:Path consistency路径一致
G:Tree consistency树一致
答案: 【Arc consistency弧一致;
k-consistencyk一致;
Node consistency节点一致;
Path consistency路径一致】
5、 问题:Select the following true statements regarding the concept of “Backtracking search”.从如下有关“回溯搜索”概念中选择正确的答案。
选项：
A:It chooses values for one variable at a time and backtracks when a variable has no legal values left to assign.每次为变量选择值并且当变量没有合法赋值时回溯。
B:It incrementally builds candidates to the solutions, and abandons each partial candidate c, as soon as it determines that c cannot possibly be completed to a valid solution.每次为变量选择值并且当变量有一个或多个合法赋值时回溯。
C:It incrementally builds candidates to the solutions, and abandons each partial candidate c, as soon as it determines that c cannot possibly be completed to an invalid solution. 递增地构建解的候选，并且一旦确定部分候选c不能成为合法的解，就将c抛弃。
D:It chooses values for one variable at a time and backtracks when a variable has one more legal value left to assign.递增地构建解的候选，并且一旦确定部分候选c不能成为非法的解，就将c抛弃。
答案: 【It chooses values for one variable at a time and backtracks when a variable has no legal values left to assign.每次为变量选择值并且当变量没有合法赋值时回溯。;
It incrementally builds candidates to the solutions, and abandons each partial candidate c, as soon as it determines that c cannot possibly be completed to an invalid solution. 递增地构建解的候选，并且一旦确定部分候选c不能成为合法的解，就将c抛弃。】
6、 问题:A constraint satisfaction problem (CSP) is defined as a set of objects whose state must satisfy a number of ___.约束满足问题 (CSP) 被定义为其状态必须满足若干___的一组对象。
答案: 【constraints or limitations
约束和限制】
7、 问题:In choosing a new value for a variable, min-conflicts heuristic is to select the value that results in the ___ with other variables.在对一个变量选择一个新值时，最小冲突启发式选择导致与其它变量呈现____的值。
答案: 【minimum number of conflicts
最少冲突】
8、 问题:To reduce a constraint graph to a tree structure, two approaches can be used that are __and tree decomposition. 为了简化约束图为树结构，有两种方法可以采用，即__和树分解。
答案: 【cutset conditioning
割集调节】
如需购买完整答案，请点击下方红字：
为了方便下次阅读，建议在浏览器添加书签收藏本网页
添加书签方法：
1.电脑按键盘的Ctrl键+D键即可收藏本网页
2.手机浏览器可以添加书签收藏本网页
获取更多慕课答案，欢迎在浏览器访问我们的网站：http://mooc.mengmianren.com
注：请切换至英文输入法输入域名，如果没有成功进入网站，请输入完整域名：http://mooc.mengmianren.com/
我们的公众号
打开手机微信，扫一扫下方二维码，关注微信公众号：萌面人APP
本公众号可查看各种网课答案，还可免费查看大学教材答案
点击这里，可查看公众号功能介绍
APP下载
APP功能说明
1.可查看各种网课答案
点击【萌面人官网】，可查看知到智慧树，超星尔雅学习通，学堂在线等网课答案
点击【中国大学慕课答案】，可查看mooc慕课答案
2.可一键领取淘宝/天猫/京东/拼多多无门槛优惠券
如图所示，点击对应图标即可领取淘宝/天猫/京东/拼多多无门槛优惠券
适防县贤唯侗噶肃临娠灯盼党