My Profile
Active Members
TodayLast 7 Days
more...
Awards & Gifts
Online Exams
Fresher Jobs
Our fresher job section is exclusively for fresh graduates! Find jobs for freshers in major Indian
cities including Bangalore, Chennai, Hyderabad, Pune or Kochi
Resources
Find educational articles, blogs, discussion threads and other resources.
Colleges
Find details about any college in India or search for courses.
|
Download Model question papers & previous years question papers
|
Posted By: S.Nagarajan Member Level: Gold Posted Date: 03 Jun 2008
|
2005 Andhra University B.Tech Computer Science & Engineering File structures Question paper
Testpapers of Andhra University BTech Computer Science & Engineering - File Structures
MODEL PAPER
B.Tech (CSE) Degree Examination
Third Year - First Semester
FILE STRUCTURES
Effective from the admitted batch of 2004-2005
Time: 3 hrs
Max Marks: 70
First Question is Compulsory
Answer any four from the remaining questions
All Questions carry equal marks
Answer all parts of any question at one place
1. a) Define the term Stream of bytes and Stream of records
b) What is rotational delay? What is the reason to delay?
c) When could be disks become bottleneck?
d) Write B-tree properties
e) What is multiple buffering? What is its use?
f) What are the limitations of key sort?
g) What ate the limitations of binary search?
2. a) What are the operations required to maintain an indexed file.
b) How do you retrieve special subset of records from a data file using combination of secondary key?
3. What is abstract data model? Why did the early file processing programs does not deal with abstract data model? What are the advantages of using abstract data models in applications?
4. What do you mean by data compression? Explain about the data compression. What are various techniques of data compression? What axe its uses?
5. What is hashing? Explain the various methods of hashing algorithms.
6. What is collision? Explain the various collision "resolution techniques".
7. a) Explain why the number of comparisons is not adequate for measuring performance in sorting large files.
b) Construct a B tree for the set of key values (21, 33, 41, 49, 54, 63, 70)_under the assumption that the number of search key values that fit in a one node is 5
Show the steps involved in the following tasks:
i) fond record 49 ii) Insert record 45 iii) Delete record 41
8. a) Explain how extendible hashing works. Show how it combines tries with conventional static hashing technique.
b) In extendible hashing procedure, the directory can occasionally point to empty bucket. Describe two situations that can produce empty bucket.
Return to question paper search
|
|
|
Submit Previous Years University Question Papers and make money from adsense revenue sharing program
Are you preparing for a university examination? Download model question papers
and practise before you write the exam.
|
Watch TV Channels
|