Scribd
Upload
241 views2 pages

Information Retrieval Model Question Paper

This document contains a model question paper for an Information Retrieval course. It includes 20 short answer questions covering key concepts like inverted indexes, tokenization, stop lists, stemming, lemmatization, wildcard queries, edit distance, distributed indexing, dictionary compression, variable byte coding, vector space model, clustering, evaluation metrics, XML retrieval, and probabilistic relevance feedback. Students are instructed to answer 4 out of 6 longer answer questions that require explanations of concepts like inverted index construction, Boolean vs ranked retrieval, wildcard queries, edit distance algorithms, distributed indexing, dictionary compression methods, variable byte coding, vector space scoring, efficient ranking, cluster pruning, and XML document simplification.

Uploaded by

Mitesh Kumar
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
241 views2 pages

Information Retrieval Model Question Paper

This document contains a model question paper for an Information Retrieval course. It includes 20 short answer questions covering key concepts like inverted indexes, tokenization, stop lists, stemming, lemmatization, wildcard queries, edit distance, distributed indexing, dictionary compression, variable byte coding, vector space model, clustering, evaluation metrics, XML retrieval, and probabilistic relevance feedback. Students are instructed to answer 4 out of 6 longer answer questions that require explanations of concepts like inverted index construction, Boolean vs ranked retrieval, wildcard queries, edit distance algorithms, distributed indexing, dictionary compression methods, variable byte coding, vector space scoring, efficient ranking, cluster pruning, and XML document simplification.

Uploaded by

Mitesh Kumar
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd

Siddaganga Institute of Technology, Tumkur-572103

(An Autonomous institution under visvesvaraya Technological University Belguam)

Eighth Semester B.E. Degree Model Question paper -2013

Information Retrieval IS832


Time: 3 Hrs

Max. Marks: 100


Instructions: 1. Question No. 1 is Compulsory.
2. Answer any 4 full questions from question Nos. 2 to 6.

1.
a)

Define Information Retrieval.

b)

What is an inverted index?

c)

Define tokenization.

d)

_____________ is the strategy for determining a stop list to sort the terms.

e)

What do you mean by Permuterm index?

f)

The process of keeping frequently used disk data in main memory is called _______.

g)

The law used for estimating the number of terms is ____________.

h)

Differentiate between parametric indexes and zone indexes.

i)

What is inverse document frequency?

j)

What are the different variant tf-idf functions for weighting of scores?

k)

Define Vector Space Model.

l)

What do you mean by pivoted document length normalization?

m)

Define Static quality scores.

n)

A process used for translation of user-specified keywords into a query is _________.

o)

Mention a difference between precision-recall curve and ROC curve.

p)

Define structured retrieval.

q)

What is Data-centric XML?

r)

Define Structured document retrieval principle.

s)

Differentiate between Text-centric and data-centric XML retrieval.

t)

What is relative frequency?

20*1=20
Marks

2. a)
b)
c)
3. a)
b)
c)
4. a)
b)
c)
d)
5. a)
b)
c)
6. a)
b)
c)

Explain the construction of inverted index with an example.

07-marks

Differentiate between extended Boolean model and ranked retrieval with a suitable
example.
Explain the working principle of Stemming and lemmatization process with a neat
example.

06-marks

What do you mean by wildcard query? Explain the different situations in which the
wildcard queries are used.
Explain the different steps involved for computing the edit distance between any two
strings such as s1 and s2 using an algorithm.
Diagrammatically explain the working procedure of Distributed indexing.

06-marks

Explain the different methods of achieving Dictionary compression. Give an example


for each.
What is Variable byte (VB) coding? Explain VB encoding and decoding processes
with a suitable example.
Write an algorithm to compute the weighted zone score from two postings lists..
Explain the vector space model for scoring with an example.

05-marks

How do you achieve efficient scoring and ranking of the documents? Illustrate with an
example.
What is cluster pruning? Explain with an example how to achieve it.
Explain the process of evaluation of unranked retrieval sets and ranked retrieval
results.

06-marks

Explain the process of simplifying XML document by DOM object with a diagram.
What are the different challenges in XML retrieval? Explain in brief.
Mention the various probabilistic approaches to relevance feedback.

06-marks
06-marks
08-marks

End of the Question Paper

07-marks

08-marks
06-marks

06-marks
05-marks
04-marks

06-marks
08-marks

You might also like