# CSE222 / DS C++ Lab

## Syllabus

{% file src="<https://2980675225-files.gitbook.io/~/files/v0/b/gitbook-x-prod.appspot.com/o/spaces%2F7uMP7Ghb8mcjzaqhpGZJ%2Fuploads%2FugLaTF38HmM3vcwdFcQ2%2FCSE%20202%20DSC%2B%2B%20Lab%20Syllabus%20BTECH-IT.pdf?alt=media&token=534f5e30-b73a-4164-929c-0ad29e35f8f8>" %}

## Resources

<details>

<summary>EXPT 1</summary>

Write a C++ programs to implement recursive and non recursive

1. Linear search
2. Binary search

</details>

<details>

<summary>EXPT 2</summary>

Write a C++ programs to implement

1. Bubble sort
2. Selection sort
3. quick sort
4. insertion sort

</details>

<details>

<summary>EXPT 3</summary>

Write a C++ programs to implement the following using an array.

* Stack ADT
* Queue ADT

</details>

<details>

<summary>EXPT 4</summary>

Write a C++ programs to implement list ADT to perform following operations

* Insert an element into a list.
* Delete an element from list
* Search for a key element in list
* count number of nodes in list.

</details>

<details>

<summary>EXPT 5</summary>

Write C++ programs to implement the following using a singly linked list.

* Stack ADT
* Queue ADT

</details>

<details>

<summary>EXPT 6</summary>

Write C++ programs to implement the deque (double ended queue) ADT using a doubly linked list and an array.

</details>

<details>

<summary>EXPT 7</summary>

Write a C++ program to perform the following operations:

* Insert an element into a binary search tree.
* Delete an element from a binary search tree.&#x20;
* Search for a key element in a binary search tree.

</details>

<details>

<summary>EXPT 8</summary>

Write C++ programs for implementing the following sorting methods:

* Merge sort
* Heap sort

</details>

<details>

<summary>EXPT 9</summary>

Write C++ programs that use recursive functions to traverse the given binary tree in

* Preorder
* in order
* post order

</details>

<details>

<summary>EXPT 10</summary>

Write a C++ program to perform the following operations

* Insertion into a B-tree
* Deletion from a B-tree.

</details>

{% embed url="<https://mantavyam.notion.site/18152f7cde8880d699a5f2e65f87374e>" %}
Get Credited for sharing your Knowledge Source with your Peer
{% endembed %}

{% embed url="<https://mantavyam.notion.site/17e52f7cde8880e0987fd06d33ef6019>" %}
Submit Queries/Feedbacks/Suggestions/Complaints using this Form
{% endembed %}