26
Depth first node generation with bounding function is called:
Answer
D. Backtracking
27
The number of triominoes to be used in a defective chess board:
Answer
A. (22k-1)/3
28
The defective chess board problem can be elegantly solved using:
Answer
B. Divide and conquer
29
The time required by the Prim’s algorithm is:
Answer
C. O(n2)
30
If a binary search tree represents n identifiers, then there will be exactly ................
Answer
D. none of these
31
The services of the O/S are invoked with a special ................... instruction.
Answer
A. system call
32
Execv is a .................. system call.
Answer
C. Process management
33
Physical addresses are also called ................
Answer
C. Absolute
34
When the order of process completion does make a difference, the problem is called a:
Answer
D. race condition
35
................... minimizes the average wait time for all processes.
Answer
A. SJF
36
................. allows us to keep the most useful process in memory.
Answer
B. Swapping
37
A file which has no internal record structure is called:
Answer
C. flat file
38
In the buddy system, there is a free block list for each power of:
Answer
D. 2
39
.............. is a situation in which a process is prevented from proceeding because some other process always has the resource it needs.
Answer
A. Starvation
40
There are ............... ways to specify file names in UNIX.
Answer
A. 2
41
Which among the following is/are a step to build a system to solve a particular problem?
(1) Define the problem
(2) Analyze the problem
(3) Isolate and represent the task knowledge
(4) None of these
(1) Define the problem
(2) Analyze the problem
(3) Isolate and represent the task knowledge
(4) None of these
Answer
C. (1), (2) and (3)
42
Specifying one or more states that would be acceptable as solution to the problem is called ............... state.
Answer
B. Goal
43
The first requirement of a good control strategy is that it .................
Answer
A. cause motion
44
Each path does not reach the goal is called a .............. path.
Answer
D. Partial
45
To conduct a breadth first search add the new path, if any, to the ............... the queue.
Answer
A. Back
46
The best first search algorithm is simplification of an algorithm called:
Answer
C. A*
47
Which among the following are/is the properties for the representation of knowledge in a particular domain?
(1) Representation adequacy (2) Inferential adequacy
(3) Inferential efficiency (4) Acquisition efficiency
(1) Representation adequacy (2) Inferential adequacy
(3) Inferential efficiency (4) Acquisition efficiency
Answer
C. All of the above
48
A semantic grammar is a ................. grammar.
Answer
C. Context free
49
The collection of attributes in a frame is usually called:
Answer
B. Slot
50
Minimax procedure is a .............. process.
Answer
A. Depth first
Discussion
Ask a doubt or share a tip.
No comments yet — start the discussion.