Write a program to implement Symbol Table using the concept of Hashing with separate chaining. The idea is to make each cell of hash table point to a linked list of records that have same hash function value.
Input: The identifier, its type and line number , which may contain repetitive entries.
Hashing function : a) Compute the sum of ASCII values for a given input to identify the cell in hash table b) The size of the hash table is 100.
Expected output: i) The hash table (Symbol table) along with identifiers, type, line number
Write a program in C++ that stores the numerator and denominator of two numbers infraction, after adding them the result is also stored into fraction format. Use structure fraction to store these numbers and their result (Bothnumeratoranddenominatorshouldbeof type int).
Write a programming C++ that calculates the number of possible arrangements for any number of guests and any number of chairs. (Assume there will never be fewer guests than chairs). A simple for loop should do it. for example the possible arrangement of six guests in four chairs is 360.
Create a structure called time. Its three members, all of type int, should be called hours, minutes, and seconds. Write a program that prompts the user to enter a time value in hours, minutes, and seconds. This can be in 12:30:50 format. The program then stores the time in a variable of type time, and finally prints out the total number of seconds.
Create a structure a type date that contains three members: the day, the month, the year, all of type int. Here the user enter a date in the format 10/9/2007, store it in a variable of type date, then retrieve the value from the variable and print the mouth in the same format.
Create a structure called volume that uses three variables of type Distance (structure) to model the volume of a room. Initialize a variable of type volume to specific dimensions, and then calculate the volume it represents and print out the result.
Create a recursive function dec to bin to find the binary representation of a non-negative integer.
Write a recursive algorithm to multiply two positive integers m and n using repeated addition. Specify the base case and the recursive case.
Write a recursive function to generate a pattern of stars, such as the following: * * * * * * * * * * * * * * * * * * * *
Write a recursive function that takes as a parameter a nonnegative integer and generates the following pattern of stars. If the nonnegative integer is 4, then the pattern generated is: * * * * * * * * * * * * * * * * * * * *