0% found this document useful (0 votes)
1 views1 page

Data Structures

The document outlines questions related to data structures, categorized into two parts: Part-A consists of 10 short answer questions covering topics like algorithm complexity, arrays, searching techniques, and linked lists, while Part-B contains 12 detailed questions on data structure classification, sorting algorithms, recursion, and tree operations. It emphasizes the importance of understanding various data structures and their applications in computer science. The document serves as a study guide for students learning about data structures.

Uploaded by

arshuddin321
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
0% found this document useful (0 votes)
1 views1 page

Data Structures

The document outlines questions related to data structures, categorized into two parts: Part-A consists of 10 short answer questions covering topics like algorithm complexity, arrays, searching techniques, and linked lists, while Part-B contains 12 detailed questions on data structure classification, sorting algorithms, recursion, and tree operations. It emphasizes the importance of understanding various data structures and their applications in computer science. The document serves as a study guide for students learning about data structures.

Uploaded by

arshuddin321
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

DATA STRUCTURES

PART-A

ANSWER THE FOLLOWING QUESTIONS(2M)

1) Define the types of complexity of an algorithm.


2) Describe an Array and its representa�ons.
3) What are the searching techniques (Linear and Binary)?
4) Write about Circular linked lists.
5) How to perform addi�on of polynomials using linked list?
6) Describe Hashing and its related terms.
7) How to evaluate Pos�ix expression?
8) Write about the applica�ons of Stack.
9) Write about the applica�ons of Queues.
10) Write about the applica�ons of Linked lists.

PART- B

ANSWER THE FOLLOWING QUESTIONS (10M)

1) Explain the classifica�on of data structures with suitable examples.


2) Explain Sparse matrix ad its memory representa�ons.
3) Explain Bubble sort, Selec�on sort and Inser�on sort with advantages and
disadvantages.
4) Explain Linked lists with defini�on, advantages and disadvantages.
5) Write about different opera�ons performed using linked lists along with algorithms.
6) Write about Hashing Collision and Resolu�on techniques.
7) How to convert Infix to Pos�ix conversion using stacks?
8) Explain how recursion is applied for finding factorial, GCD of a number and solve the
Towers of Hanoi recursive problem.
9) Explain the types of Queues and write about the opera�ons performed on a Simple
and Circular Queues.
10) Write about the opera�ons performed on Binary Tree and Binary Search Tree (BST).
11) Explain in detail about AVL trees and its opera�ons.
12) Write about Graph traversal techniques (BFS and DFS).

You might also like