Scribd
Upload
9 views6 pages

Assignment 1

Uploaded by

freefire737804650
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
9 views6 pages

Assignment 1

Uploaded by

freefire737804650
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 6

Cs3301:Data structures-assignment 1

Roll number Assignment topic


1 Abstract Data Types (ADTs)
2 List ADT
3 List-Array-based implementation
4 List-Linked list implementation
5 Singly linked lists
6 Circularly linked lists
7 Doubly-linked lists
8 Applications of lists
9 Polynomial ADT
10 Radix sort
11 Multilists.
12 Stack ADT
13 Operations of stack
14 Infix to Postfix conversion
15 Evaluating arithmetic expressions
16 Balancing Symbols
17 Function Calls
18 Queue ADT
19 Circular Queue
20 DeQueue
21 Applications of Queues.
22 Tree ADT
23 Tree Traversals
24 Binary Tree ADT
25 Expression trees
26 Abstract Data Types (ADTs)
27 List ADT
28 List-Array-based implementation
29 List-Linked list implementation
30 Singly linked lists
31 Circularly linked lists
32 Doubly-linked lists
33 Applications of lists
34 Polynomial ADT
35 Radix sort
36 Multilists.
37 Stack ADT
38 Operations of stack
39 Infix to Postfix conversion
40 Evaluating arithmetic expressions
41 Balancing Symbols
42 Function Calls
43 Queue ADT
44 Circular Queue
45 DeQueue
46 Applications of Queues.
47 Tree ADT
48 Tree Traversal
49 Binary Tree ADT
50 Expression trees
51 Abstract Data Types (ADTs)
52 List ADT
53 List-Array-based implementation
54 List-Linked list implementation
55 Singly linked lists
56 Circularly linked lists
57 Doubly-linked lists
58 Applications of lists
59 Polynomial ADT
60 Radix sort
61 Multilists.
62 Stack ADT
63 Operations of stack
64 Polynomial ADT
Cs3301 data structures-Assignment 2
Roll number Assignment topic
1 Binary Search Tree ADT
2 AVL Trees
3 Priority Queue (Heaps)
4 Binary Heap.
5 B-Tree
6 B+ Tree
7 Graph Definition
8 Representation of Graphs
9 Types of Graph
10 Breadth-first traversal
11 Depth-first traversal
12 Bi-connectivity
13 Euler circuits
14 Topological Sort
15 Dijkstra’s algorithm
16 Minimum Spanning Tree
17 Prim’s algorithm
18 Kruskal’s algorithm
19 Searching
20 Linear Search
21 Binary Search. Sorting
22 Bubble sort
23 Selection sort
24 Insertion sort
25 Shell sort
26 Merge Sort
27 Hashing
28 Hash Functions
29 Separate Chaining
30 Open Addressing
31 Rehashing
32 Extendible Hashing.
33 Binary Search Tree ADT
34 AVL Trees
35 Priority Queue (Heaps)
36 Binary Heap.
37 B-Tree
38 B+ Tree
39 Graph Definition
40 Representation of Graphs
41 Types of Graph
42 Breadth-first traversal
43 Depth-first traversal
44 Bi-connectivity
45 Euler circuits
46 Topological Sort
47 Dijkstra’s algorithm
48 Minimum Spanning Tree
49 Prim’s algorithm
50 Kruskal’s algorithm
51 Searching
52 Linear Search
53 Binary Search. Sorting
54 Bubble sort
55 Selection sort
56 Insertion sort
57 Shell sort
58 Merge Sort
59 Hashing
60 Hash Functions
61 Separate Chaining
62 Open Addressing
63 Rehashing
64 Extendible Hashing.
0
0
0
0
0
0

You might also like