[go: up one dir, main page]
Scribd
Upload
8 views2 pages

Ds-2 Important Questions

The document contains a series of questions related to computer science topics, including sorting algorithms, binary search trees, AVL trees, graph operations, and file organization. It covers various algorithms such as quick sort, merge sort, and Dijkstra's algorithm, along with their complexities and applications. Additionally, it discusses concepts like hashing, collision resolution, and different file organizations.

Uploaded by

Ayush Chamoli
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
8 views2 pages

Ds-2 Important Questions

The document contains a series of questions related to computer science topics, including sorting algorithms, binary search trees, AVL trees, graph operations, and file organization. It covers various algorithms such as quick sort, merge sort, and Dijkstra's algorithm, along with their complexities and applications. Additionally, it discusses concepts like hashing, collision resolution, and different file organizations.

Uploaded by

Ayush Chamoli
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/ 2

QUESTION(UNIT3)

1. What are the difference between Internal and External Sorting?


2. Application of sorting and searching in computer Science.
3. Which sorting algorithm is best on the basis of complexity and why?

4. Explain quick sort. How is it used and useful?Explain its complexity with suitable examples.
5. Write algorithm to perform radix sort.Discuss using an example.
6. Explain Merge-sort algorithm with example.
7. Explain Bubble sort, insertion sort and selection sort with example and complexity

8. Explain linear search and binary search with algorithm and example.what are its advantages
and limitation
9. Write algorithm to perform radix sort

QUESTION(UNIT1)

1. What is binary search tree? Explain in detail the insertion and deletion in binary search tree
with algorithm?
2. What are Threads? What are its advantages and disadvantages?How threads are implementd
in trees? Explain through examples.
3. Explain the role of threads in binary search tree with suitable example
4. What do you mean by AVL tree? How to insert a node into AVL tree? Explain.

5. Describe the search and deletion operation in AVL Tree.


6. Write short notes on B-Tree?
7. Explain general tree and also discuss the steps to convert general tree into binary tree.

8. Describe Huffman algorithm with suitable example.


9. What is m-way search tree? Describe the searching ,insertion and deletion operation in m-way
search tree.
10. Describe Huffman coding and how is it important in data structure?

QUESTION(UNIT2)

1. Describe the various operations on graphs.


2. Describe warshall's algorithm and Floyed-Warshell algorithm for shortest path with example
3. Describe Dijkstra algorithm for shortest path with example.
4. Explain Topological sorting.

5. Describe Traversal of Graph in Details.


6. Diffrentiate DFS and BFS

QUESTION(UNIT-IV)

1. Define file. Describe constituents of a file.


2. Describe various kind of operations required to maintain files briefly.
3. Explain various types of file according tofunctions they perform.
4. Describe Serial File Organisation,its advantages and disadvantages.
5. What is sequential file organisation?In what applications you can justify the use of
sequential file? How can you perform the insertion and deletion operation in sequential
file?

6. Draw flowchart and also write the steps to access a record of a file.
7. What are steps for updating a sequential file?
8. Explain sequential ,random and direct access file organisation.
9. What do you mean by indexed sequential file? Discuss the different techniques for
handling overflow in indexed sequential file?
10. Describe and differentiate multi-list file organization and Inverted list file organization.

11. Describe fixed and variable length record with example.


12. Describe primary and secondry key with example.
13. what do you mean by hashing ? Explain various hashing function using suitable example.
14. How collision can be resolved?
15. What are the rules for choosing good hash function? The following values are to be stored
in a hash table: 32,49,97,101,102,155,183. Describe how the values are hashed by using
division method of hashingwith a table size of 7. Use chaining as the method of collission
resolution.

You might also like