Scribd
Upload
48 views1 page

File Structures Jan 2018 (2010 Scheme)

The document contains questions from a File Structures exam. It has two parts, Part A and Part B, with multiple choice questions in each part. Part A questions focus on C/C++ file operations, record structures, data compression algorithms. Part B questions cover topics like B-trees, indexing, hashing, tries and Unix directory structures. Students must answer any five full questions, selecting at least two from each part.

Uploaded by

Sagar Khanal
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
48 views1 page

File Structures Jan 2018 (2010 Scheme)

The document contains questions from a File Structures exam. It has two parts, Part A and Part B, with multiple choice questions in each part. Part A questions focus on C/C++ file operations, record structures, data compression algorithms. Part B questions cover topics like B-trees, indexing, hashing, tries and Unix directory structures. Students must answer any five full questions, selecting at least two from each part.

Uploaded by

Sagar Khanal
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/ 1

For More Question Papers Visit - www.pediawikiblog.

com

rr
us ~~:Q1S63
.: ,-,J

Sixth Semester B.E. Degree Examination, Dec.2017/Jan:20t8)

ib
( ~
File Structures t.:/~/-)

Time: 3 hrs.
> /';
1/ 'Z
.c:
Max. Marks: 100
\t- [ote: Answer any FIVEfull questions, selecting ~)
I- ." / at least TWO questions from each part )\...
'v0-~' (

ik
. .: >: \PAR T - A (( : -.»
1 a. Explain the seekirig\~per.ation in detail with respect to C str p~ apd also C++ stream class.
. . ,,/:>' '~~\;. (08 Marks)
b. List and briefly explainth« strength and weakness of CD· ROM. (05 Marks)
c. Write a C++ program to .read.the contents of a file and i:Ji~pJaythe contents in reverse order
on the terminal. .K;· (07 Marks)

w
2 a. Differentiate between fixed length record and variableJingth record with suitable examples.
(04 Marks)
b. Explain the class hierarchy for record buffer object - IOBuffer. Also write only the class
structure with main members and methods of class IOBuffer.
ia (08 Marks)
c. Write a C++ program to pack the 'n; number of student records in a file. (Fixed length
record structure can be used) (08 Marks)

3 a. Write a C++ function or algorithm to search a record using RRN. (06 Marks)
b. List the needs of data compression. JExpla.in Run-length encoding algorithm with an
example. (08 Marks)
d
c. Explain the various placement strategies. (06 Marks)

4 a. Define co-sequential proc ssi.rg. Explain the essential components of consequential


»>:
e

processing model. (:: )"'- (10 Marks)


..,/.">
b. Explain K-way merge illgo~itRm with an example.
fir .....
,.. ",
-/ ..•-~
.."",,- .»:
(10 Marks)
<; 'C")
)
PAR T - B
I :> ..:: ;
.p

5 a. List the B-tree properties. Explain search and insert methods with} spect to B-tree.
//.., (10 Marks)
b. Calculate the number of levels for a B-tree given 1000000 keys arid rder 512. (10 Marks)

6 a. Explain indexed sequential access. Explain block splitting and merging ill' the sequence set
with suitable examples. (10 Marks) -c
ww

b. Explain in detail simple prefix B+ tree maintenance. ">~ (10 Marks)


..-
7 a.Define hashing. Differentiate between hashing and indexing. Explain su;;pL' hashihg
algorithm with an example. (,\(101'.farks)
v ,,( <'..\
b. Explain double hashing and chained progressive overflow in detail (to ~ ks)
<J ~ (';.
"0
~/'
w

Z
8 Explain the following:
a. Tries
b. Un ix directory structure
c. Field structures
d. Key sorting algorithm. (20 Marks)

*****

For More Question Papers Visit - www.pediawikiblog.com

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy