Scribd
Upload
6 views4 pages

AI - DSA Question Bank

The document outlines important questions related to data structures across five units, covering topics such as copying methods, object-oriented programming, asymptotic notations, and recursion. It includes both short notes and detailed explanations on various data structures like arrays, linked lists, trees, and graphs, along with algorithms for sorting and searching. Additionally, it addresses concepts like abstract data types, minimum spanning trees, and graph traversals.

Uploaded by

Vidhya Elango
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
6 views4 pages

AI - DSA Question Bank

The document outlines important questions related to data structures across five units, covering topics such as copying methods, object-oriented programming, asymptotic notations, and recursion. It includes both short notes and detailed explanations on various data structures like arrays, linked lists, trees, and graphs, along with algorithms for sorting and searching. Additionally, it addresses concepts like abstract data types, minimum spanning trees, and graph traversals.

Uploaded by

Vidhya Elango
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/ 4

IMPORTANT QUESTIONS

DATA STRUCTURES

UNIT-I

5 MARKS

1. Write short notes on shallow and deep copying.

2. Write notes on introduction to oops

3. Write notes on namespace.

4. Write notes on asymptotics notations.

5. Write short notes on recursion

10 marks

1. Explain analysis of Algorthims &asymptotic notations.

2. Explain abstract data types with its types

3. Explain analyzing recursive algorithms.

4. Write notes on introduction to oops,Explain all types with example

UNIT-II

1. Write short notes on array with its types.

2. Write notes on linked list with its types.

3. Explain circular linked list.

4. Explain ADT.

5. Write notes on applications of list.

10 marks

1. Explain linked list with its types, write algorithms.

2. Explain array abstract data types with examples.

3. Explain queue with algorithms


UNIT-III

5 MARKS

1. Write notes on bubble sort. With examples.

2. Write notes on linear search with examples.

3. Explain hashing & hash functions.

4. Explain load factors,rehashing.

10 marks

1. Explain merge sort with algorithms.

2. Explain quick sort with algorithms.

3. Explain search with its types.

UNIT-IV

5 MARKS

1. Explain tree ADT and its teriminology.

2. Explain binary search tree with examples.

3. Explain AVL tree.

4. Explain heaps

10 marks

1. Explain avl tree and rotations.

2. Explain tree traversal and its types with algorithms.

3. Explain heaps with examples.

4. Explain binary search tree with examples.

UNIT-V

5 MARKS

1. Write notes Graphs (ADT) with graph representations.

2. Write notes on minimum spanning tree.


3. Write notes on BFS with examples

4. Write notes on topological ordering.

10 marks

1. Explain graph traversals and its types.

2. Explain Kruskal’s Minimum Spanning Tree (MST) Algorithms.

3. Explain prim’s minimum spanning tree algorithms

You might also like