Sei sulla pagina 1di 3

Information Retrieval Systems important questions for IV-Year, Semester I, IT A & B, Academic

year 2019-2020
Unit -1
1. Define Information Retrieval System? Page No 2
2. Elaborate precision and recall. (or) Objectives of Information Retrieval Systems. Page No 4-7
3. Define Vocabulary Domains. Page No 8 and 9
4. Define hit files. Differences between DBMSand IRS. Page no 2
5. Explain in detail about Functional Overview or Total IRS architecture? Page No 10- 17, write only
important concepts, 2 diagrams are must - Total Information Retrieval System diagram (page 11),
and The Text Normalization Process diagram (page 12).
6. Two classes of index files: Public and Private Index files. Page no 19
7. Define Automatic File Build Profiles. Page no 19
8. Relationship to Database Management Systems, Multimedia Database Search. page no 20
9. Elaborate Digital Libraries and Data Warehouses. Page no 21
10. Data mining (originally called Knowledge Discovery in Databases - KDD), Page no 23
11. Explain in detail about Search Capabilities. Page no 28 – 37, sub heading are Boolean Logic,
Proximity, Contiguous Word Phrases, Fuzzy Searches, Term Masking, Numeric and Date Ranges,
Concept/Thesaurus Expansion, Natural Language Queries, Multimedia Queries. 4 diagrams are
must.
12. Elaborate proximity. Page no 30 and diagram in 31
13. Elaborate Concept/Thesaurus Expansion. Page no 34-35
14. Elaborate Fuzzy Searches. Page no 32
15. Elaborate Ranking. Page no 38
16. Elaborate Zoning. Page no 40
17. Define Vocabulary Browse List with entered term “comput”. Page no 41
18. Define Canned Query. Page no 43
19. Elaborate Multimedia Z39.50 and WAIS Standards. Page no 44 write only important points
Unit -2
20. Define Indexing (originally called Cataloging) page no 52
21. Elaborate Indexing Process. Page no 56, diagram must, terms include Items Overlap Between Full
Item Indexing, Public File Indexing and Private File Indexing.
22. Elaborate Precoordination and Linkages. Page no 59, and diagram in 60
23. Elaborate Automatic Indexing. Page no 58-65, sub headings are Indexing by Term- Two-level
Bayesian network diagram, Indexing by Concept, Multimedia Indexing.
24. Explain in detail about Stemming Algorithms. Page 73-80 Sub headings are Porter Stemming
Algorithm, Dictionary Look-Up Stemmers, Successor Stemmers.
25. Elaborate Porter Stemming Algorithm. Page 75-76
26. Elaborate Inverted File Structure. Page 82-84, 2 diagrams are must.
27. Elaborate N-Gram Data Structures. Page no 85-87 Diagram is must Figure 4.7 Bigrams, Trigrams
and Pentagrams for “sea colony”.
28. Elaborate PAT Data Structure. Page no 89-92, 2 Diagrams are must, write only important points.
29. Elaborate Hidden Markov Models. Page 99-101 write only important points.
30. Define Signature File Structure. Page 93, diagram must Figure 4.13 Superimposed Coding
31. Elaborate Hypertext Structure. Page no 95.
Unit-3
32. Define Automatic Indexing. Page no 105
33. Elaborate Simple Term Frequency Algorithm. Page no 113-115, write only important points.
34. Elaborate Inverse Document Frequency. Page 116-117
35. Elaborate Bayesian Model. Page no 122, 123, and 2 diagrams are must Figure 5.6 Bayesian Term
Weighting, Figure 5.7 Extended Bayesian Network, Page no 124
36. Elaborate Concept Indexing. Page no 130-131, Diagram is must.
37. Define Hypertext Linkages. Page no 132
38. Define clustering. Page no 140
39. Elaborate Manual Clustering. Page no 144
40. Elaborate Complete Term Relation Method. page no 146 -150, write only important points.
41. Elaborate Document or Item Clustering. Page no 154-156
42. Elaborate Hierarchy of Clusters. Page no 157-159, diagram is must Figure 6.12 Dendogram, write
only important points.
Unit-4
43. Define Search Statements and Binding. Page no 166, and diagram in 167
44. Explain in detail about Similarity Measures. Page no 168-172, write all important formulas, diagram
in Figure 7.3 Query Threshold Process,
45. Explain in detail about Relevance Feedback. Page no 176-178 write 2 query formulas, 3 diagram,
positive feedback, negative feedback.
46. Explain in detail about Selective Dissemination of Information Search. Page no 180-185, write
important formulas and points.
47. Define Logicon Message Dissemination System (LMDS). Page no 180
48. Define Personal Library Software (PLS) system. Page no 180
49. Define latent semantic indexing (LSI). Page no 181
50. Define Error minimization. Page no 181
51. Define latent semantic index (LSI). Page no 182
52. Elaborate Neural networks for the learning function, Linear and Non-linear networks. Page no 184
53. Explain in detail about Weighted Searches of Boolean Systems. Page no 186-190. Write important
formulas and points and one venn diagram.
54. Elaborate six key characteristics of intelligent agents. Page no 191, sub headings are Autonomy,
Communications Ability, Capacity for Cooperation, Capacity for Reasoning, Adaptive Behavior,
Trustworthiness.
55. Define Information Visualization. Pg no 200
56. Define cognitive engineering and perception. Page no 200
57. Explain in detail about Information Visualization Technologies. Page no 208-215, sub headings are
Figure 8.4 Cone Tree, Figure 8.5 Perspective Wall From inXight web site - www.inxight.com, Figure
8.6 Tree Map (pg no 211), Figure 8.7 Envision Interface pg no 212, Figure 8.8 Visualization of
Results pg no 213, Figure 8.9 Example of DCARS Query Histogram pg no 214, Figure 8.10
CityScape Example pg no 215.
58. Gestalt psychologists’ postulate that the mind follows a set of rules. Page no 204, sub heading are
Proximity, Similarity, Continuity, Closure, Connectedness.
59. Elaborate Aspects of the Visualization Process. Pg no 205.
Unit-5
60. Elaborate Text Streaming Architecture. Page no 222-224, 2 diagrams are must Figure 9.1 Text
Streaming Architecture, Figure 9.2a Finite State Automata.
61. Explain in detail about Software Text Search Algorithms. Page no 225-232, important sub headings
are Brute force approach- page no 225, The Knuth-Pratt-Morris algorithm- content in page no
225,226 and only diagram in 227 and Figure 9.3 Shift Characters table page no 226, Boyer-Moore
algorithm, Another approach based upon Knuth-Pratt-Morris uses a finite state machine to process
multiple query terms-page no 230 Figure 9.6 Tables for Aho-Corasick Algorithm.
62. Elaborate GESCAN Text Array Processor. Page no 235
63. Elaborate Fast Data Finder Architecture. Page no 237
64. Define Multimedia information retrieval. Page no 241
65. Elaborate Spoken Language Audio Retrieval or BBN Rough ’n’ Ready prototype. Page no 242-243.
66. Define SoundFisher (www.musclefish.com). Page no 244
67. Elaborate Graph Retrieval. Page no 245
68. Define SageBook. Page no 246
69. Elaborate Imagery Retrieval. Page no 247-249
Note:
1. First go through the list of questions mentioned above.
2. Write down the formulas and draw diagram whereever it is necessary.
3. Above Questions start with define means 2 or 3 marks, elaborate means 5 marks and explain
means 10 marks.
4. Read the questions carefully and write the appropriate answers.
5. Please try to attend all the answers. [for all the subjects]

..…… All the very best for your University Examinations…….


by
Dr. C. Murugamani

Potrebbero piacerti anche