A.P.

C College [WBSU]
Sessional Training Plan for 3rd Semester, 2023
Department: B.Sc. (Computer Science)
Subject: Data Structures Lab (CMSACOR05P)

Assignment Description Group / Week

No Individual
COR05P/01 WAP in C++ to search an element from a list. Give user the Individual
option to perform Linear search.
COR05P/02 WAP to search an element from a sorted list using Binary Individual One
search.
COR05P/03 WAP in C++ to sort a list of elements. Give user the option to Individual
perform sorting using Insertion sort, Bubble sort or Selection Two
sort.
COR05P/04 WAP in C++ to calculate factorial and to compute the factors
of a given no. i) using recursion. ii) using iterative Individual
COR05P/05 WAP in C++ to display Fibonacci series using recursion. Three
i) using recursion. ii) using iterative Individual
COR05P/06 WAP in C++ to calculate GCD of 2 number i) using recursion. Individual Four
ii) using iterative
COR05P/07 WAP in C++ to implement Linked List using templates.
Include functions for insertion, deletion and search of a Individual Five
number, reverse the list and concatenate two linked lists
(include a function and also overload operator +).
COR05P/08 WAP in C++ to implement Doubly Linked List using Individual
templates. Include functions for insertion, deletion and search Six
of a number, reverse the list.
COR05P/09 WAP in C++ to implement Circular Linked List using Individual
templates. Include functions for insertion, deletion and search Seven
of a number, reverse the list.
COR05P/10 WAP in C++ to perform Stack operations i) using Linked List Individual Eight
ii) using Array
COR05P/11 WAP in C++ to perform Queue operations i) using Linked
List ii) using Array Individual Nine
COR05P/12 WAP in C++ to create and perform different operations on
Double-ended Queues using Linked List. Individual Ten
COR05P/13 WAP in C++ to scan a polynomial using linked list and add Individual Eleven
two polynomial.
COR05P/14 WAP in C++ to create a Binary Search Tree and include following
operations in tree: Individual Twelve
(i) Insertion (Recursive and Iterative Implementation).
(ii) Deletion of a node.
(iii) Search a no. in BST.
(iv) Display it’s preorder, postorder and inorder traversals
recursively.
(v) Display it’s preorder, postorder and inorder traversals using
iteration.
(vi) Display it’s level-by-level traversals.
(vii) Display height of tree.
(viii) Count the no. of leaf node.
(ix) Count the no. of non-leaf node.
Instruction: Prepare a Lab Note Book in hardcopy and signed before practical examination.

Sessional in-charge: Dr. Paramita Biswas & Gobinda Karmakar

Date: 30/09/2023