We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>

www.vustudents.ning.com

 www.bit.ly/vucodes + Link For Assignments, GDBs & Online Quizzes Solution www.bit.ly/papersvu + Link For Past Papers, Solved MCQs, Short Notes & More

Dear Students! Share your Assignments / GDBs / Quizzes files as you receive in your LMS, So it can be discussed/solved timely. Add Discussion

# CS301 Assignment No 03 Fall 2019 Solution & Discussion Due Date: 21-01-2020

CS301 Assignment No 03 Fall 2019 Solution & Discussion Due Date: 21-01-2020

+ How to Join Subject Study Groups & Get Helping Material?

+ How to become Top Reputation, Angels, Intellectual, Featured Members & Moderators?

+ VU Students Reserves The Right to Delete Your Profile, If?

Views: 1396

.

+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)

+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)

### Replies to This Discussion

CS301 Data Structures Assignment 3 Solution & Discussion Fall 2019

Another Solution idea:

`#include <bits/stdc++.h> using namespace std; class HeapNode_Min { // Tree node of Huffman public://Add data members here. char d;unsigned f;HeapNode_Min *l, *r;HeapNode_Min(char d, unsigned f = -1) { //Complete the body of HeapNode_Min functionthis->d = d;this->f = f ;this->l = NULL;this->r = NULL;} }; class Analyze { // two heap nodes comparisonpublic:bool operator()(HeapNode_Min* l, HeapNode_Min* r) { //add return before statement and statement is completed. return (l->f > r->f); //Complete this statement} }; void display_Codes(HeapNode_Min* root, string s) // To print codes of huffman tree from the root. { if (!root) return; if (root->d != '\$') cout  root->d  "\t: "  s  "\n";display_Codes(root->l, s + "0"); display_Codes(root->r, s + "1"); //Complete this statement by passing arguments} void HCodes(char data[], int freq[], int s) // builds a Huffman Tree{ HeapNode_Min *t,*r, *l ; // top, right, leftpriority_queue<HeapNode_Min*, vector<HeapNode_Min*>, Analyze> H_min; int a=0;while (a<s){H_min.push(new HeapNode_Min(data[a], freq[a])); ++a;}while (H_min.size() != 1) { l = H_min.top(); H_min.pop(); r = H_min.top(); H_min.pop(); t = new HeapNode_Min('\$', r->f + l->f); t->r = r; t->l = l; H_min.push(t); } display_Codes(H_min.top(), ""); } int main() { int frequency[] = { 3, 6, 11, 14, 18, 25 }; char alphabet[] = { 'A', 'L', 'O', 'R', 'T', 'Y' }; //Complete this statement by passing data type to both sizeof operators int size_of = sizeof(alphabet) / sizeof(*alphabet);cout"Alphabet"":""Huffman Code\n";cout"--------------------------------\n";//Call Huffman_Codes function. HCodes(alphabet, frequency, size_of);return 0; }`

## Latest Activity

Mani Siddiqui BS VIII posted a status
"میں کسی اور کے خواب اب دیکھوں کیسے تیری تصویر سرہانے جو پڑی رہتی ہے"
1 hour ago
+++A++R+++ posted a status
"رِشتے صِرف اُنہی سے بناو... جو نِبھانے کی اوقات رکھتےہو..."
2 hours ago
+++A++R+++ posted a discussion

### اے بنت حوا

2 hours ago
Mani Siddiqui BS VIII posted a status
3 hours ago
Mani Siddiqui BS VIII posted a discussion

### Proof Chahiye

3 hours ago
♦_"cнαη∂α"_♦ liked ♦_"cнαη∂α"_♦'s discussion Batch 6th Quiz No.1
3 hours ago
♦_"cнαη∂α"_♦ added a discussion to the group Freelancing DigiSkills Training Program

### Batch 6th Quiz No.1

3 hours ago
+ ! ! ! ! Mobi updated their profile
4 hours ago
4 hours ago
4 hours ago
5 hours ago
5 hours ago

1

2

3