Scribd
Upload
3 views2 pages

Data Structure

The document contains a series of questions and multiple-choice items related to data structures, sorting methods, file organization, and searching algorithms. It covers topics such as internal and external sorting, hash tables, and various file operations. Additionally, it includes prompts for discussions and explanations on specific data structure concepts and techniques.

Uploaded by

haruoyoshida0731
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
3 views2 pages

Data Structure

The document contains a series of questions and multiple-choice items related to data structures, sorting methods, file organization, and searching algorithms. It covers topics such as internal and external sorting, hash tables, and various file operations. Additionally, it includes prompts for discussions and explanations on specific data structure concepts and techniques.

Uploaded by

haruoyoshida0731
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

DATA STRUCTURE

1. A file is a collection of __________


a) Records b) Process c) objects d) Data Set
2. The fields used to distinguish among the records are known as ______
a) Keys b) Records c) Process d) objects
3. Differing environments require different sorting methods
a)Internal b)External c) combine d) None of the Above
4. Merge sort consists of several passes over the records being sorted___________
a) Insertion b) Bubble c)Quick d)fibonacci
5. Trees can be represented as ______nodes index condition
a) arrays b) Object c) Data d) Nodes
6. Data is stored along the tracks in _____
a) blocks. b) Object c) Data d) Nodes
7. Tracks run across the ______of the tape
a) Length b) Depth c) Both A & B d) None of the Above
8. Larger block size reduces the ___________
a) Input time b)output timec) Both A & B d) None of the Above
9. the method of distributing runs is known as ________merge
a)fibonacci b) Insertion c) Bubble d)Quick
10. Symbol table is a set of _____________pairs
a) name-valueb) Data – value c) Nodes – value d) None of the Above

1. Compare internal and external sorting.


2. Give an algorithm for binary search.
3. What is a file? Discuss.
4. Explain fibonacci series based searching.
5. Discuss hashing methods.
6. What is a hash table?
7. What is Balanced merge ? Discuss.
8. Write a short node on symbol tables.
9. Write an algorithm for merge sort.
10. Write short notes on static tree and dynamic tree.
11. Explain the k-way merging using disks.
12. Give a procedure for searching file using Fibonacci method
1. Discuss any two internal sorting techniques.
2. What is Hashing? Discuss any one Hashing techniques in detail.
3. Discuss the radix sort method with suitable example.
4. Discuss insertion sort method and quick sort method and compare these two methods.
5. Explain heap sort with an example.
6. Explain the issues in external sorting.
7. Explain heap sort with an example.
8. Explain the issues in external sorting.
1. Certain fields in a record may be designated as___________
a) key fields b) Value fields C)Data fields d) Tree fields
2. A combination of key values specified for retrieval is called as a_____
a)queryb) Object c) Data d) Nodes
3. the physical sequence of records is ordered on some key called ______
a)primary key b) value key c) Time Key d) Nodes Key
4. The mode of retrieval may be either _____________
a) batched b)realtime c) Both A & B d) None of the Above
5. In __________system the response time is not significant.
a) batch processing b) data processing c) Node processing d) Nodes processing
6. An index differs from a table essentially in its ____
a)size b) Value C) Data d) Process
7. The ________are used to search, insert and delete entries from a table
a) AVL trees b) Binary trees c) Nodes trees d) Both A & B
8. Retaining list lengths enables us to reduce___________
a)search time b) Data Time c) Process Time d) Nodes Time
9. the same cell may be accessed with out moving the____________
a) read heads b)write heads c) Both A & B d) None of the Above
10. Deletion may be simplified if we maintain it as a ___________
a) Single Linked List b)doubly liked list c) Multiple Liked List d)None of the Above

1. What is a file ? Discuss.


2. Discuss on inverted files.
3. Explain the advantages of sequential file organizations.
4. Explain any five file based operations.
5. Explain sequential file.
6. Write down various index techniques.
7. Explain different types of query with examples.
8. How do linked organization differ from sequential organization?
9. What are factors that affect the I/O time for disks?
10. Define Query.
11. Define cellular partitions.
12. What is meant by Random Organization?
1. Explain inverted file structures.
2. What are the different types of file organizations.
3. Explain tree traversals with examples
4. Discuss on indexed techniques.
5. Describe random file organization.
6. Discuss cellular partitioned structures.
7. Explain linked organization with an example.

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