Solve all parts and also make a huff huffing Huffman tree and generate code in part B take Name= RUWISH ZAHOOR Q.No.5.503a) Find the shortest path from source1010node 1 to every other node using130suitable Graph Algorithm100b) Write the following string with yourinformation:5460string="your fullName(RUWISH ZAHOOR) 19-arid-1149"lle.g. RUWISHOZAHOORD19-arid-1149Ilconsider & use space I after each wordNow draw a Huffman tree and generate codes.20

Ans a) The shortest path is found using Dijkstra's algorithm. From source node-1 to every other node…

Q.No.5. 50 2 a) Find the shortest path from source node 1 to every other node using suitable Graph Algorithm 10 10 30 20 100 b) Write the following string with your information: 60 string="your fullName(RUWISH ZAHOOR) 19-arid-1149"

Q.No.5. 50 2 a) Find the shortest path from source node 1 to every other node using suitable Graph Algorithm 10 10 30 20 100 b) Write the following string with your information: 60 string="your fullName(RUWISH ZAHOOR) 19-arid-1149"

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter7: Characters, Strings, And The Stringbuilder

Section: Chapter Questions

Problem 16RQ

See similar textbooks

Similar questions

#include "pqueue.h" #include <assert.h> #include "string.h" #include <stdlib.h> typedef char *string; typedef double priority; //priority here is double //There are some errors to be improved. I have already highlighted out. If there is any other errors, please tell points out typedef struct node { string data; priority prior; struct node* next; } NodeT; typedef struct PriorityQueueRepr{ NodeT* top; int element; //number of element in queue }PriorityQueueRepr; pqueue pqueue_create() { pqueue pq = (pqueue)malloc(sizeof(PriorityQueueRepr)); if (pq == NULL) { return NULL; } pq->element = 0; pq->top = NULL; return pq; } void pqueue_destroy(pqueue pq) { while (!pqueue_empty(pq)) { string s = pqueue_leave(pq); free(s); } free(pq); } void pqueue_join(pqueue pq, string dat, priority prio) { NodeT* newNode = (NodeT*)malloc(sizeof(NodeT)); newNode->data = (string)malloc(strlen(dat) + 1); //error is…
String Pair // Problem Description // One person hands over the list of digits to Mr. String, But Mr. String understands only strings. Within strings also he understands only vowels. Mr. String needs your help to find the total number of pairs which add up to a certain digit D. // The rules to calculate digit D are as follow // Take all digits and convert them into their textual representation // Next, sum up the number of vowels i.e. {a, e, i, o, u} from all textual representation // This sum is digit D // Now, once digit D is known find out all unordered pairs of numbers in input whose sum is equal to D. Refer example section for better understanding. // Constraints // 1 <= N <= 100 // 1 <= value of each element in second line of input <= 100 // Number 100, if and when it appears in input should be converted to textual representation as hundred and not as one hundred. Hence number…
Edef reverse_sentence (s: str) -> str: Given a sentence , we define a word within to be a continuous sequence of characters in that starts with a capital letter and ends before the next capital letter in the string or at the end of the string, whichever comes first. A word can include a mixture of punctuation and spaces. This means that in the string 'ATest string!', there are in fact only two words: 'A' and 'Test string!'. Again, keep in mind that words start with a capital letter and continue until the next capital letter or the end of the string, which is why we consider 'Test string!' as one word. This function will reverse each word found in the string, and return a new string with the reversed words, as illustrated in the doctest below. >>> reverse_sentence('ATest string!') 'A!gnirts tseT' return
Q4: Colouring Book Having spent the last couple of hours grading assignments, I decide it’s time for a break. I take out my favourite colouring book, turn to a random page I haven’t coloured in yet, and lay it on my desk. I then take out all my n crayons and line them up on the desk (it’s a very long desk). The colour of the ith crayon is a string c[i] (e.g. "blue"). Many of the crayons have the same colour. In fact, no matter how many crayons I have, there are at most 30 distinct colours amongst them. To start colouring, I always take a sublist (see Q1 for a definition) of the crayons laid on the desk and put away the rest (too many options can be overwhelming and can lead to indecision). I take a look at the line art in front of me and wonder, “How many different colours do I need to make this look great? One? Two? Maybe three?”. Now you understand my dilemma and are fully aware of my indecision. You kindly decide to help me out by telling me for every number k, if I were to use…
• get_tokens_from_equation(line): Takes one string as input that contains any combination of digits from 0-9 and the following mathematical symbols: + - x / = ^ (O The string does not have to correspond to a valid mathematical equation. For example, '4-3=0' and '4xx5=(8' could be valid inputs to this function. The function will translate the string into a list of tokens. A token is a single non-negative number (of any length) or a single mathematical symbol. Numbers should be added to the list as integers, and symbols as strings. The tokens in the list should be in the same order as the numbers/symbols appear in the string. For example, given the string '52-2=50', the function should return the list [52, '-', 50]. >>> get_tokens_from_equation('4=3') [4, '=', 3] >>> get_tokens_from_equation('6-5=15^4/2') [6, '-', 5, '=', 15, '^', 4, '/', 2] >>> get_tokens_from_equation('288/24x6=18x13x8') [288, '/', 24, 'x', 6, '=', 18, 'x', 13, 'x', 8]
Q3. a) Construct a DFA that accepts all strings over {a,b} containing bba as a substring. b) Minimize the following DFA. q3 a b qo
Based on coding below, help me fix all the error until the program can be run properly and neatly #include <iostream>#include <iomanip>#include <ctype.h>#include <string> using namespace std; struct nodeBankAccount{string bank_acc_name;string bank_acc_num;double bank_acc_bal; nodeBankAccount*link;}; nodeBankAccount *head, *rear;nodeBankAccount *current;nodeBankAccount *newNode;nodeBankAccount *deleteBank;nodeBankAccount *previous;nodeBankAccount *found; void addBankAccount(){char answer;int insertOption; do{newNode = new nodeBankAccount; cout << "Fill in the details below" << endl;cout << "Bank Account Name: ";cin>>newNode->bank_acc_name;cout << "Bank Account Number: ";cin>>newNode->bank_acc_num;cout << "Bank Account Balance: " << "RM ";cin>>newNode->bank_acc_bal;newNode->link = NULL; if(head == NULL){head = newNode;}else{cout<<"Press 1 to insert the new record at front of the…
public static String pancakeScramble(String text) This nifty little problem is taken from the excellent Wolfram Challenges problem site where you can also see examples of what the result should be for various arguments. Given a text string, construct a new string by reversing its first two characters, then reversing the first three characters of that, and so on, until the last round where you reverse your entire current string
a) Write a program that asks user to enter number of vertices in an undirected graph and then the adjacency matrix representing the undirected graph. The program, then, must display whether the given graph is connected or not. You will find two sample runs of the program below. Sample 1 Sample 2 Enter number of vertices: 3 Enter number of vertices: 3 Enter adjacency matrix: 0 1 1 1 0 0 1 0 0 Enter adjacency matrix: 0 1 0 1 0 0 0 0 0 The graph is connected. The graph is not connected.
a) Write a program that asks user to enter number of vertices in a directed graph and then the adjacency matrix representing the directed graph. The program, then, must display the node with the highest outdegree. Assume that nodes are named as 0, 1, 2 and so on. You will find a sample run of the program below. Enter number of vertices: 4 Enter adjacency matrix: 0 1 1 1 0 0 0 0 0 0 0 0 0 1 1 0 Node with the highest outdegree: 0
What input or parameter value impacts the number of times the recursive function will be called. • Give three specific examples of input/parameter values and, for each, state the number of times the recursive function will be called. • Devise a formula with respect to n that describes the number of times the recursive function will be called, where n is either the value passed or some property of the value passed (e.g. n might be the length of a string of the size of an array).
s = "abab" h 55m Left Substrings in s are { 'a', 'b', 'a', 'b', 'ab', 'ba', 'ab', 'aba', 'bab', 'abab'}. By deleting one "a" and one "b", the string becomes "ab" or "ba" and all of its substrings are distinct. This required 17. String Reduction 2 deletions. Given a string, reduce it in such a way that all of its substrings are distinct. To do so, you may delete any characters at any ALL index. What is the minimum number of deletions needed? Function Description Complete the function getMinDeletions in the editor below. Note: A substring is a contiguous group of 1 or more characters within a string. getMinDeletions has the following parameter(s): Example string s: the given string 8 S = "abab" Returns: int: the minimum number of deletions required Substrings in s are { 'a', 'b', 'a', 'b', 'ab', 'ba', 'ab', 'aba', 'bab', 'abab'}. By deleting one "a" and one "b", the string becomes "ab" or "ba" and all of its substrings are distinct. This required Constraints 2 deletions. 10 1sns 105…