CS607 Midterm Past Paper

You have come here while searching for CS607 midterm past papers. But before going to download the CS607 midterm past paper. I have a better option for you. That is, that you can attempt the online quiz of CS607.

Practice Quiz from CS607 Midterm Past Paper

This quiz will evaluate your preparation for the CS607 midterm examination and it is based on the past papers of CS607. The purpose of this quiz is to evaluate your performance in this subject. If you can pass this quiz, then there is a great chance that you can secure good marks in your exams.

0 votes, 0 avg

Your Time starts now

Times Up

Created on January 15, 2022 By

faisal_faisi

CS607

CS607 Midterm Past Papers Practice Quiz

Welcome to CS607 Midterm Online Practice Quiz.

You can check your preparation of CS607 for your Exams here.

Questions Will be different every time you will attempt.

1 / 30

Category: CS607-mid

Progressive deepening guarantees to find the solution at a minimum depth like

a. BFS

b. DFS

c. None

2 / 30

Category: CS607-mid

IF temperature is below 0 THEN weather is cold The above rule is used to represent _______

a. Recommendations

b. None of the given options

c. Relations

d. Directives

3 / 30

Category: CS607-mid

“A computer program designed to model the problem solving ability of a human expert” is known as --

a. Expert system

b. Energy System

c. Intelligent System

d. Echo System

4 / 30

Category: CS607-mid

To infer new information from semantic networks, we can ask questions from nodes.

a. False

b. True

5 / 30

Category: CS607-mid

Breadth-first search is a good idea when you are confident that the branching factor is _________

a. Small

b. Large

c. Extremely small

d. Medium

6 / 30

Category: CS607-mid

An AI system must form a meaningful and useful _____________ of the internal information.

a. Learning

b. Representation

c. Planning

d. Execution

7 / 30

Category: CS607-mid

We use graph to represent problems and their solution spaces.

a. True

b. False

8 / 30

Category: CS607-mid

The degree of truth that we have been talking about is specifically driven out by a function called the ___________ function.

a. Inline

b. Fuzzy

c. Ordinary

d. Membership

9 / 30

Category: CS607-mid

______ is the process of deriving logical conclusions from given facts.

a. Reasoning

b. Execution

c. Representation

d. Planning

10 / 30

Category: CS607-mid

----------- are closely coupled components; each is intrinsically tied to the other.

i-Knowledge representation ii-Reasoning iii-Planning iv-Execution

a. ii & iii

b. ii & iii

c. iii & iv

d. i & ii

11 / 30

Category: CS607-mid

Most of the solution spaces for problems can be represented in a ________

a. Graph

b. Demo

c. Table

12 / 30

Category: CS607-mid

In adversarial search there may occur such a scenario where two opponents also called _____ are searching for goal.

a. Players

b. Intruders

c. Friend

d. Adversaries

13 / 30

Category: CS607-mid

Another expert system named___________was developed by Digital Equipment Corporation, as a computer configuration assistant

a. Dendral

b. MYCIN

c. R3/XCON

d. R1/XCON

14 / 30

Category: CS607-mid

Which one of the following is involved in an ES development project:

a. The end user

b. The domain expert

c. All of the given

d. The knowledge engineer

15 / 30

Category: CS607-mid

Genetic algorithm uses evolutionary techniques, based on function optimization and artificial intelligence, to develop a solution.

a. True

b. False

16 / 30

Category: CS607-mid

Within an expert system, the ______________ contains facts about a specific subject area and rules that express the reasoning procedures of an expert on the subject.

a. None of the given options

b. Inference engine

c. Knowledge engineer

d. Knowledge base

17 / 30

Category: CS607-mid

Semantic networks are graphs, with nodes representing ____________ and arcs representing ____________ between objects.

a. objects, distance

b. relationships, distance

c. distance, relationships

d. objects, relationships

18 / 30

Category: CS607-mid

In Basic Genetic Algorithm the term mutation refers to a small random ________.

a. Operator

b. Number

c. Operand

d. Change

19 / 30

Category: CS607-mid

The tractable problems are further divided into structured and ________ problems

a. Complex

b. Non-structured

c. Simple

20 / 30

Category: CS607-mid

_____ AI actually tries to recreate the functions of the inside of the brain as opposed to simply emulating behavior

a. Strong

b. Weak

c. Weak and Strong

d. None of the given

21 / 30

Category: CS607-mid

Answering the Sequence Problem need

a. None of the given

b. Ability to make plan

c. Ability to schedule

d. Intelligence

22 / 30

Category: CS607-mid

Every graph can be converted into a tree.

a. True

b. False

23 / 30

Category: CS607-mid

Some essential components of problem solving are Problem statement, _________, solution space and Operators

a. Complex State

b. Initial State

c. Goal State

d. Intermediate State

24 / 30

Category: CS607-mid

Best first search is a greedy approach

a. False

b. True

25 / 30

Category: CS607-mid

Which one is not the application area of expert system?

a. Interpretation

b. Prescription

c. Diagnosis

d. None

26 / 30

Category: CS607-mid

Classical way of problem solving

a. GA

b. Generate and Test

27 / 30

Category: CS607-mid

The foothhill problem occurs whenever there are___________ peaks

a. Secondary

b. High

c. Deep

d. Primary

28 / 30

Category: CS607-mid

In optimal path searches we try to find the ____________ solution

a. Worst

b. Least

c. Least but not worst

d. Best

29 / 30

Category: CS607-mid

Which one of the problem is more subtle, and consequently, is more frustrating

a. Foothill problem

b. Plateau

c. Ridge

d. Box

30 / 30

Category: CS607-mid

Breadth-first search is a good idea when you are confident that the branching factor is_____

a. Small

b. Large

c. Extremely small

d. Medium

Your score is

The average score is 93%

Exit

Note before downloading CS607 midterm past paper

One thing to note dear fellows that you must don’t rely on these papers only. They can be a source of help but not an ultimate solution. If you want to get good marks in your exams you are advised to go through all of your handouts and must watch all of the video lectures.

Golden rules for good marks in VU Exams.

As per my experience, I have developed some golden rules for getting good marks in Virtual University Exams based on experience. I got 3.96 CGPA by following these rules. So here they are:

Never miss your Quiz, Assignment, or GDB.
Always try to do your Assignment on your own.
Try your best to finish your video lectures 10 days before exams.
Try your best to read your handouts twice before exams.
Read forward attempt backward.
Never schedule more than one paper on the same day.
Your most difficult paper should have a gap of 1 or more days.
Toughest paper must be scheduled first.
Read questions forward and attempt backward.
Don’t waste your time during a paper on illegal activities.

You can also download the Latest VU Handouts

To download the CS607 midterm past paper click here.

CS607 Midterm Past Paper online Practice Quiz

CS607 Midterm Past Paper

Practice Quiz from CS607 Midterm Past Paper

Note before downloading CS607 midterm past paper

Golden rules for good marks in VU Exams.

Leave a Comment Cancel Reply