3. First, build a HCTree based on the frequency of chars in a file: a(3), b(5), c(4), d(26), e(12). You should use the following rules when building your HCTree: HCNode with smaller count will have higher priority, and if the count is the same, then the HCNode with the larger ASCII value symbol will have higher priority. When popping two highest priority nodes from PQ, the higher priority node will be the 'co' child of the new parent HCNode. The symbol of any parent node should be taken from its 'cO' child. Your HCTree drawing won't be graded, but is required to answer the following question List the encoding bits of all the symbols (a, b, c, d, e) based on your HCTree a d. b e

3. First, build a HCTree based on the frequency of chars in a file: a(3), b(5), c(4), d(26), e(12). You should use the following rules when building your HCTree: HCNode with smaller count will have higher priority, and if the count is the same, then the HCNode with the larger ASCII value symbol will have higher priority. When popping two highest priority nodes from PQ, the higher priority node will be the 'co' child of the new parent HCNode. The symbol of any parent node should be taken from its 'cO' child. Your HCTree drawing won't be graded, but is required to answer the following question List the encoding bits of all the symbols (a, b, c, d, e) based on your HCTree a d. b e

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

Related questions

Q: True or False? and explain why. C language

A: Since this is a multipart question but as per guidelines only first three has to be answered

Q: Problem Description: Write a telephone lookup program. Read a data set of 1,000 names and telephone…

A: Program code to copy Main.java Main.java import java.io.File;import java.util.*; public class Main{…

Q: The coding language is python The code in there may or not be correct I was playing around with it…

A: PROGRAM: # The user in prompted for input and stored in userInput userInput = str(input("Enter the…

Q: 5.20 LAB: Adjust values in a list by normalizing When analyzing data sets, such as data for human…

A: We have to write a program to adjust the values by dividing all values by the largest value. The…

Q: In this exercise you will design and implement a simple encryption program that can either encrypt…

A: # Part 1# create a dictionary that map each alphabet to other random alphabetcoding_map = {'a': 'g',…

Q: What control structure does Java use to process all elements in a collection? A A do-while loop. B…

A: All control structure does Java use to process all elements in a collection

Q: Write a program to place ten queens on 10 x 10 chessboard in such a way that one queen is to be in…

A: Initialise a 2-Dimensional array of size 10 by 10Take input of the queen positions and initialise…

Q: You are to write a program, in C/C++, Java or Python, that should run using the following…

A: Look at the next step for the coding

Q: Use c++ Write a program that uses the STL list container to create a linked list of integers. The…

A: code in c++ stl; #include <bits/stdc++.h> using namespace std; int main() { string fname,…

Q: head OB-OD-ME-D/ DH М K P FIGURE 5-32 1. For each of the following, write the Java statements that…

A: All three of these parts have Java implementations in this code:Part a: Maintains the sorted order…

Q: attached file, you will find a function that creates a binary search tree of a given size and files…

A: It is defined as an efficient algorithm for finding an item from a sorted list of items. It works by…

Q: Consider the following list of keys: 80, 57, 65, 30, 45, 77, 27, 4, 90, 54, 45, 2, 63, 38, 81, 28,…

A: Here is the C++ program That will print the list after each sort: #include <iostream>using…

Q: C++ Quadratic Probing: You have a file called athletes.txt Jamie, basketball Justine, soccer

A: The given function uses quadratic probing to search for a given name or sport in a hash table.…

Q: Write a program that reads in lines from a file "data.dat" and adds them to an unordered map where…

A: Initialize a varaible count=1 that will denote the line number. Now, using getline take input of…

Q: Task 5: Unscramble You will write a program that takes in 2 files: a dictionary file and a file…

A: Here's a C program that takes in two files, a dictionary file and a file listing jumbled words, and…

Q: We want the program to use a DEQueue object to create a sorted list of names. The program gives a…

A: Here's an implementation of the program using a Deque object to create a sorted list of names:

Q: We want the program to use a DEQueue object to create a sorted list of names. The program gives a…

A: Programming Approach : Import the deque class from the collections module. Create an empty deque…

Q: Write a program that allows the user to sort using the Heap Sort and Bin/Radix Sort. The program…

A: Heap Sort Algorithm:Heap Sort is a comparison-based sorting algorithm that uses a binary heap data…

Concept explainers

Types of Linked List

A sequence of data elements connected through links is called a linked list (LL). The elements of a linked list are nodes containing data and a reference to the next node in the list. In a linked list, the elements are stored in a non-contiguous manner and the linear order in maintained by means of a pointer associated with each node in the list which is used to point to the subsequent node in the list.

Linked List

When a set of items is organized sequentially, it is termed as list. Linked list is a list whose order is given by links from one item to the next. It contains a link to the structure containing the next item so we can say that it is a completely different way to represent a list. In linked list, each structure of the list is known as node and it consists of two fields (one for containing the item and other one is for containing the next item address).

Question

3. First, build a HCTree based on the frequency of chars in a file: a(3), b(5), c(4), d(26), e(12). You should
use the following rules when building your HCTree:
HCNode with smaller count will have higher priority, and if the count is the same, then the
HCNode with the larger ASCII value symbol will have higher priority.
When popping two highest priority nodes from PQ, the higher priority node will be the 'co' child
of the new parent HCNode.
The symbol of any parent node should be taken from its 'cO' child.
Your HCTree drawing won't be graded, but is required to answer the following question
List the encoding bits of all the symbols (a, b, c, d, e) based on your HCTree
a
d
b

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2 Step by Step HC tree making and final HC tree:

VIEW

Step 3 Encoding bits

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 3 steps with 7 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

This code gets an error for going out of range in the last for loop. What can I do to fix this? # Lucas Conklin# 5772707import csvimport statistics def readCSVIntoDictionary(f_name): data = [] with open(f_name) as f: reader = csv.reader(f) for row in reader: if not data: for index in range(len(row)): data.append([]) for index in range(len(row)): data[index].append(float(row[index])) f.close() return data features = readCSVIntoDictionary("C:\\Users\\lucas\\Downloads\\pima.csv")print(features) def find_median_and_SD(data, feature): med = statistics.median(data[feature]) rounded_med = round(med, 4) st_dev = statistics.stdev(data[feature]) rounded_st_dev = round(st_dev, 5) return rounded_med, rounded_st_dev for i in range(0, len(features)): (median, st_dev) = find_median_and_SD(features, i) print(f'Feature {i} Median: {median} Standard Deviation: {st_dev}')…
I have given you the linear search code example on the video and I want you to go through the code and adjust the code. In the following code, list consists of number 4 twice however when you execute this code you find only the first 4. Please adjust your code to find both 4’s on the list def linear_search(list1,key): for i in range(len(list1)): if key==list1[i]: print("Element is found at index", i) break else: print("The element is not found") list1=[4,5,10,4,9,21] key=int(input("Enter a key number: ")) linear_search(list1,key)
In C++, write a program that outputs the nodes of a graph in a breadth first traversal. Data File: Please use this data file. Text to copy: 100 1 3 -9991 4 -9992 5 -9993 2 -9994 -9995 7 8 -9996 4 7 -9997 -9998 -9999 7 8 -999 Diagram: Also, please take a look at figure 20-6 on page 1414 and calculate the weights for the following edges: 0 -> 1 -> 4 0 -> 3 -> 2 -> 5 -> 7 0 -> 3 -> 2 -> 5 -> 8 6 -> 4 6 -> 7 9 -> 7 9 -> 8 To calculates these weights, please assume the following data: 0 -> 1 = 1 0 -> 3 = 2 1 -> 4 = 3 3 -> 2 = 4 2 -> 5 = 5 5 -> 7 = 6 5 -> 8 = 7 6 -> 4 = 8 6 -> 7 = 9 9 -> 7 = 10 9 -> 8 = 11
C++ Code Use the following list to sort it and create a single linked list: 6,13,7,11,9,2,15,5,3,4,10,14 Also make a list of the available memory. Print the list out with the links. Now delete 11 from the list, adding its location to the available memory list, then add 1 and 8 to the list. When you add the 1 you should use the location of the deleted 11 to add 1 there. Add 8 to the next available spot on the available memory list. When you print the list, print out the logical list using the links and also print out physical list without the links to see what the real list looks like.
Using c++ Contact list: Binary Search A contact list is a place where you can store a specific contact with other associated information such as a phone number, email address, birthday, etc. Write a program that first takes as input an integer N that represents the number of word pairs in the list to follow. Word pairs consist of a name and a phone number (both strings). That list is followed by a name, and your program should output the phone number associated with that name. Define and call the following function. The return value of FindContact is the index of the contact with the provided contact name. If the name is not found, the function should return -1 This function should use binary search. Modify the algorithm to output the count of how many comparisons using == with the contactName were performed during the search, before it returns the index (or -1). int FindContact(ContactInfo contacts[], int size, string contactName) Ex: If the input is: 3 Frank 867-5309 Joe…
However, the number of integers must be a power of 2. In main.c, key[ ] has 16 integers. But as you should alreadyknow, the program will not sort if one integers is removed or added. What you are going to do is modify the mergesort.c module so that a non-power of 2 number of integers can be sorted. When you modify a module, indicate by way of comment, what was changed, the date the change was made. You will also need to add or remove an integer to/from key[] in module sort158a.c.You are NOT allowed to change merge.c, mergesort.h or wrt.c filesThe mergesort function in file mergesort.c MUST call the merge function which it currently does.The main function in sort158a.c you can only change the number of integers in the key[] arrayBelow are 3 examples of output. The first with an array of 15 integers. The second with an array of 16 (power of 2) integers and the third with 17 integers.Example of Output with 15 integersBefore mergesort: 4 3 1 67 55 4 -5 37 7 4 2 9 1 -1 6After mergesort: -5…
In C++ Develop a simple spell checker and word suggestion program using Hashing. A dictionary of words should be given as a first argument (filename) in the program. This input file is the simple text file "Dictionary.txt", where each line is a word (see Files section). The program must ask the user to give a word. (case 1) The program must respond with “True” if the word exists in the dictionary, and must suggest words (from Dictionary) starting with the same first two letters. At the end of each suggestion the exec. time (in micro-sec) must be displayed (see "TimeInterval.h" in Files section). (case 2) If the input word does not exist in Dictionary due to user misspelling, and considering the first letter is correct, the program should return a recommended word from the dictionary (only one word). For example, instead of the word sentence, the user enters snetence, setnence, sentens, or setence, etc; the program should return: "do you mean sentence?" If "no", return "false". If…
Python’s for loop allows the programmer to add or remove items in the collection over which the loop is iterating. Some designers worry that changing the structure of a collection during iteration might cause program crashes. The remedy is to make the for loop read-only, by disallowing mutations to the collection during iteration. You can detect such mutations by keeping a count of them and determining if this count goes up at any point within the collection’s __iter__ method. When this happens, you can raise an exception to prevent the computation from going forward. In the arraybag.py file complete the following in the ArrayBag class: In the __init__ method, include a new instance variable named modCount, which is set to 0. In the __iter__ method include a temporary variable named modCount, which is set initially to the value of the instance variable self.modCount. Immediately after an item is yielded within the __iter__ method, you raise an exception if the values of the two mod…
6. the grade is under 20 which is outlier, remove it from the array list. 7. Print array list using System.out.println() 8. Use indexOf to print index of 80. 9. Use get function. 10. What is the difference between get and index of? 11. Print the values of the array list using Iterator class. 12.. Delete all the values of the array list using clear function. 13. Print all the values of the array after you execute clear using System.out.println(). what is the result of using clear function? 14. What is the shortcoming of using array List?
Which of the following statements regarding linked lists and arrays is correct? Group of answer choices: a. A dynamically resizable array makes insertions at the beginning of an array very efficient. b. Using a doubly linked list is more efficient than an array when accessing the ith element of a structure. c. A dynamically resizable array is another name for a linked list. d. Any type of list tends to be better than an array when there are a set number of maximum items known beforehand. e. If many deletions at any place in the structure were common, a linked list implementation would likely be preferable to an array
Please design the mapper and reducer for the below WordCount problem. WordCount problem: Given an input text file, count the frequency of each word in the file. Please design the input and output pairs for the Mapper and Reducer, use below table for reference. Input Output We get the "WordCount.jar" file by using the above table. It only contains Mapper and Reducer. There is no Combiner and no Partitioner in this program. Please illustrate how the WordCount.jar program works on the below dataset. This text file only contains one line. Dataset: the sound sounds sound. it is the right right, right? Suppose we run the WordCount.jar program on this file. Suppose that the space symbol, and "?" are all used for separating the words. The outputs of the Mapper are Mapper The outputs of the reducer are Reducer Answer: Are the results sorted alphabetically? When was it sorted? 2 27 20 35
String doctor_names is read from input. Split doctor_names into tokens using a vertical bar ('|') as the separator and assign patients_list with the result. Ex: If the input is Harry|Suki|Maria, then the output is: ['Harry', 'Suki', 'Maria']