45. Requirements prioritization and negotiation belongs to:
(A) Requirements validation (B) Requirements elicitation
(C) Feasibility Study (D) Requirement reviews
Answer: B
46. Adaptive maintenance is a maintenance which ………….
(A) Correct errors that were not discovered till testing phase.
(B) is carried out to port the existing software to a new environment.
(C) improves the system performance.
(D) both (B) and (C)
Answer: B
47. A Design concept Refinement is a:
(A) Top-down Approach (B) Complementary of Abstraction concept
(C) Process of elaboration (D) All of the above
Answer: D
48. A software design is highly modular if :
(A) cohesion is functional and coupling is data type.
(B) cohesion is coincidental and coupling is data type.
(C) cohesion is sequential and coupling is content type.
(D) cohesion is functional and coupling is stamp type.
Answer: A
49. Match the following for operating system techniques with the most appropriate advantage:
List-I List-II
(a) Spooling (i) Allows several jobs in memory to
improve CPU utilization
(b) Multiprogramming (ii) Access to shared resources among
geographically dispersed computers in a
transparent way
(c) Time sharing (iii) overlapping I/O and computations
(d) Distributed computing (iv) Allows many users to share a computer
simultaneously by switching processor frequently
Codes:
(a) (b) (c) (d)
(A) (iii) (i) (ii) (iv)
(B) (iii) (i) (iv) (ii)
(C) (iv) (iii) (ii) (i)
(D) (ii) (iii) (iv) (i)
Answer: B
50. Which of the following statements is not true for Multi Level Feedback Queue processor scheduling algorithm?
(A) Queues have different priorities.
(B) Each queue may have different scheduling algorithm
(C) Processes are permanently assigned to a queue
(D) This algorithm can be configured to match a specific system under design
Answer: C
51. What is the most appropriate function of Memory Management Unit (MMU) ?
(A) It is an associative memory to store TLB
(B) It is a technique of supporting multiprogramming by creating dynamic partitions
(C) It is a chip to map virtual address to physical address
(D) It is an algorithm to allocate and deallocate main memory to a process
Answer: C
52. Dining Philosopher’s problem is a:
(A) Producer-Consumer problem (B) Classical IPC problem
(C) Starvation problem (D) Synchronization primitive
Answer: B
53. In ………… allocation method for disk block allocation in a file system, insertion and deletion of blocks in a file is easy.
(A) Index (B) Linked
(C) Contiguous (D) Bit Map
Answer: B
54. A unix file may be of type:
(A) Regular file (B) Directory File
(C) Device File (D) Any one of the above
Answer: D
55. Match the following:
List-I List-II
(a) Intelligence (i) Contextual, tacit, transfer needs learning
(b) Knowledge (ii) Scattered facts, easily transferrable
(c) Information (iii) Judgemental
(d) Data (iv) Codifiable, endorsed with relevance and purpose
Codes:
(a) (b) (c) (d)
(A) (iii) (ii) (iv) (i)
(B) (iii) (i) (iv) (ii)
(C) (i) (ii) (iii) (iv)
(D) (i) (iii) (iv) (ii)
Answer: B
56. Match the following knowledge representation techniques with their applications:
List-I List-II
(a) Frames (i) Pictorial representation of objects,
their attributes and relationships
(b) Conceptual dependencies (ii) To describe real world stereotype events
(c) Associative networks (iii) Record like structures for grouping
closely related knowledge
(d) Scripts (iv) Structures and primitives to represent
sentences
Codes:
(a) (b) (c) (d)
(A) (iii) (iv) (i) (ii)
(B) (iii) (iv) (ii) (i)
(C) (iv) (iii) (i) (ii)
(D) (iv) (iii) (ii) (i)
Answer: A
57. In propositional logic P↔Q is equivalent to (Where ~ denotes NOT):
(A) ~(P∨Q)∧~(Q∨P) (B) (~P∨Q)∧(~Q∨P)
(C) (P∨Q)∧(Q∨P) (D) ~(P∨Q)→~(Q∨P)
Answer: B
Explanation.
P<->Q= (P->Q)^(Q->P).
We know A->B is ~AvB.
58. Which of the following statements is true for Branch-and-Bound search?
(A) Underestimates of remaining distance may cause deviation from optimal path.
(B) Overestimates can’t cause right path to be overlooked.
(C) Dynamic programming principle can be used to discard redundant partial paths.
(D) All of the above
Answer: C
59. Match the following with respect to heuristic search techniques:
List-I List-II
(a) Steepest-accent Hill Climbing (i) Keeps track of all partial paths which
can be candidate for further exploration
(b) Branch-and-bound (ii) Discover problem state(s) that satisfy
a set of constraints
(c) Constraint satisfaction (iii) Detects difference between current
state and goal state
(d) Means-end-analysis (iv) Considers all moves from current
state and selects best move
Codes:
(a) (b) (c) (d)
(A) (i) (iv) (iii) (ii)
(B) (iv) (i) (ii) (iii)
(C) (i) (iv) (ii) (iii)
(D) (iv) (ii) (i) (iii)
Answer: B
60. Match the following for methods of MIS development:
List-I List-II
(a) Joint Application Design(JAD) (i) Delivers functionality in rapid iteration
measured in weeks and needs frequent communication, development, testing and delivery
(b) Computer Aided Software Engg (ii) Reusable applications generally with one
specific function. It is closely linked with idea of
web services and service oriented architecture.
(c) Agile development (iii) Tools to automate many tasks of SDLC
(d) Component based technology (iv) A group based tool for collecting user requirements and creating system design. Mostly used in analysis and design stages of SDLC
Codes:
(a) (b) (c) (d)
(A) (i) (iii) (ii) (iv)
(B) (iv) (iii) (i) (ii)
(C) (iii) (iv) (i) (ii)
(D) (iii) (i) (iv) (ii)
Answer: B