Scribd
Upload
66 views

Data & File Structure

This document is the exam for a Data & File Structure course being taken during the fall semester of 2005 at Pokhara University. It contains 7 questions testing various concepts related to data structures and file processing. Students are required to answer all questions in their own words within the allotted 3 hour time limit. The questions cover topics like sparse matrices, linked lists, stacks, queues, trees, sorting algorithms, file organization, directory structures, and more. Full marks are awarded based on comprehensively answering each sub-question.

Uploaded by

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

Data & File Structure

This document is the exam for a Data & File Structure course being taken during the fall semester of 2005 at Pokhara University. It contains 7 questions testing various concepts related to data structures and file processing. Students are required to answer all questions in their own words within the allotted 3 hour time limit. The questions cover topics like sparse matrices, linked lists, stacks, queues, trees, sorting algorithms, file organization, directory structures, and more. Full marks are awarded based on comprehensively answering each sub-question.

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 – Fall Year : 2005


Programme: BE Full Marks: 100
Course: Data & 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 is sparse matrix? How it can be represented in a linked list? 9


Write procedure to add two sparse matrices represented in linked
lists.
b) Convert the following infix expression into postfix expression 6
showing stack step by step in tabular form.
Infix: (A-B/C) *(D * E – F)
2. a) What is linked list? Discuss its types. What are the advantages and 8
disadvantages of linked list over array?
b) Write C/C++ functions to insert and to delete an item in queue in
circular representation. 7
3. a) Explain briefly the concept of AVL trees? Explain how you can 8
restore the balance property of AVL tree when inserting/deleting a
node violates its property. Illustrate with examples.
b) What do you mean by priority queue? Which is the most suitable 7
way to implement it? Discuss with an example.
4. a) Give outline of Divide and Conquer sorting. Trace sort algorithm 10
with following data:
13, 81, 92, 43, 65, 31, 57, 26, 26, 75, 0
b) Construct an expression tree from the following post – fix 5
expression:
ABCD - + $ * EF*- and get prefix equivalent
OR
Construst BST:
25,15,30,20,30,27,17,4,23,26,22 and show deletion of 27, 17 & 25

5. a) What is File Structure? Discuss the common operations in Files. 7


b) How is data organized in Magnetic Tape? Suppose we want to store 8
backup copy of a large mailing list file with one million 100 byte
records. If we want to store the file on a 6250 bpi tape that has an
inter-block gap of 0.3 inches, how much tape is needed? If B.F is 50,
what is the effect?
6. a) Explain and how the UNIX directory structure. 7
b) Explain physical and logical files. What are the fundamental file 8
processing operations? Explain in brief.
7. Write short notes on (Any Two) 52
a) Addressing in CD – ROM's
b) TOH problem
c) 2-3 trees
d) Double ended Queue and implementation

You might also like