Categories
C++

Hello this is a small coding assigment with 4 test cases. A driver program, call

Hello this is a small coding assigment with 4 test cases.
A driver program, called RA9Prog.cpp, is used to test your implementations of the three classes. The program reads from an input file a list of customers records and accepts a command line flag. Each customer’s record includes the customers type (Gas, or Electricity), customer’s account number, and the amount of usage. The program considers all Gas customers should have accounts in the range 0 to 99999, and all Electricity customers should have account numbers in the range 100000 to 199999. The customers records should not include two records with the same account number.
The accepted command flags are related to the following test cases:
Case 1 “-new”: Displays the list of accepted customers records.
Case 2 “-rej”: Displays the list of rejected records that have similar account numbers.
Case 3 “-inv”: Displays the lists of invalid customers’ records based on the customer’s account type.
Case 4 “-ave”: Displays the average consumption and the average bill amount for each customer type.

Categories
C++

Project 22.1 (daveteaches.com) Project 23.1 (daveteaches.com) If it says compile

Project 22.1 (daveteaches.com)
Project 23.1 (daveteaches.com)
If it says compile failed, I will continue to screenshot for you to modify, just like the incorrect example.

Categories
C++

Project 22.1 (daveteaches.com) Project 23.1 (daveteaches.com) If it says compile

Project 22.1 (daveteaches.com)
Project 23.1 (daveteaches.com)
If it says compile failed, I will continue to screenshot for you to modify, just like the incorrect example.

Categories
C++

See “The queue Container Adapter” – in textbook. page 1114 C++ STL queue For t

See “The queue Container Adapter” – in textbook. page 1114
C++ STL queue
For this assignment, modify the attach a code to create a program that allows 4 flights to be placed on a queue for departure. Use the provided code and data.
Add 4 flights from the provided FlightRunWayDepartures class.
Once the limit of 4 is reached – do the following:Remove the flight from the queue and display “Flight xxx has taken off” where xxx is the provided flight from the queue
After a flight has departed, add another flight to the queue
Continue Steps 2A-2B until all flights are loaded.
Processing the remaining entries in the queue as done in Step 2A. Do this until the queue reports it is empty.

Categories
C++

Utilize the simple example. https://llimllib.github.io/bloomfilter-tutorial/Link

Utilize the simple example.
https://llimllib.github.io/bloomfilter-tutorial/Links to an external site.
with example hashes http://www.partow.net/programming/hashfunctions/ Links to an external site.
Insert 4 names into the bit vector.
Test to see how well it performs the look-up.
Now, create your own bloom filter in netbeans, just like the example.
Randomly choose names/randomly create names and pass through the filter.
How does the Prob of false positives compare with the calculated.
Submit here

Categories
C++

Directions: Please upload a zip file. PLEASE DO NOT COPY CODE FROM INTERNET, THA

Directions: Please upload a zip file. PLEASE DO NOT COPY CODE FROM INTERNET, THANK YOU.
The file should contain the following:
a. All *.cpp and *h files
b. Screenshot(s) of the output/results by running your program.
c. Excel/Word file that summarizes and explains your execution results
d. Within your source code, you should write down comments that describes the
purpose, expected input, and expected output of each function. Inside each
function, you may introduce comments to explain the logics of important lines of
source code.
. All I need is source code that ends with cpp and h.
Objectives: Use the execution time recording source code learned from Section 1.4
(time.h) or (chrono) and compare the execution time of the following 5 implementations
Introduce 1000000 (N) integers randomly and save them in a vector/array. Find the 100 (M) smallest elements using the following implementations.
Note if your computer cannot handle 1 million elements, you may reduce the size. However, you are NOT allowed to reduce the size too small which result in insignificant execution time difference among all the algorithms. (code is not right if the execution time among 6 algorithms are insignificant).
1. Use quick sort and then print the 100 smallest elements.
2. Implement a Priority Queue implemented by the following 3 different approaches.
Print the 100 smallest element.
a. Ordered array/vector
b. Heap using array/vector
c. Heap using binary tree (a heap constructed by tree nodes. If you linked list
to construct a heap, you will get zero). You are required to implement the
following functions insert and delMax for priority queue, of course, also
including swim and sink functions (again, node based. Additionally, for
the heap using binary tree, you are required to implement the following
functions:
i. [Easy] A computeHeight function for heap binary tree that will
return the height of the tree.
ii. [Easy] A computeLeaves function for heap binary tree will return
the number of leaves of the tree.
iii. [Easy] A lookup(int key) function for heap binary tree that will
return true if key is found in the tree and return false otherwise.
iv. [Mid] A sameLevel(Node* current) function that will return all the
node pointers at the same level of current node (return a
vector*).
v. [Mid] A descendant(Node* current, Node* aNode) function that
return true if aNode is current node’s descendant node. Otherwise,
return false.
vi. [Hard] A isHeap function for heap binary tree that will return true
is all subtrees satisfy heap properties (root has max value in each
subtree and complete tree). Return false otherwise.
For each of the above implementations, please record their execution times for 5 times
and then average the results (6 different kinds to find 100 smallest elements from 1
million or billion elements). Compare the difference of execution times and self-explain
your findings (this may be asked in your final exam). Note your finding should be in a
Word or Excel format that presents the results of 6 algorithms, each is executed 5 times.
Include screenshots of execution results of your functions

Categories
C++

Utilize the simple example. https://llimllib.github.io/bloomfilter-tutorial/Link

Utilize the simple example.
https://llimllib.github.io/bloomfilter-tutorial/Links to an external site.
with example hashes http://www.partow.net/programming/hashfunctions/ Links to an external site. Insert 4 names into the bit vector.
Test to see how well it performs the look-up.
Now, create your own bloom filter in netbeans, just like the example.
Randomly choose names/randomly create names and pass through the filter.
How does the Prob of false positives compare with the calculated.
Submit here

Categories
C++

Directions: Please upload a zip file. PLEASE DO NOT COPY CODE FROM INTERNET, THA

Directions: Please upload a zip file. PLEASE DO NOT COPY CODE FROM INTERNET, THANK YOU.
The file should contain the following: a. All *.cpp and *h files
b. Screenshot(s) of the output/results by running your program.
c. Excel/Word file that summarizes and explains your execution results d. Within your source code, you should write down comments that describes the purpose, expected input, and expected output of each function. Inside each function, you may introduce comments to explain the logics of important lines of source code.
. All I need is source code that ends with cpp and h.
Objectives: Use the execution time recording source code learned from Section 1.4 (time.h) or (chrono) and compare the execution time of the following 5 implementations Introduce 1000000 (N) integers randomly and save them in a vector/array. Find the 100 (M) smallest elements using the following implementations. Note if your computer cannot handle 1 million elements, you may reduce the size. However, you are NOT allowed to reduce the size too small which result in insignificant execution time difference among all the algorithms. (code is not right if the execution time among 6 algorithms are insignificant).
1. Use quick sort and then print the 100 smallest elements.
2. Implement a Priority Queue implemented by the following 3 different approaches. Print the 100 smallest element.
a. Ordered array/vector
b. Heap using array/vector
c. Heap using binary tree (a heap constructed by tree nodes. If you linked list to construct a heap, you will get zero). You are required to implement the following functions insert and delMax for priority queue, of course, also including swim and sink functions (again, node based. Additionally, for the heap using binary tree, you are required to implement the following functions:
i. [Easy] A computeHeight function for heap binary tree that will return the height of the tree.
ii. [Easy] A computeLeaves function for heap binary tree will return the number of leaves of the tree.
iii. [Easy] A lookup(int key) function for heap binary tree that will return true if key is found in the tree and return false otherwise.
iv. [Mid] A sameLevel(Node* current) function that will return all the node pointers at the same level of current node (return a
vector*).
v. [Mid] A descendant(Node* current, Node* aNode) function that return true if aNode is current node’s descendant node. Otherwise, return false.
vi. [Hard] A isHeap function for heap binary tree that will return true is all subtrees satisfy heap properties (root has max value in each subtree and complete tree). Return false otherwise.
For each of the above implementations, please record their execution times for 5 times and then average the results (6 different kinds to find 100 smallest elements from 1 million or billion elements). Compare the difference of execution times and self-explain your findings (this may be asked in your final exam). Note your finding should be in a Word or Excel format that presents the results of 6 algorithms, each is executed 5 times. Include screenshots of execution results of your functions

Categories
C++

4 C++ coding assignments for a computer programming 1 class Upload the followin

4 C++ coding assignments for a computer programming 1 class
Upload the following files in a zip folder that you have modified:
your .cpp source file
Screenshot of the Console with the code executing in a Word document.
assignment 1 https://www.evernote.com/shard/s546/sh/35de3eea-5286-d44e-776b-278ca5cc0044/8200a44e6dc0fd25345f22c57e946e9c
assignment 2 https://www.evernote.com/shard/s546/sh/e35ca2ce-3462-9df1-b63d-b082e37bff13/5fe1cd93fe0f93643cb7cd82fdf955f0
assignment 3 https://www.evernote.com/shard/s546/sh/4c55a426-613f-f72a-cad4-7f29993d711a/a40b75fe5132eaf9a88db9e941d8b175
assignment 4 https://www.evernote.com/shard/s546/sh/681e94c2-0bb7-caaa-9737-ad04f6665a63/d81d8a3bb60128ba803f2dfd9ddfe0ac

Categories
C++

All the instructions are given and please add as many comments as you can for be

All the instructions are given and please add as many comments as you can for better understanding. this questions answer is already in the internet but i wanna find a unique solution so please. Do not overcomplicate and do not use advanced way to write. Use simple and easy method please.