Scribd
Upload
6 views2 pages

Data Structures Important Topics

The document outlines important topics in data structures, divided into five units. Key subjects include algorithms, asymptotic notations, various data structures like stacks, queues, trees, and graphs, as well as sorting and searching algorithms. Each unit covers fundamental concepts and implementations relevant to data structures.

Uploaded by

mayanksardiya2000
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
6 views2 pages

Data Structures Important Topics

The document outlines important topics in data structures, divided into five units. Key subjects include algorithms, asymptotic notations, various data structures like stacks, queues, trees, and graphs, as well as sorting and searching algorithms. Each unit covers fundamental concepts and implementations relevant to data structures.

Uploaded by

mayanksardiya2000
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

Data Structures: Important Topics

UNIT 1:

1. What is an algorithm?

2. Asymptotic notations (Big-O, Theta, Omega).

3. Recurrence relation and master theorem.

4. Tower of Hanoi.

5. Address calculation in 1D and 2D arrays.

6. Types of data structures.

UNIT 2:

1. Stack implementation using linked list and arrays.

2. Queue (types: circular queue, etc.).

3. Queue implementation using linked list.

4. Infix to postfix conversion.

5. Priority queue.

UNIT 3:

1. Tree terminologies.

2. AVL tree (rotations).

3. B-Tree (basics).

4. AVL tree rotations.

5. Threaded binary tree.

6. Types of binary trees.

7. Proof: A tree with n nodes has (n-1) edges.

8. Tree traversal (preorder, inorder, postorder).

UNIT 4:
1. Graph terminologies.

2. DFS and BFS (differences).

3. Numerical questions on DFS and BFS.

4. Dijkstra's algorithm (single source shortest path).

5. Prim's and Kruskal's algorithms (with numerical examples).

UNIT 5:

1. Binary search algorithm.

2. Hashing (short notes and numericals).

3. Quick sort algorithm.

4. Merge sort algorithm.

5. Shell sort algorithm.

6. Insertion sort algorithm.

You might also like