Scribd
Upload
7 views

JulyAugust-2022

This document outlines the examination structure for the B. Tech IV Year I Semester in Information Retrieval Systems at Jawaharlal Nehru Technological University Hyderabad. It includes a list of questions covering various topics such as indexing techniques, natural language processing, and algorithms for text searching. The exam consists of eight questions, from which students must answer any five, with each question carrying equal marks.

Uploaded by

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

JulyAugust-2022

This document outlines the examination structure for the B. Tech IV Year I Semester in Information Retrieval Systems at Jawaharlal Nehru Technological University Hyderabad. It includes a list of questions covering various topics such as indexing techniques, natural language processing, and algorithms for text searching. The exam consists of eight questions, from which students must answer any five, with each question carrying equal marks.

Uploaded by

srinivasreddy.patlolla
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Code No: 137DM R16

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD


B. Tech IV Year I Semester Examinations, July/August - 2022
INFORMATION RETRIEVAL SYSTEM
(Information Technology)
Time: 3 Hours Max. Marks: 75
Answer any Five Questions
All Questions Carry Equal Marks
JN
---

1.a) Describe various techniques used to provide the user with the capability to determine which
TU
items are of interest and select those to be displayed.
b) Explain the impact of Stop Words and Stop Lists on Precision and Recall. [10+5]

2.a) Explain how accessing previous results and accessing queries generated and saved in
H
previous sessions are helpful in facilitating current user to avoid entering poor Queries.
b) State the similarities and differences between Fuzzy Searches and Term Masking. [8+7]

3. What are the primary differences between Indexing by Term and Indexing by Concept?
U
Explain which method provides better results for “Natural Language Queries”. Justify your
answer. [15]
se
4.a) Apply the Porter stemming steps to the following words: Irreversible, incompetence,
inappropriate and irresponsible.
d
b) Describe how a bigram data structure would be used to search for the search term
“Environmental science”. What are the possible sources of errors that could cause non-
relevant Items to be retrieved? [9+6]
Pa
5.a) What is the information present in Natural language based indexing systems makes it
effective over normal statistical systems. Elaborate its effects on search process.
pe
b) Explain in detail, the major problem with URLs as a basis for hypertext links? [9+6]

6. Given the following set of items:


T1 T2 T3 T4 T5 T6 T7 T8
rs
I1 3 0 2 2 0 0 4 3
I2 0 0 4 3 2 0 0 2
I3 2 2 0 2 2 1 0 0
I4 0 1 0 2 2 0 1 0
I5 0 0 0 0 0 2 0 0
I6 2 1 3 4 2 2 0 2

a) Starting with I1 and I2 in Class 1, and with I3 and I4 in Class 2, determine which items
should be assigned to the clusters.
b) Use the one-pass technique to determine cluster assignment.
c) What are the differences in the results from the two processes? [15]
7.a) What is a Hypertext Document? Explain the potential ambiguities in use of relevance
feedback on hypertext documents.
b) Donald A. Norman said “... people are required to conform to technology. It is time to
reverse this trend, time to make technology conform to people”. Justify the statement.
[9+6]

8. Use the Boyer-Moore text search algorithm to search for the term FANCY in the text string
FANCIFUL FANNY FRUIT FILLED MY FANCY.
JN
a) Show all of the steps and explain each of the required character shifts.
b) How many character comparisons are required to obtain a match?
c) Compare this to what it would take using the Knuth-Pratt-Morris algorithm (you do not
TU
have to show the work for the KMP algorithm). [15]

--ooOoo--
H
U
se
d
Pa
pe
rs

You might also like