It's Provide A Basic Knowledge About DSA for Campus Placements These Are The Codes Which Ask By Company Mostly Very Simples Codes To Understand A DSA with Codes And Codes Were Given For The Most Important and Basic topic
Academic Year :.............................................
, LESSON PLAN
Course Code Course Title L T P C
(Laboratory Integrated Theory Course)
CS23231 Data Structures 3 0 4 5
LIST OF EXPERIMENTS
Sl. No Name of the experiment
Week 1 Implementation of Single Linked List (Insertion, Deletion and Display)
Week 2 Implementation of Doubly Linked List (Insertion, Deletion and Display)
Week 3 Applications of Singly Linked List (Polynomial Manipulation)
Week 4 Implementation of Stack using Array and Linked List implementation
Week 5 Applications of Stack (Infix to Postfix)
Week 6 Applications of Stack (Evaluating Arithmetic Expression)
Week 7 Implementation of Queue using Array and Linked List implementation
Week 8 Implementation of Binary Search Tree
Week 9 Performing Tree Traversal Techniques
Week 10 Implementation of AVL Tree
Week 11 Performing Topological Sorting
Week 12 Implementation of BFS, DFS
Week 13 Implementation of Prim’s Algorithm
Week 14 Implementation of Dijkstra’s Algorithm
Week 15 Program to perform Sorting
Week 16 Implementation of Open Addressing (Linear Probing and Quadratic Probing)
Week 17 Implementation of Rehashing
, CS23231 – D a t a S t r u c t u r e s
INDEX
Name of the Experiment Expt. Page Faculty
S. No.
Date No Sign
1 Implementation of Single Linked List
(Insertion, Deletion and Display)
2 Implementation of Doubly Linked List
(Insertion, Deletion and Display)
3 Applications of Singly Linked List
(Polynomial Manipulation)
4 Implementation of Stack using Array and
Linked List implementation
5 Applications of Stack (Infix to Postfix)
6 Applications of Stack (Evaluating
Arithmetic Expression)
7 Implementation of Queue using Array and
Linked List implementation
8 Performing Tree Traversal Techniques
9 Implementation of Binary Search Tree
10 Implementation of AVL Tree
11 Implementation of BFS, DFS
12 Performing Topological Sorting
13 Implementation of Prim’s Algorithm
14 Implementation of Dijkstra’s Algorithm
15 Program to perform Sorting
16 Implementation of Collision Resolution
Techniques
Note: Students have to write the Algorithms at left side of each
problem statements.
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 azardeenismail. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for $9.29. You're not tied to anything after your purchase.
