AI and DS stand for Artificial Intelligence and Data Science, respectively. They are two closely related fields that have a significant impact on modern technology and industries.
DEPA RTM ENT OF A RTIFICIA L INTELLIGENCE AND DATA SCIENCE
S CH OOL OF C OM PUTING
, INDEX
PAGE
SNO EX.N0 TITLE
NO.
1 Rubrics – External (i)
2 Rubrics – Internal (ii)
3 R-21 DS Lab Syllabus 1
TASK 1 - IMPLEMENTATION OF ARRAY
4 1a ADT 4
Basic Operations in Array ADT.
5 1b Find duplicates within given range. 7
6 1c Find Missing number in array without using extra space. 10
Find minimum difference between indexes of two
7 1d 13
given elements present in an array.
8 1e Right Rotation of elements from given index. 16
TASK 2-IMPLEMENTATION OF LINKED
9 2a LIST 19
Singly Linked List : Operations in Ascending Order
Doubly Linked List : Get reversed in from the given order using
10 2b 24
doubly linked list
Circular Linked List: Choose the place in the end of the circle so
11 2c 28
that you are the last one.
TASK 3-IMPLEMENTATION OF STACK ADT
12 3a 32
Implementation o f Stack ADT using Array in reverse
13 3b Find all elements greater than their Right element 38
, PAGE
SNO EX.N0 TITLE
NO.
14 3c Infix To Postfix Conversion 40
15 3d Stack Application to Balance Parenthesis 45
16 3e TOWERS of HANOI 49
TASK 4-IMPLEMENTATION OF QUEUE ADT
17 4a 53
Basic Operations of Queue ADT Using Array
18 4b Queue Implementation using Stack 58
19 4c Implementation of Circular Queue 64
TASK 5- BINARY SEARCH TREE 68
20 5a
Basic Operations of BST
21 5b Tree Traversal with Recursion 78
22 5c Tree Traversal without Recursion 82
23 5d Find the Depth and Height of the tree. 90
24 5e Find the MIN and MAX element of BST. 96
TASK 6-IMPLEMENTATION OF HASHING 102
25 6a
Basic Hashing Technique
26 6b Linear Probing 106
27 6c Separate Chaining 112
28 6d Character Frequency Counting 118
29 6e Number Frequency Counting 121
TASK 7-IMPLEMENTATION OF GRAPHS
30 7a 124
Read the adjacent Vertices from given Matrices
31 7b Find the Shortest Path using Dijkstra’s Algorithm 128
32 7c Find Minimum Spanning Tree using Prim’s algorithm 133
33 7d Find Minimum Spanning Tree using Kruskal’s algorithm 139
34 7e Implementation of Topological Sorting 144
35 7f Implementation of Depth First Search 149
, PAGE
SNO EX.N0 TITLE
NO.
36 7g Implementation of Breadth First Search 153
TASK 8-SORTING TECHNIQUES
37 8a 161
Implementation of Insertion Sort
38 8b Implementation of Merge Sort 165
39 8c Implementation of Quick Sort 171
40 8d Implementation of Bubble Sort 176
41 8e Implementation of Radix Sort 180
TASK 9-SEARCHING TECHNIQUES
43 9a 184
Implementation of Linear Search
44 9b Implementation of Binary Search 187
The benefits of buying summaries with Stuvia:
Guaranteed quality through customer reviews
Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.
Quick and easy check-out
You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.
Focus on what matters
Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!
Frequently asked questions
What do I get when I buy this document?
You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.
Satisfaction guarantee: how does it work?
Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.
Who am I buying these notes from?
Stuvia is a marketplace, so you are not buying this document from us, but from seller deepakdeendhayalan. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for $10.89. You're not tied to anything after your purchase.
