PSC Vocational Teacher in Computer Science Model Questions and Answers

26. Depth first node generation with bounding function is called:
(A) Knapsack (B) Divide and conquer
(C) Greedy (D) Backtracking
Answer: D

27. The number of triominoes to be used in a defective chess board:
(A) (22k-1)/3 (B) (22k-1)
(C) (23k-1)/3 (D) none of these
Answer: A

28. The defective chess board problem can be elegantly solved using:
(A) BFS (B) Divide and conquer
(C) Hamiltonian circuit (D) None of these
Answer: B

29. The time required by the Prim’s algorithm is:
(A) O(n) (B) O(2n)
(C) O(n2) (D) none of these
Answer: C

30. If a binary search tree represents n identifiers, then there will be exactly …………….
(A) n-1 (B) n+1
(C) n (D) none of these
Answer: D

31. The services of the O/S are invoked with a special ………………. instruction.
(A) system call (B) policy
(C) i/o (D) none of these
Answer: A

32. Execv is a ……………… system call.
(A) I/O management (B) Inter process communication
(C) Process management (D) None of these
Answer: C

33. Physical addresses are also called …………….
(A) Virtual (B) Logical
(C) Absolute (D) None of these
Answer: C

34. When the order of process completion does make a difference, the problem is called a:
(A) critical section (B) dead lock
(C) atomic action (D) race condition
Answer: D

35. ………………. minimizes the average wait time for all processes.
(A) SJF (B) FCFS
(C) Highest response ration next (D) Round robin
Answer: A

36. …………….. allows us to keep the most useful process in memory.
(A) Overlays (B) Swapping
(C) Segmentation (D) None of these
Answer: B

37. A file which has no internal record structure is called:
(A) keyed file (B) sequential file
(C) flat file (D) none of these
Answer: C

38. In the buddy system, there is a free block list for each power of:
(A) 8 (B) 4
(C) 16 (D) 2
Answer: D

39. ………….. is a situation in which a process is prevented from proceeding because some other process always has the resource it needs.
(A) Starvation (B) Dead lock
(C) Locking (D) None of these
Answer: A

40. There are …………… ways to specify file names in UNIX.
(A) 2 (B) 3
(C) 4 (D) None of these
Answer: A

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
(A) Only (1) (B) Both (2) and (3)
(C) (1), (2) and (3) (D) Only (4)
Answer: C

42. Specifying one or more states that would be acceptable as solution to the problem is called …………… state.
(A) Initial (B) Goal
(C) Ending (D) None of these
Answer: B

43. The first requirement of a good control strategy is that it ……………..
(A) cause motion (B) be systematic
(C) both (A) and (B) (D) none of these
Answer: A

44. Each path does not reach the goal is called a ………….. path.
(A) Success (B) Complete
(C) Failed (D) Partial
Answer: D

45. To conduct a breadth first search add the new path, if any, to the …………… the queue.
(A) Back (B) Front
(C) Middle (D) None of these
Answer: A

46. The best first search algorithm is simplification of an algorithm called:
(A) Depth first (B) AO*
(C) A* (D) None of these
Answer: C

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
(A) Only (1) (B) (1) and (2)
(C) All of the above (D) None of the above
Answer: C

48. A semantic grammar is a …………….. grammar.
(A) Case (B) Context sensitive
(C) Context free (D) None of these
Answer: C

49. The collection of attributes in a frame is usually called:
(A) Constraints (B) Slot
(C) Features (D) None of these
Answer: B

50. Minimax procedure is a ………….. process.
(A) Depth first (B) Slot
(C) Features (D) None of these
Answer: A