Visit : https://hemanthrajhemu.github.

io

Join Telegram to get Instant Updates: https://bit.ly/VTU_TELEGRAM

Contact: MAIL: futurevisionbie@gmail.com

INSTAGRAM: www.instagram.com/hemanthraj_hemu/

INSTAGRAM: www.instagram.com/futurevisionbie/

WHATSAPP SHARE: https://bit.ly/FVBIESHARE

 Sixth Semester B.E. Degr
ee Examination, Dec.20
17/Jan.2618
File Structures
Time: 3 hrs.

io
Note: Answer any FIVEful Max. Marks: 100
l questions, selecting

b.
at least TWO questions
from eac h part.
ted as malpractice.

hu
1 a.
Explain the seeking operation PART~A
in detail With respect to C str
eam and also C++ stream class.
List and briefly explain th €

t
os

strength and weakness of (08 Marks)

CD ROM.

gi
Write a C++ program te (0S Marks)
read the contents ofa file
ten ep, 42+8 50, will be trea

on the terminal, and display the contents in rev

erse order
pages.

u.
(07 Marks)
2 a. Differentiate betwee
n fixed length record and var
s on the rer naining blank

iable length record with sui

b. Explain the class hierar m
chy for record buffer object
table examples.
(04 Marks)
structure with main memb - IOBuffer. Also write only
the class
he
ers and methodsofclass
c. Write a C++ program to | OBuffer,
pack the “n: number of studen (08 Marks)
record structure can be used) t records in file. (Fixed len
gth
aj
evalua lor and /or equations writ

(08 Marks)
3a. Write a C++ functi
on or algorithm to search a rec
ily dray v diagonal cross line

b. List the needs of dat ord using RRN.

r

a compression, Explain Run (06 Marks)

example. -length encoding algorithm
th

with an
c. Explain the various pla
cement strategies. (08 Marks)
(06 Marks)
an

4 a. Define co-sequentia
l processing, Explain the
processing model. essentia! components of
consequential
b. Explain K-way merge alg
em

orith im with an example. (10 Marks)

of idesntification, appeal to

(10 Marks)
Ling, your answ ers, compulsor

5 a. List the B-tree proper PART-B

ties. Explain search and ins
//h

ert methods with respect to

B-tree,
b. Calculate the number of
levels for a B-tree given
1000000 keys and order 5[2 (10 Marks)
s:

. (10 Marks)
6 a. Explain indexed sequenti al acc
ess. Explain block splitt
tp

with suitable examples. ing and merging in the seq

uence set
2 _ Anyrevealin 2

b. Explain in detail simple

p refix B” tree maintenance. (10 Marks)
Important Note: 1, On comple

ht

(10 Marks)
7 a. Define hashing. Differe
ntiate between hashing and
algorithm with an exampl indexing. Explain simpic
e. hashing
b. Explain double hashing
and chained Progressive overfl (i0 Marks)
owin detail (10 Marks)
8 Explain the follow ing:
a. Tries
b. Unix directory structure
Field structures
ae

Key sorting algorithm.

=2s+& ¢ (20 Maris,

https://hemanthrajhemu.github.io