CS301P Subjective by Academic Helpers

YxZMPlUO84Bw

CS301p Data Structure (Practical)

Lab No.

Lab Topic

Page No. Lab 1: Learn to implement linked list data structure Lab 2: Learn to implement stack data structure Lab 3: Learn to implement queue data structure Lab 4 : Learn to implement Binary Search Tree Data Structure Lab 5 : Learn to implement Binary Search Tree Traversals (In-Order, PreOrder, Post-Order) Lab 6 : Learn to implement function call by value, by reference and by pointer Lab 7: Learn to build/draw AVL tree and understand different types of rotations performed while constructing an AVL tree Lab 8: Learn to build/draw AVL tree 1 | P a g e Lab 9 : Learn to delete nodes from AVL with the help of rotations Lab 10 : Learn to build frequency table and Huffman encoding tree Lab 11: Learn to implement min heap using insert( ) method Lab 12: Learn to implement min heap using buildHeap( ) method Lab 13: Learn to a build union tree by using union by size method Lab 14:Learn to implement binary search algorithm Lab 15 : Build hash table using linear probing collision resolution technique Lab 16: Learn to sort array using elementary sorting algorithms. 2 | P a g e

Lab 1

Lab 1 Problem Statement

Lab Title: Learn to implement linked list data structure

Description:

Write a C++ program to create a Linked List that will store and display the data of faculty members of a university. The user will enter the data of 5 faculty members (name and age). On the basis of age, the post of the faculty member will be decided and then this data will be added into the linked list. Each node of the linked list will contain object of Faculty class in data part and next pointer.

Age Criteria for Faculty member’s post:

• Lecturer (if age>=25 and age<=35)
• Assistant Professor (if age>=36 && age<=45)
• Professor (if age>=46 && age<=60)

Structure of Classes:

The program should contain the following classes:

1. Faculty
2. Node
3. List

Faculty Class:

Private variables (string name, int age, string post) Functions: Setter and Getter functions