Module 1:
Module 1 is about a implementing a list of award-winning pictures. There are a total of 7 programs and the first one has three major functions to print instructions, build the list, and process user inquiries and three function calls to get the user’s choice, print the entire list, and search for requested year and another function to compare function to compare 2 years (keys).
The second program is to implement a program using data structure for Academy Awards The third program maintains and displays a list of Academy Awards Motion Pictures. Fourth program is to Print instructions to user, buildList: Reads a text data file and loads the list. Fifth program is to process user choices, Prints the menu of choices, Prints the entire list. Sixth Program is used to Search for year and to print year, picture, and director. The last Program Compares two years in PICTURE structures.
Module 2:
In module2 The BST tree integer application reads integers from the keyboard and inserts them into the BST.
The first program builds and prints a BST. The second program is used to Compare two integers and return low, equal, high, Print one integer from BST. The third program is used for Swapping of left and right subtrees of a given binary tree. Fourth program is used for Counting the number of nodes in a binary search tree. Fifth program is used to find depth of the tree using
a)RECURSIVE VERSION:
A data structure that is partially composed of smaller or simpler instances of the same data structure. For instance, a tree is composed of smaller trees (subtrees) and leaf nodes, and a list may have other lists as elements.
B)ITERATIVE VERSION:
Iteration, in the context of computer programming, is a process wherein a set of instructions or structures are repeated in a sequence a specified number of times or until a condition is met. When the first set of instructions is executed again, it is called an iteration.
Module 3:In this module
1. Program to sort a given set of n numbers by first building a binary search tree with parent field
in tree node and containing numbers (using TREE-INSERT repeatedly to insert the numbers one
by one) and then printing the numbers by an inorder tree walk.
2. Program to find number of nodes and leaves in the tree
3. program for Exchanging left sub-trees with right sub-tree
4. Problem: preorder traversal of a threaded binary tree
5. Write a function to traverse an inorder threaded binary tree in preorder.
Module 4:
In this module 4 three concepts are involved they are as follows
⦁ Student list application
⦁ Radix sort
⦁ Circular single linked list
Student list application includes inserting the student data and deleting the student data
The program is done by using the concept of function reading the student data.
Comparing the cgpa between the two students. And declaring the high,lowor equal.
Radix sort is a non-comparative integer sorting algorithm that sorts data with integer keys by grouping keys by the individual digits which share the same significant position and value.
A circular linked list is a linked list in which the last node points to the head or front node making the data structure to look like a circle. A circularly linked listnode can be implemented using singly linked or doubly linked list