Only Q9 in c++ 9.WAP for finding the element which appears maximum number of times inthe array.10.Consider that you are given with a database of employee records (at least 5).Each employee record having following information-Emp_id(integer)Emp_name(string)Emp_city(string)Assume that Emp id is unique. Write a function for taking database and putit in your header file. Use this function by including your own header file forfollowing questions.{Use the structure for creating database}

We will solve 9th problem in C++ Language.

Answered: WAP for finding the element which…

Engineering

Computer Science

WAP for finding the element which appears maximum number of times in the array. 9.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

A student has a number of attributes including: stName, stNo and stMark If we have a LIST of 4 students as follow (note: select suitable representation for a student) stName stNo stMark Sami 2019205030 77.5 Ahmad 2018407080 80.5 Dana 2020607089 71 Sara 2019876545 63 - Write a function that finds the maximum mark . Your function will return stName and stMark for the student who has the maximum mark. Call your function from main program to print your result.
Only Q9 in c++ using function concept
In C programming Write a function printCourseRow() which receives a course pointer and prints all its fields as a single row. Use proper formatting so that when we print 2 or more courses as rows, the same members align below each other. Test the function, but don’t include the testing code in your homework.Upload a screenshot of a sample output.
Using binary search approach, write a python function named update_record, which takes the following inputs: 1: students_records – Nested List of Tuples. Each tuple of the list represents student's data. 2: ID – An ID of a student whose data has to be updated 3: record_title – type of data that has to be updated 4: data – A new data that should replace record_title data and update the record of students' data associated to specific ID. If ID is given as the data to be updated, then return a message that ID cannot be updated. If ID is not found in students_records, then return a message that Record not found. NOTE: The type of record_title input can be "ID", "Email", "Mid1" or "Mid2". Please use the same spelling for these types in your code, because the same have been used in test cases. Test cases are attached below: student_records = '[("aa02822", "ea02822", 80, 65),("ea02822", "ea02822@st.habib.edu.pk", 80, 65),("fa08877", "fa08877@st.habib.edu.pk", 66, 67),("gh04588",…
In C++ Query the user for the name of a file. Open and process that file, reporting the number of words in the file and the number of words containing each letter, and the length of that word. Assume that any word exceeding nine characters is counted as a ten character word. If the same letter appears more than once, it is counted only once. The result should be a matrix of 26 rows (one row for each letter) and ten columns (one column for each word length (1-10), and the contents of the matrix must be displayed. As an example, assume the file contains only two words - “rotten” and “egg”. When processing “rotten”, rows for r, o, t, e and n would have the contents of column 6 incremented because “rotten” is a six letter word. When processing “egg”, rows for e and g would have the contents of column 3 incremented because “egg” is a three letter word.
Map a lambda function onto the 'name' column to capitalize all the president names in the DataFrame you created in Question 7. Remember to apply the .upper() method to capitalize the letters.
Write a function find_key(input_dict, target_value) that takes as parameters a dictionary and a target value and returns the key in the dictionary that maps to the target value or None if no such key exists. In other words, the function finds the key such that input_dict[key] == target_value. Notes: You may assume that the target_value only appears once in the dictionary and therefore there will be only one key that maps to the target. Hint: You need to iterate over all the keys, as this task is effectively using the dictionary backwards. For example: Test Result test_dictionary = {100:'a', 20:'b', 3:'c', 400:'d'} print(find_key(test_dictionary, 'b')) 20 test_dictionary = {100:'a', 20:'b', 3:'c', 400:'d'} print(find_key(test_dictionary, 'e')) None
Define the function print_trophic_class_summary(tli3_values) that accepts a list of trophic level index values and prints a summary outlining the number of lakes in each trophic classification, in order from highest trophic classification to lowest. See the examples for the required format. Notes: Your function must print the summary, not return it. In each state line, the initial number should be formatted with width 3. (Hint: :3 will be helpful) All possible states must be included in the output, even states with zero lakes. The following list will be helpful: ['Hypertrophic', 'Supertrophic', 'Eutrophic', 'Mesotrophic', 'Oligotrophic', 'Microtrophic', 'Ultra-microtrophic'] You must include and use one of your number_in_trophic_class functions (take your pick!), plus your trophic_class function. Basically, you can start with your answer to Question 5 or 6 and add your print_trophic_class_summary function definition after your previous definitions. For example: Test Result…
Computer Science Done in Perl. Someone gave me a wrong/incomplete answer. Write a function, hashsum, which takes a hash reference as its first argument and an array reference as its second argument. The function should take the elements of the array and use them as keys in the hash. The values in the hash corresponding to the keys in the array should be totaled, and the sum should be returned to the user. If a key passed in the array does not exist in the hash, ignore it. Write a sample program to call this function.
Question 8: Search through student records View Past Answers A student record is represented as a tuple consisting of (student's matriculation number, student name). For example, ('A0077294U', 'Shao Hong'). Suppose you are given a tuple of student records (as shown in template.py). Write a function get_student_name (matric_num, records) that searches through records for the student with given matric num . If found, return the name of that student. Otherwise return 'Not found'. For example, suppose you search for matric number 'A0084135B' in the student_record given in the template file, the result of search (i.e. return value of the function call) should be 'Yang Shun'. Note: do NOT make a hasty conclusion. When searching through the records, you may return the name of the student once you find it. However, you should return 'Not found' ONLY AFTER checking all records and never find a match. template.py # Do not edit student records student_records = (('A0077294U', 'Shaohong'),…
Write the function that returns the addresses of the largest and smallest numbers in a matrix 20 that it takes as a parameter, the function prototype is as follows, the return type from the function is left blank, you define it appropriately (navigate the matrix indices with pointer addressing). Function prototype: „FindMinMaxAddress(int M, int col, int row)
In C language