USN

b.
2a.
b.
3a.
b.
c.
4a.
b.
06rs63
Time: 3 hrs.
Sixth Semester B.E. Degree Examination, Dec.2013 lJan.20l4
File Structures
Max. Marks:100
Note: Answer FIVEfull questions, selecting
at leust TWO questions
from
each part.
PART
_
A
I a. Explain reading and writing operation in file processing. List all of them; Explain any two.
5a.
b.
o
o
o
p.
()
(!
o
L
oX
b0-
=n
-t
d)
troo
.=N
ibO
yo
o<
FO
*,a
d=
oc)
boi
a(!
-?
c.r
'Ea
oi:
=
:''l
o-X
():
oE
al=
!o
>\
(k
boo
troO
ir=
qo
=>
VL
o
(r<
:^
0.)
o
-7
o
Discuss the differenoe between Unix tools for sequenti4l processing and direct access.
(10 Marks)
].
Explain buffer management.
Explain the diffeient ways to manipulate buffers using classes.
(10 Marks)
(10 Marks)
(10 Marks)
(10 Marks)
(05 Marks)
(05 Marks)
(10 Marks)
(10 Marks)
(05 Marks)
the sequence
(10 Marks)
(05 Marks)
the sequence set
(10 Marks)
,,,i (10 Marks)
(10 Marks)
What is collision? Explain the process of collision resolution by progressive oveiflow.
(10 Marks)
Explain the limitation of biflary search and internal Sorting.
Justiff the statement: "Indexes arb too large to hold in memory."
What do you mean by index?
Explain obj ect-oriented model for implimenting c o -sequential processes.
Explain K-way merging algorithm with example.
..
PART-B
List the difference between binary search trees and AVI. trees.
Explain creation
,, of B-tree using an example for
CSDTAMPIBWNGURKEHOLJYQZFXV. Order of the B,tiee is 4.
Explain virtual B-trees and LRU replacement.
Explain the block splitting and merging due to insertion and delotion in
yftt"tlaTpl.",
.. n
-*
'
ti"
Explain the loading a simple prefix B* tree.
Define hashing explain a simple hashing algorithm.
c.
6a.
b.
la.
::
'b.
I
a.
b.
c.
d.
Write short notes on :
Seeking
Extendible hashing
B+ trees
Buddy Bucket. (20 Marks)
For More Question Papers Visit - www.pediawikiblog.com
For More Question Papers Visit - www.pediawikiblog.com
w
w
w
.
p
e
d
i
a
w
i
k
i
b
l
o
g
.
c
o
m