Scribd
Upload
29 views2 pages

Question Bank - BE IT - ISR

question bank on isr sppu be it

Uploaded by

DEEPESH TIWARI
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
29 views2 pages

Question Bank - BE IT - ISR

question bank on isr sppu be it

Uploaded by

DEEPESH TIWARI
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

Question Bank

BE IT : Information storage and Retrieval

Unit No : I, II & III

Q. No. Questions UNIT


No
1 Explain Luhn’s idea in details with diagram I
2 Draw and Explain IR system block diagram I

3 Explain steps in conflation algorithm using suitable example. I

4 Find the Similarity of the following query with documents- D1,D2,D3 using vector I
model

Query Keywords
Q mouse,dog
Document Text Terms
D1 mouse mouse bee mouse bee
D2 dog bee dog hog mouse bee dog hog
Hog dog mouse dog
D3 cat gnu dog eel fox cat dog eel fox gnu

5 What is the necessity of feedback mechanism in IR ? I

6 Differetiate between suffix arrays and suffix trees? I

7 Perform Term based single pass clustering with threshold value 10 and use simple I
dot product as a Similarity calculation function.

T1 T2 T3 T4 T5
Doc1 1 2 0 0 1
Doc2 3 1 2 3 0
Doc3 3 0 0 0 1
Doc4 2 1 0 3 0
Doc5 2 2 1 5 1

8 Why is index term weighting used? I

9 Differentiate between data and informationretrieval I

10 Explain single link clustering algorithm with sutable example I

Dr Gajanan Walunjkar Page 1


11 Explain Rocchio’s algorithm in brief? I

12 Dissimilarity matrix is given as below I

1
2 0.6
3 0.6 0.8
4 0.9 0.9 0.7
5 0.9 0.6 0.6 0.9
6 0.5 0.5 0.9 0.5 0.5
1 2 3 4 5 6
Threshold 0.4,0.6,0.8, 0.9.
Apply Single link algorithm and calculate cluster for above 6 objects.

13 Compare Boolean and Vector IR models II


14 Write short on Suffix arrays and Signature files. II

15 Explain Inverted File with example. II

16 Write Short note on Suffix trees and Suffix Arrays II

17 Explain different types of searching techniques in IR

18 Define and Explain following terms-Precision and Recall III

19 Explain the terms MRR and NDCG III

20 Define and Explain following concepts related to visualization- III


i)User relevance judgment.
ii) Interface support for search process.
21 Find Precision ,Recall and F-score from the following scenario. III
Documents available: D1,D2,D3,D4,D5,D6,D7,D8,D9,D10
Relevant to our need: D1, D4, D5, D8, D10
Query to search engine retrieves: D2, D4, D5, D6, D8, D9

21 Explain user oriented measures for performance evaluation III

Dr Gajanan Walunjkar Page 2

You might also like