Scribd
Upload
0 views

data struture assignment topics

The document outlines various data structures and algorithms, including abstract data types, linked lists, trees, and graphs. It covers complexity analysis, sorting and searching techniques, and optimization problems like the knapsack problem and the traveling salesperson problem. Additionally, it discusses graph traversal methods and backtracking techniques.

Uploaded by

keerthanab64
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0 views

data struture assignment topics

The document outlines various data structures and algorithms, including abstract data types, linked lists, trees, and graphs. It covers complexity analysis, sorting and searching techniques, and optimization problems like the knapsack problem and the traveling salesperson problem. Additionally, it discusses graph traversal methods and backtracking techniques.

Uploaded by

keerthanab64
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

1.

Abstract data types – asymptotic notations – complexity analysis-


2. Linked lists: Singly linked list – doubly linked lists - Circular linked list,
3. General lists- stacks – Queues – Circular Queues – Evaluation of expression
4. Trees – Binary Trees – Binary Tree Traversal
5. Binary Tree Representations – Binary Search Trees –
6. threaded Binary Trees - Application of trees (Sets).
7. Representation of Graphs – Graph implementation
8. graph Traversals - Minimum Cost Spanning Trees
9. Shortest Path Problems-Application of graphs.
10. Bubble Sort, Insertion Sort
11. Quick Sort, Merge Sort, Selection Sort.
12. Searching – Linear search, Binary search.
13. Knapsack problem– Job Sequencing with deadlines
14. Optimal storage on tapes.
15. General method – Multistage Graph Forward Method
16. All pairs shortest path
17. Single source shortest path
18. Search Techniques for Graphs – DFS
19. Connected Components – Bi-Connected Components.
20. Backtracking: General Method -8-Queen‟s – Sum Of Subsets
21. Graph Colouring – Hamiltonian Cycles –
22. Branch And Bound: General Method – Travelling Sales Person Problem.

You might also like