Information Retrival Techniques Set 11 MCQs

Q1 | What is state space?

the whole problem

your definition to a problem

problem you design

representing your problem with variable and parameter

Q2 | A search algorithm takes as an input and returns as an output.

input, output

problem, solution

solution, problem

parameters, sequence of actions

Q3 | A problem in a search space is defined by one of these state.

initial state

last state

intermediate state

all of the mentioned

Q4 | The Set of actions for a problem in a state space is formulated by a

intermediate states

initial state

successor function, which takes current action and returns next immediate state

none of the mentioned

Q5 | The process of removing detail from a given state representation is called

extraction

abstraction

information retrieval

mining of data

Q6 | The is a touring problem in which each city must be visited exactly once. The aim is to find the shortest tour.

finding shortest path between a source and a destination

travelling salesman problem

map coloring problem

depth first search traversal on a given map represented as a graph

Q7 | Web Crawler is a/an

intelligent goal-based agent

problem-solving agent

simple reflex agent

model based agent

Q8 | What is the major component/components for measuring the performance of problem solving?

completeness

optimality

time and space complexity

all of the mentioned

Q9 | A production rule consists of

a set of rule

a sequence of steps

set of rule & sequence of steps

arbitrary representation to problem

Q10 | Which search method takes less memory?

depth-first search

breadth-first search

linear search

optimal search

Q11 | Which is the best way to go for Game playing problem?

linear approach

heuristic approach (some knowledge is stored)

random approach

an optimal approach

Q12 | What is Architecture of a software based on?

design

requirements

all of the mentioned

none of the mentioned view answer

Q13 | What would happen if different organization were given same set of requirements?

it will produce same architecture

it will produce different architecture

it may or may not produce same architecture

none of the mentioned view answer

Q14 | What factors does a software architecture results in?

technical

business

social

all of the mentioned view answer

Q15 | What does Software architecture means?

it is the structure or structure of systems

it comprises of software components

relationship among components

all of the mentioned view answer

Q16 | The architects are influenced by which of the following factors?

customers and end users

developing organization

background and experience of the architects

all of the mentioned view answer

Q17 | How do developing organizations influence by architects?

immediate business

long term business

organization structure

all of the mentioned view answer

Q18 | Which among the following are true with regards to the architecture business cycle?

the architecture can affect the enterprise goals of the developing organizations

the architecture affects the structure of developing organizations

all of the mentioned

none of the mentioned view answer

Q19 | Architecture based process includes which of the following?

creating the business case for the system

understanding the requirements

analyzing or valuating the architecture

all of the mentioned view answer

Q20 | Which of the following does a business case consists of?

how much should a product cost?

what help does architecture description language provides?

what is domain analysis?

non of the mentioned view answer

Q21 | What claim does Analyzing and evaluating architecture follow?

adl’s provide valuable analytical capabilities but tend to concentrate on run-time properties of system

maintainability is the main aspect

maintainability has many facets

all of the mentioned view answer

Q22 | Round robin scheduling falls under the category of

non-preemptive scheduling

preemptive scheduling

all of the mentioned

none of the mentioned

Q23 | With round robin scheduling algorithm in a time shared system

using very large time slices converts it into first come first served scheduling algorithm

using very small time slices converts it into first come first served scheduling algorithm

using extremely small time slices increases performance

using very small time slices converts it into shortest job first algorithm

Q24 | The portion of the process scheduler in an operating system that dispatches processes is concerned with

assigning ready processes to cpu

assigning ready processes to waiting queue

assigning running processes to blocked queue

all of the mentioned

Q25 | Complex scheduling algorithms

are very appropriate for very large computers

use minimal resources

use many resources

all of the mentioned