HINDUSTAN INSTITUTE OF TECHNOLOGY AND SCIENCE

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

I internal Examination -August 2015
PCE603- INFORMATION RETRIEVAL
Class: MTech CSE & IE

1. Which searching technique is used to search in sorted array implementation of inverted

files? Why?
2. List the advantages of fast inversion algorithm
3. What do you mean by false drop probability?
4. Break the term ‘statistics’ into unique diagrams using n-gram stemming algorithm.
5. What are signature processors
Part II

6. Explain WOBT with three nodes having C,D, F, G and H as records.(8 M)

7. How is a Patricia tree constructed? Construct a Patricia tree for 01100100010111.
Discuss the algorithms on PAT tree.(16 M)
8. Explain Boyer-Moore algorithm in searching (16 M)

HINDUSTAN INSTITUTE OF TECHNOLOGY AND SCIENCE

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
I internal Examination -August 2015
PCE603- INFORMATION RETRIEVAL
Class: MTech CSE & IE

1. Which searching technique is used to search in sorted array implementation of inverted

files? Why?
2. List the advantages of fast inversion algorithm
3. What do you mean by false drop probability?
4. Break the term ‘statistics’ into unique diagrams using n-gram stemming algorithm.
5. What are signature processors
Part II

6. Explain WOBT with three nodes having C,D, F, G and H as records.(8 M)

7. How is a Patricia tree constructed? Construct a Patricia tree for 01100100010111.
Discuss the algorithms on PAT tree.(16 M)
8. Explain Boyer-Moore algorithm in searching (16 M)
 HINDUSTAN INSTITUTE OF TECHNOLOGY AND SCIENCE
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
I internal Examination -August 2015
PCE603- INFORMATION RETRIEVAL
Class: MTech CSE & IE

1. Which searching technique is used to search in sorted array implementation of inverted

files? Why?
2. List the advantages of fast inversion algorithm
3. What do you mean by false drop probability?
4. Break the term ‘statistics’ into unique diagrams using n-gram stemming algorithm.
5. What are signature processors
Part II

6. Explain WOBT with three nodes having C,D, F, G and H as records.(8 M)

7. How is a Patricia tree constructed? Construct a Patricia tree for 01100100010111.
Discuss the algorithms on PAT tree.(16 M)
8. Explain Boyer-Moore algorithm in searching (16 M)

HINDUSTAN INSTITUTE OF TECHNOLOGY AND SCIENCE

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
I internal Examination -August 2015
PCE603- INFORMATION RETRIEVAL
Class: MTech CSE & IE

1. Which searching technique is used to search in sorted array implementation of inverted

files? Why?
2. List the advantages of fast inversion algorithm
3. What do you mean by false drop probability?
4. Break the term ‘statistics’ into unique diagrams using n-gram stemming algorithm.
5. What are signature processors
Part II

6. Explain WOBT with three nodes having C,D, F, G and H as records.(8 M)

7. How is a Patricia tree constructed? Construct a Patricia tree for 01100100010111.
Discuss the algorithms on PAT tree.(16 M)
8. Explain Boyer-Moore algorithm in searching (16 M)
 HINDUSTAN INSTITUTE OF TECHNOLOGY AND SCIENCE
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
I internal Examination -August 2015
PCE603- INFORMATION RETRIEVAL
Class: MTech CSE & IE

1. Which searching technique is used to search in sorted array implementation of inverted

files? Why?
2. List the advantages of fast inversion algorithm
3. What do you mean by false drop probability?
4. Break the term ‘statistics’ into unique diagrams using n-gram stemming algorithm.
5. What are signature processors
Part II

6. Explain WOBT with three nodes having C,D, F, G and H as records.(8 M)

7. How is a Patricia tree constructed? Construct a Patricia tree for 01100100010111.
Discuss the algorithms on PAT tree.(16 M)
8. Explain Boyer-Moore algorithm in searching (16 M)

HINDUSTAN INSTITUTE OF TECHNOLOGY AND SCIENCE

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
I internal Examination -August 2015
PCE603- INFORMATION RETRIEVAL
Class: MTech CSE & IE

1. Which searching technique is used to search in sorted array implementation of inverted

files? Why?
2. List the advantages of fast inversion algorithm
3. What do you mean by false drop probability?
4. Break the term ‘statistics’ into unique diagrams using n-gram stemming algorithm.
5. What are signature processors
Part II

6. Explain WOBT with three nodes having C,D, F, G and H as records.(8 M)

7. How is a Patricia tree constructed? Construct a Patricia tree for 01100100010111.
Discuss the algorithms on PAT tree.(16 M)
8. Explain Boyer-Moore algorithm in searching (16 M)