Scribd
Upload
33 views

Data and File Structure

The document is a past exam paper for a Data and File Structure course at Pokhara University. It contains 7 questions testing students' knowledge of data structures and file systems. The questions cover topics like sparse matrix representation, physical vs logical files, deque operations, binary search trees, quicksort, linked lists, tape drive specifications, the UNIX directory structure, and file access functions. Students are required to answer all questions in their own words within the allotted 3 hour time limit.

Uploaded by

Adhikari Sushil
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
33 views

Data and File Structure

The document is a past exam paper for a Data and File Structure course at Pokhara University. It contains 7 questions testing students' knowledge of data structures and file systems. The questions cover topics like sparse matrix representation, physical vs logical files, deque operations, binary search trees, quicksort, linked lists, tape drive specifications, the UNIX directory structure, and file access functions. Students are required to answer all questions in their own words within the allotted 3 hour time limit.

Uploaded by

Adhikari Sushil
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

POKHARA UNIVERSITY

Level: Bachelor Semester – Spring Year : 2006


Programme: BE Full Marks: 100
Course: Data and File Structure Time : 3hrs.
Candidates are required to give their answers in their own words as far
as practicable.
The figures in the margin indicate full marks.
Attempt all the questions.

1. a) What are the possible ways of representing a sparse matrix? Explain 7


practical difficulties in representing it with an array.
b) What is fire structure? Explain the differences between physical and 8
logical files.
2. a) What is double ended queue? Which data structure is suitable for 5
DEqueue operations and which are not? Discuss.
b) Write evaluation of postfix algorithm and trace the algorithm for the 10
postfix:
ABC + - D * EF + $
Where A = 6, B = 1, C = 2, D = 3, D = 2 and F = 1
3. a) How do binary trees and binary search trees differ? Explain the 8
insertion algorithm for a binary search tree.
b) Construct AVL tree; 7
Input data : 10, 20, 30, 25, 27, 7, 4, 23, 21
and show deletions of 4, 7 and 27 in order.
4. a) Trace the quick sort algorithm for the following set of data: 7
25 57 48 37 12 92 86 33
b) Write algorithms to insert a node at end and delete first node in a 4+4
linked list.
5. a) A large mailing –list file with one million 100 bytes records is to be 8
backed up on 2400 foot reels of 6250-bpi tape with 0.3 inch
interblocks gaps. Tape speed is 200 inches per second. If a blocking
factor 50 is used.
i) How many extra records could be accommodated on the
2400-foot tape?
ii) How long would it take to read one block, including the gap?
And any time to read the entire file?
b) Explain the UNIX directory structure. Also write (at least four) the
basic file system commands.
7
6. a) Explain the orgranization of data in CD-ROM. What are the factors 7
that affect accessing of data from disk?
b) When you use fopen( ), fread( ), fwrite( ), and feof ( ) functions? 8
How would you use fseek ( ) function to find the current position of
a file?
7. Write short notes on (Any Two): 5×2
a) Threaded Binary trees
b) Inheritance for record buffer classes
c) File access methods
d) Heap and Priority queues

You might also like